Orthogonal rational functions and quadrature on the real half line
نویسندگان
چکیده
In this paper we generalize the notion of orthogonal Laurent polynomials to orthogonal rational functions. Orthogonality is considered with respect to a measure on the positive real line. From this, Gauss-type quadrature formulas are derived and multipoint Padé approximants for the Stieltjes transform of the measure. Convergence of both the quadrature formula and the multipoint Padé approximants is discussed.
منابع مشابه
Quadratures associated with pseudo-orthogonal rational functions on the real half line with poles in [-∞, 0]
We consider a positive measure on [0,∞) and a sequence of nested spaces L0 ⊂ L1 ⊂ L2 · · · of rational functions with prescribed poles in [−∞, 0]. Let {φk}k=0, with φ0 ∈ L0 and φk ∈ Lk \ Lk−1, k = 1, 2, . . . be the associated sequence of orthogonal rational functions. The zeros of φn can be used as the nodes of a rational Gauss quadrature formula that is exact for all functions in Ln · Ln−1, a...
متن کاملOn computing rational Gauss-Chebyshev quadrature formulas
We provide an algorithm to compute the nodes and weights for Gauss-Chebyshev quadrature formulas integrating exactly in spaces of rational functions with arbitrary real poles outside [−1, 1]. Contrary to existing rational quadrature formulas, the computational effort is very low, even for extremely high degrees, and under certain conditions on the poles it can be shown that the complexity is of...
متن کاملRational Gauss-Chebyshev quadrature formulas for complex poles outside [-1, 1]
In this paper we provide an extension of the Chebyshev orthogonal rational functions with arbitrary real poles outside [−1, 1] to arbitrary complex poles outside [−1, 1]. The zeros of these orthogonal rational functions are not necessarily real anymore. By using the related para-orthogonal functions, however, we obtain an expression for the nodes and weights for rational Gauss-Chebyshev quadrat...
متن کاملRational Gauss Quadrature
The existence of (standard) Gauss quadrature rules with respect to a nonnegative measure dμ with support on the real axis easily can be shown with the aid of orthogonal polynomials with respect to this measure. Efficient algorithms for computing the nodes and weights of an n-point Gauss rule use the n × n symmetric tridiagonal matrix determined by the recursion coefficients for the first n orth...
متن کاملMatrix methods for quadrature formulas on the unit circle. A survey
In this paper we give a survey of some results concerning the computation of quadrature formulas on the unit circle. Like nodes and weights of Gauss quadrature formulas (for the estimation of integrals with respect to measures on the real line) can be computed from the eigenvalue decomposition of the Jacobi matrix, Szegő quadrature formulas (for the approximation of integrals with respect to me...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Complexity
دوره 19 شماره
صفحات -
تاریخ انتشار 2003