A note on matrix reordering for linear system solutions by iterative methods in interior point methods

DOI10.1007/978-3-031-24907-5_10MaRDI QIDQ6606526zbMATH OpenFDO

Authors W. Rodrigues, Marta Velazco, Aurelio R. L. Oliveira

Publication date 17 September 2024

zbMATH Keywords

linear programminginterior point methodspreconditionernested dissectionreordering

Mathematics Subject Classification ID

Linear programming (90C05) Interior-point methods (90C51)

Recommendations

• scientific article; zbMATH DE number 1187129
• On sparse matrix orderings in interior point methods
• Influence of matrix reordering on the performance of iterative methods for solving linear systems arising from interior point methods for linear programming
• A note on hybrid preconditioners for large-scale normal equations arising from interior-point methods
• scientific article; zbMATH DE number 724214

Cites work

• A Fast Implementation of the Minimum Degree Algorithm Using Quotient Graphs
• A note on hybrid preconditioners for large-scale normal equations arising from interior-point methods
• Influence of matrix reordering on the performance of iterative methods for solving linear systems arising from interior point methods for linear programming
• Nested Dissection of a Regular Finite Element Mesh
• PCx: an interior-point code for linear programming
• Preconditioning techniques for large linear systems: A survey
• Using a hybrid preconditioner for solving large-scale linear systems arising from interior point methods

This page was built for publication: A note on matrix reordering for linear system solutions by iterative methods in interior point methods

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