A comparison of algorithms for profile reduction of sparse matrices

DOI10.1016/0045-7949(94)00609-7zbMATH Open0888.65048OpenAlexW2062388982MaRDI QIDQ4377901FDOQ4377901

Authors:

Publication date: 4 June 1998

Published in: Computers & Structures (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0045-7949(94)00609-7

Recommendations

• A comparison of three algorithms for reducing the profile of a sparse matrix
• A Linear Time Implementation of Profile Reduction Algorithms for Sparse Matrices
• scientific article; zbMATH DE number 4037041
• An algorithm for profile and wavefront reduction of sparse matrices
• scientific article; zbMATH DE number 3980373

zbMATH Keywords

performancealgorithmscomparisonfactorizationglobal stiffness matrixprofile reduction of sparse symmetric banded positive definite matrices

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Complexity and performance of numerical algorithms (65Y20)

Cited In (3)

• 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

This page was built for publication: A comparison of algorithms for profile reduction of sparse matrices

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