An Alternating Sequence IterationÃ¢ÂÂs Method for Computing Largest Real Part Eigenvalue of Essentially Positive Matrices: Collatz and Perron- FroberniusÃ¢ÂÂ ApproachTedja Santanoe Oepomo*
Mathematics Division, Los Angeles Harbor College/West LA College, and School of International Business, California International University, USA
- *Corresponding Author:
- Oepomo TS
Science, Technology, Engineering, and Mathematics Division
Los Angeles Harbor College/West LA College, and
School of International Business, California International University
1301 Las Riendas Drive Suite: 15, Las Habra, CA 90631, USA
E-mail: [email protected]; [email protected]; [email protected]
Received Date: November 10, 2016; Accepted Date: December 23, 2016; Published Date: December 27, 2016
Citation: Oepomo TS (2016) An Alternating Sequence Iteration’s Method for Computing Largest Real Part Eigenvalue of Essentially Positive Matrices: Collatz and Perron-Frobernius’ Approach. J Appl Computat Math 5:334. doi: 10.4172/2168-9679.1000334
Copyright: © 2016 Oepomo TS. This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
This paper describes a new numerical method for the numerical solution of eigenvalues with the largest real part of essentially positive matrices. Finally, a numerical discussion is given to derive the required number of mathematical operations of the new method. Comparisons between the new method and several well know ones, such as Power and QR methods, were discussed. The process consists of computing lower and upper bounds which are monotonically approximating the eigenvalue.