A chain rule for multivariate divided differences
|
|
- Clifford Randall
- 5 years ago
- Views:
Transcription
1 A chain rule for multivariate divided differences Michael S. Floater Abstract In this paper we derive a formula for divided differences of composite functions of several variables with respect to rectangular grids of points. Letting the points coalesce yields a chain rule for partial derivatives of multivariate functions. Math Subject Classification: 41A05, 65D05, 26A06 Keywords: Divided difference, chain rule, calculus of several variables, Faa di Bruno formula. 1 Introduction The product rule for divided differences generalizes the Leibniz rule of calculus. It goes back at least to Popoviciu [16, 17] and Steffensen [22], and has played a role in the development of spline theory [1]. More recently, motivated by the error analysis of parametric curve interpolation, a chain rule was derived for divided differences: a formula that expresses divided differences of a composite function g f in terms of divided differences of the two functions f and g separately. Somewhat curiously, there are (at least) two such formulas, both of which were found in [8]. In one formula, all divided differences of the inner function f are over consecutive points, while in the other, all divided differences of the outer function g are over consecutive points, which suggests referring to the formulas as the inner and outer chain rules respectively. The outer chain rule was found independently in [23]. Centre of Mathematics for Applications, Department of Informatics, University of Oslo, PO Box 1053, Blindern, 0316 Oslo, Norway, michaelf@ifi.uio.no 1
2 Divided differences of composite functions appear in error formulas for parametric curve fitting based on polynomials and splines [15, 6, 7]. When compared with derivative chain rules such as Faa di Bruno s formula [5], an advantage of the divided difference chain rules is that they can be applied to functions with little or no smoothness. Moreover, by letting the points in these difference formulas coalesce, they provide a new, and simple way of deriving the Faa di Bruno formula [5, 11, 18, 19, 12, 13, 20, 11]. The inner chain rule was later used in [9] to derive a rule for divided differences of inverses of functions. Surprisingly, the inverse rule can be interpreted in terms of partitions of convex polygons, and offers a new way of counting such partitions. Given these various applications it seems worthwhile looking for a divided difference chain rule for multivariate functions. In this paper we show that at least the inner chain rule has a natural extension to multivariate functions, when divided differences are defined over rectangular grids of points. The rule can be interpreted in terms of polygonal paths that pass through points in the grid and are monotonic with respect to each variable. Due to the fact that multivariate divided differences converge to normalized partial derivatives as the grid points coalesce, the rule yields a corresponding formula for partial derivatives of multivariate composite functions; cf. [4]. 2 The univariate formula We begin by recalling the inner chain rule of [8]. Let [x 0, x 1,...,x n ]f denote the usual divided difference of a real-valued function f at the real values x 0,..., x n ; see [3]. We define [x i ]f = f(x i ), and for distinct x i, [x 0,...,x n ]f = ([x 1,..., x n ]f [x 0,...,x n 1 ]f)/(x n x 0 ). We can allow any of the x i to be equal if f has sufficiently many derivatives to allow it. In particular, if all the x i are equal to x say, then [x 0, x 1,...,x n ]f = f (n) (x)/n!. Sometimes, in order to simplify expressions, we will use the shorter notation [x; i, j]f := [x i, x i+1,...,x j ]f, j i. (1) It was shown in [8] that for n 1 and f and g smooth enough, [x; 0, n](g f) = n [f i0, f i1,...,f ik ]g k=1 0=i 0 < <i k =n k [x; i j 1, i j ]f, (2) j=1 2
3 where f i := f(x i ). The formula is a sum over all sequences of integers (i 0, i 1,...,i k ) satisfying the condition 0 = i 0 < i 1 < < i k = n, and the product term is formed by filling the gaps between x ij 1 and x ij. For example, the case n = 3 is [x; 0, 3](g f) = [f 0, f 3 ]g [x; 0, 3]f + [f 0, f 1, f 3 ]g [x; 0, 1]f [x; 1, 3]f + [f 0, f 2, f 3 ]g [x; 0, 2]f [x; 2, 3]f + [f 0, f 1, f 2, f 3 ]g [x; 0, 1]f [x; 1, 2]f [x; 2, 3]f. (3) 3 Chain rule: inner function multivariate We begin the generalization of (2) by considering the case that the inner function f is replaced by a multivariate function while the outer function g remains univariate. Following the approach of ([10], sec. 6.6), if f is a function of p variables, f = f(x 1,...,x p ), we denote by [x 1 0, x 1 1,...,x 1 n 1; x2 0, x 2 1,...,x 2 n 2;...;xp 0, x p 1,...,x p n p]f the divided difference of f with respect to the real values x r k, r = 1,...,p, 0 k n r. This is the tensor-product kind of divided difference, in the sense that it is the leading coefficient of the unique tensor-product polynomial that interpolates f over the rectangular grid of points (x 1 k 1,...,xp k p), 0 kr n r. If these points are not distinct, the interpolating polynomial is understood to be the Hermite one. The difficult but interesting issues of multivariate polynomial interpolation over other configurations of points and associated notions of divided differences have been addressed by several authors [1, 2, 14, 21]. In analogy with the univariate case, if x r k r xr for all r, then [x 1 0, x1 1,...,x1 n 1;...; xp 0, x p 1,...,x p n p]f Dn f(x), n! where x := (x 1, x 2,...,x p ), n = (n 1, n 2,...,n p ), n! := n 1!n 2! n p!, and ( ) n 1 ( ) n 2 ( ) n p D n f(x) := f(x). x 1 x 2 x p 3
4 Using the vector notation i = (i 1,...,i p ) and j = (j 1,...,j p ), we can express the condition that i r j r for all r = 1,...,p as i j, in which case, in analogy with (1), we will sometimes make use of the shorthand [x;i,j]f := [x 1 i 1, x1 i 1 +1,...,x1 j 1;...;xr i r, xr i r +1,...,xr j r;...; xp i p, xp i p +1,...,xp j p]f. As in [8] we will need the product rule. In the multivariate case this is [x;0,n](fg) = [x;0,i]f [x;i,n]g, (4) 0 i n which is a straightforward generalization of the univariate product rule found by Popoviciu [16, 17] and Steffensen [22]. The formula can be viewed as a sum over polygonal paths that connect the point 0 to the point n in the grid of points i, 0 i n. Each path has two line segments, one connecting 0 to i, the other connecting i to n, either of which can degenerate to a point. Figure 1(a) illustrates an example of a path in the bivariate case, p = 2. The two shaded boxes indicate the points involved in the two divided differences in the sum in (4), the bottom left box applies to f, while the top right box applies to g. The rule extends in a simple way to deal with a product of r functions f 1, f 2,...,f r, by induction on r, ( r ) r [x;0,n] f j = [x;i j 1,i j ]f j. (5) j=1 0=i 0 i 1 i r=n j=1 Like (4), this formula is a sum over non-decreasing polygonal paths: polygonal paths that connect the point 0 to the point n in such a way that the vertices form a non-decreasing sequence in each of the p coordinates. The paths now have r line segments (possibly degenerate). Figure 1(b) illustrates the bivariate case when there are four functions, r = 4. We now derive a chain rule for divided differences when the inner function is multivariate. With the vector notation, the formula looks almost like the univariate one. Theorem 1 If f : R p R and g : R R are smooth enough, and f i := f(x i ), then [x;0,n](g f) = n k=0 0=i 0 < <i k =n [f i0,...,f ik ]g k [x;i j 1,i j ]f. (6) j=1 4
5 n n i 3 i i i 1 Figure 1: The bivariate product rule: (a) two functions, (b) four functions. Here, i 1 < i 2 means i 1 i 2 and i 1 i 2, and n := n 1 + n n p. Note that we allow n = 0 in this formula, which is why we include the case k = 0 in the first sum, unlike in (2). If n = 0 we interpret the condition 0 = i 0 < i 1 < < i k = n (7) as having the unique solution k = 0 and i 0 = 0 and with the convention that an empty product has the value 1, formula (6) reduces to the correct equation (g f)(x 0 ) = g(f(x 0 )). If on the other hand n 1, all solutions to (7) require k 1. So for n 1 we could replace the first sum in (6) by n k=1. However, we will need to allow the case n = 0 when we use (6) to prove Theorem 2. Proof. It is sufficient to prove (6) when g is a polynomial of degree n because if we replace g by the polynomial of degree n that interpolates it on the points f i, 0 i n, the divided differences in (6) are unchanged. Therefore, by the linearity of (6) in g, it is also sufficient to prove it for any monomial g(y) = y r, with r n. In this case, by the divided difference rule for the product of r functions, [x;0,n](g f) = [x;0,n](f r ) = 0=α 0 α r=n q=1 Now, by counting the multiplicities of the points α j we have (α 0,..., α r ) = (i 0,...,i }{{} 0,...,i k,...,i }{{} k 1+µ 0 r [x; α q 1, α q ]f. (8) 1+µ k ) 5
6 Figure 2: Chain rule with f bivariate and n = (1, 1). for some k with 0 k r and 0 = i 0 < i 1 < < i k = n and µ 0 + +µ k = r k, with µ j 0. The product on the right of (8) is then r [x; α q 1, α q ]f = f µ 0 (x i0 )f µ 1 (x i1 ) f µ k (x ik ) q=1 and we obtain k [x;i j 1,i j ]f, j=1 [x;0,n](g f) = r k=0 0=i 0 < <i k =n µ 0 + +µ k =r k f µ 0 i 0 f µ k i k k [x;i j 1,i j ]f. (9) j=1 Now, observe that µ 0 + +µ k =r k f µ 0 i 0 f µ k i k = [f i0,...,f ik ]g, the divided difference of the monomial g(y) = y r at the points f i0,...,f ik. We substitute this identity into (9), and, then, since [f i0,...,f ik ]g = 0 if k > r, we can replace the upper limit r in the first sum in (9) by n. Similar to the product rule (5), formula (6) can be thought of as a sum over non-decreasing polygonal paths of vertices that connect 0 to n in the grid of points i, 0 i n. The number of line segments in the paths now varies, and is given by k. As long as n 0, the shortest path has one line segment (k = 1), and the longest paths have k = n line segments. Unlike the product rule, none of the line segments are degenerate, due to the strict inequality i j 1 < i j. Figure 1(b) can be used to illustrate the structure of the chain rule: it shows a path in (6) in the case k = 4. The shaded boxes indicate the divided differences of f in the sum in (6). 6
7 Figure 3: Chain rule with f bivariate and n = (2, 1). We write out a couple of examples of (6). In the bivariate case p = 2 with n = (1, 1) the formula has three terms. There is one term with k = 1, corresponding to the path (i 0,i 1 ) = (00, 11) (the first row of Figure 2) and two terms with k = 2 corresponding to the paths (i 0,i 1,i 2 ) = (00, 10, 11) and (i 0,i 1,i 2 ) = (00, 01, 11) (the second row of Figure 2); [x; 00, 11](g f) = [f 00, f 11 ]g [x; 00, 11]f + [f 00, f 10, f 11 ]g [x; 00, 10]f [x; 10, 11]f + [f 00, f 01, f 11 ]g [x; 00, 01]f [x; 01, 11]f. (10) In the case n = (2, 1), the formula is a sum over eight terms, one for each of the paths shown in Figure 3. The three rows in the figure show respectively: the unique path with k = 1 segment, the four paths with k = 2 segments, and the three paths with k = 3 segments, and the formula is [x; 00, 21](g f) = [f 00, f 21 ]g [x; 00, 21]f + [f 00, f 10, f 21 ]g [x; 00, 10]f [x; 10, 21]f + [f 00, f 20, f 21 ]g [x; 00, 20]f [x; 20, 21]f + [f 00, f 01, f 21 ]g [x; 00, 01]f [x; 01, 21]f + [f 00, f 11, f 21 ]g [x; 00, 11]f [x; 11, 21]f + [f 00, f 10, f 20, f 21 ]g [x; 00, 10]f [x; 10, 20]f [x; 20, 21]f + [f 00, f 10, f 11, f 21 ]g [x; 00, 10]f [x; 10, 11]f [x; 11, 21]f + [f 00, f 01, f 11, f 21 ]g [x; 00, 01]f [x; 01, 11]f [x; 11, 21]f. (11) 7
8 4 Chain rule: both functions multivariate Now we treat the full multivariate case, building on Theorem 1. We consider a composition g f in which f is a multivariate, vector-valued function f : R p R q and g is a multivariate scalar-valued function g : R q R. Theorem 2 If f : R p R q and g : R q R are smooth enough and f = (f 1,...,f q ) then, defining f r,i := f r (x i ), [x;0,n](g f) = n k=0 0=i 0 < <i k =n 0=j 0 j q=k [f 1,ij0,...,f 1,ij1 ;...; f q,ijq 1,...,f q,ijq ]g q j r r=1 j=j r 1 +1 [x;i j 1,i j ]f r. (12) Proof. Similar to the proof of Theorem 1, it is sufficient to prove the formula when g is a polynomial of the form g(y 1,...,y q ) = y r 1 1 y rq q, where 0 r j n j. Therefore, it is also sufficient to prove the formula in the more general case that g is the product of q univariate functions, g i : R R, i = 1,...,q, g(y 1,...,y q ) = g 1 (y 1 ) g q (y q ). (13) To show this, observe that with g in this form, the composition g f is given by g(f(x)) = g 1 (f 1 (x)) g q (f q (x)). (14) Then, due to the product rule (5), we have q [x;0,n](g f) = [x; α r 1, α r ](g r f r ). 0=α 0 α 1 α q=n r=1 Next, since g r is univariate, we can expand the divided differences on the right using the chain rule of Theorem 1. Note that these divided differences may have order 0, due to the possibility that α r 1 = α r, and this is why we allowed n = 0 (and consequently k = 0) in formula (6). With the shorthand A r (i 0,...,i k ) := [f r,i0,...,f r,ik ]g r 8 k [x;i j 1,i j ]f r, (15) j=1
9 for points i 0,...,i k R p and r = 1,...,q, we find [x;0,n](g f) = q 0=α 0 α 1 α q=n r=1 α r α r 1 k r=0 α r 1 =i r 0 < <ir kr =αr A r (i r 0,...,ir k ). Next, observe that since the sequence i r 0 < < ir k r in this expression connects α r 1 to α r, when we put all q of these sequences together we obtain a single increasing sequence that connects 0 to n. This means that we can rearrange the formula to be a single sum over paths connecting 0 to n, and over all possible choices of q sub-paths, with each sub-path contributing to one of the functions g r : [x;0,n](g f) = n k=0 0=i 0 < <i k =n 0=j 0 j q=k q A r (i jr 1,...,i jr ). To complete the proof, we expand the term A r using (15), and hence we obtain equation (12) for g of the form (13) because with this choice of g, r=1 q [f r,ijr 1,...,f r,ijr ]g r = [f 1,ij0,...,f 1,ij1 ;...;f q,ijq 1,...,f q,ijq ]g. r=1 We look at four examples. First, if p = 1 and q = 2, and setting a = f 1 and b = f 2, the composition has the form g(f(x)) = g(a(x), b(x)), and the formula with n = n = 1 is [x; 0, 1](g f) = [a 0, a 1 ; b 1 ]g [x; 0, 1]a + [a 0 ; b 0, b 1 ]g [x; 0, 1]b, (16) and with n = n = 2, [x; 0, 2](g f) = [a 0, a 2 ; b 2 ]g [x; 0, 2]a + [a 0 ; b 0, b 2 ]g [x; 0, 2]b + [a 0, a 1, a 2 ; b 2 ]g [x; 0, 1]a [x; 1, 2]a + [a 0, a 1 ; b 1, b 2 ]g [x; 0, 1]a [x; 1, 2]b + [a 0 ; b 0, b 1, b 2 ]g [x; 0, 1]b [x; 1, 2]b. (17) 9
10 If p = 2 and q = 2, with a = f 1 and b = f 2, the composition has the form g(f(x)) = g(a(x), b(x)), with x R 2. Specializing to n = (1, 1) we then obtain a sum over the three paths of Figure 2. But each path is now split into q = 2 parts, and there are k + 1 ways of splitting a path with k segments. Thus the total number of terms is = 8: [x; 00, 11](g f) = [a 00, a 11 ; b 11 ]g [x; 00, 11]a + [a 00 ; b 00, b 11 ]g [x; 00, 11]b + [a 00, a 10, a 11 ; b 11 ]g [x; 00, 10]a [x; 10, 11]a + [a 00, a 10 ; b 10, b 11 ]g [x; 00, 10]a [x; 10, 11]b + [a 00 ; b 00, b 10, b 11 ]g [x; 00, 10]b [x; 10, 11]b + [a 00, a 01, a 11 ; b 11 ]g [x; 00, 01]a [x; 01, 11]a + [a 00, a 01 ; b 01, b 11 ]g [x; 00, 01]a [x; 01, 11]b + [a 00 ; b 00, b 01, b 11 ]g [x; 00, 01]b [x; 01, 11]b. (18) If instead, n = (2, 1), the formula is a sum over the eight paths of Figure 3. We do not write it out but the number of terms is = Chain rule for derivatives Letting the points x k in equation (12) converge to x immediately gives a multivariate chain rule for derivatives. The points i r in the second sum in (12) are no longer specifically needed in the derivative version; the order of the partial derivative of f r depends only on the vector difference α r := i r i r 1. Thus, summing over the α r instead of the i r, the derivative formula is D n (g f)(x) n! = n k=0 α 1 + +α k =n 0=j 0 j q=k D j g(f(x)) j! q j r r=1 j=j r 1 +1 D α j f r (x), (19) α j! where the second sum is over α r > 0, and j := (j 1 j 0,...,j q j q 1 ). This equation contains, in general, repeated terms, unlike Faa di Bruno s formula and the multivariate formula in [4]. It could be reformulated to avoid repeats by summing over partitions of vector integers using the same approach as that of the conversion of equation (25) of [8] to equation (26) of [8]. Instead we simply gives some examples, taking, for comparison, the same cases that we looked at earlier for divided differences. Specializing (19) 10
11 to the cases treated in (3), (10 11), (16 17), and (18), one obtains, after cancelling factorials and drawing together repeated terms, their respective derivative counterparts: (g f) = g f + 3g f f + g (f ) 3, D 11 (g f) = g D 11 f + g D 10 fd 01 f, D 21 (g f) = g D 21 f + g (D 20 fd 01 f + 2D 10 fd 11 f) + g (D 10 f) 2 D 01 f, (g f) = D 10 g a + D 01 g b, (g f) = D 10 g a + D 01 g b + D 20 g (a ) 2 + 2D 11 g a b + D 02 g (b ) 2, and D 11 (g f) = D 10 g D 11 a + D 01 g D 11 b + D 20 g D 10 a D 01 a + D 11 g D 10 a D 01 b + D 11 g D 01 a D 10 b + D 02 g D 01 bd 10 b. References [1] C. de Boor, A Leibniz formula for multivariate divided differences, SIAM J. Numer. Anal. 41 (2003), [2] C. de Boor, A multivariate divided difference, in Approximation Theory VIII, Vol 1: Approximation and Interpolation, C. K. Chui and L. L. Schumaker (eds.), World Scientific, Singapore, 1995, pp [3] C. de Boor, Divided differences, Surveys in Approximation Theory 1 (2005), [4] G. M. Constantine and T. H. Savits, A multivariate Faa di Bruno formula with applications. Trans. Amer. Math. Soc. 348 (1996), [5] C. F. Faa di Bruno, Note sur une nouvelle formule de calcul differentiel, Quarterly J. Pure Appl. Math, 1 (1857), [6] M. S. Floater, Arc length estimation and the convergence of parametric polynomial interpolation, BIT 45 (2005),
12 [7] M. S. Floater, Chordal cubic spline interpolation is fourth order accurate, IMA J. Numer. Anal. 26 (2006), [8] M. S. Floater and T. Lyche, Two chain rules for divided differences and Faa di Bruno s formula, Math. Comp. 76 (2007), [9] M. S. Floater and T. Lyche, Divided differences of inverse functions and partitions of a convex polygon, Math. Comp. 77 (2008), [10] E. Isaacson and H. B. Keller, Analysis of numerical methods, Wiley, [11] W. P. Johnson, The curious history of Faa di Bruno s formula, Amer. Math. Monthly 109 (2002), [12] C. Jordan, Calculus of finite differences, Chelsea, New York, [13] D. Knuth, The art of computer programming, Vol I, Addison Wesley, [14] C. A. Micchelli, A constructive approach to Kergin interpolation in R k : multivariate B-splines and Lagrange interpolation, Rocky Mountain J. Math. 10 (1979), [15] K. Mørken and K. Scherer, A general framework for high-accuracy parametric interpolation, Math. Comp. 66 (1997), [16] T. Popoviciu, Sur quelques propriétés des fonctions d une ou de deux variables reélles, dissertation, presented at the Faculté des Sciences de Paris, published by Institutul de Arte Grafice Ardealul (Cluj, Romania), [17] T. Popoviciu, Introduction à la théorie des différences divisées, Bull. Math. Soc. Roumaine Sciences 42 (1940), [18] J. Riordan, Derivatives of composite functions, Bull. Amer. Math. Soc. 52 (1946), [19] J. Riordan, An introduction to combinatorial analysis, John Wiley, New York,
13 [20] S. Roman, The formula of Faa di Bruno, Amer. Math. Monthly 87 (1980), [21] T. Sauer, Polynomial interpolation in several variables: lattices, differences, and ideals, in Topics in multivariate approximation and interpolation, K. Jetter et al. (eds.), Elsevier, 2006, pp [22] J. F. Steffensen, Note on divided differences, Danske Vid. Selsk. Math.- Fys. Medd 17 (1939), [23] X. Wang and H. Wang, On the divided difference form of Faà di Bruno s formula, J. Comp. Math. 24 (2006),
Two 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 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 informationA NOTE ON DIVIDED DIFFERENCES. Ioan Gavrea and Mircea Ivan
PUBLICATIONS DE L INSTITUT MATHÉMATIQUE Nouvelle série, tome 98(112) (2015), 147 151 DOI: 10.2298/PIM1512147G A NOTE ON DIVIDED DIFFERENCES Ioan Gavrea and Mircea Ivan Abstract. We obtain a new recurrence
More informationChordal cubic spline interpolation is fourth order accurate
Chordal cubic spline interpolation is fourth order accurate Michael S. Floater Abstract: It is well known that complete cubic spline interpolation of functions with four continuous derivatives is fourth
More informationBarycentric rational interpolation with no poles and high rates of approximation
Barycentric rational interpolation with no poles and high rates of approximation Michael S. Floater Kai Hormann Abstract It is well known that rational interpolation sometimes gives better approximations
More informationExtrapolation Methods for Approximating Arc Length and Surface Area
Extrapolation Methods for Approximating Arc Length and Surface Area Michael S. Floater, Atgeirr F. Rasmussen and Ulrich Reif March 2, 27 Abstract A well-known method of estimating the length of a parametric
More informationNodal bases for the serendipity family of finite elements
Foundations of Computational Mathematics manuscript No. (will be inserted by the editor) Nodal bases for the serendipity family of finite elements Michael S. Floater Andrew Gillette Received: date / Accepted:
More informationNonlinear Means in Geometric Modeling
Nonlinear Means in Geometric Modeling Michael S. Floater SINTEF P. O. Box 124 Blindern, 0314 Oslo, Norway E-mail: Michael.Floater@math.sintef.no Charles A. Micchelli IBM Corporation T.J. Watson Research
More information290 J.M. Carnicer, J.M. Pe~na basis (u 1 ; : : : ; u n ) consisting of minimally supported elements, yet also has a basis (v 1 ; : : : ; v n ) which f
Numer. Math. 67: 289{301 (1994) Numerische Mathematik c Springer-Verlag 1994 Electronic Edition Least supported bases and local linear independence J.M. Carnicer, J.M. Pe~na? Departamento de Matematica
More informationConvergence rates of derivatives of a family of barycentric rational interpolants
Convergence rates of derivatives of a family of barycentric rational interpolants J.-P. Berrut, M. S. Floater and G. Klein University of Fribourg (Switzerland) CMA / IFI, University of Oslo jean-paul.berrut@unifr.ch
More informationCurvature variation minimizing cubic Hermite interpolants
Curvature variation minimizing cubic Hermite interpolants Gašper Jaklič a,b, Emil Žagar,a a FMF and IMFM, University of Ljubljana, Jadranska 19, Ljubljana, Slovenia b PINT, University of Primorska, Muzejski
More informationReceived: 2/7/07, Revised: 5/25/07, Accepted: 6/25/07, Published: 7/20/07 Abstract
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 7 2007, #A34 AN INVERSE OF THE FAÀ DI BRUNO FORMULA Gottlieb Pirsic 1 Johann Radon Institute of Computational and Applied Mathematics RICAM,
More informationOn a bivariate interpolation formula
Proc. of the 8th WSEAS Int. Conf. on Mathematical Methods and Computational Techniques in Electrical Engineering, Bucharest, October 16-17, 2006 113 On a bivariate interpolation formula DANA SIMIAN Lucian
More informationA generalized mean value property for polyharmonic functions
A generalized mean value property for polyharmonic functions Michael S. Floater December 1, 015 Abstract A well known property of a harmonic function in a ball is that its value at the centreequalsthemeanofitsvaluesontheboundary.
More informationEVALUATION OF A FAMILY OF BINOMIAL DETERMINANTS
EVALUATION OF A FAMILY OF BINOMIAL DETERMINANTS CHARLES HELOU AND JAMES A SELLERS Abstract Motivated by a recent work about finite sequences where the n-th term is bounded by n, we evaluate some classes
More informationGEOMETRIC MODELLING WITH BETA-FUNCTION B-SPLINES, I: PARAMETRIC CURVES
International Journal of Pure and Applied Mathematics Volume 65 No. 3 2010, 339-360 GEOMETRIC MODELLING WITH BETA-FUNCTION B-SPLINES, I: PARAMETRIC CURVES Arne Lakså 1, Børre Bang 2, Lubomir T. Dechevsky
More informationWhy Do Partitions Occur in Faà di Bruno s Chain Rule For Higher Derivatives?
Why Do Partitions Occur in Faà di Bruno s Chain Rule For Higher Derivatives? arxiv:math/0602183v1 [math.gm] 9 Feb 2006 Eliahu Levy Department of Mathematics Technion Israel Institute of Technology, Haifa
More informationMULTIVARIATE BIRKHOFF-LAGRANGE INTERPOLATION SCHEMES AND CARTESIAN SETS OF NODES. 1. Introduction
Acta Math. Univ. Comenianae Vol. LXXIII, 2(2004), pp. 217 221 217 MULTIVARIATE BIRKHOFF-LAGRANGE INTERPOLATION SCHEMES AND CARTESIAN SETS OF NODES N. CRAINIC Abstract. In this paper we study the relevance
More informationConstruction of Smooth Fractal Surfaces Using Hermite Fractal Interpolation Functions. P. Bouboulis, L. Dalla and M. Kostaki-Kosta
BULLETIN OF THE GREEK MATHEMATICAL SOCIETY Volume 54 27 (79 95) Construction of Smooth Fractal Surfaces Using Hermite Fractal Interpolation Functions P. Bouboulis L. Dalla and M. Kostaki-Kosta Received
More informationDiscrete Orthogonal Polynomials on Equidistant Nodes
International Mathematical Forum, 2, 2007, no. 21, 1007-1020 Discrete Orthogonal Polynomials on Equidistant Nodes Alfredo Eisinberg and Giuseppe Fedele Dip. di Elettronica, Informatica e Sistemistica Università
More informationAbstract. 1. Introduction
Journal of Computational Mathematics Vol.28, No.2, 2010, 273 288. http://www.global-sci.org/jcm doi:10.4208/jcm.2009.10-m2870 UNIFORM SUPERCONVERGENCE OF GALERKIN METHODS FOR SINGULARLY PERTURBED PROBLEMS
More informationAN EXPLICIT FORMULA FOR BERNOULLI POLYNOMIALS IN TERMS OF r-stirling NUMBERS OF THE SECOND KIND
ROCKY MOUNTAIN JOURNAL OF MATHEMATICS Volume 46, Number 6, 2016 AN EXPLICIT FORMULA FOR BERNOULLI POLYNOMIALS IN TERMS OF r-stirling NUMBERS OF THE SECOND KIND BAI-NI GUO, ISTVÁN MEZŐ AND FENG QI ABSTRACT.
More informationA Survey of Parking Functions
A Survey of Parking Functions Richard P. Stanley M.I.T. Parking functions... n 2 1... a a a 1 2 n Car C i prefers space a i. If a i is occupied, then C i takes the next available space. We call (a 1,...,a
More informationAlgebro-geometric aspects of Heine-Stieltjes theory
Dedicated to Heinrich Eduard Heine and his 4 years old riddle Algebro-geometric aspects of Heine-Stieltjes theory Boris Shapiro, Stockholm University, shapiro@math.su.se February, 9 Introduction and main
More informationThe multiplicity of a spline zero
The multiplicity of a spline zero Carl de Boor Department of Computer Sciences University of Wisconsin-Madison 1210 West Dayton Street Madison WI 563706-1685 USA deboor@cs.wisc.edu Abstract. The multiplicity
More informationAn O(h 2n ) Hermite approximation for conic sections
An O(h 2n ) Hermite approximation for conic sections Michael Floater SINTEF P.O. Box 124, Blindern 0314 Oslo, NORWAY November 1994, Revised March 1996 Abstract. Given a segment of a conic section in the
More informationPOLYNOMIAL INTERPOLATION, IDEALS AND APPROXIMATION ORDER OF MULTIVARIATE REFINABLE FUNCTIONS
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 00, Number 0, Pages 000 000 S 0002-9939(XX)0000-0 POLYNOMIAL INTERPOLATION, IDEALS AND APPROXIMATION ORDER OF MULTIVARIATE REFINABLE FUNCTIONS THOMAS
More informationA DISCRETE VIEW OF FAÀ DI BRUNO. 1. Introduction. How are the following two problems related?
ROCKY MOUNTAIN JOURNAL OF MATHEMATICS Volume 46, Number, 06 A DISCRETE VIEW OF FAÀ DI BRUNO RAYMOND A BEAUREGARD AND VLADIMIR A DOBRUSHKIN ABSTRACT It is shown how solving a discrete convolution problem
More informationApplication of modified Leja sequences to polynomial interpolation
Special Issue for the years of the Padua points, Volume 8 5 Pages 66 74 Application of modified Leja sequences to polynomial interpolation L. P. Bos a M. Caliari a Abstract We discuss several applications
More informationApplied Numerical Analysis Quiz #2
Applied Numerical Analysis Quiz #2 Modules 3 and 4 Name: Student number: DO NOT OPEN UNTIL ASKED Instructions: Make sure you have a machine-readable answer form. Write your name and student number in the
More informationInterpolation and polynomial approximation Interpolation
Outline Interpolation and polynomial approximation Interpolation Lagrange Cubic Splines Approximation B-Splines 1 Outline Approximation B-Splines We still focus on curves for the moment. 2 3 Pierre Bézier
More informationKatholieke Universiteit Leuven Department of Computer Science
Interpolation with quintic Powell-Sabin splines Hendrik Speleers Report TW 583, January 2011 Katholieke Universiteit Leuven Department of Computer Science Celestijnenlaan 200A B-3001 Heverlee (Belgium)
More informationLagrange Interpolation and Neville s Algorithm. Ron Goldman Department of Computer Science Rice University
Lagrange Interpolation and Neville s Algorithm Ron Goldman Department of Computer Science Rice University Tension between Mathematics and Engineering 1. How do Mathematicians actually represent curves
More informationSharp inequalities and complete monotonicity for the Wallis ratio
Sharp inequalities and complete monotonicity for the Wallis ratio Cristinel Mortici Abstract The aim of this paper is to prove the complete monotonicity of a class of functions arising from Kazarinoff
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 information#A6 INTEGERS 17 (2017) AN IMPLICIT ZECKENDORF REPRESENTATION
#A6 INTEGERS 17 (017) AN IMPLICIT ZECKENDORF REPRESENTATION Martin Gri ths Dept. of Mathematical Sciences, University of Essex, Colchester, United Kingdom griffm@essex.ac.uk Received: /19/16, Accepted:
More information1. Introduction Definition 1.1. Let r 1 be an integer. The r-generalized Fibonacci sequence {G n } is defined as
SOME IDENTITIES FOR r-fibonacci NUMBERS F. T. HOWARD AND CURTIS COOPER Abstract. Let r 1 be an integer. The r-generalized Fibonacci sequence {G n} is defined as 8 >< 0, if 0 n < r 1; G n = 1, if n = r
More informationOn the usage of lines in GC n sets
On the usage of lines in GC n sets Hakop Hakopian, Vahagn Vardanyan arxiv:1807.08182v3 [math.co] 16 Aug 2018 Abstract A planar node set X, with X = ( ) n+2 2 is called GCn set if each node possesses fundamental
More informationA NOTE ON MATRIX REFINEMENT EQUATIONS. Abstract. Renement equations involving matrix masks are receiving a lot of attention these days.
A NOTE ON MATRI REFINEMENT EQUATIONS THOMAS A. HOGAN y Abstract. Renement equations involving matrix masks are receiving a lot of attention these days. They can play a central role in the study of renable
More informationUNIT 2 FACTORING. M2 Ch 11 all
UNIT 2 FACTORING M2 Ch 11 all 2.1 Polynomials Objective I will be able to put polynomials in standard form and identify their degree and type. I will be able to add and subtract polynomials. Vocabulary
More informationNonlinear Stationary Subdivision
Nonlinear Stationary Subdivision Michael S. Floater SINTEF P. O. Box 4 Blindern, 034 Oslo, Norway E-mail: michael.floater@math.sintef.no Charles A. Micchelli IBM Corporation T.J. Watson Research Center
More information1 Basic Combinatorics
1 Basic Combinatorics 1.1 Sets and sequences Sets. A set is an unordered collection of distinct objects. The objects are called elements of the set. We use braces to denote a set, for example, the set
More informationNonstationary Subdivision Schemes and Totally Positive Refinable Functions
Nonstationary Subdivision Schemes and Totally Positive Refinable Functions Laura Gori and Francesca Pitolli December, 2007 Abstract In this paper we construct a class of totally positive refinable functions,
More informationF. T. HOWARD AND CURTIS COOPER
SOME IDENTITIES FOR r-fibonacci NUMBERS F. T. HOWARD AND CURTIS COOPER Abstract. Let r 1 be an integer. The r-generalized Fibonacci sequence {G n} is defined as 0, if 0 n < r 1; G n = 1, if n = r 1; G
More informationLecture 10 Polynomial interpolation
Lecture 10 Polynomial interpolation Weinan E 1,2 and Tiejun Li 2 1 Department of Mathematics, Princeton University, weinan@princeton.edu 2 School of Mathematical Sciences, Peking University, tieli@pku.edu.cn
More informationCombinatorial Interpretations of a Generalization of the Genocchi Numbers
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 7 (2004), Article 04.3.6 Combinatorial Interpretations of a Generalization of the Genocchi Numbers Michael Domaratzki Jodrey School of Computer Science
More informationCONTROLLABILITY OF NONLINEAR DISCRETE SYSTEMS
Int. J. Appl. Math. Comput. Sci., 2002, Vol.2, No.2, 73 80 CONTROLLABILITY OF NONLINEAR DISCRETE SYSTEMS JERZY KLAMKA Institute of Automatic Control, Silesian University of Technology ul. Akademicka 6,
More informationA sharp upper bound on the approximation order of smooth bivariate pp functions C. de Boor and R.Q. Jia
A sharp upper bound on the approximation order of smooth bivariate pp functions C. de Boor and R.Q. Jia Introduction It is the purpose of this note to show that the approximation order from the space Π
More informationKernel B Splines and Interpolation
Kernel B Splines and Interpolation M. Bozzini, L. Lenarduzzi and R. Schaback February 6, 5 Abstract This paper applies divided differences to conditionally positive definite kernels in order to generate
More information5.1 Polynomial Functions
5.1 Polynomial Functions In this section, we will study the following topics: Identifying polynomial functions and their degree Determining end behavior of polynomial graphs Finding real zeros of polynomial
More informationSolutions Final Exam May. 14, 2014
Solutions Final Exam May. 14, 2014 1. (a) (10 points) State the formal definition of a Cauchy sequence of real numbers. A sequence, {a n } n N, of real numbers, is Cauchy if and only if for every ɛ > 0,
More informationCarl de Boor. Introduction
Multivariate polynomial interpolation: A GC 2 -set in R 4 without a maximal hyperplane Carl de Boor Abstract. A set T R d at which interpolation from Π n (R d ) (polynomials of degree n) is uniquely possible
More informationGenerating Orthogonal Polynomials and their Derivatives using Vertex Matching-Partitions of Graphs
Generating Orthogonal Polynomials and their Derivatives using Vertex Matching-Partitions of Graphs John P. McSorley, Philip Feinsilver Department of Mathematics Southern Illinois University Carbondale,
More informationUSA Mathematical Talent Search Round 1 Solutions Year 27 Academic Year
1/1/27. Fill in the spaces of the grid to the right with positive integers so that in each 2 2 square with top left number a, top right number b, bottom left number c, and bottom right number d, either
More informationFinite element function approximation
THE UNIVERSITY OF WESTERN ONTARIO LONDON ONTARIO Paul Klein Office: SSC 4028 Phone: 661-2111 ext. 85227 Email: paul.klein@uwo.ca URL: www.ssc.uwo.ca/economics/faculty/klein/ Economics 613/614 Advanced
More informationPapers Published. Edward Neuman. Department of Mathematics, Southern Illinois University, Carbondale. and
Papers Published Edward Neuman Department of Mathematics, Southern Illinois University, Carbondale and Mathematical Research Institute, 144 Hawthorn Hollow, Carbondale, IL, 62903, USA 134. On Yang means
More informationApproximation by Conditionally Positive Definite Functions with Finitely Many Centers
Approximation by Conditionally Positive Definite Functions with Finitely Many Centers Jungho Yoon Abstract. The theory of interpolation by using conditionally positive definite function provides optimal
More informationA Symbolic Derivation of Beta-splines of Arbitrary Order
A Symbolic Derivation of Beta-splines of Arbitrary Order GADIEL SEROUSSI Hewlett-Packard Laboratories, 151 Page Mill Road Palo Alto, California 9434 BRIAN A BARSKY Computer Science Division, University
More informationCounting k-marked Durfee Symbols
Counting k-marked Durfee Symbols Kağan Kurşungöz Department of Mathematics The Pennsylvania State University University Park PA 602 kursun@math.psu.edu Submitted: May 7 200; Accepted: Feb 5 20; Published:
More informationUSA Mathematical Talent Search Round 2 Solutions Year 27 Academic Year
1/2/27. In the grid to the right, the shortest path through unit squares between the pair of 2 s has length 2. Fill in some of the unit squares in the grid so that (i) exactly half of the squares in each
More informationA SOLUTION TO SHEIL-SMALL S HARMONIC MAPPING PROBLEM FOR POLYGONS. 1. Introduction
A SOLUTION TO SHEIL-SMALL S HARMONIC MAPPING PROLEM FOR POLYGONS DAOUD SHOUTY, ERIK LUNDERG, AND ALLEN WEITSMAN Abstract. The problem of mapping the interior of a Jordan polygon univalently by the Poisson
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 information1. Introduction
Séminaire Lotharingien de Combinatoire 49 (2002), Article B49a AVOIDING 2-LETTER SIGNED PATTERNS T. MANSOUR A AND J. WEST B A LaBRI (UMR 5800), Université Bordeaux, 35 cours de la Libération, 33405 Talence
More informationExplicit polynomial expansions of regular real functions by means of even order Bernoulli polynomials and boundary values
Journal of Computational and Applied Mathematics 176 (5 77 9 www.elsevier.com/locate/cam Explicit polynomial expansions of regular real functions by means of even order Bernoulli polynomials and boundary
More informationRESEARCH ARTICLE. An extension of the polytope of doubly stochastic matrices
Linear and Multilinear Algebra Vol. 00, No. 00, Month 200x, 1 15 RESEARCH ARTICLE An extension of the polytope of doubly stochastic matrices Richard A. Brualdi a and Geir Dahl b a Department of Mathematics,
More informationCHAPTER 10 Shape Preserving Properties of B-splines
CHAPTER 10 Shape Preserving Properties of B-splines In earlier chapters we have seen a number of examples of the close relationship between a spline function and its B-spline coefficients This is especially
More informationGenerating functions and enumerative geometry
Generating functions and enumerative geometry Ragni Piene Centre of Mathematics for Applications and Department of Mathematics, University of Oslo October 26, 2005 KTH, Stockholm Generating functions Enumerative
More informationSymmetric polynomials and symmetric mean inequalities
Symmetric polynomials and symmetric mean inequalities Karl Mahlburg Department of Mathematics Louisiana State University Baton Rouge, LA 70803, U.S.A. mahlburg@math.lsu.edu Clifford Smyth Department of
More informationEmpirical Models Interpolation Polynomial Models
Mathematical Modeling Lia Vas Empirical Models Interpolation Polynomial Models Lagrange Polynomial. Recall that two points (x 1, y 1 ) and (x 2, y 2 ) determine a unique line y = ax + b passing them (obtained
More informationBackward divided difference: Representation of numerical data by a polynomial curve
2017; 2(2): 01-06 ISSN: 2456-1452 Maths 2017; 2(2): 01-06 2017 Stats & Maths www.mathsjournal.com Received: 01-01-2017 Accepted: 02-02-2017 Biswajit Das Research Scholar, Assam Down Town University, Panikhaiti,
More informationLecture 1 INF-MAT : Chapter 2. Examples of Linear Systems
Lecture 1 INF-MAT 4350 2010: Chapter 2. Examples of Linear Systems Tom Lyche Centre of Mathematics for Applications, Department of Informatics, University of Oslo August 26, 2010 Notation The set of natural
More informationPartititioned Methods for Multifield Problems
Partititioned Methods for Multifield Problems Joachim Rang, 22.7.215 22.7.215 Joachim Rang Partititioned Methods for Multifield Problems Seite 1 Non-matching matches usually the fluid and the structure
More informationarxiv: v1 [cs.it] 12 Jun 2016
New Permutation Trinomials From Niho Exponents over Finite Fields with Even Characteristic arxiv:606.03768v [cs.it] 2 Jun 206 Nian Li and Tor Helleseth Abstract In this paper, a class of permutation trinomials
More informationTHE CLASSIFICATION OF PLANAR MONOMIALS OVER FIELDS OF PRIME SQUARE ORDER
THE CLASSIFICATION OF PLANAR MONOMIALS OVER FIELDS OF PRIME SQUARE ORDER ROBERT S COULTER Abstract Planar functions were introduced by Dembowski and Ostrom in [3] to describe affine planes possessing collineation
More informationA q-analogue OF THE GENERALIZED FACTORIAL NUMBERS
J. Korean Math. Soc. 47 (2010), No. 3, pp. 645 657 DOI 10.4134/JKMS.2010.47.3.645 A q-analogue OF THE GENERALIZED FACTORIAL NUMBERS Seok-Zun Song, Gi-Sang Cheon, Young-Bae Jun, and LeRoy B. Beasley Abstract.
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 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 informationOn Multivariate Newton Interpolation at Discrete Leja Points
On Multivariate Newton Interpolation at Discrete Leja Points L. Bos 1, S. De Marchi 2, A. Sommariva 2, M. Vianello 2 September 25, 2011 Abstract The basic LU factorization with row pivoting, applied to
More informationApplied and Computational Harmonic Analysis 11, (2001) doi: /acha , available online at
Applied and Computational Harmonic Analysis 11 305 31 (001 doi:10.1006/acha.001.0355 available online at http://www.idealibrary.com on LETTER TO THE EDITOR Construction of Multivariate Tight Frames via
More informationSplines which are piecewise solutions of polyharmonic equation
Splines which are piecewise solutions of polyharmonic equation Ognyan Kounchev March 25, 2006 Abstract This paper appeared in Proceedings of the Conference Curves and Surfaces, Chamonix, 1993 1 Introduction
More informationOn a max norm bound for the least squares spline approximant. Carl de Boor University of Wisconsin-Madison, MRC, Madison, USA. 0.
in Approximation and Function Spaces Z Ciesielski (ed) North Holland (Amsterdam), 1981, pp 163 175 On a max norm bound for the least squares spline approximant Carl de Boor University of Wisconsin-Madison,
More informationStrictly Positive Definite Functions on a Real Inner Product Space
Strictly Positive Definite Functions on a Real Inner Product Space Allan Pinkus Abstract. If ft) = a kt k converges for all t IR with all coefficients a k 0, then the function f< x, y >) is positive definite
More informationPublications: Journal Articles
Publications: Over 80 total publications and presentations, including over 46 refereed journal articles, 6 books, over 25 papers, refereed and published in conference proceedings, one submitted work, and
More informationCOMBINATORIAL REPRESENTATION OF GENERALIZED FIBONACCI NUMBERS* Shmuel T. Klein Bar-Ilan University, Ramat-Gan , Israel (Submitted April 1989)
COMBINATORIAL REPRESENTATION OF GENERALIZED FIBONACCI NUMBERS* Shmuel T. Klein Bar-Ilan University, Ramat-Gan 52 900, Israel (Submitted April 1989) 1. Introduction A well-known combinatorial formula for
More informationM2R IVR, October 12th Mathematical tools 1 - Session 2
Mathematical tools 1 Session 2 Franck HÉTROY M2R IVR, October 12th 2006 First session reminder Basic definitions Motivation: interpolate or approximate an ordered list of 2D points P i n Definition: spline
More informationBarycentric coordinates for Lagrange interpolation over lattices on a simplex
Barycentric coordinates for Lagrange interpolation over lattices on a simplex Gašper Jaklič gasper.jaklic@fmf.uni-lj.si, Jernej Kozak jernej.kozak@fmf.uni-lj.si, Marjeta Krajnc marjetka.krajnc@fmf.uni-lj.si,
More informationGAKUTO International Series
GAKUTO International Series Mathematical Sciences and Applications, Vol.28(2008) Proceedings of Fourth JSIAM-SIMMAI Seminar on Industrial and Applied Mathematics, pp.139-148 A COMPUTATIONAL APPROACH TO
More informationA strongly rigid binary relation
A strongly rigid binary relation Anne Fearnley 8 November 1994 Abstract A binary relation ρ on a set U is strongly rigid if every universal algebra on U such that ρ is a subuniverse of its square is trivial.
More informationDIRECT ERROR BOUNDS FOR SYMMETRIC RBF COLLOCATION
Meshless Methods in Science and Engineering - An International Conference Porto, 22 DIRECT ERROR BOUNDS FOR SYMMETRIC RBF COLLOCATION Robert Schaback Institut für Numerische und Angewandte Mathematik (NAM)
More informationConstruction of `Wachspress type' rational basis functions over rectangles
Proc. Indian Acad. Sci. (Math. Sci.), Vol. 110, No. 1, February 2000, pp. 69±77. # Printed in India Construction of `Wachspress type' rational basis functions over rectangles P L POWAR and S S RANA Department
More informationTwo Point Methods For Non Linear Equations Neeraj Sharma, Simran Kaur
28 International Journal of Advance Research, IJOAR.org Volume 1, Issue 1, January 2013, Online: Two Point Methods For Non Linear Equations Neeraj Sharma, Simran Kaur ABSTRACT The following paper focuses
More informationarxiv: v1 [math.nt] 17 Nov 2011
On the representation of k sequences of generalized order-k numbers arxiv:11114057v1 [mathnt] 17 Nov 2011 Kenan Kaygisiz a,, Adem Sahin a a Department of Mathematics, Faculty of Arts Sciences, Gaziosmanpaşa
More informationSome Observations on Interpolation in Higher Dimensions
MATHEMATICS OF COMPUTATION, VOLUME 24, NUMBER 111, JULY, 1970 Some Observations on Interpolation in Higher Dimensions By R. B. Guenther and E. L. Roetman Abstract. This paper presents a method, based on
More informationFunction Approximation
1 Function Approximation This is page i Printer: Opaque this 1.1 Introduction In this chapter we discuss approximating functional forms. Both in econometric and in numerical problems, the need for an approximating
More informationConvex Domino Towers
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 20 (2017, Article 17.3.1 Convex Domino Towers Tricia Muldoon Brown Department of Mathematics Armstrong State University 11935 Abercorn Street Savannah,
More informationAn unconditionally convergent method for computing zeros of splines and polynomials
An unconditionally convergent method for computing zeros of splines and polynomials Knut Mørken and Martin Reimers November 24, 2005 Abstract We present a simple and efficient method for computing zeros
More informationRising 8th Grade Math. Algebra 1 Summer Review Packet
Rising 8th Grade Math Algebra 1 Summer Review Packet 1. Clear parentheses using the distributive property. 2. Combine like terms within each side of the equal sign. Solving Multi-Step Equations 3. Add/subtract
More informationQuasi-copulas and signed measures
Quasi-copulas and signed measures Roger B. Nelsen Department of Mathematical Sciences, Lewis & Clark College, Portland (USA) José Juan Quesada-Molina Department of Applied Mathematics, University of Granada
More informationON A WEIGHTED INTERPOLATION OF FUNCTIONS WITH CIRCULAR MAJORANT
ON A WEIGHTED INTERPOLATION OF FUNCTIONS WITH CIRCULAR MAJORANT Received: 31 July, 2008 Accepted: 06 February, 2009 Communicated by: SIMON J SMITH Department of Mathematics and Statistics La Trobe University,
More informationNumerische Mathematik
Numer. Math. (997) 76: 479 488 Numerische Mathematik c Springer-Verlag 997 Electronic Edition Exponential decay of C cubic splines vanishing at two symmetric points in each knot interval Sang Dong Kim,,
More information