Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
144 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Generalized Golub-Kahan bidiagonalization for nonsymmetric saddle point systems (2310.06952v1)

Published 10 Oct 2023 in math.NA and cs.NA

Abstract: The generalized Golub-Kahan bidiagonalization has been used to solve saddle-point systems where the leading block is symmetric and positive definite. We extend this iterative method for the case where the symmetry condition no longer holds. We do so by relying on the known connection the algorithm has with the Conjugate Gradient method and following the line of reasoning that adapts the latter into the Full Orthogonalization Method. We propose appropriate stopping criteria based on the residual and an estimate of the energy norm for the error associated with the primal variable. Numerical comparison with GMRES highlights the advantages of our proposed strategy regarding its low memory requirements and the associated implications.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (33)
  1. A fully asynchronous multifrontal solver using distributed dynamic scheduling. SIAM J. Matrix Anal. Appl., 23(1):15–41, 2020.
  2. Mario Arioli. Generalized Golub–Kahan bidiagonalization and stopping criteria. SIAM J. Matrix Anal. Appl., 34(2):571–592, 2013.
  3. Studies in Linear and Nonlinear Programming. Stanford University Press, 1958.
  4. GM Awanou and MJ Lai. On convergence rate of the augmented Lagrangian algorithm for nonsymmetric saddle point problems. Appl. Numer. Math., 54(2):122–134, 2005.
  5. Randomized Gram–Schmidt process with application to GMRES. SIAM J. Sci. Comput., 44(3):A1450–A1474, 2022.
  6. Templates for the solution of linear systems: building blocks for iterative methods. SIAM, 1994.
  7. Numerical solution of saddle point problems. Acta Numer., 14:1–137, 2005.
  8. A relaxed deteriorated PSS preconditioner for nonsymmetric saddle point problems from the steady Navier–Stokes equation. J. Comput. Appl. Math., 273:41–60, 2015.
  9. Preconditioned Chebyshev BiCG for parameterized linear systems. arXiv preprint arXiv:2212.04295, 2022.
  10. Inexact inner–outer Golub–Kahan bidiagonalization method: A relaxation strategy. Numer. Linear Algebra Appl., 30(5):e2484, 2023.
  11. Least squares preconditioners for stabilized discretizations of the Navier–Stokes equations. SIAM J. Sci. Comput., 30(1):290–311, 2008.
  12. IFISS: A computational laboratory for investigating incompressible flow problems. SIAM Review, 56(2):261–273, 2014.
  13. Finite elements and fast iterative solvers: with applications in incompressible fluid dynamics. Numer. Math. Sci. Comput., 2014.
  14. Iman Farahbakhsh. Krylov Subspace Methods with Application in Incompressible Fluid Flow Solvers. Wiley, 2020.
  15. Minimum residual methods for augmented systems. BIT, 38(3):527–543, 1998.
  16. M. Fortin and R. Glowinski. Augmented Lagrangian Methods: Applications to the Numerical Solution of Boundary-Value problems, volume 15 in Studies in Mathematics and its Applications. North-Holland Publishing Co., Amsterdam, 1983.
  17. Krylov type methods for linear systems exploiting properties of the quadratic numerical range. Electron. Trans. Numer. Anal., 53:541–561, 2020.
  18. Fast Linear Solvers for Incompressible CFD Simulations with Compatible Discrete Operator Schemes, April 2023. https://hal.science/hal-04087358.
  19. Textbook efficiency: massively parallel matrix-free multigrid for the stokes system. SIAM J. Sci. Comput., 44(2):C124–C155, 2022.
  20. ILU preconditioners for nonsymmetric saddle-point matrices with application to the incompressible Navier–Stokes equations. SIAM J. Sci. Comput., 37(5):A2171–A2197, 2015.
  21. Application of an iterative golub-kahan algorithm to structural mechanics problems with multi-point constraints. Adv. Model. Simul. Eng. Sci., 7, 2020.
  22. Parallel performance of an iterative solver based on the Golub-Kahan bidiagonalization. In: Wyrzykowski R., Deelman E., Dongarra J., Karczewski K. (eds) Parallel Processing and Applied Mathematics. PPAM 2019. Lect. Notes Comp. Sci., 12043, 2020.
  23. Parallel solution of saddle point systems with nested iterative solvers based on the Golub-Kahan bidiagonalization. Concurr. Comput., 33(11):e5914, 2021.
  24. Bounds on the eigenvalue range and on the field of values of non-hermitian and indefinite finite element matrices. J. Comp. Appl. Math., 189(1-2):304–323, 2006.
  25. Krylov Methods for Nonsymmetric Linear Systems: From Theory to Computations. Spr. S. Comp. Math. Springer International Publishing, 2020.
  26. Iterative solution of symmetric quasi-definite linear systems. SIAM, 2017.
  27. Scalable block preconditioners for saturated thermo-hydro-mechanics problems. Adv. Model. Simul. Eng. Sci., 10(1):10, 2023.
  28. Natural preconditioning and iterative methods for saddle point systems. SIAM Review, 57(1):71–91, 2015.
  29. Miroslav Rozložník. Saddle-point problems and their iterative solution. Springer, 2018.
  30. Yousef Saad. Iterative methods for sparse linear systems. SIAM, 2003.
  31. On signed incomplete Cholesky factorization preconditioners for saddle-point systems. SIAM J. Sci. Comp., 36(6):A2984–A3010, 2014.
  32. A null-space approach for large-scale symmetric saddle point systems with a small and non zero (2, 2) block. Numer. Algorithms, 90(4):1639–1667, 2022.
  33. A new generalized shift-splitting method for nonsymmetric saddle point problems. Adv. Mech. Eng., 14(8):16878132221119451, 2022.
Citations (1)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now