Abstract
ABSTRACTThe problem of finding the latent roots and vectors of matrices has been treated in a number of papers ((2)–(7)) mainly from the point of view of desk computers. In this paper the problem is treated from the standpoint of users of high-speed automatic computers. In the first section a number of iterative processes are described and, in the second, the techniques developed for using these processes on the Pilot Model of the Automatic Computing Engine. It is shown that the methods give very high accuracy and can be used to deal with matrices of high orders even on a machine of very limited storage capacity. They have been used on numerous matrices of orders up to 60 mainly on problems arising in the aircraft industry and on eigenvalue problems for systems of ordinary differential equations.
Publisher
Cambridge University Press (CUP)
Reference7 articles.
1. An iteration method for the solution of the eigenvalue problem of linear differential and integral operations;Lanzos;J. Res. nat. Bur. Stand.,1950
2. Numerical methods for finding characteristic roots and vectors of matrices
3. On Bernoulli's numerical solution of algebraic equations;Aitken;Proc. roy. Soc. Edinb.,1952
4. Expansion of determinantal equations into polynomial form
5. XX.—Studies in Practical Mathematics. II. The Evaluation of the Latent Roots and Latent Vectors of a Matrix
Cited by
22 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献