A Hyperpower Iterative Method for Computing Matrix Products Involving the Generalized Inverse
Pages 104 - 109
Abstract
Apth order iterative method for computing $A^\dag B$ is studied, where $p \geqq 2$, A and B are arbitrary complex matrices with equal number of rows and $A^\dag $ is the Moore–Penrose generalized inverse of A. The rate of convergence and the computational effort in the pth order method are studied, and the optimum p is given in terms of the numbers of columns of A and B.
References
[1]
M. Altman, An optimum cubically convergent iterative method of inverting a linear bounded operator in Hilbert space, Pacific J. Math., 10 (1960), 1107–1113
[2]
A. Ben-Israel, A note on an iterative method for generalized inversion of matrices, Math. Comp., 20 (1966), 439–440
[3]
A. Ben-Israel, A. Charnes, Contributions to the theory of generalized inverses, J. Soc. Indust. Appl. Math., 11 (1963), 667–699
[4]
Adi Ben-Israel, Dan Cohen, On iterative computation of generalized inverses and associated projections, SIAM J. Numer. Anal., 3 (1966), 410–419
[5]
G. Golub, W. Kahan, Calculating the singular values and pseudo-inverse of a matrix, J. Soc. Indust. Appl. Math. Ser. B Numer. Anal., 2 (1965), 205–224
[6]
Alston S. Householder, The theory of matrices in numerical analysis, Blaisdell Publishing Co. Ginn and Co. New York-Toronto-London, 1964xi+257
[7]
R. K. Manherz, Masters Thesis, Applications of the generalized inverse in network theory, Doctoral thesis, Dept. of Electrical Engineering., Northwestern Univ., Evanston, Ill., 1968
[8]
Ben Noble, A method for computing the generalized inverse of a matrix, SIAM J. Numer. Anal., 3 (1966), 582–584
[9]
R. Penrose, A generalized inverse for matrices, Proc. Cambridge Philos. Soc., 51 (1955), 406–413
[10]
W. V. Petryshyn, On generalized inverses and on the uniform convergence of $(I-\beta K)\sp{n}$ with application to iterative methods, J. Math. Anal. Appl., 18 (1967), 417–439
[11]
C. De Polignac, Inverse generalise de matrices, Université Laval, Quebec, Canada, 1968
[12]
W. G. Wee, Generalized inverse approach to adaptive multiclass pattern classification, IEEE Trans. Electronic Computers, C-17 (1968), 1157–1164
[13]
T. M. Whitney, R. K. Meany, Two algorithms related to the method of steepest descent, SIAM J. Numer. Anal., 4 (1967), 109–118
[14]
Leopold B. Willner, An elimination method for computing the generalized inverse, Math. Comp., 21 (1967), 227–229
[15]
S. S. Yau, T. T. Lin, Linear decision functions for pattern classification, Proc. Second Annual Princeton Conference on Information Sciences and Systems, Princeton, 1968, 448–452
[16]
Sanjo Zlobec, On computing the generalized inverse of a linear operator, Glasnik Mat. Ser. III, 2 (22) (1967), 265–271
[17]
S. Zlobec, A. Ben-Israel, On Ku-symmetric and Ku-p.d. matrices with applications to hyper-power methods of generalized inversion, Systems Research Memo. 214, Northwestern Univ., Evanston, Ill., 1968
Index Terms
- A Hyperpower Iterative Method for Computing Matrix Products Involving the Generalized Inverse
Index terms have been assigned to the content through auto-classification.
Recommendations
A note on computing matrix-vector products with generalized centrosymmetric (centrohermitian) matrices
To reduce the costs of computing matrix-vector product Ax related to a centrosymmetric matrix A as compared to the case of an arbitrary matrix A, two algorithms were proposed recently, one was designed by Melman [A. Melman, Symmetric centrosymmetric ...
The matrix analogue of the scalar AOR iterative method
The Accelerated Overrelaxation (AOR) and the Generalized AOR (GAOR) iterative methods for the solution of linear systems of algebraic equations ( A x = b , A C n í n , det ( A ) 0 , b C n ) have been around for about four decades and a plethora of ...
The generalised Sylvester matrix equations over the generalised bisymmetric and skew-symmetric matrices
A matrix <italic>P</italic> is called a symmetric orthogonal if <italic>P</italic> = <italic>P</italic><italic>T</italic> = <italic>P</italic>−1. A matrix <italic>X</italic> is said to be a generalised bisymmetric with respect to <italic>P</italic> if <...
Comments
Information & Contributors
Information
Published In
Copyright © 1971 Society for Industrial and Applied Mathematics.
Publisher
Society for Industrial and Applied Mathematics
United States
Publication History
Published: 01 March 1971
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 21 Sep 2024
Other Metrics
Citations
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in