Pages that link to "Item:Q3823722"
From MaRDI portal
The following pages link to The Evolution of the Minimum Degree Ordering Algorithm (Q3823722):
Displaying 50 items.
- Compression, inversion, and approximate PCA of dense kernel matrices at near-linear computational complexity (Q92247) (← links)
- On sparse matrix orderings in interior point methods (Q402236) (← links)
- Efficient unsteady high Reynolds number flow computations on unstructured grids (Q435525) (← links)
- Fully dynamic algorithm for chordal graphs with \(O(1)\) query-time and \(O(n^2)\) update-time (Q442287) (← links)
- Effective preconditioning through minimum degree ordering interleaved with incomplete factorization (Q482688) (← links)
- A survey on direct solvers for Galerkin methods (Q489954) (← links)
- A parallel multilevel preconditioned iterative pressure Poisson solver for the large-eddy simulation of turbulent flow inside a duct (Q534613) (← links)
- Fast minimal triangulation algorithm using minimum degree criterion (Q551209) (← links)
- Factoring matrices with a tree-structured sparsity pattern (Q551257) (← links)
- PARFES: A method for solving finite element linear equations on multi-core computers (Q614000) (← links)
- Parallel sparse Gaussian elimination with partial pivoting (Q753685) (← links)
- Task scheduling for parallel sparse Cholesky factorization (Q915427) (← links)
- Exploiting special structure in semidefinite programming: a survey of theory and applications (Q1044129) (← links)
- The average parallel complexity of Cholesky factorization (Q1192153) (← links)
- Using an interior point method for the master problem in a decomposition approach (Q1278995) (← links)
- A parallel interior point algorithm for linear programming on a network of transputers (Q1309858) (← links)
- Partitioning a chordal graph into transitive subgraphs for parallel sparse triangular solution (Q1311330) (← links)
- Using domain decomposition to find graph bisectors (Q1371661) (← links)
- Two improved algorithms for envelope and wavefront reduction (Q1371664) (← links)
- A parallel solver for the \(hp\)-version of finite element methods (Q1371905) (← links)
- Automated adaptive multilevel solver (Q1387978) (← links)
- An algebraic multilevel parallelizable preconditioner for large-scale CFD problems (Q1387981) (← links)
- A parallel multi-\(p\) method (Q1569994) (← links)
- Automotive design applications of fluid flow simulation on parallel computing platforms (Q1574344) (← links)
- Graphical models for genetic analyses (Q1764318) (← links)
- A grid-based multilevel incomplete LU factorization preconditioning technique for general sparse matrices (Q1855075) (← links)
- Preconditioning techniques for large linear systems: A survey (Q1868569) (← links)
- Applying abstraction and formal specification in numerical software design (Q1903758) (← links)
- Preconditioning for sparse linear systems at the dawn of the 21st century: history, current developments, and future perspectives (Q1954336) (← links)
- Some computational aspects of a group theoretic finite element approach to the buckling and postbuckling analyses of plates and shells of revolution (Q1965153) (← links)
- Multiphysics simulation of flow-induced vibrations and aeroelasticity on parallel computing platforms (Q1971315) (← links)
- Parallel direct solver for solving systems of linear equations resulting from finite element method on multi-core desktops and workstations (Q2006579) (← links)
- Parallel finite element solver for multi-core computers with shared memory (Q2027595) (← links)
- Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion (Q2039245) (← links)
- Learning chordal extensions (Q2046324) (← links)
- Cached Gaussian elimination for simulating Stokes flow on domains with repetitive geometry (Q2123853) (← links)
- Exploiting structure in parallel implementation of interior point methods for optimization (Q2271797) (← links)
- The effect of graph partitioning techniques on parallel block FSAI preconditioning: a computational study (Q2340362) (← links)
- Sequential and parallel triangulating algorithms for elimination game and new insights on minimum degree (Q2378540) (← links)
- Improving parallel ordering of sparse matrices using genetic algorithms (Q2576753) (← links)
- On the static interaction of fluid and gas loaded multi-chamber systems in large deformation finite element analysis (Q2637984) (← links)
- Parallelized integrated nested Laplace approximations for fast Bayesian inference (Q2677902) (← links)
- The multiple minimum degree ordering with greedy graph compression for vector computers (Q2738666) (← links)
- Minimal orderings revisited (Q2784346) (← links)
- Exploiting hardware capabilities in interior point methods (Q2815515) (← links)
- Differentiation of matrix functionals using triangular factorization (Q3015047) (← links)
- A note on fast approximate minimum degree orderings for symmetric matrices with some dense rows (Q3090780) (← links)
- State-of-the-Art Sparse Direct Solvers (Q3300486) (← links)
- Fast Implementation of the Traveling-Salesman-Problem Method for Reordering Columns within Supernodes (Q3382788) (← links)
- Graphical Models and Message-Passing Algorithms: Some Introductory Lectures (Q3463611) (← links)
