A Linear Time Implementation of Profile Reduction Algorithms for Sparse Matrices

DOI10.1137/0907082MaRDI QIDQ3750036zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

comparison of methodsfrontal increase minimization strategy algorithmssparse matrix profile reductiontime complexity

Mathematics Subject Classification ID

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

Recommendations

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

Cited in

(11)

• Simple heuristic algorithm for profile reduction of arbitrary sparse matrix
• scientific article; zbMATH DE number 4037041 (Why is no real title available?)
• Algorithms for reducing the bandwidth and profile of a sparse matrix
• scientific article; zbMATH DE number 1070486 (Why is no real title available?)
• A comparison of algorithms for profile reduction of sparse matrices
• scientific article; zbMATH DE number 3994910 (Why is no real title available?)
• A spectral algorithm for envelope reduction of sparse matrices
• The use of profile reduction algorithms with a frontal code
• A FORTRAN program for profile and wavefront reduction
• Implementing Hager's exchange methods for matrix profile reduction
• A survey of direct methods for sparse linear systems

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)