Dissertation > Excellent graduate degree dissertation topics show

An Efficient Algorithm for Computing Minimal Polynomials of Polynomial Matrices

Author: XuYanYan
Tutor: YuBo
School: Dalian University of Technology
Course: Computational Mathematics
Keywords: polynomial matrix the minimal polynomial the characteristic polynomial
CLC: O241.6
Type: Master's thesis
Year: 2005
Downloads: 351
Quote: 0
Read: Download Dissertation

Abstract


The minimal polynomial of a square matrix is a basic concept in linear algebra and its computation has important applications in automatic control, solving sparse linear equations, compution of the determinant and other fields. Firstly, this paper describes the history and state of the research to the minimal polynomial and the characteristic polynomial and then gives the main methods and its computational complexities for computing the characteristic polynomial and of a constant matrix, the characteristic polynomial of a polynomial matrix and the minimal polynomial of a polynomial. Finally, we present an efficient algorithm for computing the minimal polynomial of a polynomial matrix. It determines the coefficient polynomials term by term from lower to higher degree. By using a random vector and randomly shifting, this algorithm requires no condition on input matrix. Comparison with other algorithms in both theoretical complexity analysis and computational tests are given to show its effectiveness. Considering that our algorithm also released the restrictions added on the input matrix in CHTB method and it is of lower computational complexity comparing with CHACM method, our algorithm is one of the good candidates for the computation of the minimal polynomial of a polynomial matrix.

Related Dissertations

  1. Families of Linear Recurring m-fold Multisequences,TN918.1
  2. Study on Solutions for Several Classes of Matrix Difference Equation,O241.84
  3. Multiple Clock-Controlled Generator and Analysis,TN918.1
  4. Research on the Lin-Bose Problem and Property of Gr(?)bner Basis,O151.21
  5. φ3 Invariant of Linear Arrangements,O185
  6. Some Graphic Characters of the Laplacian Spectrum in Tricyclic Graphs,O157.5
  7. The Characteristic Polynomial and the Number of the Area of Some Kinds of Hyperplane Arrangement,O177.3
  8. Linear complexity of periodic sequences Fast Algorithm,TN918
  9. Recurrent Sequences and Combinatorial Identities,O157.1
  10. Periodic sequence of minimal polynomial and linear complexity,TN918
  11. F_q ~ m of linear recursive sequence F_q the minimal polynomial and Related Issues,O157.4
  12. Symmetric function and application of a combination of nature,O157
  13. The matrix polynomial minimal polynomial algorithm,O151.21
  14. Controller Design of Linear Systems by Bicoprime Factorization Description,TP13
  15. Feedback Shift Register Sequence of Computer Research,TN918.2
  16. Algebraic Number Reconstruction and Application,O241
  17. Polynomial Matrix Factorization and Its Applications,O151.21
  18. The Dynamic Compensator Design for Linear Systems Based on Polynomial Matrix Description,TP13
  19. The the sigma F_4 - linear feedback shift register,TP333
  20. Structural Controllability of the System over F(z) in Frequency Domain and Its Computer Aided Analysis,TB114.2

CLC: > Mathematical sciences and chemical > Mathematics > Computational Mathematics > Numerical Analysis > Linear algebra method of calculating
© 2012 www.DissertationTopic.Net  Mobile