A block upper triangular preconditioner for double saddle point problems arising from liquid crystal modeling
Source abstract
Abstract
To address the double saddle point problems that emerge in liquid crystal modeling, this article proposes the utilization of the preconditioned generalized minimal residual method for their resolution. Initially, a block upper triangular (BUT) splitting of the coefficient matrix is introduced to facilitate this objective. Subsequently, the BUT preconditioner, incorporating relevant parameters, is logically derived. Furthermore, the convergence of the iteration method when employing the preconditioner is delved into in great detail. To better demonstrate the preconditioner’s efficacy, the formula for calculating the parameters has also been established. Ultimately, the numerical example confirms that the robustness of the proposed block preconditioner exceeds that of the four existing block preconditioners, especially in the case of large dimensions.
Source: crossref · Quality: baseline
Research context
OpenAlex topics: Matrix Theory and Algorithms · Tensor decomposition and applications · Electromagnetic Scattering and Analysis
SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.
Affiliations
College of Mathematics and Statistics, Northwest Normal University 1 , Lanzhou 730070,
School of Science, Lanzhou University of Technology 2 , Lanzhou 730050,
Funding
Jun Li
References (38)
Show source-provided references
1. Block preconditioners for saddle point systems arising from liquid crystal directors modeling10.1007/s10092-018-0271-6 ↗
2. A preconditioned nullspace method for liquid crystal director modeling10.1137/120870219 ↗
3. Preconditioning techniques for a mixed Stokes/Darcy model in porous media applications10.1016/j.cam.2009.07.029 ↗
4. On GSOR, the generalized successive overrelaxation method for double saddle-point problems10.1137/22M1515884 ↗
5. A class of block alternating splitting implicit iteration methods for double saddle point linear systems10.1002/nla.2455 ↗
6. A unified approach for Uzawa algorithms10.1137/050630714 ↗
7. Preconditioned Hermitian and skew-Hermitian splitting methods for non-Hermitian positive semidefinite linear systems10.1007/s00211-004-0521-1 ↗
8. M. Benzi and G. H.Golub, “An iterative method for generalized saddle point problems,” Technical Report SCCM-02-14, Scientific Computing and Computational Mathematics Program, Department of Computer Science, Stanford University, 2002.
9. Numerical solution of saddle point problems10.1017/s0962492904000212 ↗
10. 1989
11. Semi-convergence analysis of Uzawa methods for singular saddle point problems10.1016/j.cam.2013.05.015 ↗
12. On semi-convergence of parameterized Uzawa methods for singular saddle point problems10.1016/j.laa.2009.03.033 ↗
13. GMRES: A generalized minimal residual algorithm for solving nonsymmetric Linear systems10.1137/0907058 ↗
14. A preconditioner for generalized saddle point problems10.1137/s0895479802417106 ↗
15. A dimensional split preconditioner for Stokes and linearized Navier–Stokes equations10.1016/j.apnum.2010.08.005 ↗
16. A relaxed dimensional factorization preconditioner for the incompressible Navier–Stokes equations10.1016/j.jcp.2011.04.001 ↗
17. A relaxed HSS preconditioner for saddle point problems from meshfree discretization10.4208/jcm.1304-m4209 ↗
18. A relaxed deteriorated PSS preconditioner for nonsymmetric saddle point problems from the steady Navier–Stokes equation10.1016/j.cam.2014.06.001 ↗
19. A simplified HSS preconditioner for generalized saddle point problems10.1007/s10543-015-0588-3 ↗
20. A modified relaxed positive-semidefinite and skew-Hermitian splitting preconditioner for generalized saddle point problems10.4208/eajam.190716.311216a ↗
21. A relaxed positive semi-definite and skew-Hermitian splitting preconditioner for non-Hermitian generalized saddle point problems10.1007/s11075-015-0068-5 ↗
22. New preconditioners for saddle point problems10.1016/j.amc.2004.11.016 ↗
23. Two improvements of the deteriorated PSS preconditioner for generalized saddle point problems10.1007/s11075-016-0195-7 ↗
24. Inexact modified positive-definite and skew-Hermitian splitting preconditioners for generalized saddle point problems10.1177/1687814018804092 ↗
25. Alternating positive semidefinite splitting preconditioners for double saddle point problems10.1007/s10092-019-0322-7 ↗
26. A two-parameter block triangular preconditioner for double saddle point problem arising from liquid crystal directors modeling10.1007/s11075-021-01142-5 ↗
27. Iterative methods for double saddle point systems10.1137/17M1121226 ↗
28. Parameter-robust Uzawa-type iteration methods for double saddle point problems arising in Biot’s consolidation and multiple-network poroelasticity models10.1142/S0218202520500499 ↗
29. Modified restrictive preconditioners for double saddle point problems arising from liquid crystal director modeling10.1007/s40314-023-02564-8 ↗
30. On preconditioning of double saddle point linear systems arising from liquid crystal director modeling10.1016/j.aml.2022.108445 ↗
31. Three effective preconditioners for double saddle point problem10.3934/math.2021406 ↗
32. A modified new matrix splitting preconditioner for double saddle point problems10.1007/s13160-023-00581-y ↗
33. A modified improved alternating positive semi-definite splitting preconditioner for double saddle point problems10.1007/s12190-024-02165-6 ↗
34. A variant of relaxed alternating positive semi-definite splitting preconditioner for double saddle point problems10.1007/s13160-021-00467-x ↗
35. Improved splitting preconditioner for double saddle point problems arising from liquid crystal director modeling10.1007/s11075-022-01305-y ↗
36. A block triangular preconditioner for a class of three-by-three block saddle point problems10.1007/s13160-022-00561-8 ↗
37. 1971
38. Towards an optimal condition number of certain augmented Lagrangian-type saddle-point matrices10.1002/nla.2050 ↗