References for the Linear System Solvers and the Preconditioners
1. http://mumps.enseeiht.fr/
2. www.pardiso-project.org/
3. www.netlib.org/linalg/spooles/
4.  https://www.netlib.org/lapack/index.html
5. https://www.netlib.org/scalapack/index.html
6. https://computation.llnl.gov/casc/hypre/software.html
7. https://github.com/hypre-space/hypre/
8. D. Kuzmin, R. Löhner, and S. Turek (editors), “Flux-Corrected Transport: Principles, Algorithms, and Applications”, Scientific Computation, Springer-Verlag, Berlin, 2005.
9. Greenbaum, A., “Iterative Methods for Linear Systems”, Frontiers in Applied Mathematics, vol. 17, SIAM, 1997.
10. Y. Saad and M.H. Schultz, “GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems”, SIAM J. Sci. Statist. Comput., vol. 7, pp. 856–869, 1986.
11. M.L. Parks, E. de Sturler, G. Mackey, D. D. Johnson, and S Maiti: Recycling Krylov Subspaces of Linear Systems, Technical Report UIUCDCS-R-2004-2421 (CS), UILU-ENG-2004-1722 (ENGR), March 2004, https://www.sandia.gov/~mlparks/papers/UIUCDCS-R-2004-2421.pdf.
12. Y. Saad, Iterative Methods for Sparse Linear Systems, Boston, 1996.
13. Y. Saad, “A Flexible Inner-Outer Preconditioned GMRES Algorithm”, SIAM J. Sci. Statist. Comput., vol. 14, pp. 461–469, 1993.
14. M.R. Hestenes and E. Stiefel, “Methods of Conjugate Gradients for Solving Linear Systems”, J. Res. Nat. Bur. Standards, vol. 49, pp. 409–435, 1952.
15. C. Lanczos, “Solutions of Linear Equations by Minimized Iterations”, J. Res. Nat. Bur. Standards, vol. 49, pp. 33–53, 1952.
16. H.A. Van Der Vorst, “A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems”, SIAM J. Sci. Statist. Comput., vol. 13, pp. 631–644, 1992.
17. J.R. Gilbert and S. Toledo, “An Assessment of Incomplete-LU Preconditioners for Nonsymmetric Linear Systems”, Informatica, vol. 24, pp. 409–425, 2000.
18. Y. Saad, ILUT: A Dual Threshold Incomplete LU Factorization, Report umsi-92-38, Computer Science Department, University of Minnesota, available from https://www-users.cs.umn.edu/~saad.
19. W. Hackbusch, Multi-grid Methods and Applications, Springer-Verlag, Berlin, 1985.
20. R. Beck and R. Hiptmair, “Multilevel Solution of the Time-harmonic Maxwell’s Equations Based on Edge Elements”, Int. J. Num. Meth. Engr., vol. 45, pp. 901–920, 1999.
21. S. Vanka, “Block-implicit Multigrid Calculation of Two-dimensional Recirculating Flows”, Computer Methods in Applied Mechanics and Engineering, vol. 59, no. 1, pp. 29–48, 1986.
22. H.C. Elman and others, “A Multigrid Method Enhanced by Krylov Subspace Iteration for Discrete Helmholtz Equations”, SIAM J. Sci. Comp., vol. 23, pp. 1291–1315, 2001.
23. A. Toselli and O. Widlund, “Domain Decomposition Methods — Algorithms and Theory”, Springer Series in Computational Mathematics, vol. 34, 2005.
24. E. Agullo, L. Giraud, A. Guermouche, A. Haidar, and J. Roman: Parallel algebraic domain decomposition solver for the solution of augmented systems, HAL Id: inria-00559133, https://hal.inria.fr/inria-00559133.
25. A. Haidar: On the parallel scalability of hybrid solvers for large 3D problems, Ph.D. dissertation, INPT, June 2008, TH/PA/08/57, https://oatao.univ-toulouse.fr/7711/
26. X. Antoine and C Geuzaine, “Optimized Schwarz Domain Decomposition Methods For Scalar and Vector Helmholtz Equations”, Modern Solvers for Helmholtz Problems, Birkhäuser, 2017.
27. J.E. Dennis, Jr., and Robert B. Schnabel, Numerical Methods for Unconstrained Optimization and Nonlinear Equations, SIAM, 1996.
28. Intel® Developer Zone, Preconditioners based on Incomplete LU Factorization Technique: https://software.intel.com/content/www/us/en/develop/documentation/mkl-developer-reference-fortran/top/sparse-solver-routines/preconditioners-based-on-incomplete-lu-factorization-technique.html.
29. R. Fruend, “A Transpose-Free Quasi-Minimal Residual Algorithm for Non-Hermitian Linear Systems”, SIAM Journal on Scientific Computing, vol. 14, pp. 470–482, 1993.
30. H.M Bücker, A transpose-free 1-norm quasi-minimal residual algorithm for non-Hermitian linear systems, FZJ-ZAM-IB-9706.
The COMSOL Multiphysics implementations of the algebraic multigrid solver and preconditioner are based on the following references:
31. K. Stüben, Algebraic Multigrid (AMG): An Introduction with Applications, GMD Report 70, GMD, 1999.
32. C. Wagner, Introduction to Algebraic Multigrid, course notes, University of Heidelberg, 1999.
33. R. Hiptmair, “Multigrid Method for Maxwell’s Equations”, SIAM J. Numer. Anal., vol. 36, pp. 204–225, 1999.
34. D. J. Mavriplis, “Directional Agglomeration Multigrid Techniques for High-Reynolds Number Viscous Flows”, ICASE Report No. 98-7 (NASA/CR-1998-206911), Institute for Computer Applications in Science and Engineering, NASA Langley Research Center, Hampton, VA, 1998.
35. V. John and G. Matthies, “Higher-order Finite Element Discretization in a Benchmark Problem for Incompressible Flows”, Int. J. Numer. Meth. Fluids, vol. 37, pp. 885–903, 2001.
36. V. John, “Higher-order Finite Element Methods and Multigrid Solvers in a Benchmark Problem for the 3D Navier-Stokes Equations”, Int. J. Numer. Meth. Fluids, vol. 40, pp. 775–798, 2002.
37. J. Zhu, X. Zhong, C.-W. Shu, and J. Qiu, “Runge-Kutta discontinuous Galerkin method using a new type of WENO limiters on unstructured meshes,” Journal of Computational Physics, vol. 248, pp. 200–220, 2013.
38. X. Zhang, Y. Xia, and C.-W. Shu, “Maximum-Principle-Satisfying and Positivity-Preserving High Order Discontinuous Galerkin Schemes for Conservation Laws on Triangular Meshes,” J. Sci. Comput., vol. 50, pp. 29–62, 2012.