On the Complexity of Sparse $QR$ and $LU$ Factorization of Finite-Element Matrices
From MaRDI portal
Publication:3806668
DOI10.1137/0909057zbMath0658.65023MaRDI QIDQ3806668
No author found.
Publication date: 1988
Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0909057
computational complexity; numerical stability; QR factorization; Gaussian elimination with partial pivoting; ordering algorithms; finite- element matrices
65F50: Computational methods for sparse matrices
68Q25: Analysis of algorithms and problem complexity
65N30: Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs
65F05: Direct numerical methods for linear systems and matrix inversion
Related Items
Parallel sparse Gaussian elimination with partial pivoting, Block computation and representation of a sparse nullspace basis of a rectangular matrix, An incomplete nested dissection algorithm for parallel direct solution of finite element discretizations of partial differential equations, Separators and structure prediction in sparse orthogonal factorization