DFPI, A unified framework for deflated linear solvers: bridging the gap between Krylov subspace methods and Fixed-Point Iterations

Guillaume Pierrot; Jeremy Kalfoun; John Cagnol

arxiv: 2502.20121 · v1 · submitted 2025-02-27 · 🧮 math.NA · cs.NA

DFPI, A unified framework for deflated linear solvers: bridging the gap between Krylov subspace methods and Fixed-Point Iterations

Jeremy Kalfoun , Guillaume Pierrot , John Cagnol This is my paper

Pith reviewed 2026-05-23 02:34 UTC · model grok-4.3

classification 🧮 math.NA cs.NA

keywords deflated fixed point iterationsKrylov subspace methodsRichardson iterationlinear system solversprojection operatorsAnderson accelerationnumerical linear algebraconvergence analysis

0 comments

The pith

DFPI unifies Richardson iterations with Krylov methods like GMRES under one deflated fixed-point framework.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper introduces DFPI as a framework for iterative solution of linear systems that arise from PDE discretizations. It shows how techniques such as RPM, BoostConv, and Anderson acceleration fit inside the same structure as Richardson iterations and connects them to Krylov methods including GMRES, PCG, and BiCGStab. A general convergence result is presented that holds with little dependence on the exact projection operator provided the projection space stays invariant under the iteration matrix. When that invariance fails, the framework requires a minimization principle instead. Numerical tests on CFD cases are used to compare the resulting solvers.

Core claim

DFPI organizes deflated fixed-point iterations around two blocks, the projection operator and the trouble-vector recruitment strategy, thereby placing RPM, BoostConv, Anderson acceleration, and Krylov subspace methods inside one setting and supplying a convergence theorem that depends only on invariance of the projection space under the iteration matrix.

What carries the argument

The DFPI framework, built from a projection operator paired with a trouble-vector recruitment strategy.

If this is right

Methods previously treated separately now share a single convergence analysis.
The specific choice of projection operator matters little whenever the invariance condition holds.
A minimization step must be added when the projection space is not guaranteed to be invariant.
The same recruitment and projection blocks apply across fixed-point and Krylov families.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

New hybrid solvers could be assembled by swapping recruitment strategies from one existing method into another.
The invariance condition offers a practical test that could guide when to switch between simple and more expensive projections.
The framework suggests examining whether the same unification extends to nonlinear or time-dependent problems.

Load-bearing premise

The projection space remains invariant under the iteration matrix.

What would settle it

A numerical example in which the projection space is invariant under the iteration matrix yet different projection operators produce clearly different convergence rates or failure modes.

read the original abstract

Iterative algorithms are instrumental in modern numerical simulation for solving systems arising from the discretization of PDEs. They face however significant challenges in industrial applications, such as slow convergence, limit cycle oscillations, or iterations blow-up. An ideal preconditioner is rarely available and naive approaches such as Richardson iterations often fail to converge on complex cases, calling for generic sophistications such as deflation techniques and/or Krylov subspaces approaches. However the quest for an optimal general linear solver is still open and a matter of active research. This paper introduces a new theoretical framework, called DFPI (Deflated Fixed Point Iterations) for the iterative solution of linear systems. It unifies several existing acceleration and stabilization techniques such as RPM, BoostConv and Anderson acceleration, and bridges the gap between Richardson iterations and Krylov subspace methods, including GMRES, PCG, BiCGStab and variants. DFPI is structured around two key building blocks : the choice of a projection operator, on the one hand and the trouble vectors recruitment strategy, on the other hand. A general convergence result will be presented, showing the choice of a specific projection operator has minimal impact as long as the projection space remains invariant by the iteration matrix. However when this is not guaranteed, a minimization principle becomes a must have. Finally numerical comparisons will be conducted on a variety of relevant CFD cases.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

DFPI gives a clean taxonomy via projection operators and trouble-vector recruitment but the unification and convergence claim rest on an invariance condition whose coverage of GMRES-style methods is not shown in the abstract.

read the letter

The paper's main contribution is a two-block framework for deflated fixed-point iterations that groups RPM, BoostConv, Anderson acceleration, and several Krylov methods under the same projection-plus-recruitment structure, plus a convergence statement that holds with little dependence on the specific projection when the projection space is invariant under the iteration matrix. That organization is new enough to be worth writing down if the derivations are clean. The abstract does a reasonable job naming the blocks and stating the condition under which the choice of projection has minimal impact, which could help CFD practitioners keep track of why certain accelerators behave the way they do on stiff linear systems. The numerical comparisons on CFD cases are promised but not detailed here, so their value is still open. The soft spot is exactly the one flagged in the stress test: the minimal-impact result is conditioned on invariance, yet the abstract does not derive or verify that the listed methods (GMRES, PCG, BiCGStab, Anderson, etc.) satisfy it from the trouble-vector rules. When invariance fails, the paper says a minimization principle is required, but without seeing how that principle is applied to the bridged methods, the bridging claim stays at the level of a special case rather than a general unification. The citation pattern looks standard for the field and no obvious circularity appears in the abstract. This is the sort of framework paper that numerical analysts and industrial CFD groups might want to read for the taxonomy, even if they end up using the existing accelerators unchanged. It deserves a serious referee to check whether the invariance holds or is enforced for the claimed methods and whether the CFD runs add new evidence beyond re-labeling known behavior. I would send it to review.

Referee Report

2 major / 2 minor

Summary. The paper introduces the DFPI (Deflated Fixed Point Iterations) framework for solving linear systems from PDE discretizations. It unifies RPM, BoostConv, and Anderson acceleration while bridging Richardson iterations to Krylov methods (GMRES, PCG, BiCGStab and variants) via two building blocks: choice of projection operator and trouble-vector recruitment strategy. A general convergence result is stated showing that the specific projection operator has minimal impact provided the projection space remains invariant under the iteration matrix; otherwise a minimization principle is required. Numerical comparisons on CFD test cases are included.

Significance. If the convergence theorem is rigorously derived and the invariance condition is shown to hold (or is enforced) for the listed accelerators and Krylov methods, the framework would supply a useful theoretical unification between fixed-point and subspace methods, potentially guiding new solver constructions. The CFD numerics would then serve as practical evidence of applicability in industrial settings where standard Richardson iterations fail.

major comments (2)

[§3] §3 (Convergence result): The theorem establishing minimal dependence on the projection operator is conditioned on the projection space being invariant under the iteration matrix, yet the manuscript does not derive or verify this invariance from the trouble-vector recruitment definitions for the unified methods (RPM, BoostConv, Anderson) or for the Krylov subspace methods (GMRES, PCG, BiCGStab). Without this step the bridging claim rests on an unverified premise outside the special case.
[§2.2] §2.2 (Projection operator and invariance): The framework states that invariance yields the general convergence result, but no explicit check is provided that the projection spaces arising from the listed accelerators remain invariant; if invariance fails, the text indicates a minimization principle must be invoked, yet it is unclear whether this principle is applied uniformly in the unification or only in the numerics.

minor comments (2)

[Abstract] The abstract and introduction use the future tense (“will be presented”, “will be conducted”) for the convergence result and numerics; these should be changed to present tense once the sections are written.
[§2] Notation for the iteration matrix and projection operator should be introduced once in §2 and used consistently; several ad-hoc symbols appear without prior definition in the convergence discussion.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful reading and constructive comments on the DFPI framework. The points raised about explicit verification of the invariance condition are well-taken and will be addressed through targeted revisions to strengthen the theoretical unification.

read point-by-point responses

Referee: [§3] §3 (Convergence result): The theorem establishing minimal dependence on the projection operator is conditioned on the projection space being invariant under the iteration matrix, yet the manuscript does not derive or verify this invariance from the trouble-vector recruitment definitions for the unified methods (RPM, BoostConv, Anderson) or for the Krylov subspace methods (GMRES, PCG, BiCGStab). Without this step the bridging claim rests on an unverified premise outside the special case.

Authors: We agree that the convergence theorem would be strengthened by an explicit derivation linking the trouble-vector recruitment strategies to the invariance property. In the revised manuscript we will add a new subsection in §3 that derives the invariance condition for RPM, BoostConv and Anderson acceleration directly from their recruitment definitions. For the Krylov methods we will show how their subspace construction either enforces invariance under the iteration matrix or operates under the minimization principle, thereby making the bridging claim rigorous rather than resting on an unverified premise. revision: yes
Referee: [§2.2] §2.2 (Projection operator and invariance): The framework states that invariance yields the general convergence result, but no explicit check is provided that the projection spaces arising from the listed accelerators remain invariant; if invariance fails, the text indicates a minimization principle must be invoked, yet it is unclear whether this principle is applied uniformly in the unification or only in the numerics.

Authors: We will revise §2.2 to include explicit checks (or short proofs) confirming invariance for each listed accelerator where it holds. We will also clarify that the minimization principle is invoked uniformly whenever invariance cannot be guaranteed, and we will add a short paragraph in the numerical section illustrating its consistent application across the unified methods. This will remove any ambiguity about uniformity. revision: yes

Circularity Check

0 steps flagged

No circularity: claims rest on stated assumptions without reduction to inputs by construction

full rationale

The abstract introduces DFPI via two building blocks (projection operator choice and trouble-vector recruitment) and states a convergence result explicitly conditioned on the projection space remaining invariant under the iteration matrix. No equations, parameter fits, or self-citations appear in the provided text that would make any prediction or unification equivalent to its inputs by definition. The unification of RPM/BoostConv/Anderson with Krylov methods is presented as a consequence of the framework structure rather than a renaming or self-referential fit. The invariance condition is flagged as an assumption whose generic satisfaction is not derived here, but this is an external-verifiability issue rather than circularity within the derivation chain itself.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Abstract-only review supplies no explicit free parameters, axioms, or invented entities; the framework is described at the level of projection operators and recruitment strategies whose precise definitions and assumptions are not given.

pith-pipeline@v0.9.0 · 5788 in / 1233 out tokens · 25489 ms · 2026-05-23T02:34:02.857110+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

3 extracted references · 3 canonical work pages

[1]

Anderson and J

J.D. Anderson and J. Wendt, Computational Fluid Dynamics, Springer, 206 (1995)

work page 1995
[2]

Saad, Iterative methods for sparse linear systems, SIAM, 2003

Y. Saad, Iterative methods for sparse linear systems, SIAM, 2003

work page 2003
[3]

R. Fletcher, Conjugate gradient methods for indefinite systems, Numerical Analysis: Proceedings of the Dundee Conference on Numerical Analysis, 1975, Springer (2006) 73-89 18 [4] [5] [6] [7] [8] [9] [10] [11] [12] [13] [14] [15] [16] [17] [18] [19] [20] [21] [22] [23] [24] [25] [26] [27] [28] [29] [30] [31] Y. Saad and M.H. Schultz, GMRES: A Generalized M...

work page 1975

[1] [1]

Anderson and J

J.D. Anderson and J. Wendt, Computational Fluid Dynamics, Springer, 206 (1995)

work page 1995

[2] [2]

Saad, Iterative methods for sparse linear systems, SIAM, 2003

Y. Saad, Iterative methods for sparse linear systems, SIAM, 2003

work page 2003

[3] [3]

R. Fletcher, Conjugate gradient methods for indefinite systems, Numerical Analysis: Proceedings of the Dundee Conference on Numerical Analysis, 1975, Springer (2006) 73-89 18 [4] [5] [6] [7] [8] [9] [10] [11] [12] [13] [14] [15] [16] [17] [18] [19] [20] [21] [22] [23] [24] [25] [26] [27] [28] [29] [30] [31] Y. Saad and M.H. Schultz, GMRES: A Generalized M...

work page 1975