AC(k): robust solution of Laplacian equations by randomized approximate Cholesky factorization
From MaRDI portal
AC\((k)\): robust solution of Laplacian equations by randomized approximate Cholesky factorization
Cites work
- \textit{BoomerAMG}: A parallel algebraic multigrid solver and preconditioner
- A class of first order factorization methods
- A matrix Chernoff bound for strongly Rayleigh distributions and spectral sparsifiers from a few random spanning trees
- A Multigrid Tutorial, Second Edition
- A Nearly-m log n Time Solver for SDD Linear Systems
- A New Convergence Proof for the Multigrid Method Including the V-Cycle
- A simple, combinatorial algorithm for solving SDD systems in nearly-linear time
- A Stability Analysis of Incomplete LU Factorizations
- An Approximate Factorization Procedure for Solving Self-Adjoint Elliptic Difference Equations
- An Approximate Minimum Degree Ordering Algorithm
- An efficient multigrid method for graph Laplacian systems. II: Robust aggregation
- An efficient parallel solver for SDD linear systems
- An implicit, numerical method for solving two-dimensional time-dependent diffusion problems
- An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
- Approaching optimality for solving SDD linear systems
- Approximate factorizations with modified S/P consistently ordered M‐factors
- Approximate Gaussian elimination for Laplacians -- fast, sparse, and simple
- Conditioning of Stieltjes matrices by S/P consistently ordered approximate factorizations
- Direct methods for sparse matrices
- Engineering a combinatorial Laplacian solver: lessons learned
- Expanders via random spanning trees
- General highly accurate algebraic coarsening
- scientific article; zbMATH DE number 1714593 (Why is no real title available?)
- scientific article; zbMATH DE number 434719 (Why is no real title available?)
- scientific article; zbMATH DE number 4190984 (Why is no real title available?)
- scientific article; zbMATH DE number 3700434 (Why is no real title available?)
- scientific article; zbMATH DE number 1953444 (Why is no real title available?)
- scientific article; zbMATH DE number 2088244 (Why is no real title available?)
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- scientific article; zbMATH DE number 5485569 (Why is no real title available?)
- scientific article; zbMATH DE number 7788371 (Why is no real title available?)
- ILUT: A dual threshold incomplete LU factorization
- Lean algebraic multigrid (LAMG): fast graph Laplacian linear solver
- Multi-Level Adaptive Solutions to Boundary-Value Problems
- Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
- Optimal interpolation and compatible relaxation in classical algebraic multigrid
- RCHOL: Randomized Cholesky Factorization for Solving SDD Linear Systems
- Solving elliptic finite element systems in near-linear time with support preconditioners
- Solving SDD linear systems in nearly \(m \log^{1/2} n\) time
- Sparsified Cholesky and multigrid solvers for connection Laplacians
- Subgraph sparsification and nearly optimal ultrasparsifiers
- Support Theory for Preconditioning
- Support-Graph Preconditioners
- The incomplete Cholesky-conjugate gradient method for the iterative solution of systems of linear equations
- The University of Florida sparse matrix collection
- Unit capacity maxflow in almost \(O(m^{4/3})\) time
- Vaidya's preconditioners: Implementation and experimental study
This page was built for publication: AC\((k)\): robust solution of Laplacian equations by randomized approximate Cholesky factorization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7268722)
