Pages that link to "Item:Q4717298"
From MaRDI portal
The following pages link to An Approximate Minimum Degree Ordering Algorithm (Q4717298):
Displaying 50 items.
- Efficient Algorithms for Bayesian Nearest Neighbor Gaussian Processes (Q104464) (← links)
- State-defect constraint pairing graph coarsening method for Karush-Kuhn-Tucker matrices arising in orthogonal collocation methods for optimal control (Q301689) (← links)
- A fast nested dissection solver for Cartesian 3D elliptic problems using hierarchical matrices (Q348573) (← links)
- A fast direct solver for elliptic problems on general meshes in 2D (Q422952) (← links)
- The cost of continuity: a study of the performance of isogeometric finite elements using direct solvers (Q438156) (← links)
- Effective preconditioning through minimum degree ordering interleaved with incomplete factorization (Q482688) (← links)
- A survey on direct solvers for Galerkin methods (Q489954) (← links)
- Sparse approximate inverse preconditioners on high performance GPU platforms (Q520817) (← links)
- A relaxed dimensional factorization preconditioner for the incompressible Navier-Stokes equations (Q551042) (← links)
- A dimensional split preconditioner for Stokes and linearized Navier-Stokes equations (Q610781) (← links)
- Application of the incomplete Cholesky factorization preconditioned Krylov subspace method to the vector finite element method for 3-D electromagnetic scattering problems (Q615044) (← links)
- Implementation of nonsymmetric interior-point methods for linear optimization over sparse matrix cones (Q621748) (← links)
- Substructure preconditioners for a class of structured linear systems of equations (Q623055) (← links)
- A domain-decomposing parallel sparse linear system solver (Q645723) (← links)
- JADAMILU: a software code for computing selected eigenvalues of large sparse symmetric matrices (Q710112) (← links)
- Block splitting for distributed optimization (Q744220) (← links)
- Limited-memory LDL\(^{\top}\) factorization of symmetric quasi-definite matrices with application to constrained optimization (Q745223) (← links)
- Non-intrusive parallelization of multibody system dynamic simulations (Q835510) (← links)
- Fill-ins number reducing direct solver designed for FIT-type matrix (Q991499) (← links)
- Exploiting structure in large-scale electrical circuit and power system problems (Q1025851) (← links)
- Multifrontal parallel distributed symmetric and unsymmetric solvers (Q1574349) (← links)
- The impact of high-performance computing in the solution of linear systems: Trends and problems (Q1591200) (← links)
- Decomposition in multidimensional Boolean-optimization problems with sparse matrices (Q1647455) (← links)
- Method of fundamental solutions for 3D elasticity with body forces by coupling compactly supported radial basis functions (Q1654813) (← links)
- A parallel computing method using blocked format with optimal partitioning for SpMV on GPU (Q1678174) (← links)
- Distance descending ordering method: an \(O(n)\) algorithm for inverting the mass matrix in simulation of macromolecules with long branches (Q1695352) (← links)
- Experiments with sparse Cholesky using a sequential task-flow implementation (Q1713223) (← links)
- New parallel sparse direct solvers for multicore architectures (Q1736591) (← links)
- Coupling of continuous and hybridizable discontinuous Galerkin methods: application to conjugate heat transfer problem (Q1736903) (← links)
- A relaxed splitting preconditioner for the incompressible Navier-Stokes equations (Q1760678) (← links)
- Graphical models for genetic analyses (Q1764318) (← links)
- Preconditioning techniques for large linear systems: A survey (Q1868569) (← links)
- Gigaflops in linear programming (Q1919182) (← links)
- Comparison of high-order continuous and hybridizable discontinuous Galerkin methods for incompressible fluid flow problems (Q1997159) (← links)
- Element partition trees for \(h\)-refined meshes to optimize direct solver performance. I: Dynamic programming (Q2011908) (← links)
- \(p\)-multigrid methods and their comparison to \(h\)-multigrid methods within isogeometric analysis (Q2020925) (← links)
- Fast computation of Katz index for efficient processing of link prediction queries (Q2036769) (← links)
- A triangulation and fill-reducing initialization procedure for the simplex algorithm (Q2062318) (← links)
- Bregman primal-dual first-order method and application to sparse semidefinite programming (Q2070334) (← links)
- A block ILUT smoother for multipatch geometries in isogeometric analysis (Q2090179) (← links)
- A parallel multithreaded sparse triangular linear system solver (Q2192563) (← links)
- A high performance level-block approximate LU factorization preconditioner algorithm (Q2228018) (← links)
- Stabilized dimensional factorization preconditioner for solving incompressible Navier-Stokes equations (Q2273083) (← links)
- Solving sparse polynomial optimization problems with chordal structure using the sparse bounded-degree sum-of-squares hierarchy (Q2297658) (← links)
- Sparse and scalable eigenstrain-based reduced order homogenization models for polycrystal plasticity (Q2310060) (← links)
- Parameter modified versions of preconditioning and iterative inner product free refinement methods for two-by-two block matrices (Q2332393) (← links)
- Distributed algebraic tearing and interconnecting techniques (Q2334804) (← 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)
- A Bayesian linear model for the high-dimensional inverse problem of seismic tomography (Q2443172) (← links)
