Tree organization of the data structure for Cholesky factorization

MaRDI QIDQ1904005zbMATH OpenFDO

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

algorithmCholesky factorizationdifference schemeshierarchical partitioningnested quad-dissections methodnumerical examplePoisson's equation

Mathematics Subject Classification ID

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

Review text

A new variant of carrying out a Cholesky factorization for solving five-point difference schemes on a rectangular grid is proposed. The algorithm makes use of the nested quad-dissections method based on a hierarchical partitioning of the grid into four parts. A corresponding storage scheme for the matrix is described. Finally, the efficiency of the proposed algorithm is demonstrated by a numerical example, and an extension of the method to problems on arbitrary grids is briefly discussed.

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)