The Evolution of the Minimum Degree Ordering Algorithm
From MaRDI portal
Publication:3823722
DOI10.1137/1031001zbMath0671.65024OpenAlexW2096559782WikidataQ56453662 ScholiaQ56453662MaRDI QIDQ3823722
No author found.
Publication date: 1989
Published in: SIAM Review (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/7a2dbaf6329877a1da396e6565ce40f03f6d85bd
computational complexitysparse matrixsymmetric positive definite systemminimum degree ordering algorithm
Computational methods for sparse matrices (65F50) Analysis of algorithms and problem complexity (68Q25) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items
Cached Gaussian elimination for simulating Stokes flow on domains with repetitive geometry, Sequential and parallel triangulating algorithms for elimination game and new insights on minimum degree, Unnamed Item, On the static interaction of fluid and gas loaded multi-chamber systems in large deformation finite element analysis, Graphical Models and Message-Passing Algorithms: Some Introductory Lectures, Applying abstraction and formal specification in numerical software design, Using domain decomposition to find graph bisectors, Two improved algorithms for envelope and wavefront reduction, A parallel solver for the \(hp\)-version of finite element methods, Graph Bisection with Pareto Optimization, Automated adaptive multilevel solver, An algebraic multilevel parallelizable preconditioner for large-scale CFD problems, PARFES: A method for solving finite element linear equations on multi-core computers, On sparse matrix orderings in interior point methods, Parallelized integrated nested Laplace approximations for fast Bayesian inference, Generating weakly chordal graphs from arbitrary graphs, Footbridge between finite volumes and finite elements with applications to CFD, JASMIN-based Two-dimensional Adaptive Combined Preconditioner for Radiation Diffusion Equations in Inertial Fusion Research, Efficient unsteady high Reynolds number flow computations on unstructured grids, Fully dynamic algorithm for chordal graphs with \(O(1)\) query-time and \(O(n^2)\) update-time, Preconditioning for sparse linear systems at the dawn of the 21st century: history, current developments, and future perspectives, Task scheduling for parallel sparse Cholesky factorization, Unnamed Item, Some computational aspects of a group theoretic finite element approach to the buckling and postbuckling analyses of plates and shells of revolution, Multiphysics simulation of flow-induced vibrations and aeroelasticity on parallel computing platforms, Effective preconditioning through minimum degree ordering interleaved with incomplete factorization, State-of-the-Art Sparse Direct Solvers, A survey on direct solvers for Galerkin methods, Reordering and incomplete preconditioning in serial and parallel adaptive mesh refinement and coarsening flow solutions, The average parallel complexity of Cholesky factorization, Differentiation of matrix functionals using triangular factorization, The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth., PACE Solver Description: Tree Depth with FlowCutter, Implementing cholesky factorization for interior point methods of linear programming, A parallel multilevel preconditioned iterative pressure Poisson solver for the large-eddy simulation of turbulent flow inside a duct, Compression, inversion, and approximate PCA of dense kernel matrices at near-linear computational complexity, Parallel direct solver for solving systems of linear equations resulting from finite element method on multi-core desktops and workstations, Graphical models for genetic analyses, A survey of direct methods for sparse linear systems, Fast minimal triangulation algorithm using minimum degree criterion, Factoring matrices with a tree-structured sparsity pattern, On the ordering of sparse linear systems, Exploiting structure in parallel implementation of interior point methods for optimization, Combinatorial Aspects in Sparse Elimination Methods, Parallel finite element solver for multi-core computers with shared memory, Hierarchical Cholesky decomposition of sparse matrices arising from curl–curl-equation, Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion, Learning chordal extensions, Fast Implementation of the Traveling-Salesman-Problem Method for Reordering Columns within Supernodes, Exploiting hardware capabilities in interior point methods, Parallel sparse Gaussian elimination with partial pivoting, Unnamed Item, Using an interior point method for the master problem in a decomposition approach, A parallel multi-\(p\) method, Unnamed Item, Automotive design applications of fluid flow simulation on parallel computing platforms, Exploiting special structure in semidefinite programming: a survey of theory and applications, Iterative methods for linear systems of equations: A brief historical journey, Matrix Reordering Using Multilevel Graph Coarsening for ILU Preconditioning, Subspace Iteration Randomization and Singular Value Problems, Improving parallel ordering of sparse matrices using genetic algorithms, The effect of graph partitioning techniques on parallel block FSAI preconditioning: a computational study, A grid-based multilevel incomplete LU factorization preconditioning technique for general sparse matrices, A parallel interior point algorithm for linear programming on a network of transputers, Partitioning a chordal graph into transitive subgraphs for parallel sparse triangular solution, LOQO:an interior point code for quadratic programming, Customizable Contraction Hierarchies, Preconditioning techniques for large linear systems: A survey
