Numerical comparison of preconditionings for large sparse finite element problems

DOI10.1002/NUM.1690040204MaRDI QIDQ4728160zbMATH OpenOpenAlexFDO

Authors G. Gambolati, G. Zilli, Giorgio Pini

Publication date 1988

Published in Numerical Methods for Partial Differential Equations (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/num.1690040204

zbMATH Keywords

efficiencypreconditioningfinite elementnumerical comparisonincomplete Cholesky factorizationsparsity patternmodified conjugate gradients

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Boundary value problems for second-order elliptic equations (35J25) Initial-boundary value problems for second-order parabolic equations (35K20) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30)

Recommendations

• 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

Cites work

• An improved iterative optimization technique for the leftmost eigenpairs of large symmetric matrices
• Incomplete factorization for finite element methods

Cited in

(13)

• On vectorizing the preconditioned generalized conjugate residual methods
• Computation of minimum eigenvalue through minimization of rayleigh's quotient for large sparse matrices using vector computer:
• A general finite element preconditioning for the conjugate gradient method
• Accelerated simultaneous iterations for large finite element eigenproblems
• Preconditioning for sparse linear systems at the dawn of the 21st century: history, current developments, and future perspectives
• LEFTMOST EIGENVALUE OF REAL AND COMPLEX SPARSE MATRICES ON PARALLEL COMPUTER USING APPROXIMATE INVERSE PRECONDITIONING
• Polynomial preconditioning on vector computers
• An Empirical Analysis of the Performance of Preconditioners for SPD Systems
• A new preconditioning technique for solving large sparse linear systems
• Performance of preconditioners for large-scale simulations using Nek5000
• Iterative methods for solving sparse linear systems with a parallel preconditioner
• Using the modified 2nd order incomplete Cholesky decomposition as the conjugate gradient preconditioning
• Conjugate gradient solution of finite element equations on the IBM 3090 vector computer utilizing polynomial preconditionings

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)