Skip to content
DraconiticResearch
Search Sources API
201,818 studies31 sourcesUpdated 54 min ago
PreprintCC BY-NC-ND 4.0arXiv

The transposition method in saddle-point problems

Abstract

The transposition method known from the theory of second-order elliptic partial differential equations is formulated for saddle-point problems under certain structural assumptions known from the Brezzi splitting plus mapping properties that reflect elliptic regularity in concrete instances of differential operators with boundary conditions. A framework is devised that grants approximation by standard, unmodified Galerkin-type methods, which may be nonconforming with respect to the more general data allowed by the transposed operator. That the data need not be regularized is an advantage particular to the saddle-point approach. Examples covered by the framework include the Laplacian, the Stokes operator, linear elasticity, the bi-Laplacian, and the stationary Maxwell problem with L2 boundary data.

Related

  1. On a PSOR-like Method for Generalized Saddle Point Problems
    Rongxia Shao, Xuanle Guo, Shuo Li +2
    AxiomsPeer-reviewedCC BY 4.0General mathematicsCrossref
  2. A parameterized block LU preconditioning for double saddle point problems
    Hamed Aslani, Mehdi Najafi Kalyani, Davod Khojasteh Salkuyeh
    arXivPreprintCC0Full textNumerical analysis & scientific computingarXiv
  3. Fluid Problems Posed on Closed Hypersurfaces: Circumventing the Saddle-Point Structure
    Ricardo H. Nochetto, Mansur Shakipov
    arXivPreprintarXiv licenceFull textAnalysis & PDEsarXiv
  4. Projection-Free Algorithms for Nonsmooth Stochastic Convex-Concave Saddle-Point Problems
    Khanh-Hung Giang-Tran, Soroosh Shafiee
    arXivPreprintCC BY 4.0Full textOptimisation & controlarXiv
  5. Tikhonov-Regularized Dynamics and Inexact Algorithms for Nonlinear Saddle-Point Problems
    Hong-lu Li, Yi-bin Xiao
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
BibTeX
@misc{gallistl2026transposition,
  title = {{The transposition method in saddle-point problems}},
  author = {Dietmar Gallistl and Zhen Liu},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.24478},
  eprint = {2609.24478},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.24478},
  note = {CC BY-NC-ND 4.0},
}
RIS
TY  - UNPB
TI  - The transposition method in saddle-point problems
AU  - Dietmar Gallistl
AU  - Zhen Liu
PY  - 2026
DA  - 2026/09/21
PB  - arXiv
DO  - 10.48550/arxiv.2609.24478
UR  - https://arxiv.org/abs/2609.24478
AB  - The transposition method known from the theory of second-order elliptic partial differential equations is formulated for saddle-point problems under certain structural assumptions known from the Brezzi splitting plus mapping properties that reflect elliptic regularity in concrete instances of differential operators with boundary conditions. A framework is devised that grants approximation by standard, unmodified Galerkin-type methods, which may be nonconforming with respect to the more general data allowed by the transposed operator. That the data need not be regularized is an advantage particular to the saddle-point approach. Examples covered by the framework include the Laplacian, the Stokes operator, linear elasticity, the bi-Laplacian, and the stationary Maxwell problem with L^2 boundary data.
ER  -