BIVARIATE LAGRANGE INTERPOLATION AT THE PADUA POINTS: THE IDEAL THEORY APPROACH
|
|
- Myles Anthony
- 6 years ago
- Views:
Transcription
1 BIVARIATE LAGRANGE INTERPOLATION AT THE PADUA POINTS: THE IDEAL THEORY APPROACH LEN BOS, STEFANO DE MARCHI, MARCO VIANELLO, AND YUAN XU Abstract The Padua points are a family of points on the square [, ] given by explicit formulas that admits unique Lagrange interpolation by bivariate polynomials Interpolation polynomials and cubature formulas based on the Padua points are studied from an ideal theoretic point of view, which leads to the discovery of a compact formula for the interpolation polynomials The L p convergence of the interpolation polynomials is also studied Introduction For polynomial interpolation in one variable, the Chebyshev points (zeros of Chebyshev polynomial) are optimal in many ways Let L n f be the n-th Lagrange interpolation polynomial based on the Chebyshev points The Lebesgue constant L n in the uniform norm on [,] has growth of order of O(log n), which is the minimal rate of growth of any projection operator from C[,] onto the space of polynomials of degree at most n The Chebyshev points are also the nots of the Gaussian quadrature formula for the weight function / x on [,] In the case of two variables, it is often difficult to even give explicit point sets for which the polynomial interpolation problem is well-posed, or unisolvent Let Π n denote the space of polynomials of degree at most n in two variables It is well nown that dim Π n = (n + )(n + )/ Then consider a set V of points in R of cardinality V = dim Π n The set V is said to be unisolvent if for any given function f defined on R, there is a unique polynomial P such that P(x) = f(x) on V The Padua points are a family of interpolation points that may legitimately be considered as an analogue of the Chebyshev points for the square [,] For each n 0, they are defined by () Pad n = {x,j = (ξ,η j ), 0 n, j n + + δ }, where δ := 0 if n is even or n is odd but is even, δ := if n is odd and is odd, and () ξ = cos π cos j n, η n+ π, even j = cos j n+ π, odd Date: February 8, Mathematics Subject Classification 4A05, 4A0 Key words and phrases bivariate Lagrange interpolation, Padua points, polynomial ideal The second and the third authors were supported by the ex-60% funds of the University of Padua and by the INdAM GNCS (Italian National Group for Scientific Computing) The fourth author was partially supported by NSF Grant DMS
2 LEN BOS, STEFANO DE MARCHI, MARCO VIANELLO, AND YUAN XU Padua Points for n= Figure It is easy to verify that the cardinality of Pad n is equal to the dimension of Π n These points were introduced heuristically in [4] (only for even degrees) and proved to be unisolvent in [3] The Lebesgue constant of the Lagrange interpolation based on the Padua points in the uniform norm grows lie O((log n) ), which is the minimal order of growth for any set of interpolation points in the square Moroever, there is a cubature formula of degree n based on these points for the weight function /( x y ) on [,] ([3]) A family of points studied in [0] also possesses similar properties ([,, 0]), but the cardinality of the set is not equal to dim Π n and the interpolation polynomial belongs to a subspace of Π n The study in [3] starts from the fact that the Padua points there lie on a single generating curve, γ n (t) = (cos(nt),cos((n + )t), 0 t π In fact, the points are exactly the distinct points among {γ n ( π n(n+) ), 0 n(n + )} In the present paper, we study the interpolation on the Padua points using an ideal theoretic approach, which considers the points as the variety of a polynomial ideal and it treats the cubature formula based on the interpolation points simultaneously The advantage of this approach is that it casts the result on Padua points into a general theoretic framewor The study in [0] used such an approach In particular, it shows how the compact formula of the interpolation polynomial arises naturally The order of the Lebesgue constant of the interpolation is found in [3], which solves the problem about the convergence of the interpolation polynomials on the
3 BIVARIATE LAGRANGE INTERPOLATION AT PADUA POINTS 3 Padua points in the uniform norm In the present paper, we show the convergence in a weighted L p norm The paper is organized as follows In the following section, we review the necessary bacground and show that the Padua points are unisolvent The explicit formula of the Lagrange interpolation polynomials is derived in Section 3, and the L p convergence of the interpolation polynomials is proved in Section 4 Polynomial ideal and Padua points Polynomial ideals, interpolation, and cubature formulas We first recall some notation and results about polynomial ideals and their relation to polynomial interpolation and cubature formulas To eep the notation simple we shall restrict to the case of two variables, even though all results in this subsection hold for more than two variables Let I be a polynomial ideal in R[x] with x = (x,x ), the ring of all polynomials in two variables If there are polynomials f,,f r in R[x] such that every f I can be written as f = a f ++a r f r, a j R[x], then we say that I is generated by the basis {f,,f r } and we write I = f,,f r Fix a monomial order, say the lexicographical order, and let LT(f) denote the leading term of the polynomial f in the monomial order Let LT(I) denote the ideal generated by the leading terms of LT(f) for all f I \ {0} Then it is is well nown that there is an isomorphism between R[x]/I and the space S I := span{x x j : x x j / LT(I) ([5, Chapt 5]) The codimension of the ideal is defined by codim(i) := dim(r[x]/i) For an ideal I of R[x], we denote by V = V (I) its real affine variety, ie, V (I) = {x R : p(x) = 0, p I} We consider the case of a zero dimensional variety, that is, when V is a finite set of distinct points in R In this case, it is well-nown that V codim I The following result is proved in [] Proposition Let I be a polynomial ideal in R[x] with finite codimension and let V be its affine variety If V = codim(i) then there is a unique interpolation polynomial in S I based on the points in the variety, ie, for every ordinate function z : V R there exists a unique p S I such that p(x) = z(x), x V In this case I coincides with the polynomial ideal I(V ), which contains all polynomials in R[x] that vanish on V An especially interesting case is when the ideal is generated by a sequence of quasi-orthogonal polynomials Let dµ be a nonnegative measure with finite moments on a subset of R A polynomial P R[x] is said to be an orthogonal polynomial with respect to dµ if R P(x)Q(x)dµ(x) = 0, Q R[x], deg Q < deg P; it is called a (n )-orthogonal polynomial if the above integral is zero for all Q R[x] such that deg P + deg Q n In particular, if P is of degree n + and (n ) orthogonal, then it is orthogonal with respect to all polynomials of degree n or lower We need the following result (cf []) Proposition Let I and V be as in the previous proposition Assume that I is generated by (n )-orthogonal polynomials If codim I = V then there is a cubature formula f(x)dµ(x) λ x f(x) R x V
4 4 LEN BOS, STEFANO DE MARCHI, MARCO VIANELLO, AND YUAN XU of degree n ; that is, the above formula is an identity for all f Π n The cubature formula in this proposition can be obtained by integrating the interpolation polynomial in Proposition We will apply this result for dµ = W(x)dx, where W is the Chebyshev weight function on [,], () W(x) = π x x, < x,x < For such a weight function, the cubature formula of degree n exists only if V satisfies Möller s lower bound V dim Π n + [n/] Formulas that attain this lower bound exist ([7, 8]), whose nots are the interpolation points studied in [0] Recall that the Chebyshev polynomials T n and U n of the first and the second ind are given by T n (x) = cos nθ and U n (x) = sin(n+)θ sin θ, x = cos θ, respectively The polynomials T n (x) are orthogonal with respect to / x Consequently, it is easy to verify that the polynomials () T (x )T n (x ), 0 n, are mutually orthogonal polynomials of degree n with respect to the weight function W(x,x ) on [,] Polynomial ideals and Padua points The Padua points () were introduced in [4] (apart from a misprint that n should be replaced by n + ) based on a heuristic argument that we now describe Morrow and Patterson [7] introduced, for s, an explicit set of nots in [,] for a cubature formula of degree s with respect to the weight function x x on [,] These Morrow-Patterson points are the common zeros of (3) R s j(x,x ) := U j (x )U s j (x ) + U s j (x )U j (x ), 0 j s There turn out to be exactly dim Π s many such points, and they are all in the interior (,) Moreover, they may be seen to lie on a certain collection of vertical and horizontal lines, forming a subset of a certain rectangular grid The Padua points of degree n are precisely the Morrow-Patterson points of degree n, together with the natural boundary points of this grid Figure shows the 8 Padua points of degree 6, consisting of the 5 interior Morrow-Patterson points of degree 6-=4, together with 3 additional boundary points It should be noted that the Morrow-Patterson points turn out to be sub-optimal in the sense that the associated Lebesgue constants grow faster than best possible In contrast, the Padua points have Lebesgue constants of optimal growth See ([]) for a discussion of this fact As shown in [3] the Padua points can be characterized as self-intersection points (interior points) and the boundary contact points of the algebraic curve T n (x ) + T n+ (x ) = 0, (x,x ) [,] (the generating curve), where T n denotes the n-th Chebyshev polynomial of the first ind (Actually the generating curve used in [3] is T n+ (x ) T n (x ) = 0) Depending on the orientation of the x and x directions, there are four families of Padua points, which are the two mentioned above and two others whose generating curves are T n (x ) T n+ (x ) = 0 and T n+ (x ) + T n (x ) = 0, respectively We restrict to the family () in this paper Theorem 3 Let Q n+ Π n+ be defined by (4) Q n+ 0 (x,x ) = T n+ (x ) T n (x ),
5 BIVARIATE LAGRANGE INTERPOLATION AT PADUA POINTS 5 and for n +, (5) Q n+ (x,x ) = T n + (x )T (x ) + T n + (x )T (x ) Then the set Pad n in () is the variety of the ideal I = Q n+ 0,Q n+,,q n+ n+ Furthermore, codim(i) = Pad n = dim Π n Proof That the polynomials Q n+ vanish on the Padua points () can be easily verified upon using the following representation and, for n +, Q n+ 0 (x,x ) = ( x )U n (x ) = sin θ sin nθ, Q n+ (x,x ) = cos ( )θ(cos (n + )φ cos φ + sin(n + )φ sin φ) + cos φ(cos nθ cos ( )θ + sinnθ sin ( )θ), where x = cos θ and x = cos φ Furthermore, the definition of Q n+ shows easily that the set {LT(Q n+ 0 ),,LT(Q n+ n+ )} is exactly the set of monomials of degree n + in R[x] Hence, it follows that dim R[x]/I dim Π d n Recall that codim(i) = dim R[x]/I V and V Pad n = dim Π d n, we conclude that codim(i) = Pad n The basis (4) and (5) of the ideal was originally identified by using the fact that the interior points of Pad n are the common zeros of (3) This implies that the ideal contains the polynomials ( x ) ( x ) R n j, 0 j n, as well as two specific univariate polynomials, ( x )U n (x ), which gives rise to (4), and a certain other polynomial in x (the details of which are not important) From these polynomials we were able to derive a simple basis for the ideal, the Q n+ Once the basis is identified, it is of course, after the fact, easier to simply verify it directly, as we did in the proof Since the product Chebyshev polynomials () are orthogonal with respect to W in (), it follows readily that Q n+ (x,x ) are orthogonal to the polynomials in Π n with respect to W on [,] In particular, they are (n )-orthogonal polynomials Hence, as a consequence of the theorem and Propositions and, we have the following: Corollary 4 The set of Padua points Pad n is unisolvent for Π d n Furthermore, there is a cubature formula of degree n based on the Padua points in Pad n We denote the unique interpolation polynomial based on Pad n by L n f, which can be written as (6) L n f(x) = x,j Pad n f(x,j )l,j (x), x = (x,x ), where l,j (x) are the fundamental interpolation polynomials uniquely determined by (7) l,j (x,j ) = δ, δ j,j, x,j Pad n, and l,j Π d n In the following section we derive an explicit formula for the fundamental polynomials
6 6 LEN BOS, STEFANO DE MARCHI, MARCO VIANELLO, AND YUAN XU 3 Construction of the Lagrange interpolation polynomials To derive explicits formulas for the fundamental Lagrange polynomials of (6), we will use orthogonal polynomials and follow the strategy in [8, 0] We note that the method in [8] wors for the case that V = dim Π n + σ with σ n In our case σ = n +, so that the general theory there does not apply We remind the reader that [3] gives an alternate derivation Let V d n denote the space of orthogonal polynomials of degree n with respect to () on [,] An orthonormal basis for V d n is given by P n(x,x ) := T n (x ) T (x ), 0 n, where T 0 (x) = and T (x) = T (x) for We introduce the notation P n = [P n 0,P n,,p n n ] and treat it both as a set and as a column vector The reproducing ernel of the space Π d n in L (W,[,] ) is defined by (3) K n (x,y) = n [P (x)] t P (y) = =0 n =0 j=0 Pj (x)pj (y) There is a Christoffel-Darboux formula (cf [6, 8]) which states that (3) K n (x,y) = [A n,ip n+ (x)] t P n (y) [A n,i P n+ (y)] t P n (x) x i y i, i =,, where x = (x,x ), y = (y,y ), and A n,i R (n+) (n+) are matrices defined by A n, = 0 0, A n, = The fundamental interpolation polynomials are given in terms of K n (x,y) To this end, we will try to express K n (x,y) in terms of the polynomials in the ideal I of Theorem 3 Recall that the Padua points are the common zeros of polynomials Q n+ defined in (4)and (5) We also denote [ (33) Q n+ := Q n+ 0,Q n+,,q n+ n, ] Q n+ n+ The definition of Q n+ shows that we have the relation (34) Q n+ = P n+ + Γ P n + Γ P n, where Γ R (n+) (n+) and Γ R (n+) n are matrices defined by Γ = 0 and Γ = 0
7 BIVARIATE LAGRANGE INTERPOLATION AT PADUA POINTS 7 (35) By using the representation (34) we can rewrite (3) as where (x i y i )K n (x,y) =[Q n+ (x) Γ P n (x) Γ P n (x)] t A t n,ip n (y) P t n(x)a n,i [Q n+ (y) Γ P n (y) Γ P n (y)] =S,i (x,y) + S,i (x,y) + S 3,i (x,y), i =,, S,i (x,y) = Q t n+(x)a t n,ip n (y) P t n(x)a n,i Q n+ (y), S,i (x,y) = P t n(x) ( A n,i Γ Γ t A t n,i) Pn (y), S 3,i (x,y) = P t n(x)a n,i Γ P n (y) P t n (x)γ t A t n,ip n (y) If both x and y are in Pad n, then S,i will be zero We now wor out the other two terms First, observe that A n, Γ is a symmetrix matrix, 0 0 A n, Γ =, 0 0 and A n, Γ = It follows that S, (x,y) 0 and (36) S 3, (x,y) = P n 0 (x)p n 0 (y) + P n 0 (y)p n 0 (x) = T n (x )T n (y ) + T n (y )T n (x ) We also have A n, Γ = 0, which entails that S 3, (x,y) 0 Finally, we have A n, Γ Γ t A t n, =, from which we get (37) S, (x,y) = T n (x )T n (y ) T n (x )T n (y ) The terms S 3, and S, do not vanish on the Padua points We try to mae them part of the left hand side of (35) by seeing a polynomial h n (x,y) such that (38) It is easy to chec that S 3, (x,y) (x y )h n (x,y) = 0, x,y Pad n, S, (x,y) (x y )h n (x,y) = 0, x,y Pad n h n (x,y) := T n (x )T n (y )
8 8 LEN BOS, STEFANO DE MARCHI, MARCO VIANELLO, AND YUAN XU satisfies (38) This can be verified directly using the three term relation tt n (t) = T n+ (t) + T n (t) as follows By (36), S 3, (x,y) (x y )h n (x,y) = T n(x )(T n+ (y ) T n (y )) T n(y )(T n+ (x ) T n (x )) = T n(x )Q n+ 0 (y) T n(y )Q n+ 0 (x), using the definition of Q n+ 0 at (4) Similarly, by (37), S, (x,y) (x y )h n (x,y) = T n (y )(x T n (x ) + T n (x )) + T n (x )(y T n (y ) + T n (y )) = T n (y )Q n+ (x) + T n (x )Q n+ (y), using the definition of Q n+ at (5) Since Q n+ (x) vanishes on the Padua points, both equations in (38) are satisfied Consequently, we have proved the following proposition: Proposition 3 For x = (x,x ) and y = (y,y ), define (39) K n(x,y) := K n (x,y) T n (x )T n (y ) Then (x y )K n(x,y) = Q t n+(x)a t n,p n (y) P t n(x)a n, Q n+ (y) + T n(x )Q n+ 0 (y) T n(y )Q n+ 0 (x), (x y )K n(x,y) = Q t n+(x)a t n,p n (y) P t n(x)a n, Q n+ (y) T n (y )Q n+ (x) + T n (x )Q n+ (y) In particular, K (x,y) = 0 if x,y Pad n and x y Since P n n (x,x ) = T n (x ), we evidently have K n(x,x) > 0 Consequently, a compact formula for the fundamental interpolation polynomials follows immediately from the above proposition Theorem 3 The fundamental interpolation polynomials l,j in (6) associated with the Padua points x,j = (ξ,η j ) are given by (30) l,j (x) = K n(x,x,j ) K n(x,j,x,j ) = K n(x,x,j ) T n (x )T n (ξ ) K n (x,j,x,j ) [T n (ξ )] In fact, using the representation of K n in Proposition 3, the conditions (7) can be verified readily, which proves the theorem We can say more about the formula (30) In fact, a compact formula for the reproducing ernel K n appeared in [9], which states that (3) K n (x,y) =D n (θ + φ,θ + φ ) + D n (θ + φ,θ φ ) + D n (θ φ,θ + φ ) + D n (θ φ,θ φ ), where x = (cos θ,cos θ ), y = (cos φ,cos φ ), and D n (α,β) = cos((n + )α)cos α cos((n + )β)cos β cos α cos β
9 BIVARIATE LAGRANGE INTERPOLATION AT PADUA POINTS 9 Hence, the formula (30) provides a compact formula for the fundamental interpolation polynomials l,j Furthermore, the explicit formula (3) allows us to derive an explicit formula for the denominator K n(x,j,x,j ) The Padua points () naturally divide into three groups, Pad n = A v A b A in, where A v consists of the two vertex points (( ),( ) n ) for = 0,n, A b consists of the other points on the boundary of [,], and A in consists of interior points inside (,) (see Figure ) Proposition 33 For x,j Pad n, K, if x,j A v n(x,j,x,j ) = n(n + ), if x,j A b, if x,j A in The proof can be derived from the explicit formula of the Padua points () and the compact formula (3) by a tedious verification We refer to [3] for a proof using the generating curve Since integration of the Lagrange interpolation polynomial gives the quadrature formula, it follows from the above proposition and Corollary 4 that: Proposition 34 A cubature formula of degree n based on the Padua points is given by dx dx π f(x,x ) w [,] x x,j f(x,j ) x,j Pad n where w,j = /K n(x,j,x,j ) We note that this cubature formula is not a minimal cubature formula, since there are cubature formulas of the same degree with a fewer number of nodes 4 Convergence of the Lagrange interpolation polynomials In [3] it is shown that the Lagrange interpolation projection L n f in (6) has Lebesgue constant O((log n) ); that is, as an operator from C([,] ) to itself, its operator norm in the uniform norm is O((log n) ) This settles the problem of uniform convergence of L n f In this section we prove that L n f converges in L p norm For the Chebyshev weight function W defined in (), we define L p (W) as the space of Lebesgue measurable functions for which the norm ( ) /p f W,p := [,] f(x,x ) p W(x,x )dx dx is finite We eep this notation also for 0 < p <, even though it is no longer a norm for p in that range The main result in this section is Theorem 4 Let L n f be the Lagrange interpolation polynomial (6) based on the Padua points Let 0 < p < Then lim L nf f W,p = 0, f C([,] ) n
10 0 LEN BOS, STEFANO DE MARCHI, MARCO VIANELLO, AND YUAN XU In fact, let E n (f) be the error of the best approximation of f by polynomials from Π n in the uniform norm; then L n f f W,p c p E n (f) f C([,] ) The proof follows the approach in [0], where the mean convergence of another family of interpolation polynomials is proved We shall be brief whenever the same proof carries over First we need a lemma on the Fourier partial sum, S n f, defined by n S n f(x) = a j(f)pj (x) = π [,] K n f(x,y)w(y)dy =0 j=0 where a j (f) is the Fourier coefficient of f with respect to the orthonormal basis {Pj } in L (W) In the following we let c p denote a generic constant that depends on p only, its value may be different from line to line Lemma 4 Let < p < Then (4) S n f W,p c p f W,p, f L p (W) This is [0, Lemma 34] We will need another lemma whose proof follows almost verbatim from that of [0, Lemma 35] In the following we write N = Pad n = (n + )(n + )/ Lemma 43 Let p < Let x,j be the Padua points Then (4) P(x,j ) p c p P(x) p W(x)dx, P Π N n x,j Pad [,] p n The main tool in the proof of Theorem 4 is a converse inequality of (4), which we state below and give a complete proof, even though the proof is similar to that of [0, Theorem 33] Proposition 44 Let < p < Let x,j be the Padua points Then P(x) p W(x)dx c p P(x,j p, P Π d [,] N n x,j Pad n Proof Let P Π d n For p >, we have (43) P W,p = sup P(x)g(x)W(x)dx g W,q= [,] = sup P(x)S n g(x)w(x)dx, g W,q= [,] p + q =, where the second equality follows from the orthogonality We write S n g = S n g + a t n(g)p n, where a n = g(x)p n (x)w(x)dx [,]
11 BIVARIATE LAGRANGE INTERPOLATION AT PADUA POINTS Since the cubature formula is of degree n and PS n g is of degree n, we have P(x)S n (x)w(x)dx [,] = w,j P(x,j )S n (x,j ) x Pad,j n (44) /p /q x,j Pad n w,j P(x,j ) p By Lemma 4 and Lemma 43, x,j Pad n w,j S n (x,j ) q x,j Pad n w,j S n (x,j ) q c S n g W,q c g W,q = c Hence, using the fact that w,j N, it follows readily that (45) P(x)S n (x)w(x)dx [,] c w,j P(x,j ) p x,j Pad n We need to establish the similar inequality for the a t np n term Since L n P = P as P is of degree n, it follows from (30) and the orthogonality that P(x)a t n(g)p n (x)w(x)dx = L n P(x)a t n(g)p n (x)w(x)dx [,] [,] = w,j P(x,j ) K n(x,j,x)a t n(g)p n (x)w(x)dx x,j Pad [,] n = w,j P(x,j )a t n(g)p n (x,j ) an n(g) w,j P(x,j ) T n (ξ,j ) x,j Pad n x,j Pad n For the first term we can write a t (g)p n = S n g S n g and apply Hölder s inequality as in (44), so that the proof of (45) can be carried out again For the second term we use the fact that T n (x) to conclude that a n n(g) T n (x)g(x) W(x)dx g W,q [,] so that the sum is bounded by an n(g) w,j P(x,j ) T n (ξ,j ) x,j Pad n w,j P(x,j ) p x,j Pad n In this way we have established the inequality P(x)a t n(g)p n (x)w(x)dx [,] c w,j P(x,j ) p x,j Pad n Together with (45), this completes the proof of the proposition As shown in the proof of Theorem 3 of [0], the proof of Theorem 4, including the cases 0 < p <, follows as an easy consequence of Proposition 44 /p /p /p
12 LEN BOS, STEFANO DE MARCHI, MARCO VIANELLO, AND YUAN XU References [] L Bos, M Caliari, S De Marchi and M Vianello, A numerical study of the Xu polynomial interpolation formula in two variables Computing 76 (005), 3 34 [] L Bos, S De Marchi and M Vianello, On the Lebesgue constant for the Xu interpolation formula J Approx Theory 4 (006), 34 4 [3] L Bos, M Caliari, S De Marchi, M Vianello and Y Xu, Bivariate Lagrange interpolation at the Padua points: the generating curve approach J Approx Theory 43 (006), 5 5 [4] M Caliari, S De Marchi and M Vianello, Bivariate polynomial interpolation on the square at new nodal sets Appl Math Comput 65 (005), 6 74 [5] D Cox, J Little and D O Shea, Ideals, Varieties, and Algorithms, nd ed, Springer, Berlin, 997 [6] CF Dunl and Y Xu, Orthogonal Polynomials of Several Variables, Encyclopedia of Mathematics and its Applications, 8 Cambridge University Press, Cambridge, 00 [7] C R Morrow and T N L Patterson, Construction of algebraic cubature rules using polynomial ideal theory, SIAM J Numer Anal 5 (978), [8] Y Xu, Common zeros of polynomials in several variables and higher dimensional quadrature, Pitman Research Notes in Mathematics Series, Longman, Essex, 994 [9] Y Xu, Christoffel functions and Fourier series for multivariate orthogonal polynomials J Approx Theory 8 (995), [0] Y Xu, Lagrange interpolation on Chebyshev points of two variables J Approx Theory 87 (996), 0 38 [] Y Xu, Polynomial interpolation in several variables, cubature formulae, and ideals, Adv Comput Math (000), Department of Mathematics and Statistics, University of Calgary, Calgary, Alberta, Canada TNN4 address: lpbos@mathucalgaryca Department of Computer Science, University of Verona, 3734 Verona, Italy address: demarchi@sciunivrit Department of Pure and Applied Mathematics, University of Padua, 353 Padova, Italy address: marcov@mathunipdit Department of Mathematics, University of Oregon, Eugene, Oregon , USA address: yuan@mathuoregonedu
Bivariate 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 informationA numerical study of the Xu polynomial interpolation formula in two variables
A numerical study of the Xu polynomial interpolation formula in two variables Len Bos Dept. of Mathematics and Statistics, University of Calgary (Canada) Marco Caliari, Stefano De Marchi Dept. of Computer
More informationInterpolation and Cubature at Geronimus Nodes Generated by Different Geronimus Polynomials
Interpolation and Cubature at Geronimus Nodes Generated by Different Geronimus Polynomials Lawrence A. Harris Abstract. We extend the definition of Geronimus nodes to include pairs of real numbers where
More informationStability of Kernel Based Interpolation
Stability of Kernel Based Interpolation Stefano De Marchi Department of Computer Science, University of Verona (Italy) Robert Schaback Institut für Numerische und Angewandte Mathematik, University of Göttingen
More informationTrivariate polynomial approximation on Lissajous curves 1
Trivariate polynomial approximation on Lissajous curves 1 Stefano De Marchi DMV2015, Minisymposium on Mathematical Methods for MPI 22 September 2015 1 Joint work with Len Bos (Verona) and Marco Vianello
More informationOn the Lebesgue constant of subperiodic trigonometric interpolation
On the Lebesgue constant of subperiodic trigonometric interpolation Gaspare Da Fies and Marco Vianello November 4, 202 Abstract We solve a recent conjecture, proving that the Lebesgue constant of Chebyshev-like
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 informationDubiner distance and stability of Lebesgue constants
Dubiner distance and stability of Lebesgue constants Marco Vianello 1 March 15, 2018 Abstract Some elementary inequalities, based on the non-elementary notion of Dubiner distance, show that norming sets
More informationOn the Lebesgue constant of barycentric rational interpolation at equidistant nodes
On the Lebesgue constant of barycentric rational interpolation at equidistant nodes by Len Bos, Stefano De Marchi, Kai Hormann and Georges Klein Report No. 0- May 0 Université de Fribourg (Suisse Département
More informationPolynomial approximation and cubature at approximate Fekete and Leja points of the cylinder
Polynomial approximation and cubature at approximate Fekete and Leja points of the cylinder Stefano De Marchi, Martina Marchioro and Alvise Sommariva May 18, 2018 arxiv:1110.5513v1 [math.na] 25 Oct 2011
More informationOn Orthogonal Polynomials in Several Variables
Fields Institute Communications Volume 00, 0000 On Orthogonal Polynomials in Several Variables Yuan Xu Department of Mathematics University of Oregon Eugene, Oregon 97403-1222 Abstract. We report on the
More informationConstructing optimal polynomial meshes on planar starlike domains
Constructing optimal polynomial meshes on planar starlike domains F. Piazzon and M. Vianello 1 Dept. of Mathematics, University of Padova (Italy) October 13, 2014 Abstract We construct polynomial norming
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 informationStability constants for kernel-based interpolation processes
Dipartimento di Informatica Università degli Studi di Verona Rapporto di ricerca Research report 59 Stability constants for kernel-based interpolation processes Stefano De Marchi Robert Schaback Dipartimento
More informationA Proof of Markov s Theorem for Polynomials on Banach spaces
A Proof of Markov s Theorem for Polynomials on Banach spaces Lawrence A. Harris Department of Mathematics, University of Kentucky Lexington, Kentucky 40506-007 larry@ms.uky.edu Dedicated to my teachers
More informationChapter 1. Preliminaries. The purpose of this chapter is to provide some basic background information. Linear Space. Hilbert Space.
Chapter 1 Preliminaries The purpose of this chapter is to provide some basic background information. Linear Space Hilbert Space Basic Principles 1 2 Preliminaries Linear Space The notion of linear space
More informationarxiv: v1 [math.gr] 8 Nov 2008
SUBSPACES OF 7 7 SKEW-SYMMETRIC MATRICES RELATED TO THE GROUP G 2 arxiv:0811.1298v1 [math.gr] 8 Nov 2008 ROD GOW Abstract. Let K be a field of characteristic different from 2 and let C be an octonion algebra
More informationORTHOGONAL POLYNOMIALS AND CUBATURE FORMULAE ON SPHERES AND ON SIMPLICES. Yuan Xu
ORTHOGONAL POLYNOMIALS AND CUBATURE FORMULAE ON SPHERES AND ON SIMPLICES Yuan Xu Abstract. Orthogonal polynomials on the standard simplex Σ d in R d are shown to be related to the spherical orthogonal
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 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 informationETNA Kent State University
Electronic Transactions on Numerical Analysis. Volume 39, pp. 1-11, 1. Copyright 1,. ISSN 168-9613. ETNA TRIGONOMETRIC GAUSSIAN QUADRATURE ON SUBINTERVALS OF THE PERIOD GASPARE DA FIES AND MARCO VIANELLO
More information2014:05 Incremental Greedy Algorithm and its Applications in Numerical Integration. V. Temlyakov
INTERDISCIPLINARY MATHEMATICS INSTITUTE 2014:05 Incremental Greedy Algorithm and its Applications in Numerical Integration V. Temlyakov IMI PREPRINT SERIES COLLEGE OF ARTS AND SCIENCES UNIVERSITY OF SOUTH
More informationQuadrature Formula for Computed Tomography
Quadrature Formula for Computed Tomography orislav ojanov, Guergana Petrova August 13, 009 Abstract We give a bivariate analog of the Micchelli-Rivlin quadrature for computing the integral of a function
More informationRecall that any inner product space V has an associated norm defined by
Hilbert Spaces Recall that any inner product space V has an associated norm defined by v = v v. Thus an inner product space can be viewed as a special kind of normed vector space. In particular every inner
More informationOptimal Polynomial Admissible Meshes on the Closure of C 1,1 Bounded Domains
Optimal Polynomial Admissible Meshes on the Closure of C 1,1 Bounded Domains Constructive Theory of Functions Sozopol, June 9-15, 2013 F. Piazzon, joint work with M. Vianello Department of Mathematics.
More informationTrigonometric Gaussian quadrature on subintervals of the period
Trigonometric Gaussian quadrature on subintervals of the period Gaspare Da Fies and Marco Vianello 1 April 24, 212 Abstract We construct a quadrature formula with angles and positive weights, exact in
More informationPadua2DM: fast interpolation and cubature at the Padua points in Matlab/Octave
Numerical Algorithms manuscript No. (will be inserted by the editor) Padua2DM: fast interpolation and cubature at the Padua points in Matlab/Octave Marco Caliari Stefano De Marchi Alvise Sommariva Marco
More informationOn the solution of integral equations of the first kind with singular kernels of Cauchy-type
International Journal of Mathematics and Computer Science, 7(202), no. 2, 29 40 M CS On the solution of integral equations of the first kind with singular kernels of Cauchy-type G. E. Okecha, C. E. Onwukwe
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 informationPolynomial approximation via de la Vallée Poussin means
Summer School on Applied Analysis 2 TU Chemnitz, September 26-3, 2 Polynomial approximation via de la Vallée Poussin means Lecture 2: Discrete operators Woula Themistoclakis CNR - National Research Council
More informationIntroduction to Orthogonal Polynomials: Definition and basic properties
Introduction to Orthogonal Polynomials: Definition and basic properties Prof. Dr. Mama Foupouagnigni African Institute for Mathematical Sciences, Limbe, Cameroon and Department of Mathematics, Higher Teachers
More informationA trigonometric orthogonality with respect to a nonnegative Borel measure
Filomat 6:4 01), 689 696 DOI 10.98/FIL104689M Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat A trigonometric orthogonality with
More informationFurther Mathematical Methods (Linear Algebra) 2002
Further Mathematical Methods (Linear Algebra) Solutions For Problem Sheet 9 In this problem sheet, we derived a new result about orthogonal projections and used them to find least squares approximations
More informationApproximation Theory
Approximation Theory Function approximation is the task of constructing, for a given function, a simpler function so that the difference between the two functions is small and to then provide a quantifiable
More informationFEKETE TYPE POINTS FOR RIDGE FUNCTION INTERPOLATION AND HYPERBOLIC POTENTIAL THEORY. Len Bos, Stefano De Marchi, and Norm Levenberg
PUBLICATIONS DE L INSTITUT MATHÉMATIQUE Nouvelle série, tome 96 110) 2014), 41 48 DOI: 10.2298/PIM1410041B FEETE TYPE POINTS FOR RIDGE FUNCTION INTERPOLATION AND HYPERBOLIC POTENTIAL THEORY Len Bos, Stefano
More informationIB Mathematics HL Year 2 Unit 11: Completion of Algebra (Core Topic 1)
IB Mathematics HL Year Unit : Completion of Algebra (Core Topic ) Homewor for Unit Ex C:, 3, 4, 7; Ex D: 5, 8, 4; Ex E.: 4, 5, 9, 0, Ex E.3: (a), (b), 3, 7. Now consider these: Lesson 73 Sequences and
More informationA new stable basis for radial basis function interpolation
A new stable basis for radial basis function interpolation Stefano De Marchi and Gabriele Santin Department of Mathematics University of Padua (Italy) Abstract It is well-known that radial basis function
More informationVectors in Function Spaces
Jim Lambers MAT 66 Spring Semester 15-16 Lecture 18 Notes These notes correspond to Section 6.3 in the text. Vectors in Function Spaces We begin with some necessary terminology. A vector space V, also
More information1 Directional Derivatives and Differentiability
Wednesday, January 18, 2012 1 Directional Derivatives and Differentiability Let E R N, let f : E R and let x 0 E. Given a direction v R N, let L be the line through x 0 in the direction v, that is, L :=
More informationLARGE DEVIATIONS OF TYPICAL LINEAR FUNCTIONALS ON A CONVEX BODY WITH UNCONDITIONAL BASIS. S. G. Bobkov and F. L. Nazarov. September 25, 2011
LARGE DEVIATIONS OF TYPICAL LINEAR FUNCTIONALS ON A CONVEX BODY WITH UNCONDITIONAL BASIS S. G. Bobkov and F. L. Nazarov September 25, 20 Abstract We study large deviations of linear functionals on an isotropic
More informationCOMMON COMPLEMENTS OF TWO SUBSPACES OF A HILBERT SPACE
COMMON COMPLEMENTS OF TWO SUBSPACES OF A HILBERT SPACE MICHAEL LAUZON AND SERGEI TREIL Abstract. In this paper we find a necessary and sufficient condition for two closed subspaces, X and Y, of a Hilbert
More informationClass notes: Approximation
Class notes: Approximation Introduction Vector spaces, linear independence, subspace The goal of Numerical Analysis is to compute approximations We want to approximate eg numbers in R or C vectors in R
More informationLegendre s Equation. PHYS Southern Illinois University. October 18, 2016
Legendre s Equation PHYS 500 - Southern Illinois University October 18, 2016 PHYS 500 - Southern Illinois University Legendre s Equation October 18, 2016 1 / 11 Legendre s Equation Recall We are trying
More informationPOLYA CONDITIONS FOR MULTIVARIATE BIRKHOFF INTERPOLATION: FROM GENERAL TO RECTANGULAR SETS OF NODES. 1. Introduction
Acta Math. Univ. Comenianae Vol. LXXIX, 1(20), pp. 9 18 9 POLYA CONDITIONS FOR MULTIVARIATE BIRKHOFF INTERPOLATION: FROM GENERAL TO RECTANGULAR SETS OF NODES M. CRAINIC and N. CRAINIC Abstract. Polya conditions
More informationSimultaneous Gaussian quadrature for Angelesco systems
for Angelesco systems 1 KU Leuven, Belgium SANUM March 22, 2016 1 Joint work with Doron Lubinsky Introduced by C.F. Borges in 1994 Introduced by C.F. Borges in 1994 (goes back to Angelesco 1918). Introduced
More informationVector spaces. DS-GA 1013 / MATH-GA 2824 Optimization-based Data Analysis.
Vector spaces DS-GA 1013 / MATH-GA 2824 Optimization-based Data Analysis http://www.cims.nyu.edu/~cfgranda/pages/obda_fall17/index.html Carlos Fernandez-Granda Vector space Consists of: A set V A scalar
More informationPolynomial Meshes: Computation and Approximation
Proceedings of the 15th International Conference on Computational and Mathematical Methods in Science and Engineering, CMMSE 215 6 1 July, 215. Polynomial Meshes: Computation and Approximation S. De Marchi
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 informationarxiv: v1 [math.pr] 22 May 2008
THE LEAST SINGULAR VALUE OF A RANDOM SQUARE MATRIX IS O(n 1/2 ) arxiv:0805.3407v1 [math.pr] 22 May 2008 MARK RUDELSON AND ROMAN VERSHYNIN Abstract. Let A be a matrix whose entries are real i.i.d. centered
More informationFinite-dimensional spaces. C n is the space of n-tuples x = (x 1,..., x n ) of complex numbers. It is a Hilbert space with the inner product
Chapter 4 Hilbert Spaces 4.1 Inner Product Spaces Inner Product Space. A complex vector space E is called an inner product space (or a pre-hilbert space, or a unitary space) if there is a mapping (, )
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 informationConvex Feasibility Problems
Laureate Prof. Jonathan Borwein with Matthew Tam http://carma.newcastle.edu.au/drmethods/paseky.html Spring School on Variational Analysis VI Paseky nad Jizerou, April 19 25, 2015 Last Revised: May 6,
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 informationReflections and Rotations in R 3
Reflections and Rotations in R 3 P. J. Ryan May 29, 21 Rotations as Compositions of Reflections Recall that the reflection in the hyperplane H through the origin in R n is given by f(x) = x 2 ξ, x ξ (1)
More informationwhere m is the maximal ideal of O X,p. Note that m/m 2 is a vector space. Suppose that we are given a morphism
8. Smoothness and the Zariski tangent space We want to give an algebraic notion of the tangent space. In differential geometry, tangent vectors are equivalence classes of maps of intervals in R into the
More informationStability inequalities for Lebesgue constants via Markov-like inequalities
Stability inequalities for Lebesgue constants via Markov-like inequalities F. Piazzon and M. Vianello Department of Mathematics, University of Padova (Italy) February, 208 Abstract We prove that L -norming
More informationL p Functions. Given a measure space (X, µ) and a real number p [1, ), recall that the L p -norm of a measurable function f : X R is defined by
L p Functions Given a measure space (, µ) and a real number p [, ), recall that the L p -norm of a measurable function f : R is defined by f p = ( ) /p f p dµ Note that the L p -norm of a function f may
More informationPOLYNOMIAL OPTIMIZATION WITH SUMS-OF-SQUARES INTERPOLANTS
POLYNOMIAL OPTIMIZATION WITH SUMS-OF-SQUARES INTERPOLANTS Sercan Yıldız syildiz@samsi.info in collaboration with Dávid Papp (NCSU) OPT Transition Workshop May 02, 2017 OUTLINE Polynomial optimization and
More informationTopological properties
CHAPTER 4 Topological properties 1. Connectedness Definitions and examples Basic properties Connected components Connected versus path connected, again 2. Compactness Definition and first examples Topological
More informationGlobal polynomial optimization by norming sets on sphere and torus
Global polynomial optimization by norming sets on sphere and torus Marco Vianello 1 February 12, 2018 Abstract Using the approximation theoretic notion of norming set, we compute (1 ε)-approximations to
More informationDISCRETE FOURIER ANALYSIS, CUBATURE AND INTERPOLATION ON A HEXAGON AND A TRIANGLE
DISCRETE FOURIER ANALYSIS, CUBATURE AND INTERPOLATION ON A HEXAGON AND A TRIANGLE HUIYUAN LI, JIACHANG SUN, AND YUAN XU Abstract. Several problems of trigonometric approximation on a hexagon and a triangle
More information(1-2) fx\-*f(x)dx = ^^ Z f(x[n)) + R (f), a > - 1,
MATHEMATICS OF COMPUTATION, VOLUME 29, NUMBER 129 JANUARY 1975, PAGES 93-99 Nonexistence of Chebyshev-Type Quadratures on Infinite Intervals* By Walter Gautschi Dedicated to D. H. Lehmer on his 10th birthday
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 informationReproducing Kernels of Generalized Sobolev Spaces via a Green Function Approach with Distributional Operators
Noname manuscript No. (will be inserted by the editor) Reproducing Kernels of Generalized Sobolev Spaces via a Green Function Approach with Distributional Operators Gregory E. Fasshauer Qi Ye Abstract
More informationUNIFORM BOUNDS FOR BESSEL FUNCTIONS
Journal of Applied Analysis Vol. 1, No. 1 (006), pp. 83 91 UNIFORM BOUNDS FOR BESSEL FUNCTIONS I. KRASIKOV Received October 8, 001 and, in revised form, July 6, 004 Abstract. For ν > 1/ and x real we shall
More information2. Dual space is essential for the concept of gradient which, in turn, leads to the variational analysis of Lagrange multipliers.
Chapter 3 Duality in Banach Space Modern optimization theory largely centers around the interplay of a normed vector space and its corresponding dual. The notion of duality is important for the following
More informationLEGENDRE POLYNOMIALS AND APPLICATIONS. We construct Legendre polynomials and apply them to solve Dirichlet problems in spherical coordinates.
LEGENDRE POLYNOMIALS AND APPLICATIONS We construct Legendre polynomials and apply them to solve Dirichlet problems in spherical coordinates.. Legendre equation: series solutions The Legendre equation is
More informationSome approximation theorems in Math 522. I. Approximations of continuous functions by smooth functions
Some approximation theorems in Math 522 I. Approximations of continuous functions by smooth functions The goal is to approximate continuous functions vanishing at ± by smooth functions. In a previous homewor
More informationReal Analysis Math 131AH Rudin, Chapter #1. Dominique Abdi
Real Analysis Math 3AH Rudin, Chapter # Dominique Abdi.. If r is rational (r 0) and x is irrational, prove that r + x and rx are irrational. Solution. Assume the contrary, that r+x and rx are rational.
More informationCORRESPONDENCE BETWEEN ELLIPTIC CURVES IN EDWARDS-BERNSTEIN AND WEIERSTRASS FORMS
CORRESPONDENCE BETWEEN ELLIPTIC CURVES IN EDWARDS-BERNSTEIN AND WEIERSTRASS FORMS DEPARTMENT OF MATHEMATICS AND STATISTICS UNIVERSITY OF OTTAWA SUPERVISOR: PROFESSOR MONICA NEVINS STUDENT: DANG NGUYEN
More informationSolving the 3D Laplace Equation by Meshless Collocation via Harmonic Kernels
Solving the 3D Laplace Equation by Meshless Collocation via Harmonic Kernels Y.C. Hon and R. Schaback April 9, Abstract This paper solves the Laplace equation u = on domains Ω R 3 by meshless collocation
More informationLecture Note 3: Polynomial Interpolation. Xiaoqun Zhang Shanghai Jiao Tong University
Lecture Note 3: Polynomial Interpolation Xiaoqun Zhang Shanghai Jiao Tong University Last updated: October 24, 2013 1.1 Introduction We first look at some examples. Lookup table for f(x) = 2 π x 0 e x2
More informationOn the Lebesgue constant for the Xu interpolation formula
O the Lebesgue costat for the Xu iterpolatio formula Le Bos Dept. of Mathematics ad Statistics, Uiversity of Calgary Caada Stefao De Marchi Dept. of Computer Sciece, Uiversity of Veroa Italy Marco Viaello
More informationNORMS ON SPACE OF MATRICES
NORMS ON SPACE OF MATRICES. Operator Norms on Space of linear maps Let A be an n n real matrix and x 0 be a vector in R n. We would like to use the Picard iteration method to solve for the following system
More informationON THE CHEBYSHEV POLYNOMIALS. Contents. 2. A Result on Linear Functionals on P n 4 Acknowledgments 7 References 7
ON THE CHEBYSHEV POLYNOMIALS JOSEPH DICAPUA Abstract. This paper is a short exposition of several magnificent properties of the Chebyshev polynomials. The author illustrates how the Chebyshev polynomials
More informationAPPENDIX A. Background Mathematics. A.1 Linear Algebra. Vector algebra. Let x denote the n-dimensional column vector with components x 1 x 2.
APPENDIX A Background Mathematics A. Linear Algebra A.. Vector algebra Let x denote the n-dimensional column vector with components 0 x x 2 B C @. A x n Definition 6 (scalar product). The scalar product
More informationChapter 4 Euclid Space
Chapter 4 Euclid Space Inner Product Spaces Definition.. Let V be a real vector space over IR. A real inner product on V is a real valued function on V V, denoted by (, ), which satisfies () (x, y) = (y,
More informationProduct Gaussian quadrature on circular lunes
Product Gaussian quadrature on circular lunes Gaspare Da Fies and Marco Vianello 1 August 30, 2013 Abstract Resorting to recent results on subperiodic trigonometric quadrature, we provide three product
More informationSpectra of Multiplication Operators as a Numerical Tool. B. Vioreanu and V. Rokhlin Technical Report YALEU/DCS/TR-1443 March 3, 2011
We introduce a numerical procedure for the construction of interpolation and quadrature formulae on bounded convex regions in the plane. The construction is based on the behavior of spectra of certain
More informationGRÖBNER BASES AND POLYNOMIAL EQUATIONS. 1. Introduction and preliminaries on Gróbner bases
GRÖBNER BASES AND POLYNOMIAL EQUATIONS J. K. VERMA 1. Introduction and preliminaries on Gróbner bases Let S = k[x 1, x 2,..., x n ] denote a polynomial ring over a field k where x 1, x 2,..., x n are indeterminates.
More informationA Polynomial Chaos Approach to Robust Multiobjective Optimization
A Polynomial Chaos Approach to Robust Multiobjective Optimization Silvia Poles 1, Alberto Lovison 2 1 EnginSoft S.p.A., Optimization Consulting Via Giambellino, 7 35129 Padova, Italy s.poles@enginsoft.it
More informationTHEOREMS, ETC., FOR MATH 515
THEOREMS, ETC., FOR MATH 515 Proposition 1 (=comment on page 17). If A is an algebra, then any finite union or finite intersection of sets in A is also in A. Proposition 2 (=Proposition 1.1). For every
More informationThe Closed Form Reproducing Polynomial Particle Shape Functions for Meshfree Particle Methods
The Closed Form Reproducing Polynomial Particle Shape Functions for Meshfree Particle Methods by Hae-Soo Oh Department of Mathematics, University of North Carolina at Charlotte, Charlotte, NC 28223 June
More informationLectures 2 3 : Wigner s semicircle law
Fall 009 MATH 833 Random Matrices B. Való Lectures 3 : Wigner s semicircle law Notes prepared by: M. Koyama As we set up last wee, let M n = [X ij ] n i,j=1 be a symmetric n n matrix with Random entries
More informationAPPROXIMATING CONTINUOUS FUNCTIONS: WEIERSTRASS, BERNSTEIN, AND RUNGE
APPROXIMATING CONTINUOUS FUNCTIONS: WEIERSTRASS, BERNSTEIN, AND RUNGE WILLIE WAI-YEUNG WONG. Introduction This set of notes is meant to describe some aspects of polynomial approximations to continuous
More informationSome D-module theoretic aspects of the local cohomology of a polynomial ring
Some D-module theoretic aspects of the local cohomology of a polynomial ring Toshinori Oaku Tokyo Woman s Christian University July 6, 2015, MSJ-SI in Osaka Toshinori Oaku (Tokyo Woman s Christian University)
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 informationComputing approximate Fekete points by QR factorizations of Vandermonde matrices
Computing approximate Fekete points by QR factorizations of Vandermonde matrices Alvise Sommariva and Marco Vianello Dept. of Pure and Applied Mathematics, University of Padova (Italy) Abstract We propose
More informationSTOKES PROBLEM WITH SEVERAL TYPES OF BOUNDARY CONDITIONS IN AN EXTERIOR DOMAIN
Electronic Journal of Differential Equations, Vol. 2013 2013, No. 196, pp. 1 28. ISSN: 1072-6691. URL: http://ejde.math.txstate.edu or http://ejde.math.unt.edu ftp ejde.math.txstate.edu STOKES PROBLEM
More informationPOSITIVE POLYNOMIALS LECTURE NOTES (09: 10/05/10) Contents
POSITIVE POLYNOMIALS LECTURE NOTES (09: 10/05/10) SALMA KUHLMANN Contents 1. Proof of Hilbert s Theorem (continued) 1 2. The Motzkin Form 2 3. Robinson Method (1970) 3 3. The Robinson Form 4 1. PROOF OF
More informationPolynomial mappings into a Stiefel manifold and immersions
Polynomial mappings into a Stiefel manifold and immersions Iwona Krzyżanowska Zbigniew Szafraniec November 2011 Abstract For a polynomial mapping from S n k to the Stiefel manifold Ṽk(R n ), where n k
More informationINDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS
INDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS STEVEN P. LALLEY AND ANDREW NOBEL Abstract. It is shown that there are no consistent decision rules for the hypothesis testing problem
More informationAN EXAMPLE OF FUNCTIONAL WHICH IS WEAKLY LOWER SEMICONTINUOUS ON W 1,p FOR EVERY p > 2 BUT NOT ON H0
AN EXAMPLE OF FUNCTIONAL WHICH IS WEAKLY LOWER SEMICONTINUOUS ON W,p FOR EVERY p > BUT NOT ON H FERNANDO FARRONI, RAFFAELLA GIOVA AND FRANÇOIS MURAT Abstract. In this note we give an example of functional
More informationarxiv:math/ v1 [math.fa] 26 Oct 1993
arxiv:math/9310217v1 [math.fa] 26 Oct 1993 ON COMPLEMENTED SUBSPACES OF SUMS AND PRODUCTS OF BANACH SPACES M.I.Ostrovskii Abstract. It is proved that there exist complemented subspaces of countable topological
More informationNEW BOUNDS FOR TRUNCATION-TYPE ERRORS ON REGULAR SAMPLING EXPANSIONS
NEW BOUNDS FOR TRUNCATION-TYPE ERRORS ON REGULAR SAMPLING EXPANSIONS Nikolaos D. Atreas Department of Mathematics, Aristotle University of Thessaloniki, 54006, Greece, e-mail:natreas@auth.gr Abstract We
More informationSYMMETRIC SUBGROUP ACTIONS ON ISOTROPIC GRASSMANNIANS
1 SYMMETRIC SUBGROUP ACTIONS ON ISOTROPIC GRASSMANNIANS HUAJUN HUANG AND HONGYU HE Abstract. Let G be the group preserving a nondegenerate sesquilinear form B on a vector space V, and H a symmetric subgroup
More informationReal Analysis Qualifying Exam May 14th 2016
Real Analysis Qualifying Exam May 4th 26 Solve 8 out of 2 problems. () Prove the Banach contraction principle: Let T be a mapping from a complete metric space X into itself such that d(tx,ty) apple qd(x,
More informationOrthogonal Polynomials and Gaussian Quadrature
Orthogonal Polynomials and Gaussian Quadrature 1. Orthogonal polynomials Given a bounded, nonnegative, nondecreasing function w(x) on an interval, I of the real line, we consider the Hilbert space L 2
More informationMeasures, orthogonal polynomials, and continued fractions. Michael Anshelevich
Measures, orthogonal polynomials, and continued fractions Michael Anshelevich November 7, 2008 MEASURES AND ORTHOGONAL POLYNOMIALS. µ a positive measure on R. A linear functional µ[p ] = P (x) dµ(x), µ
More informationSHARP BOUNDARY TRACE INEQUALITIES. 1. Introduction
SHARP BOUNDARY TRACE INEQUALITIES GILES AUCHMUTY Abstract. This paper describes sharp inequalities for the trace of Sobolev functions on the boundary of a bounded region R N. The inequalities bound (semi-)norms
More information