Parallel Factorizations in Numerical Analysis
From MaRDI portal
Abstract: In this paper we review the parallel solution of sparse linear systems, usually deriving by the discretization of ODE-IVPs or ODE-BVPs. The approach is based on the concept of parallel factorization of a (block) tridiagonal matrix. This allows to obtain efficient parallel extensions of many known matrix factorizations, and to derive, as a by-product, a unifying approach to the parallel solution of ODEs.
Recommendations
Cited in
(18)- Parallel solution in time of ODEs: Some achievements and perspectives
- ParalleloGAM: A parallel code for ODEs
- Time-parallel solutions to differential equations via functional optimization
- Parallel matrix function evaluation via initial value ODE modeling
- Derivation and analysis of parallel-in-time neural ordinary differential equations
- Novel parallel in time integrators for ODEs
- GParareal: a time-parallel ODE solver using Gaussian process emulation
- An adaptive parallel-in-time method with application to a membrane problem
- A time-parallel implicit methodology for the near-real-time solution of systems of linear oscillators
- Speculative parallel processing applied to modelling of initial problems
- scientific article; zbMATH DE number 221341 (Why is no real title available?)
- Parallel iteration schemes for implicit ODEIVP methods
- scientific article; zbMATH DE number 879001 (Why is no real title available?)
- PARAEXP: a parallel integrator for linear initial-value problems
- Parallelism in solving ordinary differential equations
- Parallelism across time in ODEs
- Nonlinear parallel-in-time Schur complement solvers for ordinary differential equations
- Parallel ODE-solvers with stepsize control
This page was built for publication: Parallel Factorizations in Numerical Analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3621391)
