Tree organization of the data structure for Cholesky factorization

MaRDI QIDQ1904005zbMATHFDO

Authors V. P. Il'in, V. I. Karnachuk, M. R. Larin

Publication date 13 December 1995

Published in Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

zbMATH Keywords

Cholesky factorizationalgorithmnumerical exampledifference schemesPoisson's equationhierarchical partitioningnested quad-dissections method

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Laplace operator, Helmholtz equation (reduced wave equation), Poisson equation (35J05) Finite difference methods for boundary value problems involving PDEs (65N06)

Recommendations

• A compact row storage scheme for Cholesky factors using elimination trees
• scientific article; zbMATH DE number 1372507
• Parallel sparse Cholesky factorization on a shared memory multiprocessor
• Highly Parallel Sparse Cholesky Factorization
• scientific article; zbMATH DE number 434523

Cited in

(2)

• Fast implementation of partial Gram-Schmidt algorithm using tree data structure with sequential row pointers data structure to solve structural problems (PGS)
• A compact row storage scheme for Cholesky factors using elimination trees

This page was built for publication: Tree organization of the data structure for Cholesky factorization

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