An Approximate Minimum Degree Ordering Algorithm
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- An efficient multicore implementation of a novel HSS-structured multifrontal solver using randomized sampling
- Permutation and Grouping Methods for Sharpening Gaussian Process Approximations
- Distance descending ordering method: an \(O(n)\) algorithm for inverting the mass matrix in simulation of macromolecules with long branches
- Quasi-optimal \textit{hp}-finite element refinements towards singularities via deep neural network prediction
- Postoptimal Analysis in Nonserial Dynamic Programming
- Square root SAM: simultaneous localization and mapping via square root information smoothing
- Multifrontal parallel distributed symmetric and unsymmetric solvers
- Tree decompositions and social graphs
- A MATLAB-based frequency-domain finite difference package for solving 2D visco-acoustic wave equation
- Challenges in model order reduction for industrial problems
- Sparse matrix methods for circuit simulation problems
- Comparison of high-order continuous and hybridizable discontinuous Galerkin methods for incompressible fluid flow problems
- Sparse and scalable eigenstrain-based reduced order homogenization models for polycrystal plasticity
- Exactly solving sparse rational linear systems via roundoff-error-free Cholesky factorizations
- Sparse approximate inverse preconditioners on high performance GPU platforms
- Experiments with sparse Cholesky using a sequential task-flow implementation
- Method of fundamental solutions for 3D elasticity with body forces by coupling compactly supported radial basis functions
- A Rational Function Preconditioner For Indefinite Sparse Linear Systems
- \(p\)-multigrid methods and their comparison to \(h\)-multigrid methods within isogeometric analysis
- A block ILUT smoother for multipatch geometries in isogeometric analysis
- A new preconditioned nonlinear conjugate gradient method in real arithmetic for computing the ground states of rotational Bose-Einstein condensate
- A note on Chebyshev accelerated PMHSS iteration method for block two-by-two linear systems
- Combinatorial Aspects in Sparse Elimination Methods
- Graphical Models and Message-Passing Algorithms: Some Introductory Lectures
- Sparse Stretching for Solving Sparse-Dense Linear Least-Squares Problems
- A hierarchical low rank Schur complement preconditioner for indefinite linear systems
- On accurate and time efficient solution of primal-mixed finite element equations in multiscale solid mechanics
- Efficient Covariance Approximations for Large Sparse Precision Matrices
- Modification of the minimum-degree algorithm by multiple elimination
- Preconditioning techniques for large linear systems: A survey
- Efficient low-order refined preconditioners for high-order matrix-free continuous and discontinuous Galerkin methods
- Graphical models for genetic analyses
- Compression and Conditional Emulation of Climate Model Output
- A survey of direct methods for sparse linear systems
- Exact or approximate inference in graphical models: why the choice is dictated by the treewidth, and how variable elimination can be exploited
- Low-Rank Correction Methods for Algebraic Domain Decomposition Preconditioners
- A primal-dual interior-point algorithm for quadratic programming
- Approximate Generalized Inverses with Iterative Refinement for $\epsilon$-Accurate Preconditioning of Singular Systems
- Sparse linear least-squares problems
- A Bayesian linear model for the high-dimensional inverse problem of seismic tomography
- Gigaflops in linear programming
- Parallel Schur complement techniques based on multiprojection methods
- Distributed algebraic tearing and interconnecting techniques
- New parallel sparse direct solvers for multicore architectures
- Coupling of continuous and hybridizable discontinuous Galerkin methods: application to conjugate heat transfer problem
- A faster direct sampling algorithm for equilateral closed polygons and the probability of knotting
- A high performance level-block approximate LU factorization preconditioner algorithm
- Compressed Graphs and the Minimum Degree Algorithm
- A dimensional split preconditioner for Stokes and linearized Navier-Stokes equations
- A domain-decomposing parallel sparse linear system solver
- On the accuracy of finite-difference solutions for nonlinear water waves
- Matrix reordering using multilevel graph coarsening for ILU preconditioning
- Block preconditioning for saddle point systems with indefinite (1, 1) block
- The Effect of Various Sparsity Structures on Parallelism and Algorithms to Reveal Those Structures
- A relaxed dimensional factorization preconditioner for the incompressible Navier-Stokes equations
- Sparse Hessian factorization in curved trajectories for unconstrained minimization
- Hierarchical Cholesky decomposition of sparse matrices arising from curl–curl-equation
- Schur complement-based domain decomposition preconditioners with low-rank corrections.
- The impact of high-performance computing in the solution of linear systems: Trends and problems
- An efficient out-of-core multifrontal solver for large-scale unsymmetric element problems
- Fill-ins number reducing direct solver designed for FIT-type matrix
- Parameter modified versions of preconditioning and iterative inner product free refinement methods for two-by-two block matrices
- On the decomposition of generalized eigenproblems for the free vibration analysis of cyclically symmetric finite element models
- scientific article; zbMATH DE number 3989404 (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
- Minimum Degree Orderings
- The order of Appel's algorithm
- A multiscale computational framework using active learning to model complex suspension flows
- State-defect constraint pairing graph coarsening method for Karush-Kuhn-Tucker matrices arising in orthogonal collocation methods for optimal control
- scientific article; zbMATH DE number 5556488 (Why is no real title available?)
- Parallel direct solver for the finite integration technique in electromagnetics
- A parallel computing method using blocked format with optimal partitioning for SpMV on GPU
- SlabLU: a two-level sparse direct solver for elliptic PDEs
- Fast implementation of the traveling-salesman-problem method for reordering columns within supernodes
- Modified augmented Lagrangian preconditioners for the incompressible Navier-Stokes equations
- Efficient computation of global resolvent modes
- Fast linear solvers for incompressible CFD simulations with compatible discrete operator schemes
- Decomposition in multidimensional Boolean-optimization problems with sparse matrices
- The effect of graph partitioning techniques on parallel block FSAI preconditioning: a computational study
- Element partition trees for \(h\)-refined meshes to optimize direct solver performance. I: Dynamic programming
- Fast computation of Katz index for efficient processing of link prediction queries
- Block splitting for distributed optimization
- Parallel structured Gaussian elimination for the number field sieve
- Non-intrusive parallelization of multibody system dynamic simulations
- Limited-memory LDL\(^{\top}\) factorization of symmetric quasi-definite matrices with application to constrained optimization
- The Evolution of the Minimum Degree Ordering Algorithm
- RCHOL: Randomized Cholesky Factorization for Solving SDD Linear Systems
- Application of the incomplete Cholesky factorization preconditioned Krylov subspace method to the vector finite element method for 3-D electromagnetic scattering problems
- A parallel multithreaded sparse triangular linear system solver
- An algebraic multilevel preconditioner with low-rank corrections for sparse symmetric matrices
- A triangulation and fill-reducing initialization procedure for the simplex algorithm
- An algorithm to minimize representations of finite order relations
- Longitudinal modeling of age-dependent latent traits with generalized additive latent and mixed models
- Substructure preconditioners for a class of structured linear systems of equations
- Exploiting structure in large-scale electrical circuit and power system problems
- State-of-the-art sparse direct solvers
- Detecting ``dense columns in interior point methods for linear programs
- Exploiting hardware capabilities in interior point methods
- Improving multifrontal methods by means of block low-rank representations
- Solution of linear systems from an optimal control problem arising in wind simulation
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)
