AbstractSingular systems with index one arise in many applications, such as Markov chain modelling. In this paper, we use the group inverse to characterize the convergence and quotient convergence properties of stationary iterative schemes for solving consistent singular linear systems when the index of the coefficient matrix equals one. We give necessary and sufficient conditions for the convergence of stationary iterative methods for such problems. Next we show that for the stationary iterative method, the convergence and the quotient convergence are equivalent
In order to solve the large scale linear systems, backward and Jacobi iteration algorithms are emplo...
A statistical approach to the study of the stability of a stationary iterative method for solving a ...
Research Report 95-121, Department of Mathematics, Temple University, December 1995. This paper appe...
AbstractIn this paper, we first show that for the stationary iterative methods for solving consisten...
AbstractIterative methods for the solution of consistent singular systems of linear equations are go...
AbstractIn this paper, we discuss convergence of the extrapolated iterative methods for solving sing...
AbstractKrylov subspace methods have been recently considered to solve singular linear systems Ax=b....
We consider the simulation-based solution of linear systems ofequations, <i>Ax = b</i>, of various t...
In this paper, we discuss semiconvergence of the alternating iterative methods for solving singular ...
AbstractThis note investigates the convergence of a linear stationary iterative process of the form ...
AbstractConsider the linear system of equations Bx=ƒ, where B is an NxN singular matrix. In an earli...
AbstractWe study the semiconvergence of two-stage iterative methods for solving nonsymmetric singula...
AbstractA stationary iterative method for solving a singular system Ax=b converges for any starting ...
AbstractInfluenced by some techniques used for computing singular points of nonlinear equations, a g...
A stationary iterative method for solving a singular system Ax=b converges for any starting vector i...
In order to solve the large scale linear systems, backward and Jacobi iteration algorithms are emplo...
A statistical approach to the study of the stability of a stationary iterative method for solving a ...
Research Report 95-121, Department of Mathematics, Temple University, December 1995. This paper appe...
AbstractIn this paper, we first show that for the stationary iterative methods for solving consisten...
AbstractIterative methods for the solution of consistent singular systems of linear equations are go...
AbstractIn this paper, we discuss convergence of the extrapolated iterative methods for solving sing...
AbstractKrylov subspace methods have been recently considered to solve singular linear systems Ax=b....
We consider the simulation-based solution of linear systems ofequations, <i>Ax = b</i>, of various t...
In this paper, we discuss semiconvergence of the alternating iterative methods for solving singular ...
AbstractThis note investigates the convergence of a linear stationary iterative process of the form ...
AbstractConsider the linear system of equations Bx=ƒ, where B is an NxN singular matrix. In an earli...
AbstractWe study the semiconvergence of two-stage iterative methods for solving nonsymmetric singula...
AbstractA stationary iterative method for solving a singular system Ax=b converges for any starting ...
AbstractInfluenced by some techniques used for computing singular points of nonlinear equations, a g...
A stationary iterative method for solving a singular system Ax=b converges for any starting vector i...
In order to solve the large scale linear systems, backward and Jacobi iteration algorithms are emplo...
A statistical approach to the study of the stability of a stationary iterative method for solving a ...
Research Report 95-121, Department of Mathematics, Temple University, December 1995. This paper appe...