A new row ordering strategy for frontal solver

DOI10.1002/(SICI)1099-1506(199904/05)6:3%3C189::AID-NLA160%3E3.0.CO;2-CMaRDI QIDQ2760352zbMATH OpenFDO

Authors J. A. Scott

Publication date 19 December 2001

Published in Numerical Linear Algebra with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/(SICI)1099-1506(199904/05)6:3%3C189::AID-NLA160%3E3.0.CO;2-C

zbMATH Keywords

frontal methodnumerical experimentsordering rowsrow graphsSloan's profile reduction algorithmsparse unsymmetric matricesspectral method

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50)

Review text

The problem of reordering the rows of a general unsymmetric matrix \(A\) for use with a frontal solver is studied. A variant of Sloan's profile reduction algorithm and spectral method are applied to a row graph of an unsymmetric matrix \(A\) to reorder the rows. The author illustrates the effectiveness of her algorithms on several numerical experiments based on industrial and engineering applications.

Recommendations

• Reversing the row order for the row-by-row frontal method
• The use of profile reduction algorithms with a frontal code
• scientific article; zbMATH DE number 1442000
• A combined unifrontal/multifrontal method for unsymmetric sparse matrices
• scientific article; zbMATH DE number 1309685

Cites work

• An algorithm for profile and wavefront reduction of sparse matrices

Cited in

(4)

• Ordering techniques for singly bordered block diagonal forms for unsymmetric parallel sparse direct solvers
• scientific article; zbMATH DE number 1309685 (Why is no real title available?)
• Reversing the row order for the row-by-row frontal method
• A survey of direct methods for sparse linear systems

Describes a project that uses

Uses Software

• HSL

This page was built for publication: A new row ordering strategy for frontal solver

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