Some Design Features of a Sparse Matrix Code

DOI10.1145/355815.355817zbMath0401.65023OpenAlexW1986942951MaRDI QIDQ4185736

John 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

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

Related Items (15)

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

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