Determinantal representation of inverses and solution of linear systems
A representation of the minimal -norm solution.
Self-correcting iterative methods for computing -inverses
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.
Determinantal representation of weighted Moore-Penrose inverse.
Implementation of penalty function methods in LISP
On the generalized Drazin inverse and generalized resolvent
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....
Transformations of Dual Problem and Decreasing Dimensions in Linear Programming
On Moore-Penrose Inverse of Block Matrices and Full-rank Factorization
A Modification of Revised Simplex Method
General Representation of Pseudoinverses
Application of the partitioning method to specific Toeplitz matrices
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...
Second Order Optimization Methods in Lisp
Symbolic Derivation Without Using Expression Trees
Heuristic Algorithm for Single Resource Constrained Project Scheduling Problem Based on the Dynamic Programming
A Non-Recursive Algorithm for Polygon Triangulation
Symbolic Implementation of the Hooke-Jeeves Method
Page 1