Discrete Orthogonal Polynomials on Equidistant Nodes
|
|
- Ferdinand King
- 5 years ago
- Views:
Transcription
1 International Mathematical Forum, 2, 2007, no. 21, Discrete Orthogonal Polynomials on Equidistant Nodes Alfredo Eisinberg and Giuseppe Fedele Dip. di Elettronica, Informatica e Sistemistica Università della Calabria Arcavacata di Rende (CS Italy Abstract In this paper we give an alternative and, in our opinion, more simple proof for the orthonormal discrete polynomials on a set of equidistant nodes. Such a proof provides a unifying explicit formulation of discrete orthonormal polynomials on an equidistant grid and an explicit formula for the coefficients of the three-term recurrence relation. We show how to efficiently apply these formulas to the problem of least-squares fitting on equidistant nodes. Finally we investigate the problem to determine the effect of adding a new basis function or taking one away. This is useful in the process of trying to discover the optimal set of basis functions and the problem to update them when a moving window over the time series/data stream is used. Mathematics Subject Classification: 05E35, 93E24 Keywords: Orthogonal polynomials, Least-squares 1 Introduction Although orthogonal polynomials over discrete sets were considered as early as the middle of the nineteenth century by Chebyshev [5, 6, 10, 11], comparatively little attention had been paid to them until now. They appear naturally in combinatorics, genetics, statistics and various areas in applied mathematics (see, for example, [7, 11]. Expansion in orthogonal polynomials is used, for example, to avoid the difficulties with ill-conditioned systems of equations which occur in a least squares applications [1]. The Gram polynomials [3, 1], orthonormal on the set of equidistant nodes in [ 1, 1], are used
2 1008 A. Eisinberg and G. Fedele in all the applications in which equidistant measures must be used. In this paper we focus our attention on discrete orthonormal polynomials. We derive an analytic expression for orthonormal polynomials on a discrete grid Z n = {z r z r = a + hr, r =0, 1,..., n 1} and the coefficients of the threeterm recurrence relation by using some results of the pseudoinverse on integer nodes [4]. We show how to efficiently apply these formulas to the problem of least-squares fitting on equidistant nodes. Finally we investigate the problem to determine the effect of adding a new basis function or taking one away as part of a process of trying to discover the optimal set of basis functions and the problem to update the basis functions when a moving window over the time series/data stream is used. We want to emphasize that although high degree approximations on equidistant nodes have a bad reputation in numerical analysis, a lot of researches have been made for the design of accurate algorithms for polynomial approximation on such a set of nodes. There is a considerable interest on equidistant nodes because this choice frequently occurs in many applications. 2 Preliminary results Let f 1 and f 2 be real valued functions defined on the set of nodes X n = {x 1,x 2,..., x n } and introduce the inner product: f 1 (x,f 2 (x = n f 1 (x k f 2 (x k. (1 k=1 A family P = {p 1 (x,p 2 (x,..., p m (x} with m n of polynomials is orthogonal respect to this inner product if the following properties hold: p k (x,p q (x =0, k q; k, q =1, 2,..., m p k (x,p k (x = ξ k 0, k =1, 2,..., m. (2 If ξ k =1, k =1, 2,..., m then polynomials p k are said orthonormal on the set of nodes X n. A well known result from the general theory of orthogonal polynomials is that the orthogonal polynomials satisfy a three term recursion formula: p k (x =(α k x + β k p k 1 (x+γ k p k 2 (x, k =3, 4,..., m. (3 Proposition 1 Let X n be a set of n nodes and let P be a family of m orthogonal polynomials on X n, then
3 Discrete orthogonal polynomials on equidistant nodes 1009 if and only if p i (x j =( 1 i+1 p i (x n+1 j, j =1, 2,..., n; i =1, 2,..., m (4 α i (x j + x n+1 j +2β i =0, i =1, 2,..., m; j =1, 2,..., n. (5 Proof. The proof is made by induction on the polynomial index i. Suppose (5 is true for i 1 and i 2 then and p i 1 (x j =( 1 i p i 1 (x n+1 j, j =1, 2,..., n (6 p i 2 (x j =( 1 i+1 p i 2 (x n+1 j, j =1, 2,..., n (7 ( Taking into account (3, the (4 becomes: (α i x j + β i p i 1 (x j +γ i p i 2 (x j = ( 1 i+1 [(α i x n+1 j + β i p i 1 (x n+1 j +γ i p i 2 (x n+1 j ] (8 By using (6 and (7 the (5 follows. ( Taking into account (6 and (7, p i (x n+1 j can be written as p i (x n+1 j = ( 1 i (α i x n+1 j + β i p i 1 (x j + +( 1 i+1 p i 2 (x j. (9 Considered that (α i x n+1 j + β i = (α i x j + β i then (4 follows. Here we review a result useful in the sequel. Let B k be the matrix defined as follows: B k (i, j = n p i+j 2, i,j =1, 2,..., k (10 p=1
4 1010 A. Eisinberg and G. Fedele then its inverse can be factorized as [4]: B 1 k = W k Λ 1 k W T k. (11 In (11, W k and Λ 1 k have the following expressions: (j 1! W k (i, j = where ( 2j 2 j 1 n s 1 ( 1 i+j (! ( s + j 2 ( n s n j [s [ ] i are the Stirling numbers of the first kind [8], and j Λ 1 k { ( 2i 2 } i 1 = diag [(i 1!] 2 ( n+i 1 2i 1 i i=1,2,...,k 3 Discrete orthogonal polynomials ], i,j =1, 2,..., k, (12. (13 Let P = {p 1 (x,p 2 (x,..., p m (x} be the set of polynomials defined as p k (x = k c k,i x i 1, k =1, 2,..., m. (14 i=1 The set P is orthogonal on the set of nodes X n = {1, 2,..., n} if the following equalities hold: p k (x,x q 1 =0, k =2, 3,..., m; q =1, 2,..., k 1, (15 p k (x,x k 1 = ρ k 0, k =1, 2,..., m. (16 Let c k and b k (k =1, 2,..., m, be two vectors defined as follows: c k (i =c k,i, bk (i =ρ k δ k,i, i =1, 2,..., k i =1, 2,..., k (17 then by (15 and (16 and taking into account (11, it must be
5 Discrete orthogonal polynomials on equidistant nodes 1011 It is straightforward to note that: c k = W k Λ 1 k W T k b k. (18 and [ Λ 1 k W k T b k ]i = ρ k W T k b k = b k (19 ( 2k 2 k 1 [(k 1!] 2 ( n+k 1 2k 1 Then, by simple algebraic manipulations we have: δ k,i, i =1, 2,..., k. (20 c k,i = μ k ( 1 i+k k s=1 1 (! ( s + k 2 ( n s n k [s i ], i =1, 2,..., k, (21 where μ k = ρ k (k 1! (, k =1, 2,..., m. (22 n+k 1 2k 1 By using the identity [8]: [ s ( 1 i i i ] x i 1 =( 1 s (! ( x 1 (23 polynomial p k (x becomes: p k (x =μ k If we put k s=1 ( ( s + k 2 n s ( 1 s+k n k ( x 1, k =1, 2,..., m. (24 ( n + k 1 ρ k =(k 1!, k =1, 2,..., m (25 2k 1 then the family P of polynomials
6 1012 A. Eisinberg and G. Fedele p k (x = k s=1 ( ( s + k 2 n s ( 1 s+k n k ( x 1, k =1, 2,..., m. (26 is orthogonal on the set X n = {1, 2,..., n}. By an affine transformation on the variable x in (26 we have that the polynomials p k (x = k s=1 ( 1 s+k ( s + k 2 are orthogonal on the set ( n s n k, k =1, 2,..., m. (27 ( x a h Z n = {z r z r = a + hr, r =0, 1,..., n 1} (28 Such polynomials satisfy the following three-term recurrence relation: where p k (x =(α k x + β k p k 1 (x+γ k p k 2 (x, k =3, 4,..., m (29 α k = 4k 6, h(k 1 2 β k = [(2k 3(2a+h(n 1] h(k 1 2, γ k = (k 22 n 2 (k 1 2, k =3, 4,..., m (30 Proposition 2 The set of polynomials Q = {q 1 (x,q 2 (x,..., q m (x} where q k (x = 1 (n+k 1 ( 2k 2 2k 1 k 1 k ( ( s + k 2 n s ( 1 s+k n k s=1 ( x 1, (31 k =1, 2,..., m is orthonormal on the set of nodes X n = {1, 2,..., n}. Proof. It is straightforward to note that p k (x,p k (x = c k,k ρ k, (32
7 Discrete orthogonal polynomials on equidistant nodes 1013 then by using (21 and the expression (25 for ρ k, we have p k (x,p k (x = ( ( n + k 1 2k 2 2k 1 k 1 (33 and the (31 follows. Corollary 3.1 The generic polynomial t k (x in the family of orthonormal polynomials T = {t 1 (x,t 2 (x,..., t m (x} on the set of nodes can be written as Z n = {z r z r = a + hr, r =0, 1,..., n 1} (34 t k (x = 1 (n+k 1 ( 2k 2 2k 1 k 1 k s=1 ( 1 s+k ( s + k 2 k =1, 2,..., m ( n s n k ( x a h, (35 The t k satisfies a three-term recurrence relation t 1 (x = 1 n t 2 (x = 3 [2x h(n 1 2a] h n(n 2 1 t k (x =(α k x + β k t k 1 (x+γ k t k 2 (x k =3, 4,..., n where α k = 2 (2k 1(2k 3 h(k 1 n 2 (k 1 2 β k = 1 2 [2a + h(n 1] α k (36 γ k = α k α k 1 k =3, 4,..., n Such explicit formulas are particularly useful because they allow to compute efficiently the orthonormal polynomials without using the Stieltjes procedure which can be sensitive to roundoff errors [13].
8 1014 A. Eisinberg and G. Fedele 4 Least squares application In this section we consider the problem of least squares on a discrete set Z n = {z r z r = a + hr, r =0, 1,..., n 1} (37 by using polynomials p k defined in (27 which are orthogonal on Z n. Such polynomials satisfies the three-term recurrence relation (29 with parameters (30. Note that p k (x,p k (x is invariant under affine transformation, therefore its value can be computed by using the (33. Here we want to expand a given function y = f(x in terms of orthogonal polynomials [9, 12]: f(x = m w i q i (x. (38 i=1 and to determine the coefficients w 1,w 2,..., w m in (38 such that the Euclidean norm of the error function f f is minimized, n 1 f f = f(z j f(z j 2. j=0 Since q 1 (x,q 2 (x,..., q m (x form an orthogonal system, the coefficients are computed more simple by w j = q j(x,f(x, j =1, 2,..., m. (39 q j (x,q j (x If we define the following quantities: where b = H f (40 H(i, j =q i (z j, i =1, 2,..., m; j =0, 1,..., n 1, (41 and f =[f(z 0,f(z 1,..., f(z n 1 ] (42
9 Discrete orthogonal polynomials on equidistant nodes 1015 then g(i = ( 2i 2 i 1 ( n + i 1 2i 1, i =1, 2,..., m (43 w i = b(i, i =1, 2,..., m. (44 g(i Since the product b = H f is also invariant under affine transformation, then it would be computed by considering, for example, the set of orthogonal polynomials on [1, 2,..., n] for which the matrix H is H(i, j = i s=1 ( 1 s+i ( s + i 2 ( n s n i ( j 1, (45 i =1, 2,..., m; j =1, 2,..., n. The pseudo-code in Table 1 finds the coefficients w i,i=1, 2,..., m in (38. We compare our algorithm (EF applied to the orthogonal polynomials on the set of n equidistant nodes in [0, 1] with that proposed in [2] (CB which costs 10mn flops and with the Mathematica built-in function Fit (MA [15]. The first two algorithms have been implemented in Mathematica package, which allows arbitrary precision numbers. Our algorithm costs 3.5mn flops. Infact we build an half part of the matrix H by the three-term recurrence relation, and the product H f by using the property in Proposition 1. For some values of m with n = 1000, we have generated one thousand vectors f, with entries uniformly distributed in [ 1, 1], and have computed the exact solution of the problem (38 f(x = m h i q i (x = i=1 m r k x k 1 (46 using extended precision. For each algorithm we have computed the maximum componentwise relative errors k=1 E EF = max 1 i m ˆr EF i r i r i (47 E CB = max 1 i m ˆr CB i r i r i (48
10 1016 A. Eisinberg and G. Fedele Table 1: Pseudo-code for least-square problem by discrete orthogonal polynomials. function lmsort Input: a, h, m, f Output: w i,i=1, 2,..., m Calculate the quantities α k,β k and γ k in (30. Calculate g k in (43. Build the matrix C P of the coefficients of the polynomials p k by using the three-term recurrence relation (29. Build the elements i =1, 2,..., m, j =1, 2,..., n 2 of the matrix H. Build the two vectors f 1 = { f(i, i=1, 2,..., n 2 } and f 2 = { f(n +1 i, i=1, 2,..., n 2 }. { Build the vector b = b(i = n 2 j=1 if n is odd then c h =1 b(1 = b(1 + f((n +1/2 for i =3:2:m c h = γ(ic h ; b(i =b(i+c h f((n +1/2 end } H(i, j(f 1 (j+( 1 i+1 f 2 (j.
11 Discrete orthogonal polynomials on equidistant nodes 1017 E MA = max 1 i m ˆr MA i r i r i (49 where ˆr EF,ˆr CB and ˆr MA are the approximate solutions computed by EF, CB and MA algorithms respectively in machine precision. The mean and the maximum of E EF, E CB and E MA over one thousand runs have then been computed and reported in Table 2. Table 2 reports also the fraction of trials in which the proposed algorithm gives equal or more accurate result than CB and MA algorithm. Note that the matrix H in (45 has integer entries that can be stored without rounding errors and this is probably the cause of the robustness of this algorithm. 5 Some properties A common problem in least-square problems is to determine the effect of adding a new basis function, that is to determine the effect of using m +1 basis in (38. This is important as part of a process of trying to discover the optimal set of basis functions. The effect can, of course, be calculated by restarting the algorithm in the previous section. However in our case, simple analytical formulas can be derived to cover this situation. Let C Pm be the matrix of the coefficients of the polynomial p k (x, k = 1, 2,..., m in (27, that is C P m = c 1, c 2,1 c 2, c 3,1 c 3,2 c 3, c m,1 c m,2 c m,3... c m,m = [ CP m 1 0 w T m and let G m be the matrix of the g k,k=1, 2,..., m in (43: c m,m ] (50 G m = g g = [ Gm T g m ] ( g m If we consider the matrix H in (41 as H m = [ Hm 1 h T m ] (52
12 1018 A. Eisinberg and G. Fedele then the coefficients of the approximant polynomial can be expressed in matrix form as C P T m G m H m f = [ CP T m 1 G m 1H m 1 f + g m (h T m fw m c m,m g m (h T m f ]. (53 Formula (53 is useful for the updating of the degree of the approximant polynomial in least square sense since it gives the coefficients of the approximant polynomial of degree m 1 in terms of the approximant polynomial of degree m 2. In real-time applications, which process a stream of continuously arriving data, it is often required a processing in moving time windows. More specific, let Z 1 and Z 2 be two discrete sets of nodes such as Z 1 = {a + h r, r =0, 1,..., n 1}, (54 Z 2 = {a + p + h r, r =0, 1,..., n 1, p>0} (55 and C P1 and C P2 the matrix of the coefficients of the orthogonal polynomial on Z 1 and Z 2 respectively, then where C P2 = C P1 M p (56 ( i 1 M(i, j =( 1 i+j, i,j =1, 2,..., m. (57 j 1 Proposition 3 The p-th power of the matrix M is ( i 1 M p (i, j =( 1 i+j p i j, i,j =1, 2,..., m. (58 j 1 The matrix M p has the following useful recursive properties: M p (i, i =1, i =1, 2,..., m, M p (i, 1 = pm p (i 1, 1, i =2, 3,..., m, M p (i, j = pm p (i 1,j+M p (i 1,j 1, i =3, 4,..., m, j =2, 3,..., i 1. (59
13 Discrete orthogonal polynomials on equidistant nodes 1019 m CB MA EF max mean max mean max mean EF vs CB EF vs MA Table 2: Maximum and mean value of E CB, E MA and E EF n = 1000, f [ 1, 1]. Success rate of EF algorithm. over 1000 runs, 6 Conclusions In this paper we have given an alternative proof of the explicit formula for the discrete orthogonal polynomials on equidistant nodes. Such a formula, with its properties, allows us to design an efficient algorithm for solving least squares problem. The numerical experiments indicate that our approach is more stable compared with existing Conte-de Boor algorithm. We finally have shown some properties satisfied by these polynomials. References [1] A. Björck, Numerical Methods for Least Squares Problems, SIAM, [2] S.D. Conte and C. De Boor, Elementary Numerical Analysis, McGraw-Hill, Second. ed., [3] G. Dahlquist and A. Björck, Numerical Methods, Prentice Hall, Englewood Cliffs, [4] A. Eisinberg, P. Pugliese and N. Salerno, Vandermonde matrices on integer nodes: the rectangular case. Numer. Math., 87 (2001, [5] F.B. Hildebrand, Introduction to Numerical Analysis, New York: Mc- Graw-Hill, [6] C. Jordan, Calculus Of Finite Differences, Chelsea Publ. Comp., New York, [7] S. Karlin and J. McGregor, Linear growth models with many types and multidimensional Hahn polynomials, in Theory and applications of special functions, 261?288, ed. R. A. Askey, Academic Press, New York, 1975.
14 1020 A. Eisinberg and G. Fedele [8] D.E. Knuth, The Art of Computer Programming,(2nd ed., Addison- Wesley, Reading Mass., [9] B.M. Mohan and B. Srinath, On the identification of discrete-time systems via discrete orthogonal functions, Computers Elec. Engng., 23 (1997, [10] R. Mukundan, Image Analysis by Tchebichef Moments, IEEE Trans. Image Proc., vol.10 no.9 (2001, [11] A.F. Nikiforov, S.K. Suslov, V.B. Uvarov, Classical orthogonal polynomials of a discrete variable, Springer-Verlag, Berlin, [12] M. Okabe, Discrete orthogonal polynomials inherent to sampling points at equal intervals, Comput. Methods Appl. Mech. Engng., 123 (1995, [13] L. Reichel, Fast QR Decomposition of Vandermonde-Like Matrices and Polynomial Least Squares Approximation, SIAM J. Matrix Anal. Appl., 3 (1991, [14] G. Szego, Orthogonal Polynomials, 4th ed., Amer. Math. Soc., Providence, RI, [15] S. Wolfram, Mathematica: a System for Doing Mathematics by Computers, Second. ed., Addison-Wesley, Received: August 10, 2006
On the inversion of the Vandermonde matrix
On the inversion of the Vandermonde matrix A. Eisinberg, G. Fedele Dip. Elettronica Informatica e Sistemistica, Università degli Studi della Calabria, 87036, Rende (Cs), Italy Abstract The inversion of
More informationGauss-Lobatto to Bernstein polynomials transformation
Gauss-Lobatto to Bernstein polynomials transformation Loredana Coluccio, Alfredo Eisinberg, Giuseppe Fedele Dip. Elettronica Informatica e Sistemistica, Università degli Studi della Calabria, 87036, Rende
More informationExplicit solution of the polynomial least-squares approximation problem on Chebyshev extrema nodes
Explicit solution of the polynoial least-squares approxiation proble on Chebyshev extrea nodes Alfredo Eisinberg, Giuseppe Fedele Dipartiento di Elettronica Inforatica e Sisteistica, Università degli Studi
More informationMOMENT functions are used in several computer vision
IEEE TRANSACTIONS ON IMAGE PROCESSING, VOL. 13, NO. 8, AUGUST 2004 1055 Some Computational Aspects of Discrete Orthonormal Moments R. Mukundan, Senior Member, IEEE Abstract Discrete orthogonal moments
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 informationA NOTE ON RATIONAL OPERATOR MONOTONE FUNCTIONS. Masaru Nagisa. Received May 19, 2014 ; revised April 10, (Ax, x) 0 for all x C n.
Scientiae Mathematicae Japonicae Online, e-014, 145 15 145 A NOTE ON RATIONAL OPERATOR MONOTONE FUNCTIONS Masaru Nagisa Received May 19, 014 ; revised April 10, 014 Abstract. Let f be oeprator monotone
More informationDifference Equations for Multiple Charlier and Meixner Polynomials 1
Difference Equations for Multiple Charlier and Meixner Polynomials 1 WALTER VAN ASSCHE Department of Mathematics Katholieke Universiteit Leuven B-3001 Leuven, Belgium E-mail: walter@wis.kuleuven.ac.be
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 informationA Note about the Pochhammer Symbol
Mathematica Moravica Vol. 12-1 (2008), 37 42 A Note about the Pochhammer Symbol Aleksandar Petoević Abstract. In this paper we give elementary proofs of the generating functions for the Pochhammer symbol
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 informationLinear least squares problems and smoothing filters
Linear least squares problems and smoothing filters Krystyna Ziętak (Wroclaw) Iwona Wróbel (Warsaw) Birmingham, September 14, 2010 Outline 1 Savitzky-Golay filters 2 Gram polynomials 3 Persson and Strang
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 informationPolyexponentials. Khristo N. Boyadzhiev Ohio Northern University Departnment of Mathematics Ada, OH
Polyexponentials Khristo N. Boyadzhiev Ohio Northern University Departnment of Mathematics Ada, OH 45810 k-boyadzhiev@onu.edu 1. Introduction. The polylogarithmic function [15] (1.1) and the more general
More informationWeighted Sums of Orthogonal Polynomials Related to Birth-Death Processes with Killing
Advances in Dynamical Systems and Applications ISSN 0973-5321, Volume 8, Number 2, pp. 401 412 (2013) http://campus.mst.edu/adsa Weighted Sums of Orthogonal Polynomials Related to Birth-Death Processes
More informationOn Solving Large Algebraic. Riccati Matrix Equations
International Mathematical Forum, 5, 2010, no. 33, 1637-1644 On Solving Large Algebraic Riccati Matrix Equations Amer Kaabi Department of Basic Science Khoramshahr Marine Science and Technology University
More informationThe Generating Functions for Pochhammer
The Generating Functions for Pochhammer Symbol { }, n N Aleksandar Petoević University of Novi Sad Teacher Training Faculty, Department of Mathematics Podgorička 4, 25000 Sombor SERBIA and MONTENEGRO Email
More informationON LINEAR COMBINATIONS OF
Física Teórica, Julio Abad, 1 7 (2008) ON LINEAR COMBINATIONS OF ORTHOGONAL POLYNOMIALS Manuel Alfaro, Ana Peña and María Luisa Rezola Departamento de Matemáticas and IUMA, Facultad de Ciencias, Universidad
More informationDecomposition of a recursive family of polynomials
Decomposition of a recursive family of polynomials Andrej Dujella and Ivica Gusić Abstract We describe decomposition of polynomials f n := f n,b,a defined by f 0 := B, f 1 (x := x, f n+1 (x = xf n (x af
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 informationLecture 2: Computing functions of dense matrices
Lecture 2: Computing functions of dense matrices Paola Boito and Federico Poloni Università di Pisa Pisa - Hokkaido - Roma2 Summer School Pisa, August 27 - September 8, 2018 Introduction In this lecture
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 informationBESSEL MATRIX DIFFERENTIAL EQUATIONS: EXPLICIT SOLUTIONS OF INITIAL AND TWO-POINT BOUNDARY VALUE PROBLEMS
APPLICATIONES MATHEMATICAE 22,1 (1993), pp. 11 23 E. NAVARRO, R. COMPANY and L. JÓDAR (Valencia) BESSEL MATRIX DIFFERENTIAL EQUATIONS: EXPLICIT SOLUTIONS OF INITIAL AND TWO-POINT BOUNDARY VALUE PROBLEMS
More informationToufik Mansour 1. Department of Mathematics, Chalmers University of Technology, S Göteborg, Sweden
COUNTING OCCURRENCES OF 32 IN AN EVEN PERMUTATION Toufik Mansour Department of Mathematics, Chalmers University of Technology, S-4296 Göteborg, Sweden toufik@mathchalmersse Abstract We study the generating
More informationThe Nearest Doubly Stochastic Matrix to a Real Matrix with the same First Moment
he Nearest Doubly Stochastic Matrix to a Real Matrix with the same First Moment William Glunt 1, homas L. Hayden 2 and Robert Reams 2 1 Department of Mathematics and Computer Science, Austin Peay State
More informationDepartment of Applied Mathematics Faculty of EEMCS. University of Twente. Memorandum No Birth-death processes with killing
Department of Applied Mathematics Faculty of EEMCS t University of Twente The Netherlands P.O. Box 27 75 AE Enschede The Netherlands Phone: +3-53-48934 Fax: +3-53-48934 Email: memo@math.utwente.nl www.math.utwente.nl/publications
More informationAsymptotics of Integrals of. Hermite Polynomials
Applied Mathematical Sciences, Vol. 4, 010, no. 61, 04-056 Asymptotics of Integrals of Hermite Polynomials R. B. Paris Division of Complex Systems University of Abertay Dundee Dundee DD1 1HG, UK R.Paris@abertay.ac.uk
More informationOrthogonal polynomials
Orthogonal polynomials Gérard MEURANT October, 2008 1 Definition 2 Moments 3 Existence 4 Three-term recurrences 5 Jacobi matrices 6 Christoffel-Darboux relation 7 Examples of orthogonal polynomials 8 Variable-signed
More informationL p -Width-Integrals and Affine Surface Areas
LIBERTAS MATHEMATICA, vol XXX (2010) L p -Width-Integrals and Affine Surface Areas Chang-jian ZHAO and Mihály BENCZE Abstract. The main purposes of this paper are to establish some new Brunn- Minkowski
More informationA chain rule for multivariate divided differences
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
More informationarxiv: v2 [math.na] 27 Dec 2016
An algorithm for constructing Equiangular vectors Azim rivaz a,, Danial Sadeghi a a Department of Mathematics, Shahid Bahonar University of Kerman, Kerman 76169-14111, IRAN arxiv:1412.7552v2 [math.na]
More informationUniversity of Houston, Department of Mathematics Numerical Analysis, Fall 2005
4 Interpolation 4.1 Polynomial interpolation Problem: LetP n (I), n ln, I := [a,b] lr, be the linear space of polynomials of degree n on I, P n (I) := { p n : I lr p n (x) = n i=0 a i x i, a i lr, 0 i
More information1 Backward and Forward Error
Math 515 Fall, 2008 Brief Notes on Conditioning, Stability and Finite Precision Arithmetic Most books on numerical analysis, numerical linear algebra, and matrix computations have a lot of material covering
More informationON THE TAYLOR COEFFICIENTS OF THE HURWITZ ZETA FUNCTION
ON THE TAYLOR COEFFICIENTS OF THE HURWITZ ZETA FUNCTION Khristo N. Boyadzhiev Department of Mathematics, Ohio Northern University, Ada, Ohio, 45810 k-boyadzhiev@onu.edu Abstract. We find a representation
More informationInverses of regular Hessenberg matrices
Proceedings of the 10th International Conference on Computational and Mathematical Methods in Science and Engineering, CMMSE 2010 27 30 June 2010. Inverses of regular Hessenberg matrices J. Abderramán
More informationMATH 425-Spring 2010 HOMEWORK ASSIGNMENTS
MATH 425-Spring 2010 HOMEWORK ASSIGNMENTS Instructor: Shmuel Friedland Department of Mathematics, Statistics and Computer Science email: friedlan@uic.edu Last update April 18, 2010 1 HOMEWORK ASSIGNMENT
More informationOn the loss of orthogonality in the Gram-Schmidt orthogonalization process
CERFACS Technical Report No. TR/PA/03/25 Luc Giraud Julien Langou Miroslav Rozložník On the loss of orthogonality in the Gram-Schmidt orthogonalization process Abstract. In this paper we study numerical
More informationArchiv der Mathematik Holomorphic approximation of L2-functions on the unit sphere in R^3
Manuscript Number: Archiv der Mathematik Holomorphic approximation of L-functions on the unit sphere in R^ --Manuscript Draft-- Full Title: Article Type: Corresponding Author: Holomorphic approximation
More informationWeighted G 1 -Multi-Degree Reduction of Bézier Curves
Vol. 7, No. 2, 216 Weighted G 1 -Multi-Degree Reduction of Bézier Curves Abedallah Rababah Department of Mathematics, Jordan University of Science and Technology Irbid 2211 Jordan Salisu Ibrahim Department
More informationIs Every Matrix Similar to a Toeplitz Matrix?
Is Every Matrix Similar to a Toeplitz Matrix? D. Steven Mackey Niloufer Mackey Srdjan Petrovic 21 February 1999 Submitted to Linear Algebra & its Applications Abstract We show that every n n complex nonderogatory
More informationPolynomial Interpolation
Polynomial Interpolation (Com S 477/577 Notes) Yan-Bin Jia Sep 1, 017 1 Interpolation Problem In practice, often we can measure a physical process or quantity (e.g., temperature) at a number of points
More informationGeneralization Of The Secant Method For Nonlinear Equations
Applied Mathematics E-Notes, 8(2008), 115-123 c ISSN 1607-2510 Available free at mirror sites of http://www.math.nthu.edu.tw/ amen/ Generalization Of The Secant Method For Nonlinear Equations Avram Sidi
More informationHermite Interpolation and Sobolev Orthogonality
Acta Applicandae Mathematicae 61: 87 99, 2000 2000 Kluwer Academic Publishers Printed in the Netherlands 87 Hermite Interpolation and Sobolev Orthogonality ESTHER M GARCÍA-CABALLERO 1,, TERESA E PÉREZ
More informationYi Wang Department of Applied Mathematics, Dalian University of Technology, Dalian , China (Submitted June 2002)
SELF-INVERSE SEQUENCES RELATED TO A BINOMIAL INVERSE PAIR Yi Wang Department of Applied Mathematics, Dalian University of Technology, Dalian 116024, China (Submitted June 2002) 1 INTRODUCTION Pairs of
More informationFully Symmetric Interpolatory Rules for Multiple Integrals over Infinite Regions with Gaussian Weight
Fully Symmetric Interpolatory ules for Multiple Integrals over Infinite egions with Gaussian Weight Alan Genz Department of Mathematics Washington State University ullman, WA 99164-3113 USA genz@gauss.math.wsu.edu
More informationAuthor copy. for some integers a i, b i. b i
Cent. Eur. J. Math. 6(3) 008 48-487 DOI: 10.478/s11533-008-0038-4 Central European Journal of Mathematics Rational points on the unit sphere Research Article Eric Schmutz Mathematics Department, Drexel
More informationOn the positivity of linear weights in WENO approximations. Abstract
On the positivity of linear weights in WENO approximations Yuanyuan Liu, Chi-Wang Shu and Mengping Zhang 3 Abstract High order accurate weighted essentially non-oscillatory (WENO) schemes have been used
More informationThe Solvability Conditions for the Inverse Eigenvalue Problem of Hermitian and Generalized Skew-Hamiltonian Matrices and Its Approximation
The Solvability Conditions for the Inverse Eigenvalue Problem of Hermitian and Generalized Skew-Hamiltonian Matrices and Its Approximation Zheng-jian Bai Abstract In this paper, we first consider the inverse
More informationTwo chain rules for divided differences
Two chain rules for divided differences and Faà di Bruno s formula Michael S Floater and Tom Lyche Abstract In this paper we derive two formulas for divided differences of a function of a function Both
More informationNumerical Analysis: Solving Systems of Linear Equations
Numerical Analysis: Solving Systems of Linear Equations Mirko Navara http://cmpfelkcvutcz/ navara/ Center for Machine Perception, Department of Cybernetics, FEE, CTU Karlovo náměstí, building G, office
More information4. Multi-linear algebra (MLA) with Kronecker-product data.
ect. 3. Tensor-product interpolation. Introduction to MLA. B. Khoromskij, Leipzig 2007(L3) 1 Contents of Lecture 3 1. Best polynomial approximation. 2. Error bound for tensor-product interpolants. - Polynomial
More informationON DIVISIBILITY OF SOME POWER SUMS. Tamás Lengyel Department of Mathematics, Occidental College, 1600 Campus Road, Los Angeles, USA.
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 7 (007, #A4 ON DIVISIBILITY OF SOME POWER SUMS Tamás Lengyel Department of Mathematics, Occidental College, 600 Campus Road, Los Angeles, USA
More informationConvergence and Stability of a New Quadrature Rule for Evaluating Hilbert Transform
Convergence and Stability of a New Quadrature Rule for Evaluating Hilbert Transform Maria Rosaria Capobianco CNR - National Research Council of Italy Institute for Computational Applications Mauro Picone,
More informationBernstein-Szegö Inequalities in Reproducing Kernel Hilbert Spaces ABSTRACT 1. INTRODUCTION
Malaysian Journal of Mathematical Sciences 6(2): 25-36 (202) Bernstein-Szegö Inequalities in Reproducing Kernel Hilbert Spaces Noli N. Reyes and Rosalio G. Artes Institute of Mathematics, University of
More informationON THE COMPLETE PIVOTING CONJECTURE FOR A HADAMARD MATRIX OF ORDER 12 ALAN EDELMAN 1. Department of Mathematics. and Lawrence Berkeley Laboratory
ON THE COMPLETE PIVOTING CONJECTURE FOR A HADAMARD MATRIX OF ORDER 12 ALAN EDELMAN 1 Department of Mathematics and Lawrence Berkeley Laboratory University of California Berkeley, California 94720 edelman@math.berkeley.edu
More informationBanach Journal of Mathematical Analysis ISSN: (electronic)
Banach J. Math. Anal. 2 (2008), no., 70 77 Banach Journal of Mathematical Analysis ISSN: 735-8787 (electronic) http://www.math-analysis.org WIDTH-INTEGRALS AND AFFINE SURFACE AREA OF CONVEX BODIES WING-SUM
More information5.8 Chebyshev Approximation
84 Chapter 5. Evaluation of Functions appropriate setting is ld=, and the value of the derivative is the accumulated sum divided by the sampling interval h. CITED REFERENCES AND FURTHER READING: Dennis,
More informationPositive Denite Matrix. Ya Yan Lu 1. Department of Mathematics. City University of Hong Kong. Kowloon, Hong Kong. Abstract
Computing the Logarithm of a Symmetric Positive Denite Matrix Ya Yan Lu Department of Mathematics City University of Hong Kong Kowloon, Hong Kong Abstract A numerical method for computing the logarithm
More informationAN ITERATIVE METHOD WITH ERROR ESTIMATORS
AN ITERATIVE METHOD WITH ERROR ESTIMATORS D. CALVETTI, S. MORIGI, L. REICHEL, AND F. SGALLARI Abstract. Iterative methods for the solution of linear systems of equations produce a sequence of approximate
More informationON SOME RESULTS ON LINEAR ORTHOGONALITY SPACES
ASIAN JOURNAL OF MATHEMATICS AND APPLICATIONS Volume 2014, Article ID ama0155, 11 pages ISSN 2307-7743 http://scienceasia.asia ON SOME RESULTS ON LINEAR ORTHOGONALITY SPACES KANU, RICHMOND U. AND RAUF,
More informationON THE SINGULAR DECOMPOSITION OF MATRICES
An. Şt. Univ. Ovidius Constanţa Vol. 8, 00, 55 6 ON THE SINGULAR DECOMPOSITION OF MATRICES Alina PETRESCU-NIŢǍ Abstract This paper is an original presentation of the algorithm of the singular decomposition
More informationHankel Operators plus Orthogonal Polynomials. Yield Combinatorial Identities
Hanel Operators plus Orthogonal Polynomials Yield Combinatorial Identities E. A. Herman, Grinnell College Abstract: A Hanel operator H [h i+j ] can be factored as H MM, where M maps a space of L functions
More informationPositivity of Turán determinants for orthogonal polynomials
Positivity of Turán determinants for orthogonal polynomials Ryszard Szwarc Abstract The orthogonal polynomials p n satisfy Turán s inequality if p 2 n (x) p n 1 (x)p n+1 (x) 0 for n 1 and for all x in
More informationHarmonic Polynomials and Dirichlet-Type Problems. 1. Derivatives of x 2 n
Harmonic Polynomials and Dirichlet-Type Problems Sheldon Axler and Wade Ramey 30 May 1995 Abstract. We take a new approach to harmonic polynomials via differentiation. Surprisingly powerful results about
More informationA classification of sharp tridiagonal pairs. Tatsuro Ito, Kazumasa Nomura, Paul Terwilliger
Tatsuro Ito Kazumasa Nomura Paul Terwilliger Overview This talk concerns a linear algebraic object called a tridiagonal pair. We will describe its features such as the eigenvalues, dual eigenvalues, shape,
More informationNumerical integration formulas of degree two
Applied Numerical Mathematics 58 (2008) 1515 1520 www.elsevier.com/locate/apnum Numerical integration formulas of degree two ongbin Xiu epartment of Mathematics, Purdue University, West Lafayette, IN 47907,
More informationMULTI-RESTRAINED STIRLING NUMBERS
MULTI-RESTRAINED STIRLING NUMBERS JI YOUNG CHOI DEPARTMENT OF MATHEMATICS SHIPPENSBURG UNIVERSITY SHIPPENSBURG, PA 17257, U.S.A. Abstract. Given positive integers n, k, and m, the (n, k)-th m- restrained
More informationMOORE-PENROSE INVERSE IN AN INDEFINITE INNER PRODUCT SPACE
J. Appl. Math. & Computing Vol. 19(2005), No. 1-2, pp. 297-310 MOORE-PENROSE INVERSE IN AN INDEFINITE INNER PRODUCT SPACE K. KAMARAJ AND K. C. SIVAKUMAR Abstract. The concept of the Moore-Penrose inverse
More informationETNA Kent State University
Electronic Transactions on Numerical Analysis. Volume 35, pp. 148-163, 2009. Copyright 2009,. ISSN 1068-9613. ETNA SPHERICAL QUADRATURE FORMULAS WITH EQUALLY SPACED NODES ON LATITUDINAL CIRCLES DANIELA
More informationOn the degree of local permutation polynomials
On the degree of local permutation polynomials Wiebke S. Diestelkamp Department of Mathematics University of Dayton Dayton, OH 45469-2316 wiebke@udayton.edu Stephen G. Hartke Department of Mathematics
More informationRational Chebyshev pseudospectral method for long-short wave equations
Journal of Physics: Conference Series PAPER OPE ACCESS Rational Chebyshev pseudospectral method for long-short wave equations To cite this article: Zeting Liu and Shujuan Lv 07 J. Phys.: Conf. Ser. 84
More informationTHE SET OF RECURRENT POINTS OF A CONTINUOUS SELF-MAP ON AN INTERVAL AND STRONG CHAOS
J. Appl. Math. & Computing Vol. 4(2004), No. - 2, pp. 277-288 THE SET OF RECURRENT POINTS OF A CONTINUOUS SELF-MAP ON AN INTERVAL AND STRONG CHAOS LIDONG WANG, GONGFU LIAO, ZHENYAN CHU AND XIAODONG DUAN
More informationP(X 0 = j 0,... X nk = j k )
Introduction to Probability Example Sheet 3 - Michaelmas 2006 Michael Tehranchi Problem. Let (X n ) n 0 be a homogeneous Markov chain on S with transition matrix P. Given a k N, let Z n = X kn. Prove that
More informationThe generalized order-k Fibonacci Pell sequence by matrix methods
Journal of Computational and Applied Mathematics 09 (007) 33 45 wwwelseviercom/locate/cam The generalized order- Fibonacci Pell sequence by matrix methods Emrah Kilic Mathematics Department, TOBB University
More informationApplications of Singular-Value Decomposition (SVD)
Applications of Singular-Value Decomposition (SVD Alkiviadis G Akritas and Gennadi I Malaschonok Summer 00 Abstract Let A be an m n matrix with m n Then one form of the singular-value decomposition of
More informationPOLYNOMIAL INTERPOLATION IN NONDIVISION ALGEBRAS
Electronic Transactions on Numerical Analysis. Volume 44, pp. 660 670, 2015. Copyright c 2015,. ISSN 1068 9613. ETNA POLYNOMIAL INTERPOLATION IN NONDIVISION ALGEBRAS GERHARD OPFER Abstract. Algorithms
More informationM ath. Res. Lett. 15 (2008), no. 2, c International Press 2008 PFAFFIANS, HAFNIANS AND PRODUCTS OF REAL LINEAR FUNCTIONALS. Péter E.
M ath. Res. Lett. 15 (008), no., 351 358 c International Press 008 PFAFFIANS, HAFNIANS AND PRODUCTS OF REAL LINEAR FUNCTIONALS Péter E. Frenkel Abstract. We prove pfaffian and hafnian versions of Lieb
More informationON SIMILARITIES BETWEEN EXPONENTIAL POLYNOMIALS AND HERMITE POLYNOMIALS
Journal of Applied Mathematics and Computational Mechanics 2013, 12(3), 93-104 ON SIMILARITIES BETWEEN EXPONENTIAL POLYNOMIALS AND HERMITE POLYNOMIALS Edyta Hetmaniok, Mariusz Pleszczyński, Damian Słota,
More informationlinearly indepedent eigenvectors as the multiplicity of the root, but in general there may be no more than one. For further discussion, assume matrice
3. Eigenvalues and Eigenvectors, Spectral Representation 3.. Eigenvalues and Eigenvectors A vector ' is eigenvector of a matrix K, if K' is parallel to ' and ' 6, i.e., K' k' k is the eigenvalue. If is
More informationDeviation Measures and Normals of Convex Bodies
Beiträge zur Algebra und Geometrie Contributions to Algebra Geometry Volume 45 (2004), No. 1, 155-167. Deviation Measures Normals of Convex Bodies Dedicated to Professor August Florian on the occasion
More informationUniqueness of the Solutions of Some Completion Problems
Uniqueness of the Solutions of Some Completion Problems Chi-Kwong Li and Tom Milligan Abstract We determine the conditions for uniqueness of the solutions of several completion problems including the positive
More informationA Backward Stable Hyperbolic QR Factorization Method for Solving Indefinite Least Squares Problem
A Backward Stable Hyperbolic QR Factorization Method for Solving Indefinite Least Suares Problem Hongguo Xu Dedicated to Professor Erxiong Jiang on the occasion of his 7th birthday. Abstract We present
More informationINTERLACING PROPERTIES FOR HERMITIAN MATRICES WHOSE GRAPH IS A GIVEN TREE
INTERLACING PROPERTIES FOR HERMITIAN MATRICES WHOSE GRAPH IS A GIVEN TREE C M DA FONSECA Abstract We extend some interlacing properties of the eigenvalues of tridiagonal matrices to Hermitian matrices
More informationDIAGONAL TOEPLITZ OPERATORS ON WEIGHTED BERGMAN SPACES
DIAGONAL TOEPLITZ OPERATORS ON WEIGHTED BERGMAN SPACES TRIEU LE Abstract. In this paper we discuss some algebraic properties of diagonal Toeplitz operators on weighted Bergman spaces of the unit ball in
More informationOn Riesz-Fischer sequences and lower frame bounds
On Riesz-Fischer sequences and lower frame bounds P. Casazza, O. Christensen, S. Li, A. Lindner Abstract We investigate the consequences of the lower frame condition and the lower Riesz basis condition
More informationMINIMAL REPRESENTING MEASURES ARISING FROM RANK-INCREASING MOMENT MATRIX EXTENSIONS
J. OPERATOR THEORY 42(1999), 425 436 c Copyright by Theta, 1999 MINIMAL REPRESENTING MEASURES ARISING FROM RANK-INCREASING MOMENT MATRIX EXTENSIONS LAWRENCE A. FIALKOW Communicated by Florian-Horia Vasilescu
More informationKrylov Subspace Methods that Are Based on the Minimization of the Residual
Chapter 5 Krylov Subspace Methods that Are Based on the Minimization of the Residual Remark 51 Goal he goal of these methods consists in determining x k x 0 +K k r 0,A such that the corresponding Euclidean
More informationA Generalized Finite Hankel Type Transformation and a Parseval Type Equation
International Journal of Scientific and Innovative Mathematical Research (IJSIMR) Volume 4, Issue 1, January 2016, PP 21-31 ISSN 2347-307X (Print) & ISSN 2347-3142 (Online) wwwarcjournalsorg A Generalized
More informationarxiv: v2 [math.co] 17 Mar 2016
COUNTING ZERO KERNEL PAIRS OVER A FINITE FIELD SAMRITH RAM arxiv:1509.08053v2 [math.co] 17 Mar 2016 Abstract. Helmke et al. have recently given a formula for the number of reachable pairs of matrices over
More informationAn angle metric through the notion of Grassmann representative
Electronic Journal of Linear Algebra Volume 18 Volume 18 (009 Article 10 009 An angle metric through the notion of Grassmann representative Grigoris I. Kalogeropoulos gkaloger@math.uoa.gr Athanasios D.
More informationA PROJECTED HESSIAN GAUSS-NEWTON ALGORITHM FOR SOLVING SYSTEMS OF NONLINEAR EQUATIONS AND INEQUALITIES
IJMMS 25:6 2001) 397 409 PII. S0161171201002290 http://ijmms.hindawi.com Hindawi Publishing Corp. A PROJECTED HESSIAN GAUSS-NEWTON ALGORITHM FOR SOLVING SYSTEMS OF NONLINEAR EQUATIONS AND INEQUALITIES
More informationA MODIFIED TSVD METHOD FOR DISCRETE ILL-POSED PROBLEMS
A MODIFIED TSVD METHOD FOR DISCRETE ILL-POSED PROBLEMS SILVIA NOSCHESE AND LOTHAR REICHEL Abstract. Truncated singular value decomposition (TSVD) is a popular method for solving linear discrete ill-posed
More informationFINITE GROUPS IN WHICH SOME PROPERTY OF TWO-GENERATOR SUBGROUPS IS TRANSITIVE
FINITE GROUPS IN WHICH SOME PROPERTY OF TWO-GENERATOR SUBGROUPS IS TRANSITIVE COSTANTINO DELIZIA, PRIMOŽ MORAVEC, AND CHIARA NICOTERA Abstract. Finite groups in which a given property of two-generator
More informationMath Linear Algebra II. 1. Inner Products and Norms
Math 342 - Linear Algebra II Notes 1. Inner Products and Norms One knows from a basic introduction to vectors in R n Math 254 at OSU) that the length of a vector x = x 1 x 2... x n ) T R n, denoted x,
More informationMatrix Energy. 1 Graph Energy. Christi DiStefano Gary Davis CSUMS University of Massachusetts at Dartmouth. December 16,
Matrix Energy Christi DiStefano Gary Davis CSUMS University of Massachusetts at Dartmouth December 16, 2009 Abstract We extend Ivan Gutmans idea of graph energy, stemming from theoretical chemistry via
More informationA SUFFICIENT CONDITION FOR STRICT TOTAL POSITIVITY OF A MATRIX. Thomas Craven and George Csordas
A SUFFICIENT CONDITION FOR STRICT TOTAL POSITIVITY OF A MATRIX Thomas Craven and George Csordas Abstract. We establish a sufficient condition for strict total positivity of a matrix. In particular, we
More informationTHE STRUCTURE OF A RING OF FORMAL SERIES AMS Subject Classification : 13J05, 13J10.
THE STRUCTURE OF A RING OF FORMAL SERIES GHIOCEL GROZA 1, AZEEM HAIDER 2 AND S. M. ALI KHAN 3 If K is a field, by means of a sequence S of elements of K is defined a K-algebra K S [[X]] of formal series
More informationAPPLICATIONS OF THE HYPER-POWER METHOD FOR COMPUTING MATRIX PRODUCTS
Univ. Beograd. Publ. Eletrotehn. Fa. Ser. Mat. 15 (2004), 13 25. Available electronically at http: //matematia.etf.bg.ac.yu APPLICATIONS OF THE HYPER-POWER METHOD FOR COMPUTING MATRIX PRODUCTS Predrag
More informationVector and Matrix Norms. Vector and Matrix Norms
Vector and Matrix Norms Vector Space Algebra Matrix Algebra: We let x x and A A, where, if x is an element of an abstract vector space n, and A = A: n m, then x is a complex column vector of length n whose
More informationYunhi Cho and Young-One Kim
Bull. Korean Math. Soc. 41 (2004), No. 1, pp. 27 43 ANALYTIC PROPERTIES OF THE LIMITS OF THE EVEN AND ODD HYPERPOWER SEQUENCES Yunhi Cho Young-One Kim Dedicated to the memory of the late professor Eulyong
More informationMONOTONICITY OF THE ERROR TERM IN GAUSS TURÁN QUADRATURES FOR ANALYTIC FUNCTIONS
ANZIAM J. 48(27), 567 581 MONOTONICITY OF THE ERROR TERM IN GAUSS TURÁN QUADRATURES FOR ANALYTIC FUNCTIONS GRADIMIR V. MILOVANOVIĆ 1 and MIODRAG M. SPALEVIĆ 2 (Received March 19, 26) Abstract For Gauss
More information