A frontal code for the solution of sparse positive-definite symmetric systems arising from finite-element applications

DOI10.1145/332242.332243zbMath0962.65028OpenAlexW2073151819WikidataQ113310006 ScholiaQ113310006MaRDI QIDQ4518219

Jennifer Scott, Iain S. Duff

Publication date: 20 November 2000

Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/332242.332243

zbMATH Keywords

performancealgorithmsGaussian eliminationLevel 3 BLASfinite-element equationssparse symmetric linear equationssymmetric frontal method

Mathematics Subject Classification ID

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

Related Items (3)

A comparative analysis of contact algorithms in contact shape optimization problems ⋮ Reduced numerical solution times for combined boundary‐initial value problems using parallel computing ⋮ A survey of direct methods for sparse linear systems

Uses Software

• Unnamed Item
• BLAS
• Harwell-Boeing sparse matrix collection
• MA27
• MA42
• MA62
• MA32
• NAMMU

This page was built for publication: A frontal code for the solution of sparse positive-definite symmetric systems arising from finite-element applications