Some Design Features of a Sparse Matrix Code

DOI10.1145/355815.355817MaRDI QIDQ4185736zbMATH OpenOpenAlexFDO

Authors J. K. Reid, Iain S. Duff

Publication date 1979

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

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

zbMATH Keywords

Gaussian EliminationHarwell Sparse Matrix PackageSparse Matrix SoftwareSparse Sets of Linear Equations

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)

Cited in

(15)

• Exploiting the sparsity in the solution of linear ordinary differential equations
• A survey of the advances in the exploitation of the sparsity in the solution of large problems
• Solving sparse linear least-squares problems on some supercomputers by using large dense blocks
• Multiprocessing a sparse matrix code on the Alliant FX/8
• Sparse Gaussian Elimination Modulo p: An Update
• Characteristics study of an electronic systems design strategy
• Analog circuit optimization on basis of control theory approach
• A Combined Direct-Iterative Method for Certain M-Matrix Linear Systems
• A Parallel Block Iterative Scheme Applied to Computations in Structural Analysis
• Diagonal Scaling to an Orthogonal Matrix
• New factorization codes for sparse, symmetric and positive definite matrices
• A Stable Method for the $LU$ Factorization of M-Matrices
• GRSIM: A FORTRAN subroutine for the solution of non-symmetric linear systems
• A survey of direct methods for sparse linear systems
• On PDE solution in transient optimization of gas networks

This page was built for publication: Some Design Features of a Sparse Matrix Code

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