An Optimal Agorithm for Symbolic Factorization of Symmetric Matrices

DOI10.1137/0209044MaRDI QIDQ3899516zbMATH OpenOpenAlexFDO

Authors

Publication date 1980

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0209044

zbMATH Keywords

sparse matricesCholesky factorsymbolic factorization

Mathematics Subject Classification ID

Factorization of matrices (15A23) Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Linear equations (linear algebraic aspects) (15A06)

Cited in

(8)

• Sparse matrix factor modification in structural reanalysis
• A survey of direct methods for sparse linear systems
• Algorithmique et calculs de complexité pour un solveur de type dissections emboîtées. (Algorithmic study and complexity bounds for a nested dissection solver)
• Parallel sparse Gaussian elimination with partial pivoting
• Solution of sparse linear least squares problems using Givens rotations
• Solution of sparse positive definite systems on a hypercube
• Approximation by cubic C^ 1-splines on arbitrary triangulations
• A physical interpretation of factorization and factor modification in structural analysis

This page was built for publication: An Optimal Agorithm for Symbolic Factorization of Symmetric Matrices

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