Summary
Optoelectronics and Communications Conference/International Conference on Integrated Optics and Optical Fiber Communication
2007
Session Number:13A2
Session:
Number:13A2-3
Fast Generation of Orthogonal Periodic Polynomials and Its Application to Smooth Approximation of the Internet Traffic
Hiroshi Hasegawa, Naoya Matsusue, Ken-ichi Sato,
pp.540-541
Publication Date:2007/7/9
Online ISSN:2188-5079
DOI:10.34385/proc.49.13A2-3
PDF download (293.1KB)
Summary:
In this paper we propose a method to generate a sequence of periodic orthogonal polynomials over [0,1], where polynomial weighting function is defined over the interval. Low computational load and numerical stability are realized by using the Lanczos’s three-term recurrence relation to generate the sequence. Further improvement is provided by omitting numerical integration, and therefore, the proposed method requires only a small number of arithmetic operations. Finally the generated sequence is employed for least-squares smooth approximation of given traffic data having diel periodicity.