A parameterized block-splitting preconditioner for indefinite least squares problem

2025/07/22 by Davod Khojasteh Salkuyeh, Salkuyeh, Davod Khojasteh
Chemistry · Computer Science · Mathematics · #65F10 #Advanced NMR Techniques and Applications #Advanced Optimization Algorithms Research #FOS: Mathematics #Matrix Theory and Algorithms #Numerical Analysis (math.NA)

paper · pdf · doi:10.48550/arxiv.2507.16938

openalex publication_date 2025/07/22 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Related

• The GMRES method for solving the large indefinite least squares problem via an accelerated preconditioner
• Splitting-based randomized iterative methods for solving indefinite least squares problem
• Polynomial Preconditioning for Indefinite Matrices
• Inner-iteration preconditioning with a symmetric splitting matrix for rank-deficient least squares problems
• A note on indefinite matrix splitting and preconditioning