Performance of algebraic multigrid methods for non-symmetric matrices arising in particle methods
From MaRDI portal
Publication:3094591
Abstract: Large linear systems with sparse, non-symmetric matrices arise in the modeling of Markov chains or in the discretization of convection-diffusion problems. Due to their potential to solve sparse linear systems with an effort that is linear in the number of unknowns, algebraic multigrid (AMG) methods are of fundamental interest for such systems. For symmetric positive definite matrices, fundamental theoretical convergence results are established, and efficient AMG solvers have been developed. In contrast, for non-symmetric matrices, theoretical convergence results have been provided only recently. A property that is sufficient for convergence is that the matrix be an M-matrix. In this paper, we present how the simulation of incompressible fluid flows with particle methods leads to large linear systems with sparse, non-symmetric matrices. In each time step, the Poisson equation is approximated by meshfree finite differences. While traditional least squares approaches do not guarantee an M-matrix structure, an approach based on linear optimization yields optimally sparse M-matrices. For both types of discretization approaches, we investigate the performance of a classical AMG method, as well as an AMLI type method. While in the considered test problems, the M-matrix structure turns out not to be necessary for the convergence of AMG, problems can occur when it is violated. In addition, the matrices obtained by the linear optimization approach result in fast solution times due to their optimal sparsity.
Recommendations
- A root-node-based algebraic multigrid method
- Nonsymmetric algebraic multigrid based on local approximate ideal restriction (\(\ell\)AIR)
- On algebraic multilevel methods for non-symmetric systems - convergence results
- On algebraic multi-level methods for non-symmetric systems --- comparison results
- Algebraic multigrid (AMG) for saddle point systems from meshfree discretizations
Cites work
- scientific article; zbMATH DE number 3555381 (Why is no real title available?)
- scientific article; zbMATH DE number 1181255 (Why is no real title available?)
- scientific article; zbMATH DE number 1953446 (Why is no real title available?)
- A Meshfree Method For Incompressible Fluid Flows with Incorporated Surface Tension
- A Particle-Partition of Unity Method for the Solution of Elliptic, Parabolic, and Hyperbolic PDEs
- A Particle-Partition of Unity Method--Part III: A Multilevel Solver
- A robust algebraic multilevel preconditioner for non-symmetricM-matrices
- Algebraic Multilevel Preconditioning Methods, II
- Algebraic analysis of two-grid methods: the nonsymmetric case
- Algebraic multigrid theory: The symmetric case
- Algebraic multilevel preconditioning methods. I
- An SPH projection method
- An introduction to SPH
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- Element‐free Galerkin methods
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Iterative solution of large sparse systems of equations. Transl. from the German
- M-matrices in meshless finite difference methods
- Matrix iterative analysis
- Minimal positive stencils in meshfree finite difference methods for the Poisson equation
- Moving-least-squares-particle hydrodynamics?I. Consistency and stability
- Numerical Solution of the Navier-Stokes Equations
- On algebraic multilevel methods for non-symmetric systems - convergence results
- On some convergence results for FDM with irregular mesh
- Smoothed particle hydrodynamics and its diverse applications
- Smoothed particle hydrodynamics: theory and application to non-spherical stars
- Surfaces Generated by Moving Least Squares Methods
- The approximation power of moving least-squares
- The finite difference method at arbitrary irregular grids and its application in applied mechanics
- Two characterizations of inverse-positive matrices: the Hawkins-Simon condition and the Le Chatelier-Braun principle
Cited in
(15)- Multigrid methods for convergent mixed finite difference scheme for Monge-Ampère equation
- Novel multilevel techniques for convergence acceleration in the solution of systems of equations arising from RBF-FD meshless discretizations
- A root-node-based algebraic multigrid method
- Approximate solution of the Hamilton-Jacobi-Bellman equation
- A splitting-free vorticity redistribution method
- Algebraic multigrid for the finite pointset method
- Minimal numerical differentiation formulas
- Compact moving least squares: an optimization framework for generating high-order compact meshless discretizations
- Multigrid methods for image registration model based on optimal mass transport
- Fast multilevel methods for Markov chains.
- MGM: A Meshfree Geometric Multilevel Method for Systems Arising from Elliptic Equations on Point Cloud Surfaces
- Convergence in norm of nonsymmetric algebraic multigrid
- Bucket-based multigrid preconditioner for solving pressure Poisson equation using a particle method
- Strong-form approach to elasticity: hybrid finite difference-meshless collocation method (FDMCM)
- Lagrangian differencing dynamics for incompressible flows
This page was built for publication: Performance of algebraic multigrid methods for non-symmetric matrices arising in particle methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3094591)
