On the Complexity of Sparse QR and LU Factorization of Finite-Element Matrices

DOI10.1137/0909057MaRDI QIDQ3806668zbMATH OpenOpenAlexFDO

Authors

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

zbMATH Keywords

computational complexitynumerical stabilityQR factorizationGaussian elimination with partial pivotingordering algorithmsfinite- element matrices

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50) Analysis of algorithms and problem complexity (68Q25) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30)

Recommendations

• Sparse Partial Pivoting in Time Proportional to Arithmetic Operations
• Computing row and column counts for sparse \(QR\) and \(LU\) factorization
• Elimination Structures for Unsymmetric Sparse $LU$ Factors
• Symbolic Factorization for Sparse Gaussian Elimination with Partial Pivoting
• A Data Structure for Sparse QR and LU Factorizations

Cited in

(23)

• A generalized multigrid method for solving contact problems in Lagrange multiplier based unfitted finite element method
• A survey of direct methods for sparse linear systems
• Numerical recovery strategies for parallel resilient Krylov linear solvers.
• A block-diagonal preconditioner for a four-field mixed finite element method for Biot's equations
• Sparse Partial Pivoting in Time Proportional to Arithmetic Operations
• Computing row and column counts for sparse \(QR\) and \(LU\) factorization
• Massless Dirac Fermions on a Space‐Time Lattice with a Topologically Protected Dirac Cone
• Parallel sparse Gaussian elimination with partial pivoting
• A parabolic local problem with exponential decay of the resonance error for numerical homogenization
• 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
• Optimal multilevel adaptive FEM for the Argyris element
• A Superquadratic Variant of Newton's Method
• Multilevel Monte Carlo Methods for Stochastic Convection–Diffusion Eigenvalue Problems
• Common factors in fraction-free matrix decompositions
• Separators and structure prediction in sparse orthogonal factorization
• Computing the null space of finite element problems
• Probabilistic data-driven turbulence closure modeling by assimilating statistics
• scientific article; zbMATH DE number 4109938 (Why is no real title available?)
• Sparsity Analysis of the QR Factorization
• Maintaining LU factors of a general sparse matrix
• Adaptive concepts for stochastic partial differential equations
• Hierarchical orthogonal factorization: sparse square matrices

This page was built for publication: On the Complexity of Sparse $QR$ and $LU$ Factorization of Finite-Element Matrices

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