A node-addition model for symbolic factorization

DOI10.1145/5960.5963zbMath0631.65020OpenAlexW1998810385WikidataQ114846930 ScholiaQ114846930MaRDI QIDQ3768254

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

finite elementexecution timenode addition modelsparse symmetric, positive definite matricessymbolic Cholesky factorization

Mathematics Subject Classification ID

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

Related Items (5)

Efficient Solution of a Sparse Non-symmetric System of Linear Equations ⋮ A survey of direct methods for sparse linear systems ⋮ Sparse matrix factor modification in structural reanalysis ⋮ A physical interpretation of factorization and factor modification in structural analysis ⋮ \(LU\)-decomposition and numerical structure for solving large sparse nonsymmetric linear systems

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