ALGORITMA POLINOMIAL MINIMUM UNTUK MEMBENTUK MATRIKS DIAGONAL DARI MATRIKS PERSEGI

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...

Full description

Bibliographic Details
Main Author: Himmatul Mursyidah
Format: Article
Language:Indonesian
Published: Universitas Muhammadiyah Metro 2017-12-01
Series:Aksioma: Jurnal Program Studi Pendidikan Matematika
Subjects:
Online Access:http://ojs.fkip.ummetro.ac.id/index.php/matematika/article/view/978
_version_ 1818508164915527680
author Himmatul Mursyidah
author_facet Himmatul Mursyidah
author_sort Himmatul Mursyidah
collection DOAJ
description 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.
first_indexed 2024-12-10T22:27:57Z
format Article
id doaj.art-352e3c4a31314da28eb3b5bbad59e343
institution Directory Open Access Journal
issn 2089-8703
2442-5419
language Indonesian
last_indexed 2024-12-10T22:27:57Z
publishDate 2017-12-01
publisher Universitas Muhammadiyah Metro
record_format Article
series Aksioma: Jurnal Program Studi Pendidikan Matematika
spelling doaj.art-352e3c4a31314da28eb3b5bbad59e3432022-12-22T01:31:07ZindUniversitas Muhammadiyah MetroAksioma: Jurnal Program Studi Pendidikan Matematika2089-87032442-54192017-12-016228229310.24127/ajpm.v6i2.978808ALGORITMA POLINOMIAL MINIMUM UNTUK MEMBENTUK MATRIKS DIAGONAL DARI MATRIKS PERSEGIHimmatul Mursyidah0Universitas Muhammadiyah SurabayaIn 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.http://ojs.fkip.ummetro.ac.id/index.php/matematika/article/view/978diagonal matrixmatricesminimum polynomial
spellingShingle Himmatul Mursyidah
ALGORITMA POLINOMIAL MINIMUM UNTUK MEMBENTUK MATRIKS DIAGONAL DARI MATRIKS PERSEGI
Aksioma: Jurnal Program Studi Pendidikan Matematika
diagonal matrix
matrices
minimum polynomial
title ALGORITMA POLINOMIAL MINIMUM UNTUK MEMBENTUK MATRIKS DIAGONAL DARI MATRIKS PERSEGI
title_full ALGORITMA POLINOMIAL MINIMUM UNTUK MEMBENTUK MATRIKS DIAGONAL DARI MATRIKS PERSEGI
title_fullStr ALGORITMA POLINOMIAL MINIMUM UNTUK MEMBENTUK MATRIKS DIAGONAL DARI MATRIKS PERSEGI
title_full_unstemmed ALGORITMA POLINOMIAL MINIMUM UNTUK MEMBENTUK MATRIKS DIAGONAL DARI MATRIKS PERSEGI
title_short ALGORITMA POLINOMIAL MINIMUM UNTUK MEMBENTUK MATRIKS DIAGONAL DARI MATRIKS PERSEGI
title_sort algoritma polinomial minimum untuk membentuk matriks diagonal dari matriks persegi
topic diagonal matrix
matrices
minimum polynomial
url http://ojs.fkip.ummetro.ac.id/index.php/matematika/article/view/978
work_keys_str_mv AT himmatulmursyidah algoritmapolinomialminimumuntukmembentukmatriksdiagonaldarimatrikspersegi