AbstractWe develop and analyze a new algorithm that computes bases for the null spaces of all powers of a given matrix, as well as its index. The algorithm uses row operations and “shuffling” steps in which rows of pairs of matrices are interchanged. In particular, the new algorithm may be viewed as an extension of the classic Gauss-Jordan elimination method for inverting a nonsingular matrix. It is also shown that the Drazin inverse has a simple representation in terms of the output of the algorithm and the original matrix
AbstractThe inverse of the matrix A(τ, q) = (aij(τ, q)), aij(τ, q) = (τ+aji), i, j = 0,1,…., n− 1, i...
AbstractA method is given for computing the Drazin inverse of a square matrix A of order n as a poly...
AbstractWe present an alternative explicit expression for the Moore–Penrose inverse of a matrix. Bas...
AbstractWe develop and analyze a new algorithm that computes bases for the null spaces of all powers...
AbstractA shuffle is the horizontal interchange of a pair of blocks of the same size in a matrix. A ...
AbstractIn this paper an algorithm is presented for calculating an estimate for the spectral norm of...
Performing elementary row operations on [ A | I ] , we can calculate matrices whose columns form bas...
AbstractGiven a square matrix A of order n, let a sequence of numbers P1, P2,…, and a sequence of ma...
The generalized inverse A T,S (2) of a matrix A is a {2}-inverse of A with the prescribed range T an...
In this paper we propose two algorithms for computation of the outer inverse with prescribed range a...
AbstractA new type of generalized inverse is defined which is a weakened form of the Drazin inverse....
The objective was to try to develop a useful numerical algorithm for the Drazin inverse and to analy...
We present an alternative explicit expression for the Moore–Penrose inverse of a matrix. Based on th...
In this paper we show how to apply Grobner bases to compute the Drazin inverse of a matrix with mult...
AbstractA new formulation for LU decomposition allows efficient representation of intermediate matri...
AbstractThe inverse of the matrix A(τ, q) = (aij(τ, q)), aij(τ, q) = (τ+aji), i, j = 0,1,…., n− 1, i...
AbstractA method is given for computing the Drazin inverse of a square matrix A of order n as a poly...
AbstractWe present an alternative explicit expression for the Moore–Penrose inverse of a matrix. Bas...
AbstractWe develop and analyze a new algorithm that computes bases for the null spaces of all powers...
AbstractA shuffle is the horizontal interchange of a pair of blocks of the same size in a matrix. A ...
AbstractIn this paper an algorithm is presented for calculating an estimate for the spectral norm of...
Performing elementary row operations on [ A | I ] , we can calculate matrices whose columns form bas...
AbstractGiven a square matrix A of order n, let a sequence of numbers P1, P2,…, and a sequence of ma...
The generalized inverse A T,S (2) of a matrix A is a {2}-inverse of A with the prescribed range T an...
In this paper we propose two algorithms for computation of the outer inverse with prescribed range a...
AbstractA new type of generalized inverse is defined which is a weakened form of the Drazin inverse....
The objective was to try to develop a useful numerical algorithm for the Drazin inverse and to analy...
We present an alternative explicit expression for the Moore–Penrose inverse of a matrix. Based on th...
In this paper we show how to apply Grobner bases to compute the Drazin inverse of a matrix with mult...
AbstractA new formulation for LU decomposition allows efficient representation of intermediate matri...
AbstractThe inverse of the matrix A(τ, q) = (aij(τ, q)), aij(τ, q) = (τ+aji), i, j = 0,1,…., n− 1, i...
AbstractA method is given for computing the Drazin inverse of a square matrix A of order n as a poly...
AbstractWe present an alternative explicit expression for the Moore–Penrose inverse of a matrix. Bas...