Re: [deal.II] Iterate over active descendants

Bangerth wrote: > On 5/27/24 00:28, Felipe Ponce wrote: > > > > Probably, the problem is not the filtered iterator, but maybe I should > > re-think the algorithm, to avoid a costly search for active descendants. > > Yes. The three methods you show in your code are do

Re: [deal.II] Iterate over active descendants

algorithm, to avoid a costly search for active descendants. On Sat, May 25, 2024, 12:17 AM Wolfgang Bangerth wrote: > On 5/24/24 15:24, Felipe Ponce wrote: > > * > > * > > Is there a better alternative to iterate active descendants? Why is > > /set_to_next_positive/ so slow

[deal.II] Iterate over active descendants

I iterate a collection of cells, and for each one I have to iterate the active descendants. Given a coarse cell, I use a FilteredIterator to iterate active descendants, but the method *set_to_next_positive* significantl

Re: [deal.II] Matrix Free alternatives in dealii

M on src > } > > Now you can use FMM with gmres. > > Best, > Luca. > > Il giorno 18 mag 2024, alle ore 07:38, Felipe Ponce > ha scritto: > >  <https://scicomp.stackexchange.com/posts/44208/timeline> > I am implementing a Fast Multipole Method (FMM) in d

[deal.II] Matrix Free alternatives in dealii

I am implementing a Fast Multipole Method (FMM) in deal ii. I do not want to store a dense matrix, but lower rank matrices and to use matrix free methods. By now, I store the elements of the low-rank matrices, and I want to retrieve them