Results 1  10
of
13
Computation of GaussKronrod Quadrature Rules with NonPositive Weights
 Math. Comp
, 1999
"... Recently Laurie presented a fast algorithm for the computation of (2n + 1)point GaussKronrod quadrature rules with real nodes and positive weights. We describe modifications of this algorithm that allow the computation of GaussKronrod quadrature rules with complex conjugate nodes and weights or w ..."
Abstract

Cited by 22 (5 self)
 Add to MetaCart
Recently Laurie presented a fast algorithm for the computation of (2n + 1)point GaussKronrod quadrature rules with real nodes and positive weights. We describe modifications of this algorithm that allow the computation of GaussKronrod quadrature rules with complex conjugate nodes and weights or with real nodes and positive and negative weights.
On Product Integration With GaussKronrod Nodes
, 1998
"... GaussKronrod product quadrature formulas for the numerical approximation of R 1 \Gamma1 k(x)f(x) dx are shown to converge for every Riemann integrable f , and to possess optimal stability. Similar results are proved for the product formulas based on the Kronrod nodes only. An application to the ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
GaussKronrod product quadrature formulas for the numerical approximation of R 1 \Gamma1 k(x)f(x) dx are shown to converge for every Riemann integrable f , and to possess optimal stability. Similar results are proved for the product formulas based on the Kronrod nodes only. An application to the uniform convergence of approximate solutions of integral equations is given.
Stieltjes polynomials and the error of GaussKronrod quadrature formulas
, 1998
"... . The GaussKronrod quadrature scheme, which is based on the zeros of Legendre polynomials and Stieltjes polynomials, is the standard method for automatic numerical integration in mathematical software libraries. For a long time, very little was known about the error of the GaussKronrod scheme. An ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
. The GaussKronrod quadrature scheme, which is based on the zeros of Legendre polynomials and Stieltjes polynomials, is the standard method for automatic numerical integration in mathematical software libraries. For a long time, very little was known about the error of the GaussKronrod scheme. An essential progress was made only recently, based on new bounds and asymptotic properties for the Stieltjes polynomials. The purpose of this paper is to give a survey on these results. In particular, the quality of the GaussKronrod formula for smooth and for nonsmooth functions is investigated and compared with other quadrature formulas. 1. Introduction The numerical evaluation of definite integrals is an important step in many applications of mathematics. From a practical point of view, great interest lies in automatic routines, whose only input are the integrand function, the domain of integration, and a tolerance for the error. In applications, such routines are expected to give quick and...
Stopping functionals for Gaussian quadrature formulas
 J. Comput. Appl. Math
"... ..."
(Show Context)
Marcinkiewicz inequalities based on Stieltjes zeros
"... The authors find necessary and sufficient conditions for GDT weighted Marcinkiewicz inequalities based at Stieltjes zeros. Key words: Marcinkiewicz inequalities, Stieltjes polynomials 1 Introduction If P is an arbitrary polynomial of degree m \Gamma 1 and u is a weight function in [\Gamma1; 1]; then ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
The authors find necessary and sufficient conditions for GDT weighted Marcinkiewicz inequalities based at Stieltjes zeros. Key words: Marcinkiewicz inequalities, Stieltjes polynomials 1 Introduction If P is an arbitrary polynomial of degree m \Gamma 1 and u is a weight function in [\Gamma1; 1]; then the following identity is wellknown: 1 Z \Gamma1 jP (x)u(x)j 2 dx = m X k=1 m (u 2 ; y k )jP (y k )j 2 ; where m (u 2 ; t) is the m\Gammath Christoffel function with respect to the weight function u 2 and y k ; k = 1; : : : ; m; are the zeros of the m\Gammath orthogonal polynomial associated with the weight function u 2 : Preprint submitted to Elsevier Preprint 18 November 1998 The above identity is generally false if we replace 2 by an arbitrary p 2 (0; +1): Thus, we can investigate on the validity of the inequality 1 Z \Gamma1 jP (x)u(x)j p dx C m X k=1 m (u p ; y k )jP (y k )j p ; (1) for any absolute constant C ? 0 and for given \Gamma1 y 1 ! \Delt...
Weighted convergence of Lagrange interpolation based on GaussKronrod nodes
 J. Comput. Anal. Appl
"... The GaussKronrod quadrature scheme, which is based on the zeros of Legendre polynomials and Stieltjes polynomials, is the standard method for automatic numerical integration in mathematical software libraries. For a long time, very little was known about the underlying Lagrange interpolation proces ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
The GaussKronrod quadrature scheme, which is based on the zeros of Legendre polynomials and Stieltjes polynomials, is the standard method for automatic numerical integration in mathematical software libraries. For a long time, very little was known about the underlying Lagrange interpolation processes. Recently, the authors proved new bounds and asymptotic properties for the Stieltjes polynomials, and subsequently applied these results to investigate the associated interpolation processes. The purpose of this paper is to give a survey on the quality of these interpolation processes, with additional results that extend and complete the existing ones. The principal new results in this paper are necessary and sufficient conditions for weighted convergence. In particular, we show that the Lagrange interpolation polynomials are equivalent to the polynomials of best approximation in certain weighted Besov spaces. Key Words and Phrases: Lagrange interpolation, GaussKronrod nodes, weighted ...
STIELTJESTYPE POLYNOMIALS ON THE UNIT CIRCLE
, 2008
"... Stieltjestype polynomials corresponding to measures supported on the unit circle T are introduced and their asymptotic properties away from T are studied for general classes of measures. As an application, we prove the convergence of an associated sequence of interpolating rational functions to th ..."
Abstract
 Add to MetaCart
Stieltjestype polynomials corresponding to measures supported on the unit circle T are introduced and their asymptotic properties away from T are studied for general classes of measures. As an application, we prove the convergence of an associated sequence of interpolating rational functions to the corresponding Carathéodory function. In turn, this is used to give an estimate of the rate of convergence of certain quadrature formulae that resemble the GaussKronrod rule, provided that the integrand is analytic in a neighborhood of T.
Article electronically published on October 27, 2008 STIELTJESTYPE POLYNOMIALS ON THE UNIT CIRCLE
"... Abstract. Stieltjestype polynomials corresponding to measures supported on the unit circle T are introduced and their asymptotic properties away from T are studied for general classes of measures. As an application, we prove the convergence of an associated sequence of interpolating rational functi ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. Stieltjestype polynomials corresponding to measures supported on the unit circle T are introduced and their asymptotic properties away from T are studied for general classes of measures. As an application, we prove the convergence of an associated sequence of interpolating rational functions to the corresponding Carathéodory function. In turn, this is used to give an estimate of the rate of convergence of certain quadrature formulae that resemble the GaussKronrod rule, provided that the integrand is analytic in a neighborhood of T. 1.
ASYMPTOTICS FOR STIELTJES POLYNOMIALS, PADÉTYPE APPROXIMANTS, AND GAUSSKRONROD QUADRATURE
"... Abstract. We study the asymptotic properties of Stieltjes polynomials outside the support of the measure as well as the asymptotic behaviour of their zeros. These properties are used to estimate the rate of convergence of sequences of rational functions, whose poles are partially fixed, which appro ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. We study the asymptotic properties of Stieltjes polynomials outside the support of the measure as well as the asymptotic behaviour of their zeros. These properties are used to estimate the rate of convergence of sequences of rational functions, whose poles are partially fixed, which approximate Markovtype functions. An estimate for the speed of convergence of GaussKronrod quadrature formula in the case of analytic functions is also given. 1.
STIELTJESTYPE POLYNOMIALS ON THE UNIT CIRCLE
"... Abstract. Stieltjestype polynomials corresponding to measures supported on the unit circle T are introduced and their asymptotic properties away from T are studied for general classes of measures. As an application, we prove the convergence of an associated sequence of interpolating rational functi ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. Stieltjestype polynomials corresponding to measures supported on the unit circle T are introduced and their asymptotic properties away from T are studied for general classes of measures. As an application, we prove the convergence of an associated sequence of interpolating rational functions to the corresponding Carathéodory function. In turn, this is used to give an estimate of the rate of convergence of certain quadrature formulae that resemble the GaussKronrod rule, provided that the integrand is analytic in a neighborhood of T. 1.