A node-addition model for symbolic factorization

DOI10.1145/5960.5963MaRDI QIDQ3768254zbMATH OpenOpenAlexWikidataFDO

Authors Kincho H. Law, Steven J. Fenves

Publication date 1986

Published in ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL http://www.acm.org/pubs/contents/journals/toms/1986-12/

zbMATH Keywords

execution timefinite elementnode addition modelsparse symmetric, positive definite matricessymbolic Cholesky factorization

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Factorization of matrices (15A23) Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30)

Recommendations

• Modifying a Sparse Cholesky Factorization
• Symbolic Cholesky factorization on a local-memory multiprocessor
• Multiple-rank modifications of a sparse Cholesky factorization
• Row Modifications of a Sparse Cholesky Factorization
• A Tree Model for Sparse Symmetric Indefinite Matrix Factorization

Cited in

(9)

• LU-decomposition and numerical structure for solving large sparse nonsymmetric linear systems
• Sparse matrix factor modification in structural reanalysis
• Algorithmic Aspects of Elimination Trees for Sparse Unsymmetric Matrices
• Modifying a Sparse Cholesky Factorization
• scientific article; zbMATH DE number 1163753 (Why is no real title available?)
• Efficient Solution of a Sparse Non-symmetric System of Linear Equations
• Row Modifications of a Sparse Cholesky Factorization
• A survey of direct methods for sparse linear systems
• A physical interpretation of factorization and factor modification in structural analysis

This page was built for publication: A node-addition model for symbolic factorization

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