On the Computation of the Minimum Polynomial and Applications
Asian Research Journal of Mathematics · pp. 301–319 · Published 21 Oct 2022
10.9734/arjom/2022/v18i11603Abstract
Aims/Objectives: In this review article we study the computation of the minimum polynomial of a matrix A and how we can use it for the computation of the matrix An. We also describe the form of the elements of the matrix A-n and we will see that it is closely related with the computation of the Drazin generalized inverse of A. Next we study the computation of the exponential matrix and nally we give a simple proof of the Leverrier - Faddeev algorithm for the computation of the characteristic polynomial.
Cited by 1
Nikolaos Halidias · Asian Journal of Research in Computer Science · 2024
Article metrics
Real usage data collected on this platform.
22
Page views
0
PDF downloads
2
Outbound clicks
1
Citations
Views over time
Views by country
Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".
Traffic sources
Referring site, by host.
Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.