Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 8 min ago
PreprintCC0arXiv

A parameterized block LU preconditioning for double saddle point problems

Abstract

We present a biparametric preconditioning technique for large, sparse, non-symmetric, and non-singular double saddle point problems. The preconditioner is induced using a stationary iteration method. It is also based on a two-parameterized block LU factorization of the coefficient matrix. To begin with, some convergence results of the iteration method are derived. Moreover, the spectral features exhibited by the preconditioned matrix are given. Finally, the presented preconditioner is conjuncted with the GMRES method. Numerical results demonstrate the satisfactory performance of the preconditioner.

Related

  1. Randomized inexact block triangular preconditioners for double saddle-point systems in PDE-constrained optimization
    Siqi Liang, Na Huang
    arXivPreprintarXiv licenceFull textNumerical analysis & scientific computingarXiv
  2. Saddle-Point Problems with a Low-Dimensional Block Do Not Need Accurate Inner Solves
    Ivan Fomin, Alexander V. Gasnikov
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
  3. A unified variational framework for augmented Lagrangian preconditioning of saddle point systems: applications to mixed-dimensional and fictitious domain methods
    Michele Benzi, Marco Feder, Luca Heltai +1
    arXivPreprintCC BY 4.0Full textNumerical analysis & scientific computingarXiv
  4. Block diagonal preconditioners for arrow-shaped multiple saddle-point linear systems
    Luca Bergamaschi, Michele Bergamaschi
    arXivPreprintCC BY-SA 4.0Full textNumerical analysis & scientific computingarXiv
  5. Inertial parameterized Douglas-Rachford for generalized DC programming problems
    Avinash Dixit, Pankaj Gautam, Sorin-Mihai Grad
    arXivPreprintCC BY 4.0Full textOptimisation & controlarXiv
BibTeX
@misc{aslani2026parameterized,
  title = {{A parameterized block LU preconditioning for double saddle point problems}},
  author = {Hamed Aslani and Mehdi Najafi Kalyani and Davod Khojasteh Salkuyeh},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.12615},
  eprint = {2609.12615},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.12615},
  note = {CC0},
}
RIS
TY  - UNPB
TI  - A parameterized block LU preconditioning for double saddle point problems
AU  - Hamed Aslani
AU  - Mehdi Najafi Kalyani
AU  - Davod Khojasteh Salkuyeh
PY  - 2026
DA  - 2026/09/11
PB  - arXiv
DO  - 10.48550/arxiv.2609.12615
UR  - https://arxiv.org/abs/2609.12615
AB  - We present a biparametric preconditioning technique for large, sparse, non-symmetric, and non-singular double saddle point problems. The preconditioner is induced using a stationary iteration method. It is also based on a two-parameterized block LU factorization of the coefficient matrix. To begin with, some convergence results of the iteration method are derived. Moreover, the spectral features exhibited by the preconditioned matrix are given. Finally, the presented preconditioner is conjuncted with the GMRES method. Numerical results demonstrate the satisfactory performance of the preconditioner.
ER  -