## Abstract When solving multicommodity network flow problems with either a primal or a dual partitioning technique one must carry and update a working basis inverse whose size need never exceed the number of saturated arcs (i.e. arcs for which there is no excess capacity). Efficient procedures hav
Representation and approximation of the outer inverse AT,S(2) of a matrix A
β Scribed by Yong-Lin Chen; Xin Chen
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 163 KB
- Volume
- 308
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
β¦ Synopsis
In this paper, we establish a basic representation and a representation theorem for the outer inverse A
(2) T ,S of a matrix A, which is the matrix X satisfying XAX = X, R(X) = T and N(X) = S.
We develop several specific representations and iterative methods for A
(2) T ,S . We show that this representation includes many of the traditional generalized inverses and outer inverses, and the relation of our results to these outer inverses will be explored.
π SIMILAR VOLUMES
It is shown for an n x n symmetric positive definite matrix T = (t, j) with negative offdiagonal elements, positive row sums and satisfying certain bounding conditions that its inverse is well approximated, unifornaly to order l/n 2, by a matrix S = (s,,,
This paper presents an explicit expression for the generalized inverse A!$. Based on this, we established the characterization, the representation theorem and the limiting process for A(Ti. As an application, we estimate the error bound of the iterative method for approximating AFL.