Corpus ID: 119332408

Symmetric inner-iteration preconditioning for rank-deficient least squares problems

  title={Symmetric inner-iteration preconditioning for rank-deficient least squares problems},
  author={K. Morikuni},
  journal={arXiv: Numerical Analysis},
  • K. Morikuni
  • Published 2015
  • Mathematics
  • arXiv: Numerical Analysis
Stationary iterative methods with a symmetric splitting matrix are performed as inner-iteration preconditioning for Krylov subspace methods. We give a necessary and sufficient condition such that the inner-iteration preconditioning matrix is definite, and show that conjugate gradient (CG) method preconditioned by the inner iterations determines a solution of a symmetric and positive semidefinite linear system, and the minimal residual (MR) method preconditioned by the inner iterations… Expand
2 Citations
Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning
The proposed interior-point method based on iterative solvers succeeds in solving a fairly large number of LP instances from benchmark libraries under the standard stopping criteria and presents a fairly extensive benchmark test for several renowned solvers including direct and iterativesolvers. Expand
Numerical optimisation problems in finance
The Heston model, among the other members of the stochastic volatility family, is the only one that is found to be consistent under the spot inversion, and this conclusion verifies the arbitrage opportunity in the variance swap. Expand


Convergence of Inner-Iteration GMRES Methods for Rank-Deficient Least Squares Problems
A general convergence theory for the generalized minimal residual method preconditioned by inner iterations for solving least squares problems is developed and numerical experiments show that the proposed methods are more robust and efficient compared to previous methods for some rank-deficient problems. Expand
On polynomial preconditioning and asymptotic convergence factors for indefinite Hermitian matrices
Abstract We are concerned with the minimal residual method combined with polynomial preconditioning for solving large linear systems Ax = b with indefinite Hermitian coefficient matrices A . TheExpand
Minimal Residual Method Stronger than Polynomial Preconditioning
It is demonstrated that for matrices unitarily equivalent to an upper triangular Toeplitz matrix, a similar result holds; namely, either both methods converge or both fail to converge, although this result cannot be generalized to all matrices. Expand
Inner-Iteration Krylov Subspace Methods for Least Squares Problems
Numerical experiments on overdetermined sparse least squares problems show that the proposed methods outperform previous methods, especially for ill-conditioned and rank-deficient problems. Expand
Convergence properties of Krylov subspace methods for singular linear systems with arbitrary index
Abstract Krylov subspace methods have been recently considered to solve singular linear systems Ax = b . In this paper, we derive the necessary and sufficient conditions guaranteeing that a KrylovExpand
Polynomial preconditioners based on factorized sparse approximate inverses
An additive polynomial preconditioner for the Conjugate Gradient method based on multisplittings is proposed and the results of the numerical experiments obtained on a Cray T3E for a representative set of matrices are presented. Expand
Preconditioned conjugate gradients for solving singular systems
Abstract In this paper the preconditioned conjugate gradient method is used to solve the system of linear equations Ax = b , where A is a singular symmetric positive semi-definite matrix. The methodExpand
A class of iterative methods for finite element equations
Abstract A general method in the form of an accelerated preconditioned iterative refinement method (including some wellknown iterative methods and direct factorization methods) is presented for theExpand
Accelerated projection methods for computing pseudoinverse solutions of systems of linear equations
Iterative methods are developed for computing the Moore-Penrose pseudoinverse solution of a linear systemAx=b, whereA is anm ×n sparse matrix. The methods do not require the explicit formation ofATAExpand
Approximating the inverse of a matrix for use in iterative algorithms on vector processors
Approximations using the Neumann expansion of the inverse ofA give reasonable forms forM−1 and Computational results using the conjugate gradient method for the “5-point” matrixA are given. Expand