Transformations of Dual Problem and Decreasing Dimensions in Linear Programming
In this paper we construct a few iterative processes for computing -inverses of a linear bounded operator. These algorithms are extensions of the corresponding algorithms introduced in [11] and a method from [8]. A few error estimates are derived.
We propose an adaptation of the partitioning method for determination of the Moore-Penrose inverse of a matrix augmented by a block-column matrix. A simplified implementation of the partitioning method on specific Toeplitz matrices is obtained. The idea for observing this type of Toeplitz matrices lies in the fact that they appear in the linear motion blur models in which blurring matrices (representing the convolution kernels) are known in advance. The advantage of the introduced method is a significant...
We investigate the generalized Drazin inverse and the generalized resolvent in Banach algebras. The Laurent expansion of the generalized resolvent in Banach algebras is introduced. The Drazin index of a Banach algebra element is characterized in terms of the existence of a particularly chosen limit process. As an application, the computing of the Moore-Penrose inverse in -algebras is considered. We investigate the generalized Drazin inverse as an outer inverse with prescribed range and kernel....
Page 1