Papers › A universal matrix-free split preconditioner for the fixed-point iterative solution of...

A universal matrix-free split preconditioner for the fixed-point iterative solution of non-symmetric linear systems

28 Jul 2022arXiv:2207.14222links table onlyarchive 2025-07-28

Tom Vettenburg, Ivo M. Vellekoop

The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.

We present an efficient preconditioner for linear problems A x=y. It guarantees monotonic convergence of the memory-efficient fixed-point iteration for all accretive systems of the form A = L + V, where L is an approximation of A, and the system is scaled so that the discrepancy is bounded with ‖V ‖<1. In contrast to common splitting preconditioners, our approach is not restricted to any particular splitting. Therefore, the approximate problem can be chosen so that an analytic solution is available to efficiently evaluate the preconditioner. We prove that the only preconditioner with this property has the form (L+I)(I - V)⁻¹. This unique form moreover permits the elimination of the forward problem from the preconditioned system, often halving the time required per iteration. We demonstrate and evaluate our approach for wave problems, diffusion problems, and pantograph delay differential equations. With the latter we show how the method extends to general, not necessarily accretive, linear systems.

PaperPDFCode

Code

IvoVellekoop/wavesim_py mentioned on GitHubpytorch report
ivovellekoop/anysim_cluster mentioned on GitHubpytorch report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections