A spectral algorithm for envelope reduction of sparse matrices

DOI10.1002/NLA.1680020402zbMath0833.65038OpenAlexW2167573667MaRDI QIDQ4852763

Horst D. Simon, Alex Pothen, Stephen T. Barnard

Publication date: 14 March 1996

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

Full work available at URL: http://hdl.handle.net/2060/19970009822

zbMATH Keywords

sparse matrixspectral algorithmenvelope-reducing reordering

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50)

Related Items (28)

Perron components and algebraic connectivity for weighted graphs ⋮ Leveraging special-purpose hardware for local search heuristics ⋮ Exploitation of symmetry in graphs with applications to finite and boundary elements analysis ⋮ Convex Relaxations for Permutation Problems ⋮ A variable neighborhood search and simulated annealing hybrid for the profile minimization problem ⋮ Two improved algorithms for envelope and wavefront reduction ⋮ Spectral clustering and its use in bioinformatics ⋮ A GPU-based preconditioned Newton-Krylov solver for flexible multibody dynamics ⋮ Similarity-First Search: A New Algorithm with Application to Robinsonian Matrix Recognition ⋮ The seriation problem in the presence of a double Fiedler value ⋮ Consistency of spectral clustering ⋮ Localization in 1D non-parametric latent space models from pairwise affinities ⋮ Unravelling small world networks ⋮ Continuation methods for approximate large scale object sequencing ⋮ \texttt{PQser:} a Matlab package for spectral seriation ⋮ A constructive bandwidth reduction algorithm -- a variant of GPS algorithm ⋮ A Hypergraph Partitioning Model for Profile Minimization ⋮ An efficient and accurate method to compute the Fiedler vector based on Householder deflation and inverse power iteration ⋮ A survey of direct methods for sparse linear systems ⋮ Multiscale approach for the network compression-friendly ordering ⋮ Enhanced graph-based dimensionality reduction with repulsion Laplaceans ⋮ The quadratic assignment problem is easy for Robinsonian matrices with Toeplitz structure ⋮ Combinatorial optimization of special graphs for nodal ordering and graph partitioning ⋮ Multidimensional partitioning and bi-partitioning: analysis and application to gene expression data sets ⋮ TRACEMIN-Fiedler: A Parallel Algorithm for Computing the Fiedler Vector ⋮ A GRAPH BASED DAVIDSON ALGORITHM FOR THE GRAPH PARTITIONING PROBLEM ⋮ Laplacian graph eigenvectors ⋮ Addressing the envelope reduction of sparse matrices using a genetic programming system

Uses Software

• symrcm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A spectral algorithm for envelope reduction of sparse matrices