This Author published in this journals
All Journal MATEMATIKA
Robertus Heri Soelistyo
Unknown Affiliation

Published : 4 Documents
Articles

Found 4 Documents
Search

ANALISIS KEKONTINUAN, KETERDIFERENSIALAN DAN KETERINTEGRALAN FUNGSI BLANCMANGE Soelistyo, Robertus Heri; Sumanto, YD
MATEMATIKA Vol 14, No 2 (2011): JURNAL MATEMATIKA
Publisher : MATEMATIKA

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (71.575 KB)

Abstract

. This article presents differentiable characteristics of the Blancmange function on ℝ. The function has singularities of each point on ℝ. The first, it will be proven  that function is continuous at each point on ℝ, and then by constructing of an infinite series of the saw tooth function, will be proven that the Blancmange function is differentiable nowhere at each point on ℝ. At the end of this article, also discussed integrable analysis of Blancmange function.  
PENENTUAN SUATU PENGONTROL DENGAN INDEKS PERFORMANSI BERUPA NORMA CAMPURAN DAN Soelistyo, Robertus Heri
MATEMATIKA Vol 10, No 3 (2007): JURNAL MATEMATIKA
Publisher : MATEMATIKA

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (71.575 KB)

Abstract

. This paper considers the mix-norm / standard problem. Specifically an LQG control design problem involving a constraint on  disturbance attenuation is addressed. It is shown that the / dynamic compensator gains are completely characterized via coupled Riccati/Lyapunov equation. The principle result involves sufficient condition for characterizing full order guaranteeing closed loop stability, constrained  disturbance attenuation and an optimized  performance bound.
RESULTAN DARI POLINOMIAL DENGAN n - INDETERMINATE Harjito, Harjito; Soelistyo, Robertus Heri; DR, Karuniawati
MATEMATIKA Vol 10, No 3 (2007): JURNAL MATEMATIKA
Publisher : MATEMATIKA

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (71.575 KB)

Abstract

Let  be polynomials where K is a field. To determine whether two polynomials have a common factor without doing any divisions in K[x] can be seen from its resultant, that is determinant from Sylvester matrix. Two polynomials will have a common factor if and only if its resultant is zero. If its resultant isn’t zero so two polynomials have not a common factor. Wants to be look for resultant  where  in  where C is the set of all complex numbers. To make the easy resultant computations is used by maple 8.                
PELABELAN TOTAL TITIK AJAIB PADA COMPLETE GRAPH DENGAN n GANJIL Irawati, Novi; Soelistyo, Robertus Heri
MATEMATIKA Vol 13, No 3 (2010): JURNAL MATEMATIKA
Publisher : MATEMATIKA

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (71.575 KB)

Abstract

Let G be a graph consists of edges and vertex. A vertex-magic total labeling of a graph  is a bijection map of union edges and vertex to the integers such that there exists a positive integer  satisfying , for every elements of vertex. Then k  is called a magic constant and G is called vertex-magic total graph. In this article, we consider a vertex-magic labeling of complete graph  for odd with use an algorithm which is composed of a modified construction magic square algorithm.