Implementing Hager's exchange methods for matrix profile reduction

DOI10.1145/592843.592844MaRDI QIDQ5461041zbMATH OpenOpenAlexWikidataFDO

Authors J. K. Reid, J. A. Scott

Publication date 21 July 2005

Published in ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/592843.592844

zbMATH Keywords

exchange methodsnumerical examplessparse matrix

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50)

Recommendations

• A Hessenberg Reduction Algorithm for Rank Structured Matrices
• An algorithm for profile and wavefront reduction of sparse matrices
• On the iterative method for H-matrices
• Fast Hessenberg reduction of some rank structured matrices
• Algorithms for the reduction of matrix bandwidth and profile
• A comparison of algorithms for profile reduction of sparse matrices
• A linearly convergent iterative method for identifying H-matrices
• Hybrid methods for approximating Hankel matrix
• A Linear Time Implementation of Profile Reduction Algorithms for Sparse Matrices
• Iterative improvement of eigensolutions from reduced matrices

Cited in

(7)

• A variable neighborhood search and simulated annealing hybrid for the profile minimization problem
• An evaluation of reordering algorithms to reduce the computational cost of the incomplete Cholesky-conjugate gradient method
• Addressing the envelope reduction of sparse matrices using a genetic programming system
• Minimizing the profile of a symmetric matrix
• A hypergraph partitioning model for profile minimization
• Multilevel hybrid spectral element ordering algorithms
• A survey of direct methods for sparse linear systems

Describes a project that uses

Uses Software

• BLAS

This page was built for publication: Implementing Hager's exchange methods for matrix profile reduction

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