Algorithm 837
From MaRDI portal
Recommendations
Cited in
(66)- High performance sparse solver for unsymmetrical linear equations with out-of-core strategies and its application on meshless methods
- Efficient Algorithms for Bayesian Nearest Neighbor Gaussian Processes
- AMD
- Experiments with sparse Cholesky using a sequential task-flow implementation
- A general scheme for log-determinant computation of matrices via stochastic polynomial approximation
- New parallel sparse direct solvers for multicore architectures
- A new relaxed PSS preconditioner for nonsymmetric saddle point problems
- An efficient second-order cone programming approach for optimal selection in tree breeding
- On large-scale generalized inverses in solving two-by-two block linear systems
- Hierarchical Gaussian graphical models: beyond reversible jump
- A new approach for finding a basis for the splitting preconditioner for linear systems from interior point methods
- Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion
- Cahn-Hilliard-Brinkman systems for tumour growth
- QPALM: a proximal augmented Lagrangian method for nonconvex quadratic programs
- Parameter modified versions of preconditioning and iterative inner product free refinement methods for two-by-two block matrices
- Parallel preconditioners for monolithic solution of shear bands
- Explicit and implicit methods for shear band modeling at high strain rates
- A primal-dual interior-point algorithm for quadratic programming
- Domain decomposition methods for 3D crack propagation problems using XFEM
- Overhang penalization in additive manufacturing via phase field structural topology optimization with anisotropic energies
- An algebraic multilevel preconditioner with low-rank corrections for sparse symmetric matrices
- A sparse symmetric indefinite direct solver for GPU architectures
- Cholesky decomposition with fixing nodes to stable computation of a generalized inverse of the stiffness matrix of a floating structure
- Sparse matrix methods for circuit simulation problems
- Schur complement-based domain decomposition preconditioners with low-rank corrections.
- State-defect constraint pairing graph coarsening method for Karush-Kuhn-Tucker matrices arising in orthogonal collocation methods for optimal control
- Conic optimization via operator splitting and homogeneous self-dual embedding
- A note on fast approximate minimum degree orderings for symmetric matrices with some dense rows
- A hierarchical low rank Schur complement preconditioner for indefinite linear systems
- A preconditioner for a primal-dual Newton conjugate gradient method for compressed sensing problems
- An efficient out-of-core multifrontal solver for large-scale unsymmetric element problems
- Fast computation of spectral densities for generalized eigenvalue problems
- An Approximate Minimum Degree Ordering Algorithm
- An ADMM-based interior-point method for large-scale linear programming
- Exactly solving sparse rational linear systems via roundoff-error-free Cholesky factorizations
- Chordal-TSSOS: a moment-SOS hierarchy that exploits term sparsity with chordal extension
- Efficient preconditioned iterative linear solvers for 3-D magnetostatic problems using edge elements
- Sparse approximate inverse preconditioners on high performance GPU platforms
- \texttt{HSL\_MI28}: an efficient and robust limited-memory incomplete Cholesky factorization code
- A Rational Function Preconditioner For Indefinite Sparse Linear Systems
- Low-Rank Correction Methods for Algebraic Domain Decomposition Preconditioners
- Algorithm 836
- A survey of direct methods for sparse linear systems
- Sparse Hessian factorization in curved trajectories for unconstrained minimization
- Tree decompositions and social graphs
- Algorithm 1021: SPEX Left LU, Exactly Solving Sparse Linear Systems via a Sparse Left-looking Integer-preserving LU Factorization
- A multiscale computational framework using active learning to model complex suspension flows
- Computationally efficient techniques for spatial regression with differential regularization
- Phase field topology optimisation for 4D printing
- Radial basis function interpolation on irregular domain through conformal transplantation
- Cholesky decomposition of a positive semidefinite matrix with known kernel
- A faster direct sampling algorithm for equilateral closed polygons and the probability of knotting
- Convergent authalic energy minimization for disk area-preserving parameterizations
- Approximate Minimum Degree Ordering
- Spherical area-preserving parameterization via energy minimization
- A Halpern fixed-point iteration-based approach to harmonic model predictive control problem
- Energy-based distortion-balancing parameterization for open surfaces
- Complexity of chordal conversion for sparse semidefinite programs with small treewidth
- A note on Chebyshev accelerated PMHSS iteration method for block two-by-two linear systems
- Sparse linear least-squares problems
- Method for verifying solutions of sparse linear systems with general coefficients
- Algorithm 1050: SPEX Cholesky, LDL, and backslash for exactly solving sparse linear systems
- Term-sparse polynomial optimization for the design of frame structures
- Block splitting for distributed optimization
- OSQP: an operator splitting solver for quadratic programs
- On stable parametric finite element methods for the Stefan problem and the Mullins-Sekerka problem with applications to dendritic growth
This page was built for publication: Algorithm 837
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5461208)
