A Symbolic algorithm for formal power series
1999
0 görüntülenme
0 i̇ndirme
Danışman: Prof.dr. Şeref Mirasyedioğlu
Özet (EN)
IV A SYMBOLIC ALGORITHM FOR FORMAL POWER SERIES (Master Thesis) Göksal BİLGİCİ GAZİ UNIVERSITY INSTITUTE OF SCIENCE AND TECHNOLOGY December- 1999 ABSTRACT In this thesis, we investigated a symbolic algorithm to compute formal T. power series of the form Xa^x_xo)k using KOEPF's method. Then the k=0 algorithm has been implemented in MAPLE. Science Code: 500.10.78 Key Words : Power series. Chebyshev polinominals. Maple Page Number : 46 Adviser : Prof.Dr. Şeref MİRAS YEDİOGLU
Yazar
Dr. Göksal Bilgici
Bu Yayına Nasıl Atıf Yapılır
Göksal Bilgici (Master Thesis). A Symbolic algorithm for formal power series, 1999, Gazi University.
Anahtar Kelimeler
Lisans
Tüm Hakları Saklıdır
Bu eser belirtilen lisans koşulları altında paylaşılmaktadır.
Gazi University tezlerinden daha fazlası
- Occupational accident analysis and modelling in oil and gas drilling sector Turkey(2021)
- Experimental development of the interfacial bond-slip model between textile reinforced mortar strips and masonry walls(2025)
- XVI. yüzyıl Anadolu'sunda Oğuzların Karkın Boyu(2004)
- Deveplopment of semiconductor humidity sensors(2021)
- The effect of computer-assisted and direct strategy teaching on reading comprehension(2021)
- Sharing of real life geometry samples via a social learning environment: A case study(2021)