Near-minimal matrix profiles and wavefronts for testing nodal resequencing algorithms

DOI10.1002/NME.1620211005MaRDI QIDQ3700691zbMATH OpenOpenAlexFDO

Authors Bruce A. Armstrong

Publication date 1985

Published in International Journal for Numerical Methods in Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/nme.1620211005

zbMATH Keywords

bandwidth minimizationbenchmark problemsmatrix profilesnear-minimal profileswavefronts

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1163755
• Simulated annealing for profile and fill reduction of sparse matrices
• Updated profile front minimization algorithm
• An algorithm for profile and wavefront reduction of sparse matrices
• Minimizing the profile of a symmetric matrix

Cited in

(2)

• A variable neighborhood search and simulated annealing hybrid for the profile minimization problem
• Addressing the envelope reduction of sparse matrices using a genetic programming system

This page was built for publication: Near-minimal matrix profiles and wavefronts for testing nodal resequencing algorithms

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