On computation of real eigenvalues of matrices via the Adomian decomposition | ||||
| Journal of the Egyptian Mathematical Society | ||||
| Volume 22, Issue 1, 2014, Page 6-10 PDF (385.47 K) | ||||
| Document Type: Original Article | ||||
| DOI: 10.1016/j.joems.2013.06.004 | ||||
 View on SCiNiTO | ||||
| Authors | ||||
| Hooman Fatoorehchi1; Hossein Abolghasemi Abolghasemi2 | ||||
| 1Center for Separation Processes Modeling and Nano-Computations, School of Chemical Engineering, College of Engineering, University of Tehran, 11365-4563 Tehran, Iran | ||||
| 2Oil and Gas Center of Excellence, University of Tehran, Tehran, Iran | ||||
| Abstract | ||||
| The problem of matrix eigenvalues is encountered in various fields of engineering endeavor. In this paper, a new approach based on the Adomian decomposition method and the Faddeev-Leverrier’s algorithm is presented for finding real eigenvalues of any desired real matrices. The method features accuracy and simplicity. In contrast to many previous techniques which merely afford one specific eigenvalue of a matrix, the method has the potential to provide all real eigenvalues. Also, the method does not require any initial guesses in its starting point unlike most of iterative techniques. For the sake of illustration, several numerical examples are included. | ||||
| Keywords | ||||
| Eigenvalue; Adomian decomposition; Matrix computation; Characteristic polynomial; Adomian polynomials | ||||
|
Statistics Article View: 40 PDF Download: 149 |
||||
