Performance of algebraic multigrid methods for non-symmetric matrices arising in particle methods
From MaRDI portal
Publication:3094591
DOI10.1002/NLA.710zbMATH Open1240.76047arXiv0905.3005OpenAlexW2036800642MaRDI QIDQ3094591FDOQ3094591
Publication date: 25 October 2011
Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/0905.3005
Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Finite difference methods for boundary value problems involving PDEs (65N06) Particle methods and lattice-gas methods (76M28)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- For most large underdetermined systems of linear equations the minimal đ1ânorm solution is also the sparsest solution
- Numerical Solution of the Navier-Stokes Equations
- Matrix Iterative Analysis
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- Smoothed particle hydrodynamics: theory and application to non-spherical stars
- Surfaces Generated by Moving Least Squares Methods
- The approximation power of moving least-squares
- Elementâfree Galerkin methods
- Algebraic multilevel preconditioning methods. I
- Iterative solution of large sparse systems of equations. Transl. from the German
- Algebraic Multilevel Preconditioning Methods, II
- A Particle-Partition of Unity Method for the Solution of Elliptic, Parabolic, and Hyperbolic PDEs
- Two characterizations of inverse-positive matrices: the Hawkins-Simon condition and the Le Chatelier-Braun principle
- An introduction to SPH
- On some convergence results for FDM with irregular mesh
- An SPH projection method
- Smoothed particle hydrodynamics and its diverse applications
- Moving-least-squares-particle hydrodynamics?I. Consistency and stability
- The finite difference method at arbitrary irregular grids and its application in applied mechanics
- Algebraic multigrid theory: The symmetric case
- A Meshfree Method For Incompressible Fluid Flows with Incorporated Surface Tension
- A Particle-Partition of Unity Method--Part III: A Multilevel Solver
- Minimal positive stencils in meshfree finite difference methods for the Poisson equation
- On algebraic multilevel methods for non-symmetric systems - convergence results
- Algebraic analysis of two-grid methods: The nonsymmetric case
- A robust algebraic multilevel preconditioner for non-symmetricM-matrices
Cited In (14)
- Novel multilevel techniques for convergence acceleration in the solution of systems of equations arising from RBF-FD meshless discretizations
- Strong-form approach to elasticity: hybrid finite difference-meshless collocation method (FDMCM)
- Bucket-based multigrid preconditioner for solving pressure Poisson equation using a particle method
- Minimal numerical differentiation formulas
- Multigrid methods for convergent mixed finite difference scheme for Monge-Ampère equation
- Algebraic multigrid for the finite pointset method
- Lagrangian differencing dynamics for incompressible flows
- Approximate solution of the Hamilton-Jacobi-Bellman equation
- MGM: A Meshfree Geometric Multilevel Method for Systems Arising from Elliptic Equations on Point Cloud Surfaces
- Fast multilevel methods for Markov chains
- Compact moving least squares: an optimization framework for generating high-order compact meshless discretizations
- Convergence in Norm of Nonsymmetric Algebraic Multigrid
- A splitting-free vorticity redistribution method
- Multigrid methods for image registration model based on optimal mass transport
Uses Software
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)
