A parameterized block-splitting preconditioner for indefinite least squares problem
Davod Khojasteh Salkuyeh

TL;DR
This paper introduces a new parameterized block-splitting preconditioner for indefinite least squares problems, enhancing GMRES convergence and analyzing spectral properties, with demonstrated numerical efficiency improvements.
Contribution
It proposes a novel parameterized block-splitting preconditioner specifically designed for indefinite least squares problems, including convergence analysis and spectral distribution insights.
Findings
The preconditioner accelerates GMRES convergence.
Optimal parameter selection improves performance.
Numerical results outperform existing preconditioners.
Abstract
We present a stationary iteration based upon a block splitting for a class of indefinite least squares problem. Convergence of the proposed method is investigated and optimal value of the involving parameter is used. The induced preconditioner is applied to accelerate the convergence of the GMRES method for solving the problem. We also analysed the eigenpair distribution of the preconditioned matrix. {We assess the efficiency of the proposed preconditioner by presenting results from a numerical comparison with several existing preconditioners.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMatrix Theory and Algorithms · Advanced Optimization Algorithms Research · Advanced NMR Techniques and Applications
