Abstract
Most algorithms for determining a Jordan basis for an endomorphism of a finite dimensional vector space suffer from the major drawback that they are computationally inefficient. In this paper, a universal and efficient algorithm for an endomorphism of a finite dimensional vector space over an arbitrary field is presented. Three computational examples are considered which show how our new algorithm works. A computational comparison to the Jordan basis algorithm in Kudo et al. (2010) completes the paper (algorithmic aspects).
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 callDisclaimer: 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.
