Re: [deal.II] Implicit stepping methods from the TimeStepping-namespace for large sparse matrices

2019-07-16 Thread 'Maxi Miller' via deal.II User Group
If I understand it correctly, that is equivalent to solving Ax = b, with A and b given, and x returned? Am Montag, 15. Juli 2019 22:03:46 UTC+2 schrieb Daniel Arndt: > > Maxi, > > The interface for TimeStepping::evolve_one_time_step is: > > virtual double > evolve_one_time_step( > std::vector

Re: [deal.II] Implicit stepping methods from the TimeStepping-namespace for large sparse matrices

2019-07-15 Thread Daniel Arndt
Maxi, The interface for TimeStepping::evolve_one_time_step is: virtual double evolve_one_time_step( std::vector> & F, std::vector> &J_inverse, double t, double delta_t, VectorType & y); and does not depend on UMFPACK at all. You just need to provide a function-type object that can

[deal.II] Implicit stepping methods from the TimeStepping-namespace for large sparse matrices

2019-07-15 Thread 'Maxi Miller' via deal.II User Group
As far as I understand all implicit time-stepping methods in the TimeStepping-namespace take a function which invert the jacobian matrix and the mass matrix (combined). This is done using a sparse solver (UMFPACK). Is it that still possible for a larger system (10kk DoFs), or do I have to resor