A Minimal Storage Implementation of the Minimum Degree Algorithm
From MaRDI portal
Publication:3859181
DOI10.1137/0717024zbMath0424.65006OpenAlexW1973101972MaRDI QIDQ3859181
No author found.
Publication date: 1980
Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0717024
minimum degree algorithmefficient implementationfinite element applicationssparse positive definite systemsnumerical experiemnts
Factorization of matrices (15A23) 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
Multidomain decomposition of curved geometries in the Chebyshev collocation method for thermal problems, Chebyshev pseudospectral solution of the Stokes equations using finite element preconditioning, Solution of sparse positive definite systems on a hypercube, On symbolic factorization of partitioned sparse symmetric matrices, A survey of direct methods for sparse linear systems, Chebyshev collocation method and multi-domain decomposition for Navier- Stokes equations in complex curved geometries, On finite element methods for the Neumann problem, A parallel solver for adaptive finite element discretizations, Chebyshev collocation solutions of the Navier-Stokes equations using multi-domain decomposition and finite element preconditioning
