scientific article; zbMATH DE number 176171

MaRDI QIDQ4035274zbMATH OpenFDO

Authors Owe Axelsson, Niels Munksgaard

Publication date 18 May 1993

zbMATH Keywords

fixed storage allocationincomplete factorizationnumerical experimentssparse matrix

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50)

Recommendations

• scientific article; zbMATH DE number 766250
• Parallel Processing and Applied Mathematics
• scientific article; zbMATH DE number 1985700
• Balanced Incomplete Factorization
• An improved incomplete Cholesky factorization

Cited in

(13)

• A survey of preconditioned iterative methods for linear systems of algebraic equations
• Analysis of space allocation in a generally fragmented linear store
• Analysis of local enumeration and storage schemes in HPF
• Approximate factorizations with S/P consistently ordered M-factors
• The preconditioned conjugate gradient method with incomplete factorization preconditioners
• Solving systems of elastic bar structures by preconditioned conjugate gradient method
• Converting BiCR method for linear equations with complex symmetric matrices
• Improving the efficiency of incomplete Choleski preconditionings
• Performance of adaptive dual-dropping ILUT preconditioners in semiconductor dopant diffusion simulation
• \texttt{HSL\_MI28}: an efficient and robust limited-memory incomplete Cholesky factorization code
• Numerical experiences of solving elasticity systems by PCG methods.
• Special issue: Numerical methods and computational mechanics. Selected papers from the Eighth international conference (NMCM98), Miskolc, Hungary, August 24--27, 1998
• The importance of structure in incomplete factorization preconditioners

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4035274)