A latency tolerant hybrid sparse solver using incomplete Cholesky factorization

DOI10.1002/NLA.327MaRDI QIDQ5317897zbMATH OpenOpenAlexFDO

Authors Padma Raghavan, Keita Teranishi, Esmond G. Ng

Publication date 21 September 2005

Published in Numerical Linear Algebra with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/nla.327

zbMATH Keywords

conjugate gradientincomplete Choleski factorizationpreconditionersselective inversionsparse matrix factorization

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05)

Recommendations

• Parallel hybrid preconditioning: incomplete factorization with selective sparse approximate inversion
• A scalable parallel algorithm for incomplete factor preconditioning
• Solution of sparse positive definite systems on a hypercube
• Design and implementation of a parallel Markowitz threshold algorithm
• A robust incomplete factorization preconditioner for positive definite matrices

Cites work

• scientific article; zbMATH DE number 194538 (Why is no real title available?)
• Methods of conjugate gradients for solving linear systems

Cited in

(2)

• Issues in the design of scalable out-of-core dense symmetric indefinite factorization algorithms
• A parallel wavelet-based algebraic multigrid black-box solver and preconditioner

Describes a project that uses

Uses Software

• PETSc
• LAPACK

This page was built for publication: A latency tolerant hybrid sparse solver using incomplete Cholesky factorization

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