Summary
Recently Eiermann, Marek, and Niethammer have shown how to applysemiiterative methods to a fixed point systemx=Tx+c which isinconsistent or in whichthe powers of the fixed point operator T have no limit, to obtain iterative methods which converge to some approximate solution to the fixed point system. In view of their results we consider here stipulations on apreconditioning QAx=Qb of the systemAx=b and, separately, on asplitting A=M−N which lead to fixed point systems such that, with the aid of a semiiterative method, the iterative scheme converges to a weighted Moore-Penrose solution to the systemAx=b. We show in several ways that to obtain a meaningful limit point from a semiiterative method requires less restrictions on the splittings or the reconditionings than those which have been required in the classical Picard iterative method (see, e.g., the works of Berman and Plemmons, Berman and Neumann, and Tanabe).
We pay special attention to the case when the weighted Moore-Penrose solution which is sought is the minimal norm least squares solution toAx=b.
Similar content being viewed by others
References
Ben-Israel, A., Greville, T.N.E.: Generalized Inverses: Theory and Applications. New York London Sydney Toronto: Wiley 1974
Berman, A., Neumann, M.: Consistency and splittings. SIAM J. Numer. Anal.13, 877–888 (1976)
Berman, A., Plemmons, R.J.: Cones and iterative methods for best least squares solutions by iteration. SIAM J. Numer. Anal.11, 145–154 (1974)
Berman, A., Plemmons, R.J.: Nonnegative Matrices in the Mathematical Sciences. New York San Francisco London: Academic Press 1979
Björck, Å.: Least squares methodes. In: Ciarlet, P.G., Lions, J.L. (eds) Handbook of Numerical Analysis, Vol. I: Finite Difference Methods. Solutions of Equations in ℝn. North-Holland: Elsevier 1990.
Chen, Y.-T.: Iterative methods for linear least squares problems. PhD thesis, University of Waterloo, Ontario, Canada, 1975
Eiermann, M., Marek, I., Niethammer, W.: On the solution of singular linear systems of algebraic equations by semiiterative methods. Numer. Math.53, 265–283 (1988)
Eiermann, M., Niethammer, W., Varga, R.S.: A study of semiiterative methods for nonsymmetric systems of linear equations. Numer. Math.47, 505–533 (1985)
Heath, M.T.: Numerical methods for large sparse linear least squares problems. SIAM J. Sci. Stat. Comput.5, 497–513 (1984)
Joshi, V.N.: A note on the solution of rectangular linear systems by iteration. SIAM Rev.12, 463–466 (1970)
Lawson, L.M.: Computational methods for generalized inverse matrices arising from proper splittings. Linear Algebra Appl.12, 111–126 (1975)
Maess, G.: Projection methods for solving rectangular systems. J. Comput. Appl. Math.24, 107–119 (1988)
Neumann, M.: Subproper splitting for reactangular matrices. Linear Algebra Appl.14, 41–51 (1976)
Plemmons, R.J.: Direct iterative methods for linear systems using weak splittings. Acta Univ. Carol., Math. Phys.1–2, 117–120 (1974)
Plemmons, R.J.: Monotonicity and iterative approximations involving rectangular matrices. Math. Comput.26, 853–858, (1972)
Tanabe, K.: Characterization of linear stationary iterative processes for solving a singular system of linear equations. Numer. Math.22, 349–359 (1974)
Tanabe, K.: Neumann-type expansion of reflexive generalized inverses of a matrix and the hyperpower iterative method. Linear Algebra Appl.10, 163–175 (1975)
Varga, R.S.: Matrix Iterative Analysis. Englewood Cliffs. Prentice-Hall, New Jersey: 1962
Author information
Authors and Affiliations
Additional information
Research supported by the Deutsche Forschungsgemeinschaft
Partially supported by AFOSR research grant 88-0047
Rights and permissions
About this article
Cite this article
Hanke, M., Neumann, M. Preconditionings and splittings for rectangular systems. Numer. Math. 57, 85–95 (1990). https://doi.org/10.1007/BF01386399
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01386399