Gaussian interval quadrature rule for exponential weights

Gaussian interval quadrature rule for exponential weights Aleksandar S. Cvetković, a, Gradimir V. Milovanović b a Department of Mathematics, Faculty of Mechanical Engineering, University of Belgrade, Kraljice Marije 6, 20 Beograd, Serbia b Mathematical Institute of the Serbian Academy of Sciences and Arts, Kneza Mihaila 36, 00 Beograd, Serbia Abstract Interval quadrature formulae of Gaussian type on R and R + for exponential weight functions of the form w(x) = exp( Q(x)), where Q is a continuous function on its domain and such that all algebraic polynomials are integrable with respect to w, are considered. For a given set of nonoverlapping intervals and an arbitrary n, the uniqueness of the n-point interval Gaussian rule is proved. The results can be applied also to corresponding quadratures over (, ). An algorithm for the numerical construction of interval quadratures is presented. Finally, in order to illustrate the presented method, two numerical examples are done. Key words: exponential weight; numerical integration; interval quadrature rule; weight coefficients; nodes. AMS classification: 4A55, 65D30, 65D32. Introduction In this paper we consider Gaussian interval quadrature rule for the weight functions of the form w (x) = exp( Q (x)), x R, and w 2 (x) = exp( Q 2 (x)), x R +, The authors were supported in part by the Serbian Ministry of Education and Science (Project: Approximation of integral and differential operators and applications, grant number #7405). Corresponding author. E-mail addresses: aleksandarcvetkovic@pmf.ni.ac.rs (A.S. Cvetković), gvm@mi.sanu.ac.rs (G.V. Milovanović) Preprint submitted to Elsevier Science 2 March 202

where Q and Q 2 are supposed to be continuous functions on their domains, and given such that all algebraic polynomials are integrable with respect to w and w 2. In this paper, when we want to refer to any of these two weights, we refer to the general weight w defined on I (R or R + ). The index is added only when results are given specifically for a given weight. The set of all algebraic polynomials is denoted by P and its subset of all algebraic polynomials of degree at most n by P n, where n is a natural number. We also adopt the following definitions H n = { h = (h,...,h n ) R n hk 0, k =,..., n }, Hn h = { h = (h,...,h n ) H n n h = h k h }, n N, h 0. k= Given h = (h,..., h n ) H n, we define a Gaussian interval quadrature rule for the weight w to be I p(x)w(x)dx = n k= σ k p(x)w(x)dx, p P 2n, (.) w( ) where, k =,..., n, are nonoverlapping intervals, of the length 2h k, k =,...,n, respectively, whose union is the proper subset of R + in the case of the weight w 2. Quantities w( ), k =,...,n, are defined as w( ) = w(x)dx, k =,..., n. Midpoints of the intervals, k =,...,n, are denoted by x k, k =,...,n, and are called the nodes of the quadrature rule (.), so that we have = (x k h k, x k + h k ), k =,..., n. Accordingly the quantities σ k, k =,...,n, are called the weights. In order to simplify our notation we define I k = (x k h k, x k + h k ), I 2 k = (x k h k, x k ), k =,..., n, and O k = (x k + h k, x k+ h k+ ), k =,...,n, O n = (x n + h n, + ), and the interval O 0 = (, x h ), in case we are discussing the weight w and O 2 0 = (0, x h ) if the weight w 2 is concerned. We use the notation O 0 for both intervals O 0 and O 2 0 and which interval is really referred would be clear 2

from the context. Finally, the union of O k, k =,..., n, we denote by O u, i.e., O u = n k=0 O k. Given h = (h,...,h n ) H n, we define the set of admissible nodes of the quadrature rule (.), to be the set X n (h) = { x = (x,...,x n ) R n x k + h k < x k+ h k+ }, X 2 n (h) = { x = (x,...,x n ) R n 0 < x h, x k + h k < x k+ h k+ }, for the weights w and w 2, respectively. Note that the closure of Xn, for example, is given by X n (h) = { x = (x,...,x n ) x k + h k x k+ h k+ }. When dependence on the weight is not important, we denote by X n (h) the both sets. Note that, according to continuity, we have lim p(x)w(x)dx = p(x k ). h k 0 + w( ) Accordingly, the Gaussian interval quadrature rule, for h = 0, reduces to the standard Gaussian quadrature rule. We are now able to formulate our main result. Theorem. Given h H n there exists the unique Gaussian interval quadrature rule I p(x)w(x)dx = n k= σ k p(x)w(x)dx, p P 2n, w( ) where intervals, k =,...,n, are nonoverlapping and has the length 2h k. In the case of the weight w supported on I = R +, in addition, we have x h > 0. 2 Preliminary results We need the following interpolatory lemma. 3

Lemma 2. (i) Given h H n, the set of nodes x X n (h), and the sequence of numbers j k {, 2}, k =,..., n, the interpolation problem w(ik m) I m k p(x)w(x)dx = f k,m, m =, j k ; k =,...,n, has the unique solution p P N, where N + = n k= j k. (ii) Given h H n, the set of nodes x X n (h) and the sequence of numbers j k {, 2}, k =,...,n, for every c R, there exists the unique polynomial p c (x) = cx N+ + q c (x), q c P N, where N + = n k= j k, such that w(ik m) I m k p(x)w(x)dx = 0, m =, j k ; k =,...,n, which has exactly j k zeros in every interval, and p c = cp. Proof. For the proof of part (i) we consider the appropriate homogenous interpolation problem, i.e., the one with f k,m = 0, m =, j k, k =,..., n. We note that for j k = 2 there must be a zero of the polynomial p inside every interval I 2 k and also at least one inside every interval \I 2 k. If j k = it must be at least one zero inside in total at least j k zeros inside every interval, k =,...,n, i.e., p must have at least N + zeros. Since p P N, it must be p 0. For the proof of part (ii) we just note that we can rewrite the system of equations as w(ik m) I m k q c (x)w(x)dx = c w(ik m) I m k x N+ w(x)dx, m =, j k ; k =,...,n, which according to part (i) has the unique solution. Also, as we can see p c is linear in c, and has exactly j k, zeros in each interval, k =,...,n. In the case f k,m = 0, m =, 2, for some k {,..., n}, and h k = 0, we note that p(x k ) = 0, by continuity. Since p has two zeros in, for h k > 0, there must be some zero of p inside, and by continuity we have p (x k ) = 0, for h k = 0. This means that for f k,m = 0, m =, 2, and h k = 0, our interpolation conditions become p(x k ) = p (x k ) = 0. 4

The following lemma is rather trivial and we do not give its proof. The proof is based on the fact that, according to the assumptions we made, polynomials are integrable with respect to w. Lemma 2.2 (i) Given ε > 0 and n N 0, there exists δ > 0 such that provided M > δ. 0 + M x n w(x)dx < ε, (ii) Given any ε > 0 and n N 0, there exists δ > 0 such that provided M > δ. 0 M ( x) n w (x)dx < ε, We need the following lemma which is similar to the one given in [8]. Lemma 2.3 Given h 0, there exists an M > 0 such that for every h H h n the nodes of the quadrature rule (.) are uniformly bounded, i.e., x k < M, k =,..., n. Proof. Suppose that the statement of this lemma is wrong. Then for every M > 0 there exist some h M H h n, such that x k M, for some k =,...,n. Since nodes are ordered, suppose that we have ν {0,,..., n } nodes which are bounded and n ν nodes which are not. Since, we have ν nodes which are bounded, we can always create a sequence such that all bounded nodes as well as the respective lengths are convergent. Denote those sequences by x j = (x j,...,x j n) and h j = (h j,...,h j n), j N. We distinguish two cases. First consider the weight w 2 = exp( Q 2 (x)), where Q 2 is continuous on R +. Consider a sequence of polynomials p j of degree 2n with leading coefficient, satisfying the following interpolation problems w 2 (Ik,j m ) I m k,j p j (x)w 2 (x)dx = 0, m =, 2; k =,..., n, p j (x)w 2 (x)dx = 0, w 2 (I n,j ) I n,j 5

where,j Ik,j = (xj k hj k, xj k + hj k ) and I2 k,j = (xj k hj k, xj k ) for j N. According to Lemma 2. part (ii), the polynomial p j exists for every j N and it has exactly two zeros in each,j, k =,..., n, and has one additional zero in I n,j. Note that this polynomial annihilates the quadrature sum in (.), and is positive on the set (0, x j n h j n)\ n k=,j and negative on (x j n+h j n, + ). We are going to show that integral of such a polynomial cannot be zero, and hence, we show that the quadrature rule (.) whose nodes are not bounded for h Hn h cannot exist. Suppose that the first ν nodes and lengths are convergent and that other n ν nodes are not, i.e., suppose that x j k > M j, k = ν+,...,n, where the sequence M j tends to infinity. Then we have p j (x)w 2 (x)dx = R + Oj u\o n,j = Oj u\o n,j p j w 2 (x)dx + p j (x)w 2 (x)dx O n,j p j w 2 (x)dx ( p j )(x)w 2 (x)dx, O n,j where Oj u = n k=0o k,j and O k,j = (x j k + hj k, xj k+ hj k+ ), k =,..., n, O n,j = (x j n + hj n, + ). Since the nodes x j k and the lengths hj k, k =,..., n ν, are convergent, there exist some interval (α, β), α, β R +, independent of j, with the property (α, β) Oj u \O n,j for j > j 0. Then we have O u j \O n,j β p j (x)w 2 (x)dx α p j (x)w 2 (x)dx β (x α) 2n 2n (β x) 2n w 2 (x)dx = J > 0, α where n denotes the number of intervals,j with the property x j k + hj k < α and where we used the simple fact that x x j k ± hj k > x α, k =,..., n and x j k ±hj k x > β x, k = n +,...,n, for x (α, β). Note that the lower bound J does not depend of j. Denote M j + = x j n + h j n. For the integral over O n,j we have the following inequality O n,j ( p j )(x)w 2 (x)dx + M j + x 2n w 2 (x)dx = J j, 6

where we used the fact that x > x x j k ± hj k, k =,..., n, for x > Mj +. Note that the integral J j can be made arbitrarily small according to the fact that polynomials are integrable, i.e., we have J j 0 as j tends to +. We obviously have 0 = p j (x)w 2 (x)dx J J j J > 0, R + as j tends to infinity, which is a contradiction. For the weight w we use the same construction. We choose some sequence such that n nodes are diverging to and n 2 nodes are diverging to + and n n n 2 nodes which are bounded. We can always assume that the sequences of the nodes x j k and the lengths hj k, k = n +,...,n n 2 are convergent. Then we can also extract some interval (α, β) Oj u, α, β R, for j > j 0. First consider a sequence of polynomials p j of degree 2n, with the leading coefficient, which exists according to Lemma 2., part (ii), with the property w (Ik,j m ) I m k,j p j(x)w (x)dx = 0, k =,..., n, p j w (I n,j ) (x)w (x)dx = 0. I n,j For this sequence of polynomials we have that the quadrature sums in (.) are zero. For the integral we have R p j (x)w (x)dx = O u j \O n,j p j (x)w (x)dx O n,j ( p j )(x)w (x)dx. Using the same arguments as for the weight w 2, we can give the following bound O u j \O n,j p j (x)w (x)dx β α (x α) 2n 2n (β x) 2n w (x)dx = J > 0. Denote Mj = x j h j and M j + = x j n + hj n, then using integrability of the polynomials with respect to w, we have 7

O n,j ( p j )(x)w (x)dx M + j n k=0 (x + M j )2n w (x)dx ( ) n (Mj ) k k ( + M j )2n + M + j + x 2n k w (x)dx x 2n w (x)dx (2M j ) 2n (M + j ) 2n M + j + M + j x 4n w (x)dx (2M j ) 2n ε (M + j ) 2n = J j, for M j + > δ +, according to Lemma 2.2 part (i). Again, note that J is a constant which does not depend of j. This gives a natural bound 0 = p j (x)w (x)dx J Jj. R Now, for the same sequence of nodes and lengths we introduce a sequence of polynomials p 2 j of degree 2n, with the leading coefficients, which are solutions of the following interpolation problem p 2 j w (I,j ) (x)w (x)dx = 0, I,j w (Ik,j m ) I m k,j p 2 j(x)w (x)dx = 0, m =, 2; k = 2,..., n, which exists according to Lemma 2., part (ii). For this sequence, again, the quadrature sum in (.) is annihilated, and for the integral we have R p 2 j(x)w (x)dx = O,j ( p 2 j)(x)w (x)dx + O u j \O,j p 2 j(x)w (x)dx, where we can estimate O u j \O,j p 2 j (x)w (x)dx β α (x α) 2n 2n (β x) 2n w (x)dx = J 2 > 0. Note that J 2 does not depend of j and 8

O,j ( p 2 j )(x)w (x)dx M j (M + j x) 2n w (x)dx (2M+ j ) 2n (M j ) 2n M j (2M+ j ) 2n (M j ) 2n ε = J2 j 0, ( x) 4n w (x)dx for Mj > δ, according to Lemma 2.2 part (ii). This consideration gives a natural bound 0 = p 2 j (x)w (x)dx J 2 Jj 2. R We are going now to prove that at least one of the sequences Jj and J2 j tends to zero. Suppose it is Jj 2, this produces a contradiction since 0 = p 2 jw (x)dx J 2 Jj 2 J 2 > 0. R Suppose that J j c R+ {+ }. Then obviously we have J 2 j = (2M+ j ) 2n ε (M j ) 2n = 2 4n 2 ε 2 (2M j ) 2n ε (M + j ) 2n M + j M j 0, for M j +, Mj +, which is desired a contradiction. Using the same arguments we get a similar contradiction under hypotheses Jj 2 c R + {+ }. Lemma 2.4 Given h 0, there exists some ε 0 such that for every h H h n and respective nodes x X n (h), we have x k+ h k+ x k h k > ε 0, k =,..., n. In addition, if we are studying the weight w 2 we have ε 0 < x h. Proof. Assume the contrary. Then for every ε > 0 there would exist two sequences x j and h j such that x j ν+ h j ν+ x j ν h j ν ε. 9

We may assume that the sequences x j and h j are convergent, since, those two sequences belong to the compact sets. Now, consider the sequence of polynomials p j of degree 2n 2, with the leading coefficient, which satisfies the following interpolation problem w(ik,j m ) w(i ν,j ) I m ν,j I m k,j w(ik,j m ) I m k,j p j (x)w(x)dx = 0, m =, 2; k =...,ν, p j (x)w(x)dx = w(i ν+,j ) I m ν+,j p j (x)w(x)dx = 0, p j (x)w(x)dx = 0, m =, 2; k = ν + 2..., n. Every polynomial in this sequence annihilates the quadrature sum in (.) and also every polynomial is positive on O u j \ O ν,j and is negative on O ν,j, so that we have 0 = p j (x)w(x)dx = I O u j \O ν,j p j (x)w(x)dx O ν,j ( p j )(x)w(x)dx. Obviously first integral is bounded from below with for example + M (x M) 2n 2 w(x)dx > 0 and the second integral tends to zero as j +, since 0 O ν,j ( p j )(x)w(x)dx (M + x j ν+ + h j ν+) 2ν (M x j ν hj ν )2(n ν) max w(x)ε, x Oν j which produces a contradiction. Finally, for the weight w 2, consider two sequences h j and x j for which for every ε > 0 we have x j h j < ε. Then, consider a sequence of polynomials p j, of degree 2n with leading coefficient, which is a solution of the following interpolation problem 0

p j (x)w 2 (x)dx = 0, w(i,j ) I,j w(ik,j m ) p j (x)w 2 (x)dx = 0, m =, 2; k = 2,..., n. I m k,j Obviously every polynomial p j is positive on O u j \O,j and negative on O,j and annihilates the quadrature sum in (.). Thus, we have 0 = R + p j (x)w 2 (x)dx = O u j \O,j p j (x)w 2 (x)dx O,j ( p j )(x)w 2 (x)dx. First integral is bounded from bellow by + M (x M) 2n w 2 (x)dx > 0, while the second integral is bounded from above by M 2n O,j w 2 (x)dx 0, as j +. According to previous two lemmas we can define the set X ε 0,M n = { x R n xn < M, x ν+ h ν+ x ν h ν > ε 0, ν =..., n } for the weight w and X ε 0,M n = { x R n ε0 < x h, x n < M, x ν+ h ν+ x ν h ν > ε 0, ν =..., n } for the weight w 2, and also we know that nodes of the quadrature rules belong to these two sets for the respective weights. Lemma 2.5 For h H h n there exists some δ 0 > 0 such that σ k > δ 0, k =,...,n, where σ k, k =,..., n, are weights in the quadrature rule (.). Proof. Assume the contrary. Then there would exist some sequences h j and x j, such that we have σ j ν 0, for some ν {,..., n} as j tends to infinity.

Since the sets Hn h and Xε 0,M n (h) are compact we can extract convergent subsequences. Now, consider a sequence of polynomials p j, of degree 2n 2 with leading coefficient, which satisfy the following interpolation problem w(ik,j m ) I m k,j p j (x)w(x)dx = 0, m =, 2; k =,..., ν, ν +,..., n. For this sequence of polynomials we have I p j (x)w(x)dx = O j I ν,j p j (x)w(x)dx = σj ν p j (x)w(x)dx w(i ν,j ) I ν,j σ j ν(m + x j ν + h j ν) 2(ν ) (M x j ν + h j ν) 2(n ν), according to the convergence of the sequences h j and x j, lim j + σj ν + M (x M)2n 2 w(x)dx > 0, (M x ν h ν ) 2(ν ) (M x ν + h ν ) 2(n ν) which produces a contradiction. Trivially, the weights are bounded from above, since, for the polynomial p, we have I n w(x)dx = σ k > σ ν, ν =,..., n. k= 3 Proof of the main result Finally, we are able to prove our main result. The proof is based on an idea given in [3]. The difference is that we are going to apply the technique to the system (.) directly, which in turn gives us opportunity to develop a numerical algorithm for the construction of the quadrature rule. In the sequel we need the following notation h k k (π lw)= xk π l w(x)dx = (π lw)(x k + h k ) (π l w)(x k h k ) w( ) w( ) 2

w(x k + h k ) w(x k h k ) π w 2 l (x)w(x)dx. ( ) Note that we have a continuity, i.e., 0 k (π lw)= lim h k 0 + h k k (π lw) = lim h k 0 + w(x k + h k )(π l (x k + h k ) π l (ζ)) w(x k h k )(π l (x k h k ) π l (ζ)) w(η)2h k = π l(x k ), where, according to the mean value theorem, we used w(x)dx = w(η)2h k, π l (x)w(x)dx = π l (ζ). w( ) Proof of Theorem.. By π l, l N 0, we denote polynomials orthonormal with respect to the weight w, and then we define a vector representing the weights σ = (σ,...,σ n ). We are going to fix some h 0, and we consider the following family of functions F h l (σ,x) = n k= σ k π l (x)w(x)dx δ l,0, l = 0,,..., 2n, h Hn h w( ), as well as the family of mappings F h (σ,x) = (F0 h, F h,...,f2n ), h h Hn. h As a domain of the functions Fl h, l = 0,,..., 2n, and the mapping Fh, we consider the set D = [δ 0, µ 0 ] n X ε 0,M n (h), where µ 0 = I w(x)dx. According to the property π l (x)w(x)dx = δ l,0, l = 0,,..., 2n, I we conclude that any solution of the equation F h (σ,x) = 0, i.e., of the system of equations F h l (σ,x) = n k= σ k π l (x)w(x)dx δ l,0 = 0, l = 0,...,2n, (3.) w( ) 3

gives a quadrature rule of the form (.). First we establish easily that Fl h, l = 0,,..., 2n, are continuous functions on their domain. Second we conclude that the partial derivatives of the functions Fl h are given by σk Fl h = π l (x)w(x)dx, w( ) xk F h l = σ k hk k (π lw). As it can be inspected we see that partial derivatives are continuous as functions on D, this implies that the mapping F h is Fréchet differentiable (see [?], []). Next we prove that the mapping F h has a nonsingular Jacobian on D. First, we easily establish that the determinant of the Jacobian matrix can be expressed in the form ( n ) J = σ k det[ A B ], (3.2) k= where π 0 (x)w(x)dx π 0 (x)w(x)dx w(i ) w(i n ) I I n. A =.... π 2n (x)w(x)dx π 2n (x)w(x)dx w(i ) w(i n ) I I n and B = h (π 0 w) h 2 2 (π 0 w) hn n (π 0 w) h (π w) h 2 2 (π w) hn n (π w)...... h (π 2n w) h 2 2 (π 2n w) hn n (π 2n w). We know that the weights σ k [δ 0, µ 0 ], k =,...,n, so if J = 0, then it must be that the rows of the determinant are linearly dependent. This leads to a conclusion that the following interpolation problem 4

p(x)w(x)dx = 0, w( ) hk k (pw) = 0, k =,...,n, has a nontrivial solution for p P 2n. Note that h k k (pw)= (pw)(x k + h k ) (pw)(x k h k ) w( ) w(x k + h k ) w(x k h k ) w 2 ( ) = (pw)(x k + h k ) (pw)(x k h k ), w( ) π l (x)w(x)dx since the second term is zero according to the first interpolation condition. Hence, a consequence of the assumption J = 0 is the existence of the solution of the following interpolation problem p(x)w(x)dx = 0, w( ) (pw)(x k + h k ) (pw)(x k h k ) w( ) = 0, k =,...,n. According to the first interpolation condition, p must have a zero inside of each. According to the second interpolation condition we have (pw)(x k + h k ) = (pw)(x k h k ) if h k 0 or p (x k ) = 0 if h k = 0. Combining these facts, we conclude that p must have at least two zeros in each, k =,...,n. Hence, the polynomial p must have at least 2n zeros and only such a polynomial from P 2n is p 0. Hence, our interpolation problem has only trivial solutions. Accordingly, the corresponding determinant is not equal to zero. Finally, we have that themapping F h has a nonsingular Jacobian on its domain. According to the implicit function theorem, the known solution for h = 0 can be extended uniquely for all h Hn, h since the family F h depends continuously on h. We emphasize here that the system of equations (3.), with the same method of proof, can be used also for the weight functions of the form w 3 (x) = exp( Q 3 (x)), x (, ), where Q 3 is continuous and such that polynomials are integrable with respect to w 3, to prove the existence and uniqueness of 5

the quadrature rule (.). Here, the same argument applies that Jacobian J is non singular at the solution. 4 Numerical construction We have the following simple result: Theorem 4. Nodes and weights in the quadrature rule (.) are continuous functions of h. Proof. According to the implicit function Theorem, differentiability of F implies continuity with respect to the parameter. Theorem 4.2 Let x h k, σh k, k =,..., n, be nodes and weights of the Gaussian interval quadrature rule for the vector of the lengths h. There exists some ε > 0, such that for all h, with the property h h < ε, the Newton- Kantorovich process applied to the nonlinear system of equations F h l (σ,x) = 0, l = 0,,..., 2n, (4.) converges with the starting values x h k, σh k, k =,..., n. Proof. We note that Jacobian of the system of equations (4.) is non-singular for the sequence of lengths h at the solution x h and σ h and the convergence of the Newton-Kantorovich method can be established (cf. [6,]). The previous two theorems can be used to design an algorithm for constructing quadrature rules (.). Namely, for constructing Gaussian interval quadrature rules for the weight w, with the given vector of the lengths h, we can state the following algorithm: Choose h 0 = 0, x 0 = x 0 and σ 0 = σ 0, where x 0 and σ 0 are nodes and weights of the Gaussian quadrature rule for the weight w. Take h = h. 2 Solve the system (3.) using the Newton-Kantorovich method for the lengths h with the starting values x and σ. 3 If the method diverges take h = h 0 + (h h 0 )/2, x = x 0 and σ = σ 0 and go back to Step 2. 4 Take h 0 = h, x 0 = x and σ 0 = σ. If h 0 h go back to Step 2. 6

5 Return h 0, x 0 and σ 0. The Newton-Kantorovich method has the following form y k+ = y k J F h (y k ), where J is given in (3.2) and where we are using y = (σ,x). As it can be seen we must be able to compute the integrals of the form π l (x)w(x) dx, l N 0, k =,...,n. (4.2) Since the weight function w is continuous, we can apply the Gauss-Legendre quadrature for computing the integrals (4.2). Using the N-point Gauss-Legendre quadrature rule, with the nodes t m and the weights A m, m =,...,N, we have the following approximation of the integral N π m (x)w(x)dx h k A l (π m w)(h k t l + x k ). I l= k It is trivial that the quadrature sum to the right converges to the integral on the left, since, p m (x)w(x) is a continuous function. As an illustration we give two examples. Example 4.. We consider the construction of the Gaussian interval quadrature rule for the weight function w 3 (x) = ( + sin 2 (πx))χ [,] (x). The construction of polynomials π n, n N 0, orthonormal with respect to w 3 can be done using a software presented in [4]. The coefficients of the three-term recurrence relation xπ n (x) = β n+ π n+ (x) + α n π n (x) + β n π n (x), are given in Table 4.. Due to the symmetry argument we have α n = 0, n N 0. In Table 4. we present the nodes x k and the weights σ k, k =,..., 20, of the interval quadrature rule for the lengths h k, k =,..., n. Numbers in parentheses indicate decimal exponents. In these computations we used the Gauss-Legendre quadrature rule with N = 200, which can be constructed easily using the software presented in [4]. We emphasize that only 6 iterations are needed to achieve the machine 7

n β n h n x n σ n 0.732050807568877().5625357494354858.5( 3).998786560396439.95680439733938( ) 2.4744097299595.5( 3).96438075560322.425776720722553( ) 3.54574884372039.5( 3).9080446200355.6989649666054748( ) 4.490256082536.5( 3).8329679467843836.06276969409894 5.56659792584.5( 3).739385033596595.55777493344465 6.4960434357623456.5( 3).6308744385377325.2564892504766 7.504372049750382.5( 3).5078657697540.252640009724387 8.4992622994554.5( 3).378905635382944.253867888897356 9.5085946995659.5( 3).237273857587796.24988322257976 0.5000692849492345.5( 3).83824722378044( ).702023935242340.5008805207452746.( 2).7773958050270( ).695740403227302 2.500256700886247.( 2).237904609560994.2302885764868 3.50049706509456.( 2).37373996070866.2526704845526047 4.5002662750464688.( 2).50542897004346.252379647963700 5.5003247686077697.( 2).625870404505845.228404700920239 6.5002308842803479.( 2).734349842770446.572976039307774 7.50023530264395.( 2).8278804340496836.07420602936 8.50095456563984.( 2).9029506268697068.7053778826824858( ) 9.500820387838695.( 2).95653907487380.43730304034047( ) 20.50058083732057.( 2).9888837787522304.24787863045257( ) Table 4. Three-term recurrence coefficients β n for the weight function w 3 (x) = ( + sin 2 (πx))χ [,]. The lengths h k, nodes x k and weights σ k in the Gaussian interval quadrature rule (.) for the weight function w 3 precision (m.p. 2.22 0 6 ). The condition number of the Jacobian J is approximately equal to 0 2. Example 4.2. As another example we consider a construction of the interval quadrature rule for the weight function w (x) = (+x 2 ) exp( x 2 ) on R. Table 4.2 gives results and necessary data for the computation. We emphasize that in this case we needed only 5 iterations to achieve the machine precision. The condition number of the Jacobian was approximately 0 6. Hence, we used the higher precision arithmetics for computations. Finally, we emphasize that in 8

n β n h n x n σ n 0.6305465896783().92870929752769.5( 2).362388438899722().3088689648398463( 4) 2.25462867742275().5( 2).2709854370778().444253342927377( 2) 3.3597938946780().5( 2).9264622455236().8699337386563393( ) 4.52796690448630().5( 2).80470276632278().4432275725346 5.692733753984765().5( 2).40974306984462.7945347452878 6.834362605472096().( 2).409390457868029.7946527364203003 7.969724283534903().( 2).80387980330989().443309460680362 8.2093424692945().( 2).92642674233540().87050667079548( ) 9.225643443752().( 2).2709855088042445().444384880467260( 2) 0.23225285957648().( 2).362424340490755().308974047003200( 4) Table 4.2 The three-term recurrence coefficients β n for the weight w 2 (x) = ( + x 2 )exp( x 2 ) on R. The lengths h k, the nodes x k and the weights σ k in the Gaussian interval quadrature rule (.) for the weight function w 2. the case of the classical weight functions, the corresponding algorithms for constructing Gaussian interval quadrature rules are much more efficient and they are presented in [7 0]. References [] B. Bojanov, P. Petrov, Gaussian interval quadrature formula, Numer. Math., 87 (200), 625 643. [2] B. Bojanov, P. Petrov, Uniqueness of the Gaussian interval quadrature formula, Numer. Math., 95 (2003), 53 62. [3] B. Bojanov, P. Petrov, Gaussian interval quadrature formula for Tchebycheff systems, SIAM J. Numer. Anal., 43 (2005), 787 795. [4] A.S. Cvetković, G.V. Milovanović, The Mathematica Package OrthogonalPolynomials, Facta Univ. Ser. Math. Inform., 9 (2004), 7 36. [5] R. Abraham, J.E. Marsden, T. Ratiu, Manifolds, Tensor Analysis and Applications, Springer-Verlag, 998. [6] C.T. Kelley, Iterative Methods for Linear and Nonlinear Equations, SIAM, Philadelphia, 995 9

[7] G.V. Milovanović, A.S. Cvetković, Uniqueness and computation of Gaussian interval quadrature formula for Jacobi weight function, Numer. Math., 99 (2004), 4 62. [8] G.V. Milovanović, A.S. Cvetković, Gauss-Laguerre interval quadrature rule, J. Comput. Appl. Math., 82 (2005), 433 446. [9] G.V. Milovanović, A.S. Cvetković, Gauss-Radau and Gauss-Lobatto interval quadrature rules for Jacobi weight function, Numer. Math., 02 (2006), 523 542. [0] G.V. Milovanović, A.S. Cvetković, Gauss-Hermite interval quadrature rule, Comput. Math. Appl., 54 (2007), 544 555. [] J.M. Ortega, W.C. Rheinboldt, Iterative Solution of Nonlinear Equations in Several Variables, Academic Press, New York, 970. 20