A column approximate minimum degree ordering algorithm
From MaRDI portal
Recommendations
Cited in
(43)- An adjoint method in inverse problems of chromatography
- A survey of direct methods for sparse linear systems
- Sparse linear least-squares problems
- The multiple minimum degree ordering with greedy graph compression for vector computers
- An Efficient Algorithm to Compute Row and Column Counts for Sparse Cholesky Factorization
- On the ordering of sparse linear systems
- Low Rank Approximation of a Sparse Matrix Based on LU Factorization with Column and Row Tournament Pivoting
- Factoring matrices with a tree-structured sparsity pattern
- Compressed Graphs and the Minimum Degree Algorithm
- A column pre-ordering strategy for the unsymmetric-pattern multifrontal method
- On the Performance of the Minimum Degree Ordering for Gaussian Elimination
- scientific article; zbMATH DE number 5533281 (Why is no real title available?)
- Exact solution of sparse linear systems via left-looking roundoff-error-free Lu factorization in time proportional to arithmetic work
- Sparse Partial Pivoting in Time Proportional to Arithmetic Operations
- Block SOR for Kronecker structured representations
- scientific article; zbMATH DE number 5556488 (Why is no real title available?)
- Wavelet solvers for hp-FEM discretizations in 3D using hexahedral elements
- Characterizing marginalization and incremental operations on the Bayes tree
- Fast implementation of the traveling-salesman-problem method for reordering columns within supernodes
- Localized spectrum slicing
- scientific article; zbMATH DE number 1617961 (Why is no real title available?)
- COLAMD
- Ordering techniques for singly bordered block diagonal forms for unsymmetric parallel sparse direct solvers
- The Evolution of the Minimum Degree Ordering Algorithm
- A triangulation and fill-reducing initialization procedure for the simplex algorithm
- A note on fast approximate minimum degree orderings for symmetric matrices with some dense rows
- Algorithm 836
- Algorithm 837
- PMORSy: parallel sparse matrix ordering software for fill-in minimization
- Improved preconditioned Landweber iteration-based bundle adjustment for large-scale 3D reconstruction
- A spectral algorithm for envelope reduction of sparse matrices
- A sparse proximal implementation of the LP dual active set algorithm
- Dual multilevel optimization
- Nested-dissection orderings for sparse LU with partial pivoting
- Efficient preconditioning for time fractional diffusion inverse source problems
- Square root SAM: simultaneous localization and mapping via square root information smoothing
- A MATLAB-based frequency-domain finite difference package for solving 2D visco-acoustic wave equation
- Exploiting chordal structure in polynomial ideals: a Gröbner bases approach
- Sparse matrix methods for circuit simulation problems
- Fast and effective reordering of columns within supernodes using partition refinement
- \texttt{Tenscalc}: a toolbox to generate fast code to solve nonlinear constrained minimizations and compute Nash equilibria
- On the minimum FLOPs problem in the sparse Cholesky factorization
- Combinatorial Aspects in Sparse Elimination Methods
Describes a project that uses
Uses Software
This page was built for publication: A column approximate minimum degree ordering algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5461205)
