Two improved algorithms for envelope and wavefront reduction
From MaRDI portal
(Redirected from Publication:1371664)
Recommendations
- A multilevel algorithm for wavefront reduction
- Numerical optimization algorithms for wavefront phase retrieval from multiple measurements
- scientific article; zbMATH DE number 983158
- scientific article; zbMATH DE number 1530139
- Wavelet methods in multi-conjugate adaptive optics
- A FORTRAN program for profile and wavefront reduction
- Wavefront reduction using graphs, neural networks and genetic algorithm
- An algorithm for frontwidth reduction
- A Factor-Two Approximation Algorithm for Two-Dimensional Phase Unwrapping
- An algorithm for profile and wavefront reduction of sparse matrices
Cites work
- scientific article; zbMATH DE number 3976197 (Why is no real title available?)
- scientific article; zbMATH DE number 3681933 (Why is no real title available?)
- scientific article; zbMATH DE number 1263269 (Why is no real title available?)
- scientific article; zbMATH DE number 554764 (Why is no real title available?)
- scientific article; zbMATH DE number 741181 (Why is no real title available?)
- scientific article; zbMATH DE number 910879 (Why is no real title available?)
- scientific article; zbMATH DE number 3417498 (Why is no real title available?)
- A New Algorithm for Finding a Pseudoperipheral Node in a Graph
- A Spectral Algorithm for Seriation and the Consecutive Ones Problem
- A spectral algorithm for envelope reduction of sparse matrices
- An Algorithm for Reducing the Bandwidth and Profile of a Sparse Matrix
- An Analysis of Spectral Envelope Reduction via Quadratic Assignment Problems
- An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
- An algorithm for profile and wavefront reduction of sparse matrices
- Comparative Analysis of the Cuthill–McKee and the Reverse Cuthill–McKee Ordering Algorithms for Sparse Matrices
- Compressed Graphs and the Minimum Degree Algorithm
- Geometric Mesh Partitioning: Implementation and Experiments
- Implementation of the Gibbs-Poole-Stockmeyer and Gibbs-King Algorithms
- Laplace eigenvalues and bandwidth‐type invariants of graphs
- Node and element resequencing using the Laplacian of a finite element graph: Part I—General concepts and algorithm
- Optimal linear labelings and eigenvalues of graphs
- Ordering Methods for Preconditioned Conjugate Gradient Methods Applied to Unstructured Grid Problems
- Partitioning Sparse Matrices with Eigenvectors of Graphs
- The Evolution of the Minimum Degree Ordering Algorithm
- The effect of ordering on preconditioned conjugate gradients
- The use of profile reduction algorithms with a frontal code
Cited in
(13)- Discrete isoperimetric method for bandwidth, pathwidth and treewidth of hypercubes
- Addressing the envelope reduction of sparse matrices using a genetic programming system
- A survey of direct methods for sparse linear systems
- An evaluation of reordering algorithms to reduce the computational cost of the incomplete Cholesky-conjugate gradient method
- A variable neighborhood search and simulated annealing hybrid for the profile minimization problem
- Level-based heuristics and hill climbing for the antibandwidth maximization problem
- A hypergraph partitioning model for profile minimization
- scientific article; zbMATH DE number 66964 (Why is no real title available?)
- On some properties of the Laplacian matrix revealed by the RCM algorithm.
- An evaluation of low-cost heuristics for matrix bandwidth and profile reductions
- Multilevel hybrid spectral element ordering algorithms
- Influence of matrix reordering on the performance of iterative methods for solving linear systems arising from interior point methods for linear programming
- Unravelling small world networks
This page was built for publication: Two improved algorithms for envelope and wavefront reduction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1371664)
