CHOLMOD

swMATH4412MaRDI QIDQ16588FDOQ16588

Author name not available (Why is that?)

Described by source

• Implementation of nonsymmetric interior-point methods for linear optimization over sparse matrix cones

Cited In (only showing first 100 items - show all)

• On Using Cholesky-Based Factorizations and Regularization for Solving Rank-Deficient Sparse Linear Least-Squares Problems
• Distributed optimization and statistical learning via the alternating direction method of multipliers
• A proof via finite elements for Schiffer's conjecture on a regular pentagon
• AMPS: real-time mesh cutting with augmented matrices for surgical simulations.
• \(\ell_1\)-based construction of polycube maps from complex shapes
• Scalable asynchronous domain decomposition solvers
• A fast algorithm for manifold learning by posing it as a symmetric diagonally dominant linear system
• An adaptive finite element Moreau-Yosida-based solver for a coupled Cahn-Hilliard/Navier-Stokes system
• A multiscale sparse grid finite element method for a two-dimensional singularly perturbed reaction-diffusion problem
• Algorithm 907
• An introduction to the analysis and implementation of sparse grid finite element methods
• Computational aspects of the EM algorithm for spatial econometric models with missing data
• Cholesky factorisation of linear systems coming from finite difference approximations of singularly perturbed problems
• Nonlocal via local-nonlinear via linear: a new part-coding distance field via screened Poisson equation
• Projection onto a polyhedron that exploits sparsity
• Geometric optimization using nonlinear rotation-invariant coordinates
• Multiscale modeling using goal-oriented adaptivity and numerical homogenization. II: Algorithms for the Moore-Penrose pseudoinverse
• On the approximate reanalysis technique in topology optimization
• An adaptive stabilized conforming finite element method via residual minimization on dual discontinuous Galerkin norms
• Updating constraint preconditioners for KKT systems in quadratic programming via low-rank corrections
• A Gauss-Newton method for the integration of spatial normal fields in shape space
• On the implementation and usage of SDPT3 -- a Matlab software package for semidefinite-quadratic-linear programming, version 4.0
• Sparse Gaussian Elimination Modulo p: An Update
• Penalized splines for smooth representation of high-dimensional Monte Carlo datasets
• Domain decomposition methods for 3D crack propagation problems using XFEM
• SBA
• Algorithm 915: SuiteSparseQR: multifrontal multithreaded rank-revealing sparse QR factorization
• Non-intrusive parallelization of multibody system dynamic simulations
• A phase-field model for compliance shape optimization in nonlinear elasticity
• Hybridized summation-by-parts finite difference methods
• PARFES: A method for solving finite element linear equations on multi-core computers
• \(S^{4}\): a free electromagnetic solver for layered periodic structures
• Title not available (Why is that?)
• On the effect of linear algebra implementations in real-time multibody system dynamics
• Highly Scalable Bayesian Geostatistical Modeling via Meshed Gaussian Processes on Partitioned Domains
• Parameter estimation in high dimensional Gaussian distributions
• Spectral Schur complement techniques for symmetric eigenvalue problems
• On the update of constraint preconditioners for regularized KKT systems
• CVXGEN: a code generator for embedded convex optimization
• Efficient Algorithms for Bayesian Nearest Neighbor Gaussian Processes
• An Algebraic Sparsified Nested Dissection Algorithm Using Low-Rank Approximations
• GPU acceleration for FEM-based structural analysis
• Exact likelihood-free Markov chain Monte Carlo for elliptically contoured distributions
• Hypergraph-based unsymmetric nested dissection ordering for sparse LU factorization
• Efficient topology optimization in MATLAB using 88 lines of code
• Large-scale sparse inverse covariance matrix estimation
• Decomposition-based method for sparse semidefinite relaxations of polynomial optimization problems
• A sparse proximal implementation of the LP dual active set algorithm
• Dual multilevel optimization
• Robust solution of singularly perturbed problems using multigrid methods
• A Riemannian Optimization Approach for Computing Low-Rank Solutions of Lyapunov Equations
• A stable and linear time discretization for a thermodynamically consistent model for two-phase incompressible flow
• PCBDDC: a class of robust dual-primal methods in PETSc
• Title not available (Why is that?)
• Generalized Bloch mode synthesis for accelerated calculation of elastic band structures
• Accelerating implicit integration in multi-body dynamics using GPU computing
• High performance verified computing using C-XSC
• Sparse matrix methods for circuit simulation problems
• The State-of-the-Art of Preconditioners for Sparse Linear Least-Squares Problems
• Design of a multicore sparse Cholesky factorization using DAGs
• DOLFIN: automated finite element computing
• The University of Florida sparse matrix collection
• A computational study of the use of an optimization-based method for simulating large multibody systems†
• Accelerating coupled finite element-kinetic Monte Carlo models: \(200 \times\) speedup of shear transformation zone dynamics simulations
• QPALM: a proximal augmented Lagrangian method for nonconvex quadratic programs
• On a primal-dual Newton proximal method for convex quadratic programs
• Logarithmic barriers for sparse matrix cones
• Parameter selection and preconditioning for a graph form solver
• The eigenvalues slicing library (EVSL): algorithms, implementation, and software
• A phase field based PDE constrained optimization approach to time discrete Willmore flow
• Null-space preconditioners for saddle point systems
• Statistical Finite Elements via Langevin Dynamics
• An efficient analyse phase for element problems.
• Sparse Cholesky factorization on FPGA using parameterized model
• Towards an automatic isogeometric analysis suitable trivariate models generation -- application to geometric parametric analysis
• DUNE -- the distributed and unified numerics environment
• A posteriori error control for the binary Mumford-Shah model
• Parallel direct solver for solving systems of linear equations resulting from finite element method on multi-core desktops and workstations
• A phase-field approach to variational hierarchical surface segmentation
• \texttt{MADAM}: a parallel exact solver for max-cut based on semidefinite programming and ADMM
• Decomposition and regularization of nonlinear anisotropic curl‐curl DAEs
• An algorithm for the topology optimization of geometrically nonlinear structures
• Stripe patterns on surfaces
• ``Compress and Eliminate” Solver for Symmetric Positive Definite Sparse Matrices
• Joint denoising and distortion correction of atomic scale scanning transmission electron microscopy images
• Algorithm 930: FACTORIZE: an object-oriented linear system solver for MATLAB
• Algorithm 980: Sparse QR factorization on the GPU
• Improving the generalized Bloch mode synthesis method using algebraic condensation
• Goal-oriented adaptivity for a conforming residual minimization method in a dual discontinuous Galerkin norm
• HyKKT: a hybrid direct-iterative method for solving KKT linear systems
• Combined hybridizable discontinuous Galerkin (HDG) and Runge-Kutta discontinuous Galerkin (RK-DG) formulations for Green-Naghdi equations on unstructured meshes
• Automatically adaptive, stabilized finite element method via residual minimization for heterogeneous, anisotropic advection-diffusion-reaction problems
• Primal-dual interior point multigrid method for topology optimization
• Parallel-in-time multigrid with adaptive spatial coarsening for the linear advection and inviscid Burgers equations
• Generalized metric energies for continuous shape deformation
• Preconditioning techniques for the numerical solution of flow in fractured porous media
• Quadratically regularized optimal transport on graphs
• Practical Mixed-Integer Optimization for Geometry Processing
• Multilevel Spectral Domain Decomposition
• Solving primal plasticity increment problems in the time of a single predictor-corrector iteration

This page was built for software: CHOLMOD