A spectral algorithm for envelope reduction of sparse matrices
From MaRDI portal
Publication:4852763
Recommendations
- An Analysis of Spectral Envelope Reduction via Quadratic Assignment Problems
- A Linear Time Implementation of Profile Reduction Algorithms for Sparse Matrices
- Heuristic spectral techniques for the reduction of bandwidth and work-bound of sparse matrices
- A column approximate minimum degree ordering algorithm
- An algorithm for profile and wavefront reduction of sparse matrices
Cited in
(37)- Laplacian graph eigenvectors
- Two improved algorithms for envelope and wavefront reduction
- Unravelling small world networks
- A variable neighborhood search and simulated annealing hybrid for the profile minimization problem
- The quadratic assignment problem is easy for Robinsonian matrices with Toeplitz structure
- Leveraging special-purpose hardware for local search heuristics
- An efficient and accurate method to compute the Fiedler vector based on Householder deflation and inverse power iteration
- Enhanced graph-based dimensionality reduction with repulsion Laplaceans
- Addressing the envelope reduction of sparse matrices using a genetic programming system
- Consistency of spectral clustering
- The seriation problem in the presence of a double Fiedler value
- Exploitation of symmetry in graphs with applications to finite and boundary elements analysis
- A GPU-based preconditioned Newton-Krylov solver for flexible multibody dynamics
- TRACEMIN-Fiedler: a parallel algorithm for computing the Fiedler vector
- Convex relaxations for permutation problems
- scientific article; zbMATH DE number 4124955 (Why is no real title available?)
- Perron components and algebraic connectivity for weighted graphs
- An Analysis of Spectral Envelope Reduction via Quadratic Assignment Problems
- scientific article; zbMATH DE number 1070486 (Why is no real title available?)
- A generalized envelope method for sparse factorization by rows
- A hypergraph partitioning model for profile minimization
- A transposition algorithm for the factorizable sparse matrix
- A constructive bandwidth reduction algorithm -- a variant of GPS algorithm
- A graph based Davidson algorithm for the graph partitioning problem
- Similarity-first search: a new algorithm with application to Robinsonian matrix recognition
- Multidimensional partitioning and bi-partitioning: analysis and application to gene expression data sets
- Multiscale approach for the network compression-friendly ordering
- A survey of direct methods for sparse linear systems
- Heuristic spectral techniques for the reduction of bandwidth and work-bound of sparse matrices
- Localization in 1D non-parametric latent space models from pairwise affinities
- Continuation methods for approximate large scale object sequencing
- \texttt{PQser:} a Matlab package for spectral seriation
- Sparse linear least-squares problems
- Minimax optimal seriation in polynomial time
- Combinatorial optimization of special graphs for nodal ordering and graph partitioning
- Seriation of Tœplitz and latent position matrices: optimal rates and computational trade-offs
- Spectral clustering and its use in bioinformatics
This page was built for publication: A spectral algorithm for envelope reduction of sparse matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4852763)
