A Linear Time Implementation of Profile Reduction Algorithms for Sparse Matrices

DOI10.1137/0907082zbMATH Open0609.65028OpenAlexW1974236039MaRDI QIDQ3750036FDOQ3750036

Authors: L. Marro 

Publication date: 1986

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

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

Recommendations

• An algorithm for profile and wavefront reduction of sparse matrices
• A comparison of three algorithms for reducing the profile of a sparse matrix
• Publication:4721530
• The use of profile reduction algorithms with a frontal code
• scientific article; zbMATH DE number 3980373

zbMATH Keywords

comparison of methodstime complexityfrontal increase minimization strategy algorithmssparse matrix profile reduction

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Computational methods for sparse matrices (65F50)

Cited In (8)

• A survey of direct methods for sparse linear systems
• Title not available (Why is that?)
• Implementing Hager's exchange methods for matrix profile reduction
• Algorithms for reducing the bandwidth and profile of a sparse matrix
• Simple heuristic algorithm for profile reduction of arbitrary sparse matrix
• A spectral algorithm for envelope reduction of sparse matrices
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: A Linear Time Implementation of Profile Reduction Algorithms for Sparse Matrices

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