Of algebraic multigrid methods for non-symmetric matrices arising in particle methods

Numerical Linear Algebra with Applications

Volumn 17, Issue 2-3, 2010, Pages 433-451

  Seibold, B ^a  

^a Temple University   (United States)

Author keywords

Algebraic multigrid; AMLI; Finite difference; M matrix; Meshfree

Indexed keywords

EID: 77949572841     PISSN: 10705325     EISSN: 10991506     Source Type: Journal    
DOI: 10.1002/nla.710     Document Type: Article

References (52)

1. Lucy L. A numerical approach to the testing of the fission hypothesis. Astronomical Journal 1977; 82:1013-1024.
2. Gingold RA, Monaghan JJ. Smoothed particle hydrodynamics-theory and application to nonspherical stars. Monthly Notices of the Royal Astronmical Society 1977; 181:375.
3. Monaghan JJ. An introduction to SPH. Computer Physics Communications 1988; 48:89-96.
4. Monaghan JJ. Smoothed particle hydrodynamics. Annual Review of Astronomy and Astrophysics 1992; 30: 543-574.
5. Dilts GA. Moving least squares particles hydrodynamics I, consistency and stability. International Journal for Numerical Methods in Engineering 1999; 44:1115-1155.
6. Kuhnert J. General smoothed particle hydrodynamics. Dissertation, Department of Mathematics, University of Kaiserslautern, 1999.
7. Kuhnert J, Tiwari S. A meshfree method for incompressible fluid flows with incorporated surface tension. Revue Europe'enne des Elements Finis 2002; 11(7-8):965-987.
8. Kuhnert J, Tiwari S. Particle method for simulation of free surface flows. In Proceedings of the Ninth International Conference on Hyperbolic Problems, Hou T, Tadmor E (eds). Springer: Berlin, 2003; 889-898.
9. Seibold B. Multigrid and M-matrices in the finite pointset method for incompressible flows. In Meshfree Methods for Partial Differential Equations III, Griebel M, Schweitzer MA (eds). Springer: Berlin, 2007; 219-234.
10. Chorin AJ. Numerical solution of the Navier-Stokes equations. Mathematics of Computation 1968; 22:745-762.
11. Cummins SJ, Rudman M. Truly incompressible SPH. ASME Fluids Engineering Division Summer Meeting, Washington, DC, U.S.A., 1998.
12. Cummins SJ, Rudman M. An SPH projection method. Journal of Computational Physics 1999; 152(2):584-607.
13. Shewchuk JR. Lecture Notes on Delaunay Mesh Generation. Lecture Notes. University of California: Berkeley, 1999.
14. Strang G, Fix G. An Analysis of the Finite Element Method. Series in Automatic Computation. Prentice-Hall: Englewood Cliffs, 1973.
15. Belytschko T, Lu YY, Gu L. Element-free Galerkin methods. International Journal for Numerical Methods in Engineering 1994; 37:229-256.
16. Babuska I, Melenk JM. The partition of unity finite element method: basic theory and applications. Computer Methods in Applied Mechanics and Engineering 1996; 139:289-314.
17. Babuska I, Melenk JM. The partition of unity method. International Journal for Numerical Methods in Engineering 1997; 40:727-758.
18. Griebel M, Schweitzer MA. A particle-partition of unity method for the solution of elliptic parabolic and hyperbolic PDE. SIAM Journal on Scientific Computing 2000; 22:853-890.
19. Griebel M, Schweitzer MA. A particle-partition of unity method-part III: a multilevel solver. SIAM Journal on Scientific Computing 2002; 24:377-409.
20. Perrone N, Kao R. A general finite difference method for arbitrary meshes. Computers and Structures 1975; 5:45-58.
21. Liszka T, Orkisz J. The finite difference method at arbitrary irregular grids and its application in applied mechanics. Computers and Structures 1980; 11:83-95.
22. Demkowicz L, Karafiat A, Liszka T. On some convergence results for FDM with irregular meshes. Computer Methods in Applied Mechanics and Engineering 1984; 42:343-355.
23. Seibold B. M-Matrices in meshless finite difference methods. Dissertation, Department of Mathematics, University of Kaiserslautern, 2006.
24. Duarte L, Liszka T, Tworzyako W. hp-Meshless cloud method. Computer Methods in Applied Mechanics and Engineering 1996; 139(1-7):263-288.
25. Langville AN, Meyer CD. Google's PageRank and Beyond: The Science of Search Engine Rankings. Princeton University Press: Princeton, NJ, 2006.
26. Trottenberg U, Oosterlee CW, Schüller A. Multigrid. Academic Press: New York, 2001.
27. Saad Y, Schultz MH. GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems. SIAM Journal on Scientific and Statistical Computing 1986; 7:856-869.
28. van der Vorst HA. BI-CGSTAB: a fast smoothly converging variant of BI-CG for the solution of nonsymmetric linear systems. SIAM Journal on Scientific and Statistical Computing 1992; 13(2):631-644.
29. Brandt A. Algebraic multigrid theory: the symmetric case. Applied Mathematics and Computation 1986; 19:23-56.
30. Stüben K. A review of algebraic multigrid. Journal of Computational and Applied Mathematics 2001; 128: 281-309.
31. Notay Y. A robust algebraic multilevel preconditioner for non-symmetric M-matrices. Numerical Linear Algebra with Applications 2000; 7:243-267.
32. Notay Y. Algebraic analysis of two-grid methods: the nonsymmetric case. Numerical Linear Algebra with Applications 2010; 17:73-96.
33. Axelsson O, Vassilevski P. Algebraic multilevel preconditioning methods, part I. Numerische Mathematik 1989; 56:157-177.
34. Axelsson O, Vassilevski P. Algebraic multilevel preconditioning methods, part II. SIAM Journal on Numerical Analysis 1990; 27:1569-1590.
35. Mense C, Nabben R. On algebraic multilevel methods for non-symmetric systems-comparison results. Linear Algebra and its Applications 2008; 429(10):2567-2588.
36. Mense C, Nabben R. On algebraic multilevel methods for non-symmetric systems-convergence results. Electronic Transactions on Numerical Analysis 2008; 20:323-345.
37. Hackbusch W. Iterative Solution of Large Sparse Systems of Equations. Springer: Berlin, 1994.
38. Evans LC. Partial Differential Equations. Graduate Studies in Mathematics, vol. 19. American Mathematical Society: Providence, RI, 1998.
39. Quarteroni A, Sacco R, Saleri F. Numerical Mathematics. Springer: Berlin, 2000.
40. Varga RS. Matrix Iterative Analysis (2nd edn). Springer: Berlin, 2000.
41. Lancaster P, Salkauskas K. Surfaces generated by moving least squares methods. Mathematics of Computation 1981; 37:141-158.
42. Levin D. The approximation power of moving least-squares. Mathematics of Computation 1998; 67:1517-1531.
43. Vanderbei RJ. Linear Programming: Foundations and Extensions. International Series in Operations Research and Management Science (2nd edn). Springer: Berlin, 2001.
44. Seibold B. Minimal positive stencils in meshfree finite difference methods for the Poisson equation. Computer Methods in Applied Mechanics and Engineering 2008; 198(3-4):592-601.
45. 1-norm solution is also the sparsest solution. Communications on Pure and Applied Mathematics 2006; 59(6):797-829.
46. 1-norm near-solution approximates the sparsest near-solution. Communications on Pure and Applied Mathematics 2006; 59(7):907-934.
47. Chvátal V. Linear Programming. W. H. Freeman and Company: New York, 1983.
48. SCAI SAMG. Available at: http://www.scai.fhg.de/samg.html.
49. Ruge JW, Stüben K. Parallel algebraic multigrid (AMG). In Multigrid Methods, Frontiers in Applied Mathematics, MacCormick SF (ed.), vol. 5. SIAM: Philadelphia, PA, 1986.
50. Saad Y. Iterative Methods for Sparse Linear Systems (2nd edn). Society for Industrial and Applied Mathematics: Philadelphia, PA, 1996.
51. Ruge JW, Stüben K. Algebraic multigrid. In Multigrid Methods, MacCormick SF (ed.), vol. 3. SIAM: Philadelphia, PA, 1987; 73-130.
52. Fujimoto T, Ranade RR. Characterization of inverse-positive matrices: the Hawkins-Simon condition and the Le Chatelier-Braun principle. Electronic Journal of Linear Algebra 2004; 11:59-65.