A Minimal Storage Implementation of the Minimum Degree Algorithm

DOI10.1137/0717024MaRDI QIDQ3859181zbMATH OpenOpenAlexFDO

Authors

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

zbMATH Keywords

efficient implementationfinite element applicationsminimum degree algorithmnumerical experiemntssparse positive definite systems

Mathematics Subject Classification ID

Factorization of matrices (15A23) Direct numerical methods for linear systems and matrix inversion (65F05) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30)

Cited in

(9)

• On finite element methods for the Neumann problem
• 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
• Chebyshev collocation method and multi-domain decomposition for Navier- Stokes equations in complex curved geometries
• Multidomain decomposition of curved geometries in the Chebyshev collocation method for thermal problems
• A parallel solver for adaptive finite element discretizations
• A survey of direct methods for sparse linear systems
• Chebyshev collocation solutions of the Navier-Stokes equations using multi-domain decomposition and finite element preconditioning

This page was built for publication: A Minimal Storage Implementation of the Minimum Degree Algorithm

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