Hasil Pencarian  ::  Simpan CSV :: Kembali

Hasil Pencarian

Ditemukan 78 dokumen yang sesuai dengan query
cover
Tokyo: Maruzen Comp. , 1960
510 FIN
Buku Teks  Universitas Indonesia Library
cover
Keedy, Mervin L.
Reading, Mass.: Addison-Wesley, 1966
512.7 KEE n
Buku Teks SO  Universitas Indonesia Library
cover
Lie Trishadi Rusli
"Penjumlahan n bilangan floating point biasanya dilakukan dengan menggunakan metode rekursif biasa (metode original). Tugas akhir ini membahas beberapa metode alternatif untuk menjumlah n bilangan floating point, yaitu metode increasing, decreasing, psum, pairwise, insertion, dan plus-minus. Ketelitian dari metode-metode ini dibandingkan dengan analisis batas atas kesalahan dan percobaan numerik. Tidak ada satu metode yang secara seragam lebih akurat daripada metode lainnya. Tetapi untuk kasus khusus, diberikan petunjuk untuk memilih metode penjumlahan tertentu."
Depok: Fakultas Matematika dan Ilmu Pengetahuan Alam Universitas Indonesia, 1995
S-pdf
UI - Skripsi Membership  Universitas Indonesia Library
cover
Timotius
"Metode penjumlahan rekursif biasa (Original) umumnya dipakai untuk menjumlahkan n bilangan floating-point. Metode ini memiliki variasi: Increasing dan Decreasing. Pada tugas akhir ini akan dibahas cara memperbaiki ketelitian penjumlahan rekursif floating-point dengan metode compensated. Untuk membandingkan ketelitian metode-metode tersebut digunakan analisa kesalahan pembulatan dan percobaan-percobaan numerik. Metode Compensated sangat efektif untuk memperbaiki ketelitian penjumlahan rekursif floating-point, dengan batas atas kesalahan
|En| < (2u + 0(nu2)) Σ|Xi|
"
Depok: Fakultas Matematika dan Ilmu Pengetahuan Alam Universitas Indonesia, 1995
S-pdf
UI - Skripsi Membership  Universitas Indonesia Library
cover
Broyles, Bonita E.
New York: Delmar, 2009
615.14 BRO d
Buku Teks SO  Universitas Indonesia Library
cover
Garden City, N.Y.: Doubleday, 1962
511.201 CUT t
Buku Teks SO  Universitas Indonesia Library
cover
Kee, Joyce LeFever
St. Louis, Missouri: Elsevier, 2013
615.14 KEE c
Buku Teks SO  Universitas Indonesia Library
cover
Vladutiu, Mircea
"The subject of this book is the analysis and design of digital devices that implement computer arithmetic. The book's presentation of high-level detail, descriptions, formalisms and design principles means that it can support many research activities in this field, with an emphasis on bridging the gap between algorithm optimization and hardware implementation. The author provides a unified view linking the domains of digital design and arithmetic algorithms, based on original formalisms and hardware description languages.
A feature of the book is the large number of examples and the implementation details provided."
Berlin: [, Springer-Verlag ], 2012
e20408683
eBooks  Universitas Indonesia Library
cover
Bordelles, Olivier
"Classical methods in analytic theory such as Mertens’ theorem and Chebyshev’s inequalities and the celebrated Prime number theorem give estimates for the distribution of prime numbers. Later on, multiplicative structure of integers leads to multiplicative arithmetical functions for which there are many important examples in number theory. Their theory involves the Dirichlet convolution product which arises with the inclusion of several summation techniques and a survey of classical results such as Hall and Tenenbaum’s theorem and the Möbius Inversion Formula. Another topic is the counting integer points close to smooth curves and its relation to the distribution of squarefree numbers, which is rarely covered in existing texts. Final chapters focus on exponential sums and algebraic number fields. A number of exercises at varying levels are also included."
London : [Springer-Verlag, ], 2012
e20419268
eBooks  Universitas Indonesia Library
cover
Arash Eghdamian
"This research addresses the problem of finding a minimum Hamming Weight by proposing a left-to-right recoding of integers (from the most significant bit to the less significant one). This representation is the enhanced and modified version of a well-known recoding method called Generalized Non-Adjacent Form (G-NAF). Scanning the digits from the left-to-right is called Modified Generalized Signed Digit Non-Adjacent Form (MGSDNAF), which unlike the G-NAF, presents the ‘nice property’ to be obtained. A ‘nice property’ is one that is based on intuition and is particularly desirable to be obtained in a given context. This processing direction is of great importance because a table of pre-computed values may be used to speed up the scalar multiplication only for that direction. A subsequent advantage is that recoding the exponent in advance is not required. This results in better performances in both running time and memory space. This representation method can reduce the Hamming Weight of integers from about 21.6% for radix 3 to 15.1% for radix 9. These numbers for G-NAF recoding are 16.7% and 8.9% respectively. Comparing these numbers together shows that efficiency of the proposed method in reducing the Hamming Weight is more than the efficiency of G-NAF, which is from 30% (for radix 3) to more than 65% (for radix 9) more efficient in reducing the Hamming Weight. Finally, two radix 3 single scalar multiplication methods for Elliptic Curve Cryptography (ECC), which are based on G-NAF and Left-to-Right MGSDNAF, are compared in order to examine the application of the proposed method in cryptography. The results show that the proposed method can reduce the number of underlying arithmetic operations in single scalar multiplication by 14.1% while G-NAF can only reduce this number by 11.5%."
Depok: Faculty of Engineering, Universitas Indonesia, 2017
UI-IJTECH 8:3 (2017)
Artikel Jurnal  Universitas Indonesia Library
<<   1 2 3 4 5 6 7 8   >>