Optimized sparse approximate inverse smoothers for solving Laplacian linear systems
From MaRDI portal
Publication:2093517
Iterative numerical methods for linear systems (65F10) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Computational methods for sparse matrices (65F50) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Numerical methods for partial differential equations, boundary value problems (65Nxx)
Recommendations
- Sparse approximate inverse smoothers for geometric and algebraic multigrid
- Local Fourier analysis of multigrid methods with polynomial smoothers and aggressive coarsening
- Sparse Approximate Inverse Smoother for Multigrid
- Robust parallel smoothing for multigrid via sparse approximate inverses
- On the multigrid method based on finite difference approximate inverses
Cites work
- A comparative study of sparse approximate inverse preconditioners
- A massively parallel solver for discrete Poisson-like problems
- A Multigrid Tutorial, Second Edition
- A simple multigrid scheme for solving the Poisson equation with arbitrary domain boundaries
- A Sparse Approximate Inverse Preconditioner for Nonsymmetric Linear Systems
- A Sparse Approximate Inverse Preconditioner for the Conjugate Gradient Method
- A two-level method for isogeometric discretizations based on multiplicative Schwarz iterations
- A vectorized multigrid solver for the three-dimensional Poisson equation
- Acceleration of five-point red-black Gauss-Seidel in multigrid for Poisson equation
- An extrapolation cascadic multigrid method combined with a fourth-order compact scheme for 3D Poisson equation
- Approximate inverse preconditionings for sparse linear systems
- Closed-form multigrid smoothing factors for lexicographic Gauss-Seidel
- Efficient relaxed-Jacobi smoothers for multigrid on parallel computers
- Exposing fine-grained parallelism in algebraic multigrid methods
- Fast and high accuracy multigrid solution of the three dimensional Poisson equation
- Fourier Analysis for Multigrid Methods on Triangular Grids
- Grid independent convergence using multilevel circulant preconditioning: Poisson's equation
- scientific article; zbMATH DE number 1953444 (Why is no real title available?)
- scientific article; zbMATH DE number 3797123 (Why is no real title available?)
- Iterative methods and preconditioning for large and sparse linear systems with applications
- Laplacian preconditioning of elliptic PDEs: localization of the eigenvalues of the discretized operator
- Local Fourier analysis of multigrid methods with polynomial smoothers and aggressive coarsening
- Multi-Level Adaptive Solutions to Boundary-Value Problems
- Multigrid smoothers for ultraparallel computing
- On geometric multigrid methods for triangular grids using three-coarsening strategy
- On solving the singular system arisen from Poisson equation with Neumann boundary condition
- On the validity of the local Fourier analysis
- Optimizing a multigrid Runge-Kutta smoother for variable-coefficient convection-diffusion equations
- Optimizing Runge-Kutta smoothers for unsteady flow problems
- Parallel geometric multigrid
- Parallel multigrid smoothing: Polynomial versus Gauss--Seidel
- Parallel Preconditioning with Sparse Approximate Inverses
- Polynomial of best uniform approximation to 1/x and smoothing in two-level methods
- Preconditioning by inverting the Laplacian: an analysis of the eigenvalues
- Robust parallel smoothing for multigrid via sparse approximate inverses
- Scalable implementation of the parallel multigrid method on massively parallel computers
- Sparse approximate inverse preconditioners on high performance GPU platforms
- Sparse Approximate Inverse Smoother for Multigrid
- Sparse approximate inverse smoothers for geometric and algebraic multigrid
- Sparse Approximate-Inverse Preconditioners Using Norm-Minimization Techniques
- Sparse matrix approximations for multigrid methods
- The contraction number of a multigrid method for solving the Poisson equation
- The Covergence Rate of a Multigrid Method with Gauss-Seidel Relaxation for the Poisson Equation
- Toward an Effective Sparse Approximate Inverse Preconditioner
- Tuning Multigrid Methods with Robust Optimization and Local Fourier Analysis
- Two‐level Fourier analysis of multigrid for higher‐order finite‐element discretizations of the Laplacian
Cited in
(4)- Sparse approximate inverse smoothers for geometric and algebraic multigrid
- Optimized sparse approximate inverse smoothers for solving Laplacian linear systems
- Monolithic multigrid for the marker-and-cell discretization of the Stokes-Darcy equations
- Accelerated projected gradient method for linear inverse problems with sparsity constraints
This page was built for publication: Optimized sparse approximate inverse smoothers for solving Laplacian linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2093517)
