Please use this identifier to cite or link to this item: http://repository.ipb.ac.id/handle/123456789/69571
Full metadata record
DC FieldValueLanguage
dc.contributor.advisorArdana, N K Kutha
dc.contributor.advisorHanum, Farida
dc.contributor.authorRantung, Yogie Budhi
dc.date.accessioned2014-07-15T01:11:32Z
dc.date.available2014-07-15T01:11:32Z
dc.date.issued2014
dc.identifier.urihttp://repository.ipb.ac.id/handle/123456789/69571
dc.description.abstractPascal matrices are matrices that their elements contain binomial coefficients. Pascal matrices can be built into three different types: symmetric Pascal matrix lower triangular Pascal matrix and upper triangular Pascal matrix This study aims to determine the characteristics of the Pascal matrices. The proof of characteristics shows that multiplication of a lower triangular Pascal matrix with an upper triangular Pascal matrix always yields symmetric Pascal matrix through three methods: matrix multiplication, Gaussian elimination, and equality of functions. In this study, matrix multiplication is the most effective method of proof. The proof of also shows that each of and has the same determinant value, that is one . Another characteristics of the Pascal matrix is that transpose of a lower triangular Pascal matrix is an upper triangular Pascal matrix and vice versaen
dc.language.isoid
dc.titleMatriks Pascal dan Sifat-Sifatnyaen
dc.subject.keywordupper triangular Pascal matrix.en
dc.subject.keywordlower triangular Pascal matrixen
dc.subject.keywordPascal matrixen
Appears in Collections:UT - Mathematics

Files in This Item:
File Description SizeFormat 
G14ybr.pdf
  Restricted Access
full text9.23 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.