An Optimal Agorithm for Symbolic Factorization of Symmetric Matrices
From MaRDI portal
Publication:3899516
DOI10.1137/0209044zbMath0452.68049OpenAlexW2008859258MaRDI QIDQ3899516
No author found.
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
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (8)
Approximation by cubic \(C^ 1\)-splines on arbitrary triangulations ⋮ Algorithmique et calculs de complexité pour un solveur de type dissections emboîtées. (Algorithmic study and complexity bounds for a nested dissection solver) ⋮ Solution of sparse positive definite systems on a hypercube ⋮ Solution of sparse linear least squares problems using Givens rotations ⋮ A survey of direct methods for sparse linear systems ⋮ Sparse matrix factor modification in structural reanalysis ⋮ Parallel sparse Gaussian elimination with partial pivoting ⋮ 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
