Article Per Year (5 Year)
p-Index From 2021 - 2026
0.751
P-Index
This Author published in this journals
All Journal Bulletin of Electrical Engineering and Informatics Journal of Mathematics UNP Mathematical Journal of Modelling and Forecasting
Meira Parma Dewi
Unknown Affiliation
Computer Science & IT Decision Sciences, Operations Research & Management Economics, Econometrics & Finance Electrical & Electronics Engineering Mathematics

Published : 6 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 2 Documents
Search
Journal : Journal of Mathematics UNP

 1 
Penyelesaian Sistem Persamaan Linear (SPL) Dengan Dekomposisi QR Shelvia Mandasari; Muhammad Subhan; Meira Parma Dewi
Journal of Mathematics UNP Vol 2, No 1 (2014): Journal Of Mathematics UNP
Publisher : UNIVERSITAS NEGERI PADANG

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (550.813 KB) | DOI: 10.24036/unpjomath.v2i1.1960

Abstract

Abstract – QR decomposition is a numerical method to solves a System Linear Equations with n equations and n variables. This decomposition obtained by Gram Schimdt process and inner product space. From that method make an algorithm, that has been made  a computer  program to solve that System Linear Equations with n equations and n variables. The solution that obtained by this decomposition more accurate with small errors because this method only use two process so this decomposition more effective than that other numerical method. Keywords -- Inner Product Space, Gram Schmidt Process, QR Decomposition
Penerapan Pewarnaan Titik pada Graf dalam Penyusunan Lokasi Duduk Menggunakan Algoritma Greedy Berbantuan Microsoft Visual Basic 6.0 Halimah Turosdiah; Armiati Armiati; Meira Parma Dewi
Journal of Mathematics UNP Vol 2, No 1 (2014): Journal Of Mathematics UNP
Publisher : UNIVERSITAS NEGERI PADANG

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (255.663 KB) | DOI: 10.24036/unpjomath.v2i1.1956

Abstract

Abstract – Graph colouring has been applied in various problems. Graph colouring in particular vertex colouring is also applicable for arranging seat location. The arranging of seat location in many events is very concerned. Because it can avoiod rottenness that possibly happen. Vertex colouring for arranging seat location is started with representating participant’s seat as vertex and participant’s seat that adjacent with right or left or front or behind it is connected by edge, so that participant’s seat which adjacent is not placed by participant’s from the same school. Greedy algorithm will be used in this arranging of seat location that applied later in Microsoft Visual Basic 6.0 software. From the testing of  program obtained that the program of arranging seat location has made exact solution where participant’s from the same school is not adjacent sit. Keywords – Vertex colouring, Arranging seat location, Greedy algorithm
Co-Authors Aniati Murni Arymurthy Anjelia, Davina Bokari, Adib Yusron M. Halim MUHAMMAD SUBHAN Nurtami Soedarsono Oktariza, Kenanga Dylla Purwoko, Agus Setiawan, Suryana Shelvia Mandasari