Explicit polynomial expansions of regular real functions by means of even order Bernoulli polynomials and boundary values
|
|
- John Osborne
- 5 years ago
- Views:
Transcription
1 Journal of Computational and Applied Mathematics 176 ( Explicit polynomial expansions of regular real functions by means of even order Bernoulli polynomials and boundary values F.A.Costabile, F.Dell Accio, R.Luceri Dipartimento di Matematica, Università della Calabria, via P. Bucci Cubo 3A, 8736 Rende (Cs, Italy Received 11 September 3; received in revised form June 4 Abstract For a function f C n+1 ([a,b] an explicit polynomial interpolant in a and in the even derivatives up to the order n 1 at the end-points of the interval is derived.explicit Cauchy and Peano representations and bounds for the error are given and the analysis of the remainder term allows to find sufficient conditions on f so that the polynomial approximant converges to f.these results are applied to derive a new summation formula with application to rectangular quadrature rule.the polynomial interpolant is related to a fairly interesting boundary value problem for ODEs.We will exhibit solutions for this problem in some special situations. 4 Elsevier B.V. All rights reserved. MSC: primary 65D5; 65D15 Keywords: Bernoulli polynomials; Lidstone polynomials; Expansion; Boundary values 1. Status of the problem In recent years polynomial expansions for sufficiently smooth real functions in polygonal domains by means of boundary values have been investigated in several papers.in particular in [6] there is an expansion in Bernoulli polynomials, i.e., the polynomials of the sequence defined recursively by means Corresponding author. addresses: costabil@unical.it (F.A. Costabile, fdellacc@unical.it (F.Dell Accio, luceri@unical.it (R.Luceri /$ - see front matter 4 Elsevier B.V. All rights reserved. doi:1.116/j.cam.4.7.4
2 78 F.A. Costabile et al. / Journal of Computational and Applied Mathematics 176 ( of relations (see, for example, [1,13] B (x = 1, B n (x = nb n 1(x, B n (x dx =, n 1, n 1, (1 for functions in the class C n ([a,a + h], a R,h>: where f(x=f(a+ hn 1 n! k=1 ( x a B k h k! B k h k 1 (f (k 1 (a + h f (k 1 (a f (n (t(b n (x t + ( 1n B n (t dt, ( { Bn (x = Bn (x, (x + 1 otherwise B n x<1, is the periodic Bernoulli function.formula ( is a sort of generalized Taylor formula: the polynomial approximant tends to the Taylor polynomial of f with initial point in a when h.in [7,8], the previous formula has been generalized to the bivariate case, when the approximating function is defined and sufficiently smooth on rectangular or triangular domains.such kind of expansions join the well-known two-points univariate expansions, like Taylor or Lidstone one, and its generalizations to multivariate polygonal domains [5,9,14].The interest in this topic lies in the fact that these expansions find applications to several problems of numerical analysis (approximation of solutions of some boundary value problems; polynomial approximation; construction of splines with application to finite elements; etc.. For this reason, in this note we give a further contribution to the problem with new expansions for univariate functions that are, in some sense, symmetric to the Lidstone one. Let us recall that for functions in the class C n ([, 1] the Lidstone approximation formula [] can be written as follows: n 1 f(x= f (k (Λ k (1 x + f (k (1Λ k (x + k= G n (x, tf (n (t dt, (3 where [] n 1 (1 t (n k 1 k= ((n k 1! Λ k(x, G n (x, t = n 1 t (n k 1 ((n k 1! Λ k(1 x, k= x t, x t,
3 F.A. Costabile et al. / Journal of Computational and Applied Mathematics 176 ( and {Λ n (x} n N is the sequence of Lidstone polynomials in the interval [, 1], which can be defined by means of the recursive relations Λ (x = x, Λ n (x = Λ n 1 (x, Λ n ( = Λ n (1 =, n 1, n 1. The polynomials Λ n (x are related to the odd degree Bernoulli polynomials B n+1 (x by the relations [15] ( Λ n (x = n+1 x + 1 (n + 1! B n+1, (5 for each n N.Note that both expansions in ( and (3 give polynomial approximations to f by means of Bernoulli polynomials using only values of this function and its derivatives at the boundary of the interval.moreover, denoting by B n [f ](x and L n [f ](x the polynomial approximants, respectively, in ( and (3, the following interpolation conditions hold: and B n [f ]( = f(, B n [f ] (k (1 B n [f ] (k ( = f (k (1 f (k ( (6 L n [f ] (k ( = f (k (, L n [f ] (k (1 = f (k (1, (7 for each k =, 1,...,n 1.Note that conditions (6 include the interpolation of the function f at the point x = 1. In Section, we introduce the new polynomial expansion, determine the related property of interpolation and study the remainder term.the analysis of the remainder allows us to find sufficient conditions on f so that the polynomial approximant converges to f.in Section 3 we finally apply previous results to derive a new summation formula with application to rectangular quadrature rule.the polynomial interpolant is related to a fairly interesting boundary value problem for ODEs.We exhibit solutions for this problem in some special situations. (4. Construction of the expansion.1. Preliminary results Let us consider the polynomial sequence defined recursively by means of relations v (x = 1, v k (x = x v k 1 (t dt, v k (x dx =, k 1. k 1, (8
4 8 F.A. Costabile et al. / Journal of Computational and Applied Mathematics 176 ( By definition, v k (x is a polynomial of degree not greater than k and by (8 it is easy to calculate the first polynomials of the sequence: v (x = 1, v 1 (x = x 1 6, v (x = x4 4 x ,.... The polynomial sequence {v k (x} is related to the Lidstone polynomials by the following Proposition 1. For each k 1 we have v k (x = Λ k 1(x, (9 where Λ k 1 (x is the Lidstone polynomial of degree k 1. Proof. In fact, by (8 we have v 1 (x = x, d dx v k (x = v k 1 (x, k > 1, v k ( = v k (1 =, k>1, and Eq.(9 follows for each k = 1,,...by the uniqueness of Lidstone polynomial sequence (4 []. The polynomial sequence (8 is related to Bernoulli polynomials of even degree by the following: Proposition. For each k 1 v k (x = k (k! B k ( 1 + x. (1 Proof. By (9 and relations (5 by integration of the second equation in (8 it follows x v k (x=v k ( + v k (t dt = v k ( + k 1 (k 1! = v k ( + k (k 1! = v k ( + k (k! x ( 1 + t B k 1 dt (1+x/ 1/ ( B k ( 1 + x B k 1 (t dt ( 1 B k
5 F.A. Costabile et al. / Journal of Computational and Applied Mathematics 176 ( and by the third equation in (8 since = = v k (x dx (v k ( + k = v k ( + k (k! = v k ( k (k! B k ( ( ( 1 + x 1 B k B k (k! ( ( ( 1 + x 1 B k dx B k ( 1 ( ( ( 1 + x 1 B k dx = B k+1 (1 B k+1 = (k + 1 for each k 1, in force of the following well-known properties of Bernoulli polynomials [1]: B n ( 1 = (1 1 n B n (, n 1, (11 dx B n = B n ( = B n (1, n 1, (1 B n+1 ( =, n 1. (13.. The main theorem Now we can prove the following Theorem 3 (Main theorem. Let us denote by {v k (x} k=,1,,... the polynomial sequence defined recursively by means of relations (8; then for each f C n+1 ([, 1] the following identity holds: f(x= P,n [f ](x + R,n (f, x, (14 where P,n [f ](x is the polynomial defined by P,n [f ](x=f( + [f (j 1 (1(v j (x v j ( f (j 1 ((v j (1 x v j (1] (15 and the remainder R,n (f, x in its Peano s and Cauchy s representation is given respectively by R,n (f, x = f (n+1 (tk,n (x, t dt (16
6 8 F.A. Costabile et al. / Journal of Computational and Applied Mathematics 176 ( with and n K,n (x, t = t n (n! + n R,n (f, x = Q,n+1(x (n! (1 tn j+1 (v j (x v j ( (n j + 1!, x t, t n j+1 (v j (1 x v j (1 (n j + 1!, t x (17 f (n+1 (ξ, ξ (, 1, (18 where we have set ( ( ( x Q,n+1 (x = B n+ (x B n+ n+ B n+ B n+. (19 (n + 1(n + In addition, the polynomial P,n [f ](x satisfies the following interpolation conditions: P,n [f ]( = f(, d k 1 dx k 1 P,n[f ]( = dk 1 f(, dxk 1 k d k 1 dx k 1 P,n[f ](1 = dk 1 f(1, dxk 1 k = 1,...,n, = 1,...,n. Proof. Let f C n+1 ([, 1] be fixed.we start by proving that the polynomial (15 satisfies the interpolation conditions (: the first of conditions ( holds trivially; on the other hand for each j =, 1,... and k = 1,,..., by an iteration of the second equation in (8 we obtain so that d (k 1 dx (k 1 v j (x = d k 1 dx k 1 v j (x = v j k+1 (x = { vj k+1 (x, k j + 1,, j k, x v j k (t dt, x d k 1 dx k 1 v j (1 x = d dx v j k+1(1 x = v j k+1 (1 x = v j k (t dt, for each k j and d k 1 dx k 1 P,n[f ](x x= [ ] = f (j 1 (1 v j k (t dt + f (j 1 ( v j k (t dt = f (k 1 (, j=k (
7 F.A. Costabile et al. / Journal of Computational and Applied Mathematics 176 ( the third of conditions ( can be proved by analogy.let us now prove that the Cauchy s representation (18 holds.in fact, according to the interpolation conditions (, the function x R,n (f, x = f(x P,n [f ](x satisfies R,n (f, =, d k 1 dx k 1 R,n(f, x = dk 1 x= dx k 1 R,n(f, x =, k = 1,...,n, (1 x=1 and analogue conditions are satisfied, for each n 1, by the (n + 1-degree polynomial Q,n+1 as defined in (19: Q,n+1 ( =, d k 1 dt k 1 Q,n+1(t = dk 1 t= dt k 1 Q,n+1(t =, k = 1,...,n, ( t=1 in virtue of (11 (13.Let now x (, 1 be fixed; by (1, ( the function Φ(τ = R,n (f, τ R,n(f, x Q,n+1 (x Q,n+1(τ (3 satisfies the conditions Φ( =, d k 1 Φ(τ dτk 1 = dk 1 Φ(τ τ= dτk 1 =, k = 1,...,n, τ=1 and, in addition, Φ vanishes also at τ = x, so that by the Rolle s theorem the first derivative Φ (τ must vanish at a point ξ 1 : < ξ 1 <x.the three zeros, ξ 1, 1ofΦ (τ imply, by a repeated application of Rolle s theorem, the existence of a point ξ (, 1 s.t. Φ (3 (ξ = and the three zeros, ξ, 1ofΦ (3 (τ imply the existence of a zero ξ 3 (, 1 of Φ (5 (τ and so on.now, by induction, Φ (n+1 (τ must vanish at a point ξ (, 1, so that differentiating (n + 1 times the function in (3 we obtain = f (n+1 (ξ R,n(f, x Q,n+1 (x (n!, that is (18.It remains to prove the Peano s representation (16.For this, we have to note that, by virtue of previous results, for each fixed x [, 1] the linear functional f R,n (f, x is a Peano s type functional on C n+1 ([a,b], i.e., R,n (p, x = for each p in the space P n of the polynomials in x of degree not greater than n.by applying the well known Peano s kernel theorem [1, p.7] Eq.(16 is certainly true if K,n (x, t = 1 (n! R,n((x t n +,x,
8 84 F.A. Costabile et al. / Journal of Computational and Applied Mathematics 176 ( where R,n is applied to (x t n + considered as a function of x: { (x t n, x<t, + = (x t n, x t; on the other hand, R,n ((x t n +,x (n! n (1 tn j+1 (v j (x v j ( (n j + 1!, x<t, = (x t n n (1 tn j+1 (v j (x v j ( (n! (n j + 1!, x t, n (1 tn j+1 (v j (x v j ( (n j + 1!, x<t, = t n (n! + n t n j+1 (v j (1 x v j (1 (n j + 1!, x t, that is Eq.(16 holds true.the last equation in (4 is obtained using the expansion [ (x t n = ( tn (1 t n j+1 + (n! (n! (n j + 1! (v j (x v j ( ] ( tn j+1 (n j + 1! (v j (1 x v j (1, (4 which holds since (x t n /(n!, considered as a function of x, is a polynomial of degree n, and hence it must coincide with its polynomial expansion (15. Remark 4. For each f C n+1 ([, 1] a symmetric expansion (with respect to axis x = 1 to that in Theorem 3 is also possible; in particular, for each x [, 1] the following identity holds: f(x= P 1,n [f ](x + R 1,n (f, x, (5 where P 1,n [f ](x is the polynomial defined by P 1,n [f ](x=f(1 + [f (j 1 (1(v j (x v j (1 f (j 1 ((v j (1 x v j (]; for the remainder R 1,n (f, x there are the following representations: (1 Peano s representation of the error: R 1,n (f, x = f (n+1 (tk 1,n (x, t dt,
9 F.A. Costabile et al. / Journal of Computational and Applied Mathematics 176 ( where (1 tn n (1 tn j+1 (v j (x v j (1 (n! (n j + 1!, x t, K 1,n (x, t = t n j+1 (v j (1 x v j ( (n j + 1!, t x. ( Cauchy representation of the error: for each x (, 1 there exists ξ (, 1 s.t. R 1,n (f, x = Q 1,n+1(x f (n+1 (ξ, (n! where we have set ( Q 1,n+1 (x= B n+ (x B n+ (n + 1(n + ( ( x ( 1 n+ B n+ B n+. The polynomial P 1,n [f ](x satisfies the following interpolation conditions: P 1,n [f ](1 = f(1, d k 1 dx k 1 P 1,n[f ]( = dk 1 f(, dxk 1 k d k 1 = 1,...,n, dx k 1 P 1,n[f ](1 = dk 1 f(1, dxk 1 k = 1,...,n. These results follow by analogy from (14 ( after the change of variable x 1 x. Remark 5. If f C n+1 ([a,b] similar expansions to (14, (5 on [a,b] can be obtained by means of a linear transformation of the variable; in particular, if we set h = (b a we get from (14, (15, (18 [ ( ( x a f(x=f(a+ h j 1 f (j 1 (b v j v j ( h ( ( ] b x h j 1 f (j 1 (a v j v j (1 h ( x a Q,n+1 + h n+1 h f (n+1 (ξ, (6 (n! where the point ξ (a, b in the reminder term depends on x.the remainder, in its Peano s representation, is given by ( x a R,n (f, x = h n+1 f (n+1 (a + thk,n h,t dt, (7 with K,n (x, t as defined in (17.
10 86 F.A. Costabile et al. / Journal of Computational and Applied Mathematics 176 ( The Cauchy s representation of the error stated in Theorem 3 allows us to derive bounds for the remainder; consequently, we can give sufficient conditions on f so that the polynomial approximant (15 converges to f. Proposition 6 (Bound for remainder. If f C n+1 ([, 1], then for the error function R,n (f, x it holds R,n (f, x 4 (n+ 1 B n+ max (n +! f (n+1 (x. (8 x [,1] Proof. We have Q,n+1 (x = B n+ (x B n+ (n + 1(n ( + ( x n+ B n+ B n+ ( ( n+ 1 B n+ (n + 1(n + ( x + B n+ (x n+ B n+ 4 (n + 1(n + (n+ 1 B n+ ( x since by (11 (13 the function B n+ (x n+ B n+ boundary of [, 1]. The thesis follows from (18. assumes its maximum modulus at the Corollary7. Let f C ([, 1] and suppose that there exist a positive constant p<π and an integer ν > s.t. f (n+1 (x = O(p n+1 for all n ν, x [, 1], then the polynomial sequence {P,n [f ](x} n absolutely and uniformly converges to f(xin [, 1]. Proof. In fact by the Euler s formula [11, p.5] n+1 (n! B n = ( 1 (π n k n, k=1 n 1, it follows that (n +! B n+ (π n+, n, so that the right member of (8 is bounded from above by 8(1/π n+ max x [,1] f (n+1 (x.the thesis follows.
11 F.A. Costabile et al. / Journal of Computational and Applied Mathematics 176 ( Example 8. For each p < π the expansion cos px = 1 + ( 1 j p j 1 sin p(v j (x v j ( (9 holds and the right member of (9 absolutely and uniformly converges to cos px in [, 1].If p =±π the convergence of the related series to cos πx fails.for each p : p > π it can be proved that series in the second member of (9 does not converge absolutely in [, 1]. 3. Applications 3.1. Summation formula and its application to numerical quadrature For each l N set in (6 with remainder (7 a = l, b = l + 1, ξ = ξ l ; by integrating from l to l + 1 and using relations (1, (1, (11 (13 to compute integrals at the right member we obtain l+1 l [ f(xdx=f(l+ f (j 1 (l + 1 ( j (j! B j ] f (j 1 (l ( j (j! B j (1 + l+1 l ( 1 f (n+1 (l + tk,n (x l,tdt dx, hence by summing from l = tom 1 and inverting the order of summation at the right member it follows that m 1 l= f(l= m f(xdx m 1 l= m l=1 l+1 l f (j 1 ( j (j! B j f (j 1 (l j 1 (j! B j f (n+1 (l + tk,n (x l,tdt dx. f (j 1 (m j (j! B j If we are working under the hypothesis that f (n+1 (x is continuous in [, we can change the order of integration in the last term of previous equation, and after some calculation we thus obtain
12 88 F.A. Costabile et al. / Journal of Computational and Applied Mathematics 176 ( Theorem 9. Let f be a function defined for x having n+1 continuous derivatives. Then the following identity holds for m = 1,,... m 1 l= f(l= m f(xdx l=1 f (j 1 ( j (j! B j m f (j 1 (l j 1 B j f (j 1 (m j B j (j! (j! ( 1 m 1 f (n+1 (l + t K,n (s, t ds dt, (3 l= where K,n (s, t is defined as in (17. Example 1. Let g be a (n + 1 times continuously differentiable function on [, 1].We apply the summation formula (3 to f(x= g(hx, where h = 1 m. Writing x l = lh, l =, 1,...,m, there results h m 1 l= g(x l = g(xdx h j g (j 1 ( j (j! B j m h j g (j 1 (x l j 1 B j h j g (j 1 (1 j (j! (j! l=1 ( 1 1 m 1 h n+ g (n+1 (h(l + t K,n (s, t ds dt l= and inverting the order of summation at the right member h m 1 l= g(x l = g(xdx B j h j ( g (j 1 ( j (j! B j (31 m g (j 1 (x l j 1 B j g (j 1 (1 j B j (3 (j! (j! l=1 ( 1 m 1 h n+ g (n+1 (h(l + t K,n (s, t ds dt. (33 l= The left side of the above equation is the result of the numerical integration g(xdx by applying the rectangular rule to m equal subintervals.the previous formula exhibits the error of this approximation. The remainder term in the second member clearly is O(h n+.if g has derivatives of all orders, formula
13 F.A. Costabile et al. / Journal of Computational and Applied Mathematics 176 ( (33 holds true for n = 1,,... and thus it expresses the fact that the rectangular procedure admits the asymptotic expansion h m 1 l= g(x l m g(xdx l=1 g (j 1 (x l j 1 (j! h j ( g (j 1 ( j (j! B j B j g (j 1 (1 j (j! B j as h, h>.then it is possible, using the derivatives of g, to increase the accuracy of the rectangular procedure by evaluating some terms of this expansion. Remark 11. In the papers [3,4] there are investigated generalizations of the Euler MacLaurin formula that involve even-order instead of odd-order derivatives of the function to be integrated; in these formulas the coefficients multiplying the derivatives are connected with Appell polynomials instead of Bernoulli numbers. 3.. A related boundary value problem For each fixed n 1 let us consider the (n + 1th order differential equation y (n+1 (x = Φ(x, y(x, y (x,...,y (k (x, k n 1, (34 with the boundary conditions y( = α, y (i 1 ( = β i, y (i 1 (1 = γ i, i = 1,...,n, (35 where Φ is continuous at least in the domain of interest and α, β i, γ i are real numbers.if Φ = it follows by Theorem 3 that problem (34, (35 has a unique solution y(x = P,n [f ](x; another result related to problem (34, (35 in the particular case when Φ=Φ(x is also a direct consequence of the main theorem: If Φ = Φ(x is a real continuous function on [, 1] then the problem y (n+1 (x = Φ(x, y( =, y (i 1 ( =, y (i 1 (1 =, i = 1,...,n has a unique solution given by y(x = f (n+1 (tk,n (x, t dt, where K,n (x, t is defined as (17. In our opinion the general boundary value problem (34, (35 is fairly interesting and for this reason the problem of the existence and finding approximated solutions, when they exist, can be studied separately in a successive paper.
14 9 F.A. Costabile et al. / Journal of Computational and Applied Mathematics 176 ( References [1] R.P. Agarwal, P.J.Y. Wong, Error Inequalities in Polynomial Interpolation and Their Applications, Kluwer Academic Publishers, The Netherlands, [] R.P. Agarwal, P.J.Y. Wong, Explicit error bounds for the derivatives of piecewise-lidstone interpolation, J. Comput. Appl. Math.58 ( [3] G.Bretti, P.E.Ricci, Euler polynomials and the related quadrature rule, Georgian Math.J.8 (3 ( [4] G.Bretti, M.X.He, P.E.Ricci, On quadrature rules associated with Appell polynomials, Internat.J.Appl.Math.11 (1 ( [5] C.K. Chui, M.-J. Lai, Multivariate vertex splines and finite elements, J. Approx. Theory 6 (3 ( [6] F.Costabile, Expansion of real functions in Bernoulli polynomials and applications, Confer.Sem.Mat.Univ.Bari 73 ( [7] F.Costabile, F.Dell Accio, Expansion over a rectangle of real functions in Bernoulli polynomials and applications, BIT 41 (3 ( [8] F.Costabile, F.Dell Accio, Expansion over a simplex of real functions by means of Bernoulli polynomials, Numer. Algorithms 8 ( [9] F.Costabile, F.Dell Accio, Lidstone approximation on the triangle, Appl.Numer.Math., to appear. [1] P.J. Davis, Interpolation & Approximation, Dover Publications, Inc., New York, [11] K.Dilcher, Zeros of Bernoulli, generalized Bernoulli and Euler polynomials, Mem.Amer.Math.Soc.73 (386 (1988. [1] C.Jordan, Calculus of Finite Differences, Rottig and Romwalter, Budapest, [13] J.F. Steffensen, Interpolation, Chelsea, New York, [14] T.F.Sturm, A unique multivariate Hermite interpolant on the simplex, J.Math.Anal.Appl.191 ( [15] J.M.Whittaker, On Lidstone s series and two point expansions of analytic functions, Proc.London Math.Soc.( 36 (
Section Taylor and Maclaurin Series
Section.0 Taylor and Maclaurin Series Ruipeng Shen Feb 5 Taylor and Maclaurin Series Main Goal: How to find a power series representation for a smooth function us assume that a smooth function has a power
More informationError formulas for divided difference expansions and numerical differentiation
Error formulas for divided difference expansions and numerical differentiation Michael S. Floater Abstract: We derive an expression for the remainder in divided difference expansions and use it to give
More informationChapter 11 - Sequences and Series
Calculus and Analytic Geometry II Chapter - Sequences and Series. Sequences Definition. A sequence is a list of numbers written in a definite order, We call a n the general term of the sequence. {a, a
More informationMa 530 Power Series II
Ma 530 Power Series II Please note that there is material on power series at Visual Calculus. Some of this material was used as part of the presentation of the topics that follow. Operations on Power Series
More informationCALCULUS JIA-MING (FRANK) LIOU
CALCULUS JIA-MING (FRANK) LIOU Abstract. Contents. Power Series.. Polynomials and Formal Power Series.2. Radius of Convergence 2.3. Derivative and Antiderivative of Power Series 4.4. Power Series Expansion
More informationTaylor and Maclaurin Series
Taylor and Maclaurin Series MATH 211, Calculus II J. Robert Buchanan Department of Mathematics Spring 2018 Background We have seen that some power series converge. When they do, we can think of them as
More informationA Product Integration Approach Based on New Orthogonal Polynomials for Nonlinear Weakly Singular Integral Equations
Acta Appl Math (21) 19: 861 873 DOI 1.17/s144-8-9351-y A Product Integration Approach Based on New Orthogonal Polynomials for Nonlinear Weakly Singular Integral Equations M. Rasty M. Hadizadeh Received:
More informationChapter 8: Taylor s theorem and L Hospital s rule
Chapter 8: Taylor s theorem and L Hospital s rule Theorem: [Inverse Mapping Theorem] Suppose that a < b and f : [a, b] R. Given that f (x) > 0 for all x (a, b) then f 1 is differentiable on (f(a), f(b))
More informationA new approach to Bernoulli polynomials
Rendiconti di Matematica, Serie VII Volume 26, Roma 2006), -2 A new approach to Bernoulli polynomials F COSTABILE F DELL ACCIO M I GUALTIERI Dedicated to Professor Laura Gori on her 70th birthday Abstract:
More informationScattered data interpolation by Shepard s like methods: classical results and recent advances
Proceedings of Kernel-based Methods and Function Approximation 06, Volume 9 06 Pages 3 44 Scattered data interpolation by Shepard s like methods: classical results and recent advances Francesco Dell Accio
More informationJim Lambers MAT 460/560 Fall Semester Practice Final Exam
Jim Lambers MAT 460/560 Fall Semester 2009-10 Practice Final Exam 1. Let f(x) = sin 2x + cos 2x. (a) Write down the 2nd Taylor polynomial P 2 (x) of f(x) centered around x 0 = 0. (b) Write down the corresponding
More informationTAYLOR AND MACLAURIN SERIES
TAYLOR AND MACLAURIN SERIES. Introduction Last time, we were able to represent a certain restricted class of functions as power series. This leads us to the question: can we represent more general functions
More informationBivariate Lagrange interpolation at the Padua points: The generating curve approach
Journal of Approximation Theory 43 (6) 5 5 www.elsevier.com/locate/jat Bivariate Lagrange interpolation at the Padua points: The generating curve approach Len Bos a, Marco Caliari b, Stefano De Marchi
More informationContinuous Functions on Metric Spaces
Continuous Functions on Metric Spaces Math 201A, Fall 2016 1 Continuous functions Definition 1. Let (X, d X ) and (Y, d Y ) be metric spaces. A function f : X Y is continuous at a X if for every ɛ > 0
More informationBernoulli Polynomials
Chapter 4 Bernoulli Polynomials 4. Bernoulli Numbers The generating function for the Bernoulli numbers is x e x = n= B n n! xn. (4.) That is, we are to expand the left-hand side of this equation in powers
More informationTwo chain rules for divided differences
Two chain rules for divided differences and Faà di Bruno s formula Michael S Floater and Tom Lyche Abstract In this paper we derive two formulas for divided differences of a function of a function Both
More informationWe denote the derivative at x by DF (x) = L. With respect to the standard bases of R n and R m, DF (x) is simply the matrix of partial derivatives,
The derivative Let O be an open subset of R n, and F : O R m a continuous function We say F is differentiable at a point x O, with derivative L, if L : R n R m is a linear transformation such that, for
More informationChapter 11. Taylor Series. Josef Leydold Mathematical Methods WS 2018/19 11 Taylor Series 1 / 27
Chapter 11 Taylor Series Josef Leydold Mathematical Methods WS 2018/19 11 Taylor Series 1 / 27 First-Order Approximation We want to approximate function f by some simple function. Best possible approximation
More informationCOURSE Numerical integration of functions (continuation) 3.3. The Romberg s iterative generation method
COURSE 7 3. Numerical integration of functions (continuation) 3.3. The Romberg s iterative generation method The presence of derivatives in the remainder difficulties in applicability to practical problems
More informationOn Partition Functions and Divisor Sums
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 5 (2002), Article 02.1.4 On Partition Functions and Divisor Sums Neville Robbins Mathematics Department San Francisco State University San Francisco,
More informationThe combined Shepard-Lidstone bivariate operator
Trends and Applications in Constructive Approximation (Eds.) M.G. de Bruin, D.H. Mache & J. Szabados International Series of Numerical Mathematics Vol. 151 c 2005 Birkhäuser Verlag Basel (ISBN 3-7643-7124-2)
More informationSeries Solutions. 8.1 Taylor Polynomials
8 Series Solutions 8.1 Taylor Polynomials Polynomial functions, as we have seen, are well behaved. They are continuous everywhere, and have continuous derivatives of all orders everywhere. It also turns
More informationLecture 4: Numerical solution of ordinary differential equations
Lecture 4: Numerical solution of ordinary differential equations Department of Mathematics, ETH Zürich General explicit one-step method: Consistency; Stability; Convergence. High-order methods: Taylor
More informationUniversity of Houston, Department of Mathematics Numerical Analysis, Fall 2005
4 Interpolation 4.1 Polynomial interpolation Problem: LetP n (I), n ln, I := [a,b] lr, be the linear space of polynomials of degree n on I, P n (I) := { p n : I lr p n (x) = n i=0 a i x i, a i lr, 0 i
More informationJournal of Computational and Applied Mathematics
Journal of Computational and Applied Mathematics 233 2010) 1554 1561 Contents lists available at ScienceDirect Journal of Computational and Applied Mathematics journal homepage: wwwelseviercom/locate/cam
More informationX. Numerical Methods
X. Numerical Methods. Taylor Approximation Suppose that f is a function defined in a neighborhood of a point c, and suppose that f has derivatives of all orders near c. In section 5 of chapter 9 we introduced
More informationAn introduction to Birkhoff normal form
An introduction to Birkhoff normal form Dario Bambusi Dipartimento di Matematica, Universitá di Milano via Saldini 50, 0133 Milano (Italy) 19.11.14 1 Introduction The aim of this note is to present an
More informationError Estimates for Trigonometric Interpolation. of Periodic Functions in Lip 1. Knut Petras
Error Estimates for Trigonometric Interpolation of Periodic Functions in Lip Knut Petras Abstract. The Peano kernel method is used in order to calculate the best possible constants c, independent of M,
More informationUpper and lower solution method for fourth-order four-point boundary value problems
Journal of Computational and Applied Mathematics 196 (26) 387 393 www.elsevier.com/locate/cam Upper and lower solution method for fourth-order four-point boundary value problems Qin Zhang a, Shihua Chen
More informationJournal of Computational and Applied Mathematics
Journal of Computational Applied Mathematics 236 (212) 3174 3185 Contents lists available at SciVerse ScienceDirect Journal of Computational Applied Mathematics journal homepage: wwwelseviercom/locate/cam
More information1 Question related to polynomials
07-08 MATH00J Lecture 6: Taylor Series Charles Li Warning: Skip the material involving the estimation of error term Reference: APEX Calculus This lecture introduced Taylor Polynomial and Taylor Series
More informationSMOOTHNESS PROPERTIES OF SOLUTIONS OF CAPUTO- TYPE FRACTIONAL DIFFERENTIAL EQUATIONS. Kai Diethelm. Abstract
SMOOTHNESS PROPERTIES OF SOLUTIONS OF CAPUTO- TYPE FRACTIONAL DIFFERENTIAL EQUATIONS Kai Diethelm Abstract Dedicated to Prof. Michele Caputo on the occasion of his 8th birthday We consider ordinary fractional
More informationWorking papers of the Department of Economics University of Perugia (IT)
ISSN 385-75 Working papers of the Department of Economics University of Perugia (IT) The Heat Kernel on Homogeneous Trees and the Hypergeometric Function Hacen Dib Mauro Pagliacci Working paper No 6 December
More informationNumerical Integration for Multivariable. October Abstract. We consider the numerical integration of functions with point singularities over
Numerical Integration for Multivariable Functions with Point Singularities Yaun Yang and Kendall E. Atkinson y October 199 Abstract We consider the numerical integration of functions with point singularities
More informationNotes on Continued Fractions for Math 4400
. Continued fractions. Notes on Continued Fractions for Math 4400 The continued fraction expansion converts a positive real number α into a sequence of natural numbers. Conversely, a sequence of natural
More informationEXAMPLES OF PROOFS BY INDUCTION
EXAMPLES OF PROOFS BY INDUCTION KEITH CONRAD 1. Introduction In this handout we illustrate proofs by induction from several areas of mathematics: linear algebra, polynomial algebra, and calculus. Becoming
More informationIntroductory Numerical Analysis
Introductory Numerical Analysis Lecture Notes December 16, 017 Contents 1 Introduction to 1 11 Floating Point Numbers 1 1 Computational Errors 13 Algorithm 3 14 Calculus Review 3 Root Finding 5 1 Bisection
More informationA convolution test equation for double delay integral equations
Journal of Computational and Applied Mathematics 228 (2009) 589 599 Contents lists available at ScienceDirect Journal of Computational and Applied Mathematics journal homepage: www.elsevier.com/locate/cam
More informationChapter 1 Numerical approximation of data : interpolation, least squares method
Chapter 1 Numerical approximation of data : interpolation, least squares method I. Motivation 1 Approximation of functions Evaluation of a function Which functions (f : R R) can be effectively evaluated
More informationSolving Differential Equations Using Power Series
LECTURE 25 Solving Differential Equations Using Power Series We are now going to employ power series to find solutions to differential equations of the form (25.) y + p(x)y + q(x)y = 0 where the functions
More informationMAT137 Calculus! Lecture 45
official website http://uoft.me/mat137 MAT137 Calculus! Lecture 45 Today: Taylor Polynomials Taylor Series Next: Taylor Series Power Series Definition (Power Series) A power series is a series of the form
More informationSolving Differential Equations Using Power Series
LECTURE 8 Solving Differential Equations Using Power Series We are now going to employ power series to find solutions to differential equations of the form () y + p(x)y + q(x)y = 0 where the functions
More informationWe consider the problem of finding a polynomial that interpolates a given set of values:
Chapter 5 Interpolation 5. Polynomial Interpolation We consider the problem of finding a polynomial that interpolates a given set of values: x x 0 x... x n y y 0 y... y n where the x i are all distinct.
More informationCompletion Date: Monday February 11, 2008
MATH 4 (R) Winter 8 Intermediate Calculus I Solutions to Problem Set #4 Completion Date: Monday February, 8 Department of Mathematical and Statistical Sciences University of Alberta Question. [Sec..9,
More informationPH.D. PRELIMINARY EXAMINATION MATHEMATICS
UNIVERSITY OF CALIFORNIA, BERKELEY SPRING SEMESTER 207 Dept. of Civil and Environmental Engineering Structural Engineering, Mechanics and Materials NAME PH.D. PRELIMINARY EXAMINATION MATHEMATICS Problem
More informationMA2AA1 (ODE s): The inverse and implicit function theorem
MA2AA1 (ODE s): The inverse and implicit function theorem Sebastian van Strien (Imperial College) February 3, 2013 Differential Equations MA2AA1 Sebastian van Strien (Imperial College) 0 Some of you did
More informationDirect method to solve Volterra integral equation of the first kind using operational matrix with block-pulse functions
Journal of Computational and Applied Mathematics 22 (28) 51 57 wwwelseviercom/locate/cam Direct method to solve Volterra integral equation of the first kind using operational matrix with block-pulse functions
More informationChapter 4. Series Solutions. 4.1 Introduction to Power Series
Series Solutions Chapter 4 In most sciences one generation tears down what another has built and what one has established another undoes. In mathematics alone each generation adds a new story to the old
More informationDefinitions & Theorems
Definitions & Theorems Math 147, Fall 2009 December 19, 2010 Contents 1 Logic 2 1.1 Sets.................................................. 2 1.2 The Peano axioms..........................................
More informationFOURIER TRANSFORMS. 1. Fourier series 1.1. The trigonometric system. The sequence of functions
FOURIER TRANSFORMS. Fourier series.. The trigonometric system. The sequence of functions, cos x, sin x,..., cos nx, sin nx,... is called the trigonometric system. These functions have period π. The trigonometric
More informationMaking Models with Polynomials: Taylor Series
Making Models with Polynomials: Taylor Series Why polynomials? i a 3 x 3 + a 2 x 2 + a 1 x + a 0 How do we write a general degree n polynomial? n a i x i i=0 Why polynomials and not something else? We
More informationd(x n, x) d(x n, x nk ) + d(x nk, x) where we chose any fixed k > N
Problem 1. Let f : A R R have the property that for every x A, there exists ɛ > 0 such that f(t) > ɛ if t (x ɛ, x + ɛ) A. If the set A is compact, prove there exists c > 0 such that f(x) > c for all x
More informationOR MSc Maths Revision Course
OR MSc Maths Revision Course Tom Byrne School of Mathematics University of Edinburgh t.m.byrne@sms.ed.ac.uk 15 September 2017 General Information Today JCMB Lecture Theatre A, 09:30-12:30 Mathematics revision
More informationOn Some Estimates of the Remainder in Taylor s Formula
Journal of Mathematical Analysis and Applications 263, 246 263 (2) doi:.6/jmaa.2.7622, available online at http://www.idealibrary.com on On Some Estimates of the Remainder in Taylor s Formula G. A. Anastassiou
More informationLecture 32: Taylor Series and McLaurin series We saw last day that some functions are equal to a power series on part of their domain.
Lecture 32: Taylor Series and McLaurin series We saw last day that some functions are equal to a power series on part of their domain. For example f(x) = 1 1 x = 1 + x + x2 + x 3 + = ln(1 + x) = x x2 2
More informationCOURSE Numerical integration of functions
COURSE 6 3. Numerical integration of functions The need: for evaluating definite integrals of functions that has no explicit antiderivatives or whose antiderivatives are not easy to obtain. Let f : [a,
More informatione x = 1 + x + x2 2! + x3 If the function f(x) can be written as a power series on an interval I, then the power series is of the form
Taylor Series Given a function f(x), we would like to be able to find a power series that represents the function. For example, in the last section we noted that we can represent e x by the power series
More informationScientific Computing
2301678 Scientific Computing Chapter 2 Interpolation and Approximation Paisan Nakmahachalasint Paisan.N@chula.ac.th Chapter 2 Interpolation and Approximation p. 1/66 Contents 1. Polynomial interpolation
More informationRelevant sections from AMATH 351 Course Notes (Wainwright): Relevant sections from AMATH 351 Course Notes (Poulin and Ingalls):
Lecture 5 Series solutions to DEs Relevant sections from AMATH 35 Course Notes (Wainwright):.4. Relevant sections from AMATH 35 Course Notes (Poulin and Ingalls): 2.-2.3 As mentioned earlier in this course,
More information2tdt 1 y = t2 + C y = which implies C = 1 and the solution is y = 1
Lectures - Week 11 General First Order ODEs & Numerical Methods for IVPs In general, nonlinear problems are much more difficult to solve than linear ones. Unfortunately many phenomena exhibit nonlinear
More informationMath 0230 Calculus 2 Lectures
Math 00 Calculus Lectures Chapter 8 Series Numeration of sections corresponds to the text James Stewart, Essential Calculus, Early Transcendentals, Second edition. Section 8. Sequences A sequence is a
More informationPart 3.3 Differentiation Taylor Polynomials
Part 3.3 Differentiation 3..3.1 Taylor Polynomials Definition 3.3.1 Taylor 1715 and Maclaurin 1742) If a is a fixed number, and f is a function whose first n derivatives exist at a then the Taylor polynomial
More informationYunhi Cho and Young-One Kim
Bull. Korean Math. Soc. 41 (2004), No. 1, pp. 27 43 ANALYTIC PROPERTIES OF THE LIMITS OF THE EVEN AND ODD HYPERPOWER SEQUENCES Yunhi Cho Young-One Kim Dedicated to the memory of the late professor Eulyong
More informationSymmetric functions and the Vandermonde matrix
J ournal of Computational and Applied Mathematics 172 (2004) 49-64 Symmetric functions and the Vandermonde matrix Halil Oruç, Hakan K. Akmaz Department of Mathematics, Dokuz Eylül University Fen Edebiyat
More information2 Sequences, Continuity, and Limits
2 Sequences, Continuity, and Limits In this chapter, we introduce the fundamental notions of continuity and limit of a real-valued function of two variables. As in ACICARA, the definitions as well as proofs
More informationOn the Chebyshev quadrature rule of finite part integrals
Journal of Computational and Applied Mathematics 18 25) 147 159 www.elsevier.com/locate/cam On the Chebyshev quadrature rule of finite part integrals Philsu Kim a,,1, Soyoung Ahn b, U. Jin Choi b a Major
More informationAPPLICATIONS OF THE THICK DISTRIBUTIONAL CALCULUS
Novi Sad J. Math. Vol. 44, No. 2, 2014, 121-135 APPLICATIONS OF THE THICK DISTRIBUTIONAL CALCULUS Ricardo Estrada 1 and Yunyun Yang 2 Abstract. We give several applications of the thick distributional
More informationAP Calculus Testbank (Chapter 9) (Mr. Surowski)
AP Calculus Testbank (Chapter 9) (Mr. Surowski) Part I. Multiple-Choice Questions n 1 1. The series will converge, provided that n 1+p + n + 1 (A) p > 1 (B) p > 2 (C) p >.5 (D) p 0 2. The series
More informationMarkov Sonin Gaussian rule for singular functions
Journal of Computational and Applied Mathematics 169 (2004) 197 212 www.elsevier.com/locate/cam Markov Sonin Gaussian rule for singular functions G.Mastroianni, D.Occorsio Dipartimento di Matematica, Universita
More informationExplicit formulas using partitions of integers for numbers defined by recursion
Explicit formulas using partitions of integers for numbers defined by recursion Giuseppe Fera, Vittorino Talamini, arxiv:2.440v2 [math.nt] 27 Feb 203 DCFA, Sezione di Fisica e Matematica, Università di
More informationJournal of Inequalities in Pure and Applied Mathematics
Journal of Inequalities in Pure and Applied Mathematics ON SIMULTANEOUS APPROXIMATION FOR CERTAIN BASKAKOV DURRMEYER TYPE OPERATORS VIJAY GUPTA, MUHAMMAD ASLAM NOOR AND MAN SINGH BENIWAL School of Applied
More informationIntroduction to the Numerical Solution of IVP for ODE
Introduction to the Numerical Solution of IVP for ODE 45 Introduction to the Numerical Solution of IVP for ODE Consider the IVP: DE x = f(t, x), IC x(a) = x a. For simplicity, we will assume here that
More informationLECTURE 16 GAUSS QUADRATURE In general for Newton-Cotes (equispaced interpolation points/ data points/ integration points/ nodes).
CE 025 - Lecture 6 LECTURE 6 GAUSS QUADRATURE In general for ewton-cotes (equispaced interpolation points/ data points/ integration points/ nodes). x E x S fx dx hw' o f o + w' f + + w' f + E 84 f 0 f
More informationNumerical Analysis: Interpolation Part 1
Numerical Analysis: Interpolation Part 1 Computer Science, Ben-Gurion University (slides based mostly on Prof. Ben-Shahar s notes) 2018/2019, Fall Semester BGU CS Interpolation (ver. 1.00) AY 2018/2019,
More informationMY PUTNAM PROBLEMS. log(1 + x) dx = π2
MY PUTNAM PROBLEMS These are the problems I proposed when I was on the Putnam Problem Committee for the 984 86 Putnam Exams. Problems intended to be A or B (and therefore relatively easy) are marked accordingly.
More informationc n (x a) n c 0 c 1 (x a) c 2 (x a) 2...
3 CHAPTER 6 SERIES SOLUTIONS OF LINEAR EQUATIONS 6. REVIEW OF POWER SERIES REVIEW MATERIAL Infinite series of constants, p-series, harmonic series, alternating harmonic series, geometric series, tests
More informationEvaluating Singular and Nearly Singular Integrals Numerically
Evaluating Singular and early Singular Integrals umerically Matthew J. Atwood Duke University Mentor: J. Thomas Beale This work is supported by SF VIGRE grant number DMS-998332. Abstract We look for a
More informationApproximation theory
Approximation theory Xiaojing Ye, Math & Stat, Georgia State University Spring 2019 Numerical Analysis II Xiaojing Ye, Math & Stat, Georgia State University 1 1 1.3 6 8.8 2 3.5 7 10.1 Least 3squares 4.2
More informationM2PM1 Analysis II (2008) Dr M Ruzhansky List of definitions, statements and examples Preliminary version
M2PM1 Analysis II (2008) Dr M Ruzhansky List of definitions, statements and examples Preliminary version Chapter 0: Some revision of M1P1: Limits and continuity This chapter is mostly the revision of Chapter
More informationEngg. Math. I. Unit-I. Differential Calculus
Dr. Satish Shukla 1 of 50 Engg. Math. I Unit-I Differential Calculus Syllabus: Limits of functions, continuous functions, uniform continuity, monotone and inverse functions. Differentiable functions, Rolle
More informationMTH4101 CALCULUS II REVISION NOTES. 1. COMPLEX NUMBERS (Thomas Appendix 7 + lecture notes) ax 2 + bx + c = 0. x = b ± b 2 4ac 2a. i = 1.
MTH4101 CALCULUS II REVISION NOTES 1. COMPLEX NUMBERS (Thomas Appendix 7 + lecture notes) 1.1 Introduction Types of numbers (natural, integers, rationals, reals) The need to solve quadratic equations:
More informationSequences of Real Numbers
Chapter 8 Sequences of Real Numbers In this chapter, we assume the existence of the ordered field of real numbers, though we do not yet discuss or use the completeness of the real numbers. In the next
More informationOn Newton-type methods with cubic convergence
Journal of Computational and Applied Mathematics 176 (2005) 425 432 www.elsevier.com/locate/cam On Newton-type methods with cubic convergence H.H.H. Homeier a,b, a Science + Computing Ag, IT Services Muenchen,
More informationFourier Series. 1. Review of Linear Algebra
Fourier Series In this section we give a short introduction to Fourier Analysis. If you are interested in Fourier analysis and would like to know more detail, I highly recommend the following book: Fourier
More informationPart II NUMERICAL MATHEMATICS
Part II NUMERICAL MATHEMATICS BIT 31 (1991). 438-446. QUADRATURE FORMULAE ON HALF-INFINITE INTERVALS* WALTER GAUTSCHI Department of Computer Sciences, Purdue University, West Lafayette, IN 47907, USA Abstract.
More informationGenerating Functions of Partitions
CHAPTER B Generating Functions of Partitions For a complex sequence {α n n 0,, 2, }, its generating function with a complex variable q is defined by A(q) : α n q n α n [q n ] A(q). When the sequence has
More informationSuccessive Derivatives and Integer Sequences
2 3 47 6 23 Journal of Integer Sequences, Vol 4 (20, Article 73 Successive Derivatives and Integer Sequences Rafael Jaimczu División Matemática Universidad Nacional de Luján Buenos Aires Argentina jaimczu@mailunlueduar
More informationCourse 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra
Course 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra D. R. Wilkins Contents 3 Topics in Commutative Algebra 2 3.1 Rings and Fields......................... 2 3.2 Ideals...............................
More informationExamination paper for TMA4215 Numerical Mathematics
Department of Mathematical Sciences Examination paper for TMA425 Numerical Mathematics Academic contact during examination: Trond Kvamsdal Phone: 93058702 Examination date: 6th of December 207 Examination
More informationDepartment of Mathematics, University of California, Berkeley. GRADUATE PRELIMINARY EXAMINATION, Part A Fall Semester 2016
Department of Mathematics, University of California, Berkeley YOUR 1 OR 2 DIGIT EXAM NUMBER GRADUATE PRELIMINARY EXAMINATION, Part A Fall Semester 2016 1. Please write your 1- or 2-digit exam number on
More informationScattered Data Interpolation with Polynomial Precision and Conditionally Positive Definite Functions
Chapter 3 Scattered Data Interpolation with Polynomial Precision and Conditionally Positive Definite Functions 3.1 Scattered Data Interpolation with Polynomial Precision Sometimes the assumption on the
More informationG-SPLINE INTERPOLATION FOR APPROXIMATING THE SOLUTION OF FRACTIONAL DIFFERENTIAL EQUATIONS USING LINEAR MULTI- STEP METHODS
Journal of Al-Nahrain University Vol.0(), December, 00, pp.8- Science G-SPLINE INTERPOLATION FOR APPROXIMATING THE SOLUTION OF FRACTIONAL DIFFERENTIAL EQUATIONS USING LINEAR MULTI- STEP METHODS Osama H.
More informationSequences and Series of Functions
Chapter 13 Sequences and Series of Functions These notes are based on the notes A Teacher s Guide to Calculus by Dr. Louis Talman. The treatment of power series that we find in most of today s elementary
More informationAdditional exercises with Numerieke Analyse
Additional exercises with Numerieke Analyse March 10, 017 1. (a) Given different points x 0, x 1, x [a, b] and scalars y 0, y 1, y, z 1, show that there exists at most one polynomial p P 3 with p(x i )
More information5. Some theorems on continuous functions
5. Some theorems on continuous functions The results of section 3 were largely concerned with continuity of functions at a single point (usually called x 0 ). In this section, we present some consequences
More informationMath 4263 Homework Set 1
Homework Set 1 1. Solve the following PDE/BVP 2. Solve the following PDE/BVP 2u t + 3u x = 0 u (x, 0) = sin (x) u x + e x u y = 0 u (0, y) = y 2 3. (a) Find the curves γ : t (x (t), y (t)) such that that
More informationTwo special equations: Bessel s and Legendre s equations. p Fourier-Bessel and Fourier-Legendre series. p
LECTURE 1 Table of Contents Two special equations: Bessel s and Legendre s equations. p. 259-268. Fourier-Bessel and Fourier-Legendre series. p. 453-460. Boundary value problems in other coordinate system.
More information1 Solutions to selected problems
Solutions to selected problems Section., #a,c,d. a. p x = n for i = n : 0 p x = xp x + i end b. z = x, y = x for i = : n y = y + x i z = zy end c. y = (t x ), p t = a for i = : n y = y(t x i ) p t = p
More information1 Solutions to selected problems
Solutions to selected problems Section., #a,c,d. a. p x = n for i = n : 0 p x = xp x + i end b. z = x, y = x for i = : n y = y + x i z = zy end c. y = (t x ), p t = a for i = : n y = y(t x i ) p t = p
More informationBiorthogonal Spline Type Wavelets
PERGAMON Computers and Mathematics with Applications 0 (00 1 0 www.elsevier.com/locate/camwa Biorthogonal Spline Type Wavelets Tian-Xiao He Department of Mathematics and Computer Science Illinois Wesleyan
More information