An Approximate Minimum Degree Ordering Algorithm
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Exploiting structure in large-scale electrical circuit and power system problems
- Efficient Algorithms for Bayesian Nearest Neighbor Gaussian Processes
- The order of Appel's algorithm
- Multifrontal parallel distributed symmetric and unsymmetric solvers
- The impact of high-performance computing in the solution of linear systems: Trends and problems
- Decomposition in multidimensional Boolean-optimization problems with sparse matrices
- Method of fundamental solutions for 3D elasticity with body forces by coupling compactly supported radial basis functions
- A parallel computing method using blocked format with optimal partitioning for SpMV on GPU
- Distance descending ordering method: an \(O(n)\) algorithm for inverting the mass matrix in simulation of macromolecules with long branches
- Experiments with sparse Cholesky using a sequential task-flow implementation
- New parallel sparse direct solvers for multicore architectures
- Coupling of continuous and hybridizable discontinuous Galerkin methods: application to conjugate heat transfer problem
- A relaxed splitting preconditioner for the incompressible Navier-Stokes equations
- Graphical models for genetic analyses
- Preconditioning techniques for large linear systems: A survey
- Gigaflops in linear programming
- Comparison of high-order continuous and hybridizable discontinuous Galerkin methods for incompressible fluid flow problems
- Element partition trees for \(h\)-refined meshes to optimize direct solver performance. I: Dynamic programming
- \(p\)-multigrid methods and their comparison to \(h\)-multigrid methods within isogeometric analysis
- Fast computation of Katz index for efficient processing of link prediction queries
- A triangulation and fill-reducing initialization procedure for the simplex algorithm
- Bregman primal-dual first-order method and application to sparse semidefinite programming
- A block ILUT smoother for multipatch geometries in isogeometric analysis
- A parallel multithreaded sparse triangular linear system solver
- A high performance level-block approximate LU factorization preconditioner algorithm
- Stabilized dimensional factorization preconditioner for solving incompressible Navier-Stokes equations
- Solving sparse polynomial optimization problems with chordal structure using the sparse bounded-degree sum-of-squares hierarchy
- Sparse and scalable eigenstrain-based reduced order homogenization models for polycrystal plasticity
- Parameter modified versions of preconditioning and iterative inner product free refinement methods for two-by-two block matrices
- Distributed algebraic tearing and interconnecting techniques
- The effect of graph partitioning techniques on parallel block FSAI preconditioning: a computational study
- Sequential and parallel triangulating algorithms for elimination game and new insights on minimum degree
- A Bayesian linear model for the high-dimensional inverse problem of seismic tomography
- A primal-dual interior-point algorithm for quadratic programming
- Detecting ``dense columns in interior point methods for linear programs
- On the accuracy of finite-difference solutions for nonlinear water waves
- An algebraic multilevel preconditioner with low-rank corrections for sparse symmetric matrices
- Exploiting hardware capabilities in interior point methods
- A sparse symmetric indefinite direct solver for GPU architectures
- An efficient multicore implementation of a novel HSS-structured multifrontal solver using randomized sampling
- A MATLAB-based frequency-domain finite difference package for solving 2D visco-acoustic wave equation
- Sparse matrix methods for circuit simulation problems
- Challenges in model order reduction for industrial problems
- Schur complement-based domain decomposition preconditioners with low-rank corrections.
- Modified augmented Lagrangian preconditioners for the incompressible Navier-Stokes equations
- State-defect constraint pairing graph coarsening method for Karush-Kuhn-Tucker matrices arising in orthogonal collocation methods for optimal control
- On accurate and time efficient solution of primal-mixed finite element equations in multiscale solid mechanics
- A note on fast approximate minimum degree orderings for symmetric matrices with some dense rows
- Solution of linear systems from an optimal control problem arising in wind simulation
- Approximating Minimum Linear Ordering Problems
- A hierarchical low rank Schur complement preconditioner for indefinite linear systems
- State-of-the-art sparse direct solvers
- The Effect of Various Sparsity Structures on Parallelism and Algorithms to Reveal Those Structures
- Fast implementation of the traveling-salesman-problem method for reordering columns within supernodes
- Efficient Covariance Approximations for Large Sparse Precision Matrices
- Graphical Models and Message-Passing Algorithms: Some Introductory Lectures
- A fast nested dissection solver for Cartesian 3D elliptic problems using hierarchical matrices
- An efficient out-of-core multifrontal solver for large-scale unsymmetric element problems
- On the decomposition of generalized eigenproblems for the free vibration analysis of cyclically symmetric finite element models
- Square root SAM: simultaneous localization and mapping via square root information smoothing
- Combinatorial Aspects in Sparse Elimination Methods
- scientific article; zbMATH DE number 5556488 (Why is no real title available?)
- Postoptimal Analysis in Nonserial Dynamic Programming
- Modification of the minimum-degree algorithm by multiple elimination
- scientific article; zbMATH DE number 3989404 (Why is no real title available?)
- The Evolution of the Minimum Degree Ordering Algorithm
- An algorithm to minimize representations of finite order relations
- A fast direct solver for elliptic problems on general meshes in 2D
- The cost of continuity: a study of the performance of isogeometric finite elements using direct solvers
- Parallel Schur complement techniques based on multiprojection methods
- Large-scale sparse inverse covariance matrix estimation
- Compression and Conditional Emulation of Climate Model Output
- The Minimum Degree Ordering with Constraints
- Effective preconditioning through minimum degree ordering interleaved with incomplete factorization
- Compressed Graphs and the Minimum Degree Algorithm
- A survey on direct solvers for Galerkin methods
- Parallel direct solver for the finite integration technique in electromagnetics
- Efficient computation of global resolvent modes
- RCHOL: Randomized Cholesky Factorization for Solving SDD Linear Systems
- Approximate Generalized Inverses with Iterative Refinement for \epsilon-Accurate Preconditioning of Singular Systems
- Exactly solving sparse rational linear systems via roundoff-error-free Cholesky factorizations
- Efficient low-order refined preconditioners for high-order matrix-free continuous and discontinuous Galerkin methods
- Optimal and Low-Memory Near-Optimal Preconditioning of Fully Implicit Runge--Kutta Schemes for Parabolic PDEs
- Sparse approximate inverse preconditioners on high performance GPU platforms
- Exact or approximate inference in graphical models: why the choice is dictated by the treewidth, and how variable elimination can be exploited
- Sparse Stretching for Solving Sparse-Dense Linear Least-Squares Problems
- Exact solution of sparse linear systems via left-looking roundoff-error-free Lu factorization in time proportional to arithmetic work
- Matrix reordering using multilevel graph coarsening for ILU preconditioning
- Improving multifrontal methods by means of block low-rank representations
- PMORSy: parallel sparse matrix ordering software for fill-in minimization
- A Rational Function Preconditioner For Indefinite Sparse Linear Systems
- Block preconditioning for saddle point systems with indefinite (1, 1) block
- Reordering strategy for blocking optimization in sparse linear solvers
- Low-Rank Correction Methods for Algebraic Domain Decomposition Preconditioners
- Minimum Degree Orderings
- Hierarchical Cholesky decomposition of sparse matrices arising from curl–curl-equation
- Algorithm 836
- Algorithm 837
- A relaxed dimensional factorization preconditioner for the incompressible Navier-Stokes equations
- A survey of direct methods for sparse linear systems
This page was built for publication: An Approximate Minimum Degree Ordering Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4717298)
