Numerical comparison of preconditionings for large sparse finite element problems
efficiencyfinite elementincomplete Cholesky factorizationmodified conjugate gradientsnumerical comparisonpreconditioningsparsity pattern
Boundary value problems for second-order elliptic equations (35J25) Initial-boundary value problems for second-order parabolic equations (35K20) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Computational methods for sparse matrices (65F50) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30)
- A numerical study of optimized sparse preconditioners
- Numerical performance of preconditioning techniques for the solution of complex sparse linear systems
- Preconditioned techniques for solving large sparse linear systems arising from the discretization of the elliptic partial differential equations
- scientific article; zbMATH DE number 176166
- scientific article; zbMATH DE number 572217
- scientific article; zbMATH DE number 554526
- scientific article; zbMATH DE number 3879987
- Finite element preconditioning for spectral multigrid methods
- Application of Sparse Matrix Solvers as Effective Preconditioners
- Preconditioned iterative algorithms for large sparse unsymmetric problems
- Accelerated simultaneous iterations for large finite element eigenproblems
- Polynomial preconditioning on vector computers
- Preconditioning for sparse linear systems at the dawn of the 21st century: history, current developments, and future perspectives
- Performance of preconditioners for large-scale simulations using Nek5000
- An Empirical Analysis of the Performance of Preconditioners for SPD Systems
- Computation of minimum eigenvalue through minimization of rayleigh's quotient for large sparse matrices using vector computer:
- On vectorizing the preconditioned generalized conjugate residual methods
- Iterative methods for solving sparse linear systems with a parallel preconditioner
- LEFTMOST EIGENVALUE OF REAL AND COMPLEX SPARSE MATRICES ON PARALLEL COMPUTER USING APPROXIMATE INVERSE PRECONDITIONING
- Using the modified 2nd order incomplete Cholesky decomposition as the conjugate gradient preconditioning
- A general finite element preconditioning for the conjugate gradient method
- Conjugate gradient solution of finite element equations on the IBM 3090 vector computer utilizing polynomial preconditionings
- A new preconditioning technique for solving large sparse linear systems
This page was built for publication: Numerical comparison of preconditionings for large sparse finite element problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4728160)
