Improving the efficiency of incomplete Choleski preconditionings

DOI10.1002/cnm.1630070806zbMath0745.65025OpenAlexW2069382503MaRDI QIDQ3985108

Michael C. Dracopoulos, Manolis Papadrakakis

Publication date: 27 June 1992

Published in: Communications in Applied Numerical Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/cnm.1630070806

zbMATH Keywords

iterative methodssparse matricescomputational efficiencyincomplete Cholesky preconditioners

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) Complexity and performance of numerical algorithms (65Y20) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (3)

ROBUST PRECONDITIONERS FOR LINEAR ELASTICITY FEM ANALYSES ⋮ Accuracy and effectiveness of preconditioned conjugate gradient algorithms for large and ill-conditioned problems ⋮ A hierarchical iterative procedure for the analysis of composite laminates

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: Improving the efficiency of incomplete Choleski preconditionings