Home > Papers

 
 
An Efficient Algorithm for Computing Minimal Polynomials of Polynomial Matrices
Bo Yu * #,Yanyan Xu
Department of Applied Mathematics, Dalian University of Technology
*Correspondence author
#Submitted by
Subject:
Funding: none
Opened online:16 February 2005
Accepted by: none
Citation: Bo Yu,Yanyan Xu.An Efficient Algorithm for Computing Minimal Polynomials of Polynomial Matrices[OL]. [16 February 2005] http://en.paper.edu.cn/en_releasepaper/content/1554
 
 
In this paper, an efficient algorithm for computing the minimal polynomial of a polynomial matrix is presented. It determines the coefficient polynomials term by term from lower to higher degree. By using a random vector and randomly shifting, it requires no condition on the input matrix. Comparison with other algorithms in both theoretical complexity analysis and computational tests are given to show its effectiveness.
Keywords:Minimal polynomial, polynomial matrix, algorithm
 
 
 

For this paper

  • PDF (0B)
  • ● Revision 0   
  • ● Print this paper
  • ● Recommend this paper to a friend
  • ● Add to my favorite list

    Saved Papers

    Please enter a name for this paper to be shown in your personalized Saved Papers list

Tags

Add yours

Related Papers

Statistics

PDF Downloaded 1633
Bookmarked 0
Recommend 5
Comments Array
Submit your papers