Design Features of a Frontal Code for Solving Sparse Unsymmetric Linear Systems Out-of-Core

DOI10.1137/0905019zbMath0541.65017OpenAlexW1993948534MaRDI QIDQ3327616

Iain S. Duff

Publication date: 1984

Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0905019

zbMATH Keywords

finite elementGaussian eliminationfinite differenceLU-decompositionvectorizationsparse unsymmetric linear equationsout-of- core solverunsymmetric frontal methods

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Boundary value problems for second-order elliptic equations (35J25) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Direct numerical methods for linear systems and matrix inversion (65F05) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22)

Related Items (7)

Unnamed Item ⋮ A survey of the advances in the exploitation of the sparsity in the solution of large problems ⋮ Finite element applications on a shared-memory multiprocessor: Algorithms and experimental results ⋮ A survey of direct methods for sparse linear systems ⋮ A review of frontal methods for solving linear systems ⋮ A frontal solver for the 21st century ⋮ The impact of high-performance computing in the solution of linear systems: Trends and problems

Uses Software

• MA32

This page was built for publication: Design Features of a Frontal Code for Solving Sparse Unsymmetric Linear Systems Out-of-Core