AMD

swMATH39MaRDI QIDQ12812FDOQ12812

Author name not available (Why is that?)

Described by source

• Algorithm 837

Cited In (60)

• Algorithm 1021: SPEX Left LU, Exactly Solving Sparse Linear Systems via a Sparse Left-looking Integer-preserving LU Factorization
• Exactly Solving Sparse Rational Linear Systems via Roundoff-Error-Free Cholesky Factorizations
• Title not available (Why is that?)
• Low-Rank Correction Methods for Algebraic Domain Decomposition Preconditioners
• A primal-dual interior-point algorithm for quadratic programming
• 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
• Efficient Preconditioned Iterative Linear Solvers for 3-D Magnetostatic Problems Using Edge Elements
• Sparse Matrix Methods for Circuit Simulation Problems
• New parallel sparse direct solvers for multicore architectures
• A general scheme for log-determinant computation of matrices via stochastic polynomial approximation
• Algorithm 907
• The university of Florida sparse matrix collection
• A column pre-ordering strategy for the unsymmetric-pattern multifrontal method
• A fast and robust mixed-precision solver for the solution of sparse symmetric linear systems
• High performance sparse solver for unsymmetrical linear equations with out-of-core strategies and its application on meshless methods
• Algorithm 849
• An efficient out-of-core multifrontal solver for large-scale unsymmetric element problems
• Multigrid preconditioning of the non-regularized augmented Bingham fluid problem
• Parameter modified versions of preconditioning and iterative inner product free refinement methods for two-by-two block matrices
• A Hierarchical Low Rank Schur Complement Preconditioner for Indefinite Linear Systems
• On stable parametric finite element methods for the Stefan problem and the Mullins-Sekerka problem with applications to dendritic growth
• Chordal-TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity with Chordal Extension
• State-defect constraint pairing graph coarsening method for Karush-Kuhn-Tucker matrices arising in orthogonal collocation methods for optimal control
• Explicit and implicit methods for shear band modeling at high strain rates
• Title not available (Why is that?)
• Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion
• A new relaxed PSS preconditioner for nonsymmetric saddle point problems
• Domain decomposition methods for 3D crack propagation problems using XFEM
• SBA
• A Preconditioner for A Primal-Dual Newton Conjugate Gradient Method for Compressed Sensing Problems
• Block splitting for distributed optimization
• An algebraic multilevel preconditioner with low-rank corrections for sparse symmetric matrices
• HIFIR: Hybrid Incomplete Factorization with Iterative Refinement for Preconditioning Ill-Conditioned and Singular Systems
• Radial basis function interpolation on irregular domain through conformal transplantation
• On the design of interfaces to sparse direct solvers
• HSL_MI28
• Efficient Algorithms for Bayesian Nearest Neighbor Gaussian Processes
• Divide and conquer low-rank preconditioners for symmetric matrices
• A column approximate minimum degree ordering algorithm
• OSQP: An Operator Splitting Solver for Quadratic Programs
• Algorithm 930
• An ADMM-based interior-point method for large-scale linear programming
• A note on fast approximate minimum degree orderings for symmetric matrices with some dense rows
• A sparse symmetric indefinite direct solver for GPU architectures
• An out-of-core sparse Cholesky solver
• Fast Computation of Spectral Densities for Generalized Eigenvalue Problems
• An efficient second-order cone programming approach for optimal selection in tree breeding
• Cahn-Hilliard-Brinkman systems for tumour growth
• Conic optimization via operator splitting and homogeneous self-dual embedding
• Analysis of Augmented Lagrangian-Based Preconditioners for the Steady Incompressible Navier–Stokes Equations
• Preconditioners based on strong subgraphs
• Cholesky decomposition with fixing nodes to stable computation of a generalized inverse of the stiffness matrix of a floating structure
• Tree decompositions and social graphs
• Overhang penalization in additive manufacturing via phase field structural topology optimization with anisotropic energies
• Parallel preconditioners for monolithic solution of shear bands
• A Rational Function Preconditioner For Indefinite Sparse Linear Systems
• Experiments with sparse Cholesky using a sequential task-flow implementation
• QPALM: a proximal augmented Lagrangian method for nonconvex quadratic programs
• Sparse approximate inverse preconditioners on high performance GPU platforms

This page was built for software: AMD