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...
Main Author: | Himmatul Mursyidah |
---|---|
Format: | Article |
Language: | Indonesian |
Published: |
Universitas Muhammadiyah Metro
2017-12-01
|
Series: | Jurnal Aksioma |
Subjects: | |
Online Access: | http://ojs.fkip.ummetro.ac.id/index.php/matematika/article/view/978 |
Similar Items
-
A note on the rank inequality for diagonally magic matrices
by: Duanmei Zhou, et al.
Published: (2016-02-01) -
Enkripsi dan Dekripsi Teks menggunakan Algoritma Hill Cipher dengan Kunci Matriks Persegi Panjang
by: Akik Hidayat, et al.
Published: (2013-04-01) -
Implementasi Algoritma Kunci Matriks Untuk Keamanan Data Akademik
by: Joko Soebagyo, et al.
Published: (2020-05-01) -
Orthogonal diagonalization for complex skew-persymmetric anti-tridiagonal Hankel matrices
by: Gutiérrez-Gutiérrez Jesús, et al.
Published: (2016-01-01) -
Common diagonal solutions to the Lyapunov inequalities for interval systems
by: Bengi Yıldız, et al.
Published: (2016-10-01)