### ALGORITMA POLINOMIAL MINIMUM UNTUK MEMBENTUK MATRIKS DIAGONAL DARI MATRIKS PERSEGI

Himmatul Mursyidah(1*),

(*) Corresponding Author

#### Abstract

In mathematics, matrices have many uses, they are finding solutions of a linear equation system, looking for specific solutions of differential equations, determining state classification on Markov chains, and so on. There is a special matrix in matrix theory, that is a diagonal matrix. The diagonal matrix is a matrix whose all non-diagonal entries are primarily zero so that the product of the diagonal matrix can be computed by considering only the components along the main diagonal. A square matrix can sometimes be formed into a diagonal matrix. If a non-diagonal square matrix A can be conjugated with a diagonal matrix, then there is an invertible matrix P so PAP-1=D, where D is a diagonal matrix and P is said to diagonalize A. To find a square matrix diagonalizable or not, many researchers usually use eigenvalues and eigenvectors evaluation. In this study, we discuss that the other way to form a diagonal matrix by using Minimum Polynomial Algorithm.

#### Keywords

diagonal matrix; matrices; minimum polynomial

#### Full Text:

PDF (Bahasa Indonesia)

#### References

Anton, H., & Rorres, C. (2005). Elementary Linear Algebra with Applications, Ninth Edition: Application Version. New York: John Wiley & Sons, Inc.

Eves, H. (1968). Elementary Matrix Theory. Boston: Allyn and Bacon, Inc.

Fuhrmann, P. A. (2012). A Polynomial Approach to Linear Algebra, Second Edition. New York: Springer.

Koryanov, A. G. (2015). The Computer Program "Inverse Matrices". International Journal of Computer Discovered Mathematics (ICDM), Vol.0 No.0, Hal.49-53. Online. http://www.journal-1.eu/2015/01/Koryanov-Inverse-Matrices-pp.49-53.pdf

Langi, Y. A. (2011). Penentuan Klasifikasi State pada Rantai Markov dengan Menggunakan Nilai Eigen dari Matriks Peluang Transisi. Jurnal Ilmiah Sains, Vol.11 No.1, Hal.124-130.

Lipschutz, S., & Lipson, M. (2009). Schaum's Outlines, Linear Algebra, Fourth Edition. New York: Mc Graw Hill.