arXiv (OAI Expanded)
open access
A parameterized block LU preconditioning for double saddle point problems
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 w
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- BandPC: Learning Residual-Band Preconditioner Combinations for Flexible Conjugate Gradient Solvers#1132341
- A unified analysis on the speedup of accelerated gradient methods: An inertial dynamics approach#999641
- Spectral analysis of a class of IRK stage preconditioners for linear wave equations#1128882
- Gradient self-improvement for mixed local and nonlocal parabolic equations#1071483
- The Zero Pattern of a Design Matrix Drives Multiple Descent in Over-parameterized Regression#999272
Record · ID 1070101
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive