An Approximate Minimum Degree Ordering Algorithm

From MaRDI portal
Publication:4717298

DOI10.1137/S0895479894278952zbMath0861.65021MaRDI QIDQ4717298

Timothy A. Davis, Iain S. Duff, Patrick R. Amestoy

Publication date: 29 April 1997

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)




Related Items

A multiscale computational framework using active learning to model complex suspension flows, Quasi-optimal \textit{hp}-finite element refinements towards singularities via deep neural network prediction, Longitudinal modeling of age-dependent latent traits with generalized additive latent and mixed models, Non-intrusive parallelization of multibody system dynamic simulations, State-defect constraint pairing graph coarsening method for Karush-Kuhn-Tucker matrices arising in orthogonal collocation methods for optimal control, Sparse Matrix Methods for Circuit Simulation Problems, Challenges in Model Order Reduction for Industrial Problems, A Hierarchical Low Rank Schur Complement Preconditioner for Indefinite Linear Systems, Sequential and parallel triangulating algorithms for elimination game and new insights on minimum degree, Decomposition in multidimensional Boolean-optimization problems with sparse matrices, Graphical Models and Message-Passing Algorithms: Some Introductory Lectures, Block preconditioning for saddle point systems with indefinite (1, 1) block, Detecting ``dense columns in interior point methods for linear programs, On the accuracy of finite-difference solutions for nonlinear water waves, Exactly Solving Sparse Rational Linear Systems via Roundoff-Error-Free Cholesky Factorizations, Method of fundamental solutions for 3D elasticity with body forces by coupling compactly supported radial basis functions, A fast nested dissection solver for Cartesian 3D elliptic problems using hierarchical matrices, Gigaflops in linear programming, Parallel Schur Complement Techniques Based on Multiprojection Methods, A parallel computing method using blocked format with optimal partitioning for SpMV on GPU, A dimensional split preconditioner for Stokes and linearized Navier-Stokes equations, Application of the incomplete Cholesky factorization preconditioned Krylov subspace method to the vector finite element method for 3-D electromagnetic scattering problems, Reordering Strategy for Blocking Optimization in Sparse Linear Solvers, Low-Rank Correction Methods for Algebraic Domain Decomposition Preconditioners, Implementation of nonsymmetric interior-point methods for linear optimization over sparse matrix cones, Schur complement-based domain decomposition preconditioners with low-rank corrections, Substructure preconditioners for a class of structured linear systems of equations, A parallel multithreaded sparse triangular linear system solver, Distance descending ordering method: an \(O(n)\) algorithm for inverting the mass matrix in simulation of macromolecules with long branches, 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, Large-scale Sparse Inverse Covariance Matrix Estimation, A domain-decomposing parallel sparse linear system solver, Experiments with sparse Cholesky using a sequential task-flow implementation, A Bayesian linear model for the high-dimensional inverse problem of seismic tomography, Efficient Low-Order Refined Preconditioners for High-Order Matrix-Free Continuous and Discontinuous Galerkin Methods, A high performance level-block approximate LU factorization preconditioner algorithm, Effective preconditioning through minimum degree ordering interleaved with incomplete factorization, An efficient out-of-core multifrontal solver for large-scale unsymmetric element problems, State-of-the-Art Sparse Direct Solvers, The Effect of Various Sparsity Structures on Parallelism and Algorithms to Reveal Those Structures, A survey on direct solvers for Galerkin methods, New parallel sparse direct solvers for multicore architectures, Coupling of continuous and hybridizable discontinuous Galerkin methods: application to conjugate heat transfer problem, Modified augmented Lagrangian preconditioners for the incompressible Navier-Stokes equations, On the decomposition of generalized eigenproblems for the free vibration analysis of cyclically symmetric finite element models, 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, Comparison of high-order continuous and hybridizable discontinuous Galerkin methods for incompressible fluid flow problems, Square Root SAM: Simultaneous Localization and Mapping via Square Root Information Smoothing, A relaxed splitting preconditioner for the incompressible Navier-Stokes equations, Graphical models for genetic analyses, A survey of direct methods for sparse linear systems, A relaxed dimensional factorization preconditioner for the incompressible Navier-Stokes equations, Element partition trees for \(h\)-refined meshes to optimize direct solver performance. I: Dynamic programming, Sparse Hessian factorization in curved trajectories for unconstrained minimization, Parallel direct solver for the finite integration technique in electromagnetics, JADAMILU: a software code for computing selected eigenvalues of large sparse symmetric matrices, Stabilized dimensional factorization preconditioner for solving incompressible Navier-Stokes equations, \(p\)-multigrid methods and their comparison to \(h\)-multigrid methods within isogeometric analysis, Efficient Algorithms for Bayesian Nearest Neighbor Gaussian Processes, A primal-dual interior-point algorithm for quadratic programming, Combinatorial Aspects in Sparse Elimination Methods, Fill-ins number reducing direct solver designed for FIT-type matrix, Hierarchical Cholesky decomposition of sparse matrices arising from curl–curl-equation, Compression and Conditional Emulation of Climate Model Output, An Algebraic Multilevel Preconditioner with Low-Rank Corrections for Sparse Symmetric Matrices, Fast computation of Katz index for efficient processing of link prediction queries, Solving sparse polynomial optimization problems with chordal structure using the sparse bounded-degree sum-of-squares hierarchy, Block splitting for distributed optimization, Postoptimal Analysis in Nonserial Dynamic Programming, Limited-memory LDL\(^{\top}\) factorization of symmetric quasi-definite matrices with application to constrained optimization, Fast Implementation of the Traveling-Salesman-Problem Method for Reordering Columns within Supernodes, On accurate and time efficient solution of primal-mixed finite element equations in multiscale solid mechanics, Exploiting hardware capabilities in interior point methods, 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, Efficient Covariance Approximations for Large Sparse Precision Matrices, Sparse and scalable eigenstrain-based reduced order homogenization models for polycrystal plasticity, A triangulation and fill-reducing initialization procedure for the simplex algorithm, Exploiting structure in large-scale electrical circuit and power system problems, A Sparse Symmetric Indefinite Direct Solver for GPU Architectures, 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, An Efficient Multicore Implementation of a Novel HSS-Structured Multifrontal Solver Using Randomized Sampling, Exact Solution of Sparse Linear Systems via Left-Looking Roundoff-Error-Free LU Factorization in Time Proportional to Arithmetic Work, Bregman primal-dual first-order method and application to sparse semidefinite programming, Multifrontal parallel distributed symmetric and unsymmetric solvers, Efficient computation of global resolvent modes, Parameter modified versions of preconditioning and iterative inner product free refinement methods for two-by-two block matrices, A block ILUT smoother for multipatch geometries in isogeometric analysis, Distributed algebraic tearing and interconnecting techniques, Matrix Reordering Using Multilevel Graph Coarsening for ILU Preconditioning, A MATLAB-based frequency-domain finite-difference package for solving 2D visco-acoustic wave equation, Tree decompositions and social graphs, The impact of high-performance computing in the solution of linear systems: Trends and problems, The effect of graph partitioning techniques on parallel block FSAI preconditioning: a computational study, Improving Multifrontal Methods by Means of Block Low-Rank Representations, RCHOL: Randomized Cholesky Factorization for Solving SDD Linear Systems, PMORSy: parallel sparse matrix ordering software for fill-in minimization, Preconditioning techniques for large linear systems: A survey, Approximate Generalized Inverses with Iterative Refinement for $\epsilon$-Accurate Preconditioning of Singular Systems, A Rational Function Preconditioner For Indefinite Sparse Linear Systems