Abstract
IN THIS paper we shall give some iterative methods for the solution of the complete eigenvalue problem of a matrix. These can be easily carried out on electronic computers and the main portion of the work can be done with fixed-point arithmetic without materially reducing the accuracy. The method for solving the complete eigenvalue problem for normal matrices is given in Q 1. It resembles Jacobi’s process in its structure (see [I], 5 Sl). The method of solution in the case of an arbitrary matrix with a simple structure is given in 5 2. It resembles the triangular power method (see [l], 9 78). For simplicity we shall consider real matrices only, although all the methods given can be applied to complex matrices also without particular difficulty.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: USSR Computational Mathematics and Mathematical Physics
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
