Abstract
LetM be a matrix with polynomial entries. This paper deals with calculating eigenvalues, eigenvectors and inverse ofM approximately in the form of truncated power series. The calculation of approximate eigenvalues is based on algorithms solving algebraic equation symbolically in terms of power series. Then, we give algorithms for calculating eigenvectors and inverse in terms of power series approximately. We show an example for each algorithm. Finally, we explain acceleration of convergence of power series and estimate of errors due to truncation of power series.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Japan Journal of Industrial and Applied Mathematics
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.