Parallel multistep methods for linear evolution problems | Zendy

Lehel Banjai | Zendy; Daniel Peterseim | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Parallel multistep methods for linear evolution problems

Author(s) -

Lehel Banjai,

Daniel Peterseim

Publication year - 2011

Publication title -

ima journal of numerical analysis

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 1.672

H-Index - 66

eISSN - 1464-3642

pISSN - 0272-4979

DOI - 10.1093/imanum/drq040

Subject(s) - discretization , multigrid method , helmholtz free energy , mathematics , linear multistep method , block (permutation group theory) , linear system , helmholtz equation , computation , runge–kutta methods , decoupling (probability) , computer science , algorithm , spacetime , parallel algorithm , numerical analysis , mathematical optimization , partial differential equation , mathematical analysis , differential equation , boundary value problem , ordinary differential equation , geometry , differential algebraic equation , physics , quantum mechanics , control engineering , engineering

Time-stepping procedures for the solution of evolution equations can be performed on parallel architecture by parallelizing the space computation at each time step. This, however, requires heavy communication between processors and becomes inefficient when many time steps are to be computed and many processors are available. In such cases parallelization in time is advantageous. In this paper we p...

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research