Factoring matrices with a tree-structured sparsity pattern
From MaRDI portal
Publication:551257
DOI10.1016/j.laa.2011.03.035zbMath1242.65053MaRDI QIDQ551257
Publication date: 15 July 2011
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2011.03.035
algorithm; numerical experiments; sparse matrices; minimum degree ordering; column ordering; sibling-dominant pivoting; sparse LU-factorization; tree-structured matrices
65F50: Computational methods for sparse matrices
15A23: Factorization of matrices
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
65F05: Direct numerical methods for linear systems and matrix inversion
Related Items
Uses Software
Cites Work
- On the \(k\)th Laplacian eigenvalues of trees with perfect matchings
- Improved bounds for the Laplacian energy of Bethe trees
- Semiregular trees with minimal Laplacian spectral radius
- On multiple eigenvalues of trees
- On the weighted trees with given degree sequence and positive weight set
- On the characteristic and Laplacian polynomials of trees
- Stability of acyclic matrices
- Treediagonal matrices and their inverses
- On computing accurate singular values and eigenvalues of matrices with acyclic graphs
- On Green's Matrices of Trees
- Nested-Dissection Orderings for Sparse LU with Partial Pivoting
- The Use of Linear Graphs in Gauss Elimination
- Sparse Partial Pivoting in Time Proportional to Arithmetic Operations
- The Evolution of the Minimum Degree Ordering Algorithm
- Sparse Matrices in MATLAB: Design and Implementation
- Bounds for Rounding Errors in the Gaussian Elimination for Band Systems
- Eigenvectors of acyclic matrices
- Accuracy and Stability of Numerical Algorithms
- A column pre-ordering strategy for the unsymmetric-pattern multifrontal method
- Algorithm 832
- A column approximate minimum degree ordering algorithm
- Algorithm 836
