Algebraic multigrid methods
J Xu, L Zikatanov - Acta Numerica, 2017 - cambridge.org
This paper provides an overview of AMG methods for solving large-scale systems of
equations, such as those from discretizations of partial differential equations. AMG is often …
equations, such as those from discretizations of partial differential equations. AMG is often …
PETSc users manual revision 3.8
This manual describes the use of PETSc for the numerical solution of partial differential
equations and related problems on high-performance computers. The Portable, Extensible …
equations and related problems on high-performance computers. The Portable, Extensible …
Lean algebraic multigrid (LAMG): Fast graph Laplacian linear solver
OE Livne, A Brandt - SIAM Journal on Scientific Computing, 2012 - SIAM
Laplacian matrices of graphs arise in large-scale computational applications such as
semisupervised machine learning; spectral clustering of images, genetic data, and web …
semisupervised machine learning; spectral clustering of images, genetic data, and web …
Adaptive aggregation-based domain decomposition multigrid for the lattice Wilson--Dirac operator
In lattice quantum chromodynamics (QCD) computations a substantial amount of work is
spent in solving discretized versions of the Dirac equation. Conventional Krylov solvers …
spent in solving discretized versions of the Dirac equation. Conventional Krylov solvers …
Linear solvers for reservoir simulation problems: An overview and recent developments
Linear solvers for reservoir simulation applications are the objective of this review.
Specifically, we focus on techniques for Fully Implicit (FI) solution methods, in which the set …
Specifically, we focus on techniques for Fully Implicit (FI) solution methods, in which the set …
Theoretical bounds for algebraic multigrid performance: review and analysis
SP MacLachlan, LN Olson - Numerical Linear Algebra with …, 2014 - Wiley Online Library
Algebraic multigrid methods continue to grow in robustness as effective solvers for the large
and sparse linear systems of equations that arise in many applications. Unlike geometric …
and sparse linear systems of equations that arise in many applications. Unlike geometric …
Efficient preconditioning of laplacian matrices for computer graphics
We present a new multi-level preconditioning scheme for discrete Poisson equations that
arise in various computer graphics applications such as colorization, edge-preserving …
arise in various computer graphics applications such as colorization, edge-preserving …
Smoothed aggregation multigrid for cloth simulation
R Tamstorf, T Jones, SF McCormick - ACM Transactions on Graphics …, 2015 - dl.acm.org
Existing multigrid methods for cloth simulation are based on geometric multigrid. While good
results have been reported, geometric methods are problematic for unstructured grids …
results have been reported, geometric methods are problematic for unstructured grids …
Linking Gaussian process regression with data-driven manifold embeddings for nonlinear data fusion
In statistical modelling with Gaussian process regression, it has been shown that combining
(few) high-fidelity data with (many) low-fidelity data can enhance prediction accuracy …
(few) high-fidelity data with (many) low-fidelity data can enhance prediction accuracy …
Multiscale Cholesky preconditioning for ill-conditioned problems
Many computer graphics applications boil down to solving sparse systems of linear
equations. While the current arsenal of numerical solvers available in various specialized …
equations. While the current arsenal of numerical solvers available in various specialized …