Optimal and Low-Memory Near-Optimal Preconditioning of Fully Implicit Runge--Kutta Schemes for Parabolic PDEs
From MaRDI portal
(Redirected from Publication:5161772)
Recommendations
- Order‐Optimal Preconditioners for Implicit Runge–Kutta Schemes Applied to Parabolic PDEs
- A New Block Preconditioner for Implicit Runge--Kutta Methods for Parabolic PDE Problems
- Fast solution of fully implicit Runge-Kutta and discontinuous Galerkin in time for numerical PDEs. I: The linear setting
- A parallelizable preconditioner for the iterative solution of implicit Runge-Kutta-type methods
- Fast solution of fully implicit Runge-Kutta and discontinuous Galerkin in time for numerical PDEs. II: Nonlinearities and DAEs
Cites work
- A Circulant Preconditioner for the Systems of LMF-Based ODE Codes
- A comparison of preconditioned Krylov subspace methods for large‐scale nonsymmetric linear systems
- A First Course in the Numerical Analysis of Differential Equations
- A Flexible Inner-Outer Preconditioned GMRES Algorithm
- A hybrid geometric + algebraic multigrid method with semi‐iterative smoothers
- A hybrid method and unified analysis of generalized finite differences and Lagrange finite elements
- A linear time implementation of the reverse Cuthill-McKee algorithm
- A multilevel Crout ILU preconditioner with pivoting and row permutation
- A scalable parallel algorithm for incomplete factor preconditioning
- A special stability problem for linear multistep methods
- A splitting preconditioner for the iterative solution of implicit Runge-Kutta and boundary value methods
- A supernodal approach to incomplete LU factorization with partial pivoting
- An Approximate Minimum Degree Ordering Algorithm
- An Efficient Solution Process for Implicit Runge–Kutta Methods
- An Optimal Circulant Preconditioner for Toeplitz Systems
- Analysis of finite difference schemes. For linear partial differential equations with generalized solutions
- Application of implicit-explicit high order Runge-Kutta methods to discontinuous-Galerkin schemes
- Automated solution of differential equations by the finite element method. The FEniCS book
- Comparison of multigrid algorithms for high-order continuous finite element discretizations.
- Conditioning of implicit Runge-Kutta integration for finite element approximation of linear diffusion equations on anisotropic meshes
- Evaluation of fully implicit Runge Kutta schemes for unsteady flow calculations
- Generalized Kronecker product splitting iteration for the solution of implicit Runge-Kutta and boundary value methods.
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- HILUCSI: Simple, robust, and fast multilevel ILU for large‐scale saddle‐point problems from PDEs
- scientific article; zbMATH DE number 1012640 (Why is no real title available?)
- scientific article; zbMATH DE number 1953444 (Why is no real title available?)
- scientific article; zbMATH DE number 940566 (Why is no real title available?)
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- scientific article; zbMATH DE number 5180707 (Why is no real title available?)
- ILUT: A dual threshold incomplete LU factorization
- Matlab code for sorting real Schur forms
- Multilevel ILU With Reorderings for Diagonal Dominance
- Multilevel Preconditioners Constructed From Inverse-Based ILUs
- Numerical Methods for Ordinary Differential Equations
- On algorithms for permuting large entries to the diagonal of a sparse matrix
- On the implementation of implicit Runge-Kutta methods
- Optimal and Superoptimal Circulant Preconditioners
- Order‐Optimal Preconditioners for Implicit Runge–Kutta Schemes Applied to Parabolic PDEs
- Preconditioning techniques for large linear systems: A survey
- Preconditioning techniques for nonsymmetric and indefinite linear systems
- Spectral/hp Element Methods for Computational Fluid Dynamics
- Stage-parallel fully implicit Runge-Kutta solvers for discontinuous Galerkin fluid simulations
- Strang-type preconditioners applied to ordinary and neutral differential-algebraic equations.
- Strang-type preconditioners for systems of LMF-based ODE codes
- Triangularly Implicit Iteration Methods for ODE-IVP Solvers
Cited in
(8)- Fast solution of fully implicit Runge-Kutta and discontinuous Galerkin in time for numerical PDEs. I: The linear setting
- Fast solution of fully implicit Runge-Kutta and discontinuous Galerkin in time for numerical PDEs. II: Nonlinearities and DAEs
- A New Block Preconditioner for Implicit Runge--Kutta Methods for Parabolic PDE Problems
- Additive Polynomial Time Integrators, Part I: Framework and Fully Implicit-Explicit Collocation Methods
- Theoretical and practical aspects of space-time DG-SEM implementations
- A-Stable High-Order Block Implicit Methods for Parabolic Equations
- Optimal and Low-Memory Near-Optimal Preconditioning of Fully Implicit Runge-Kutta Schemes for Parabolic PDEs
- Block implicit methods with L-stability for parabolic problems
This page was built for publication: Optimal and Low-Memory Near-Optimal Preconditioning of Fully Implicit Runge--Kutta Schemes for Parabolic PDEs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5161772)
