Orthogonal Polynomials and Polynomial Approximations
ثبت نشده
چکیده
3.1.1. Existence and uniqueness. Our immediate goal is to establish the existence of a sequence of orthogonal polynomials. Although we could, in principle, determine the coefficients a j of pn in the natural basis by using the orthogonality conditions (3.1.2), it is computationally advantageous to express pn in terms of lower-order orthogonal polynomials. Let us denote Pn := span { 1, x, x, · · · , x } . (3.1.3)
منابع مشابه
Optimal error estimates in Jacobi-weighted Sobolev spaces for polynomial approximations on the triangle
Spectral approximations on the triangle by orthogonal polynomials are studied in this paper. Optimal error estimates in weighted semi-norms for both the L2− and H1 0−orthogonal polynomial projections are established by using the generalized Koornwinder polynomials and the properties of the Sturm-Liouville operator on the triangle. These results are then applied to derive error estimates for the...
متن کاملIndexing Spatio-Temporal Trajectories with Orthogonal Polynomials
In this paper we consider d-dimensional spatiotemporal data (d 1) and ways to approximate and index it. We focus on indexing such data for similarity matching using orthogonal polynomial approximations. There are many ways to choose an approximation scheme for d-dimensional spatiotemporal trajectories. Some of them have been studied before. In this paper we extend the approach proposed in [6] ...
متن کاملThe best uniform polynomial approximation of two classes of rational functions
In this paper we obtain the explicit form of the best uniform polynomial approximations out of Pn of two classes of rational functions using properties of Chebyshev polynomials. In this way we present some new theorems and lemmas. Some examples will be given to support the results.
متن کاملFast least-squares polynomial approximation in moving time windows
Only a few time series methods are applicable to signal trend analysis under real-time conditions. The use of orthogonal polynomials for least-squares approximations on discrete data turned out to be very e cient for providing estimators in the time domain. A polynomial extrapolation considering signal trends in a certain time window is obtainable even for high sampling rates. The presented met...
متن کاملFourier Series of Orthogonal Polynomials
It follows from Bateman [4] page 213 after setting = 1 2 . It can also be found with slight modi cation in Bateman [5] page122. However we are not aware of any reference where explicit formulas for the Fourier coef cients for Gegenbauer, Jacobi, Laguerre and Hermite polynomials can be found. In this article we use known formulas for the connection coef cients relating an arbitrary orthogonal po...
متن کامل