On the Complexity of Sparse $QR$ and $LU$ Factorization of Finite-Element Matrices
From MaRDI portal
Publication:3806668
DOI10.1137/0909057zbMath0658.65023OpenAlexW2026930830MaRDI 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 complexitynumerical stabilityQR factorizationGaussian elimination with partial pivotingordering algorithmsfinite- element matrices
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) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items
A generalized multigrid method for solving contact problems in Lagrange multiplier based unfitted finite element method, Separators and structure prediction in sparse orthogonal factorization, A block-diagonal preconditioner for a four-field mixed finite element method for Biot's equations, Optimal multilevel adaptive FEM for the Argyris element, Massless Dirac Fermions on a Space‐Time Lattice with a Topologically Protected Dirac Cone, Numerical recovery strategies for parallel resilient Krylov linear solvers, A Superquadratic Variant of Newton's Method, Block computation and representation of a sparse nullspace basis of a rectangular matrix, Computing the null space of finite element problems, A survey of direct methods for sparse linear systems, Parallel sparse Gaussian elimination with partial pivoting, Adaptive concepts for stochastic partial differential equations, A parabolic local problem with exponential decay of the resonance error for numerical homogenization, An incomplete nested dissection algorithm for parallel direct solution of finite element discretizations of partial differential equations, Hierarchical Orthogonal Factorization: Sparse Square Matrices
