Iterative schemes for approximating a solution to restricted rectangular but consistent linear system of equations Ax=b, x∈T, are considered. The methods are based upon so-called subproper splitting A=M−N, which is a generalization of the concept of subproper splitting introduced by Neumann and studied further by Berman and Neumann and others. We give a necessary and sufficient condition on the splitting such that the iterative sequence converges to a solution of Ax=b in the case of b∈AT for every x0, where A∈Cm×n and T is a subspace of Cn. Monotonicity and the concept of regular subproper splitting are used to determine a necessary and a sufficient condition for the convergence of the iterative scheme. Finally, we present two numerical exa...
AbstractFor every nonsingular matrix A, we show there exists a convergent splitting A = M − N with M...
In [5] a new iterative method is given for the linear system of equations Au=b , where A is large, s...
AbstractFor the linear-squares problems minx||b−Ax||2, where A is large and sparse, straightforward ...
Let Ax = b be a rectricted rectangular and consistent linear system, where A is an m by n matrix and...
AbstractIn this paper iterative schemes for approximating a solution to a rectangular but consistent...
AbstractWe explore iterative schemes for obtaining a solution to the linear system (∗) Ax = b, A ϵ C...
AbstractA subproper splitting of a matrix A is a decomposition A = B − C such that the kernel of A i...
AbstractIn this paper, the perturbation and subproper splittings for the generalized inverse AT,S(2)...
AbstractIn this paper we extend the notions of K-semipositivity, K-monotonicity and of K-positive su...
AbstractRecently, Lee et al. [Young-ju Lee, Jinbiao Wu, Jinchao Xu, Ludmil Zikatanov, On the converg...
AbstractWe study the semiconvergence of two-stage iterative methods for solving nonsymmetric singula...
We study the convergence of P-regular splitting iterative methods for non-Hermitian positive definit...
In this paper, the semiconvergence of a proper weak regular splitting method for the singular linear...
AbstractA proper splitting of a rectangular matrix A is one of the form A = M − N, where A and M hav...
AbstractWe construct a certain iterative scheme for solving large scale consistent systems of linear...
AbstractFor every nonsingular matrix A, we show there exists a convergent splitting A = M − N with M...
In [5] a new iterative method is given for the linear system of equations Au=b , where A is large, s...
AbstractFor the linear-squares problems minx||b−Ax||2, where A is large and sparse, straightforward ...
Let Ax = b be a rectricted rectangular and consistent linear system, where A is an m by n matrix and...
AbstractIn this paper iterative schemes for approximating a solution to a rectangular but consistent...
AbstractWe explore iterative schemes for obtaining a solution to the linear system (∗) Ax = b, A ϵ C...
AbstractA subproper splitting of a matrix A is a decomposition A = B − C such that the kernel of A i...
AbstractIn this paper, the perturbation and subproper splittings for the generalized inverse AT,S(2)...
AbstractIn this paper we extend the notions of K-semipositivity, K-monotonicity and of K-positive su...
AbstractRecently, Lee et al. [Young-ju Lee, Jinbiao Wu, Jinchao Xu, Ludmil Zikatanov, On the converg...
AbstractWe study the semiconvergence of two-stage iterative methods for solving nonsymmetric singula...
We study the convergence of P-regular splitting iterative methods for non-Hermitian positive definit...
In this paper, the semiconvergence of a proper weak regular splitting method for the singular linear...
AbstractA proper splitting of a rectangular matrix A is one of the form A = M − N, where A and M hav...
AbstractWe construct a certain iterative scheme for solving large scale consistent systems of linear...
AbstractFor every nonsingular matrix A, we show there exists a convergent splitting A = M − N with M...
In [5] a new iterative method is given for the linear system of equations Au=b , where A is large, s...
AbstractFor the linear-squares problems minx||b−Ax||2, where A is large and sparse, straightforward ...