Explicit solution of the polynomial least-squares approximation problem on Chebyshev extrema nodes
|
|
- Dominick Dickerson
- 5 years ago
- Views:
Transcription
1 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 della Calabria, 87036, Rende (Cs), Italy Abstract In this paper we propose an explicit solution to the polynoial least squares approxiation proble on Chebyshev extrea nodes. We also show that the inverse of the noral atrix on this set of nodes can be represented as the su of two syetric atrices: a full rank atrix which adits a Cholesky factorization and a -rank atrix. Finally we discuss the nuerical properties of the proposed forulas. Key words: Polynoial approxiation, Cholesky factorization, Cobinatorial identities 1 Introduction The polynoial least squares proble (PLSP) has so any applications [1]. The proble is forulated as follows: given a set of points Θ = {(x i,f i ), i = 1,,...,n}, find a polynoial p(x) of degree less than or equal to 1 with coefficients c 1,c,...,c such that the least squares criterion n ɛ(c 1,c,...,c ) = (p(x i ) f i ) i=1 Corresponding author. Tel.: ; fax: E-ail address: fedele@si.deis.unical.it (G. Fedele) Preprint subitted to Elsevier Science 5 March 007
2 is iniized. In general, is uch saller than n. The proble can be reforulated as follows in c V c f, (1) V is a Vanderonde atrix of order n, depending on the observation points x i V (i,j) = x j 1 i, i = 1,,...,n, j = 1,,...,, () and f R n and c R are vectors containing experiental data f i and coefficients c i, respectively. Finding the solution of proble (1) is equivalent to copute the best approxiate solution [1] of the over-deterined linear syste V c = f. This is given by c = (V T V ) 1 V T f = V f, V is the Moore-Penrose pseudo-inverse of V, that is well-defined if x i x j. The nuerical solution of PLSP is usually ill-conditioned. The ost reliable algoriths either use orthogonal transforations, for exaple the well-known QR ethod, or copute the Cholesky factorization of the noral atrix B = V T V. The choice between the two ethods is still an open proble. Golub and Van Loan [8] reported soe guidelines for the above choice, based on the value of the ratio n/ and on that of the residual ρ = in c V c f, but they recognized that both ethods can give inaccurate solutions when they are applied to probles with large value of κ (V ). Rectangular Vanderonde atrices on not structured nodes have been considered in [4], fast algoriths for the Cholesky factorization of the noral atrix B = V T V and for the QR factorization of V have been given. Here we give explicit solution to the proble (1) for Chebyshev extrea [] (also called Gauss-Lobatto [7] or Clenshaw-Curtis) nodes x k = cos ( ) k 1 n 1 π, k = 1,,...,n. (3) First we present soe properties of the noral atrix defined on these nodes and show that it can be represented as a su of two syetric atrix: the first adits a Cholesky factorization, the second is a -rank atrix. Moreover we propose an explicit forula for the Moore-Penrose pseudoinverse of V. This work generalizes soe results given in [6] when n =, that corresponds to the polynoial interpolation proble. As in [6] we obtain the results using cobinatorial identities and other arguents fro nuber theory. Fro the practical point of view the proposed forulas give an algorith that is fast and accurate. The effect of finite precision arithetic is investigated by perforing several nuerical experients.
3 The structure of the noral atrix In this section we present soe properties of the noral atrix B = V T V. Such a atrix has a very siple structure; in particular its entries exhibit a chessboard pattern, and they are rational nubers. Proposition 1 B(i, j) = 1 + ˆB(i, j), i,j = 1,,...,, B(i 1, j 1) = 1 + ˆB(i 1, j 1), i,j = 1,,..., (4) ˆB(i, j) = ˆB(i 1, j 1) = ( ) n 1 i+j i+j i+j 1, i,j = 1,,...,, (5) ( ) n 1 i+j 4 i+j 4 i+j, i,j = 1,,...,. Proof. It is easy to see [9] that B(i,j) = 0 when i + j is odd. If i + j is even, by Lea 1 (see Appendix), then eq. (4) follows. Note that B = ˆB + u 1 u T 1 + u u T, (6) u 1 (i) = Mod[i, ], i = 1,,...,, (7) u (i) = Mod[i + 1, ], i = 1,,...,, therefore atrix B is the su of a full-rank atrix ˆB and a -rank atrix. The following proposition gives the Cholesky factorization of the atrix ˆB. Proposition ˆB = ˆR T ˆL ˆR, (8) ˆR(i, j) = ( ) i j j 1 j i, i = 1,,...,, j = i,i + 1,...,, ˆR(i 1, j 1) = ( ) i j j j i, i = 1,,...,, j = i,i + 1,..., (9) 3
4 and 1, i = 1, ˆL(i,i) = (n 1) 1, i =, 3,...,. i 3 (10) Proof. By (9) and (10), eq. (8) can be rewritten as: ˆB(i, j) = 3 i j (n 1) k 1 ( i 1 i k ˆB(i 1, j 1) = 4 i j (n 1) ( i i i j (n 1) k j 1, (11) j k j j 1 ( i i k By using Lea and standard arguents we can get the (8). Further result is an explicit expression for the inverse of ˆR. Proposition 3 ˆR 1 (1, 1) = 1, (1) j j k. ˆR 1 (1, j 1) = ( 1) j+1 1, j =, 3,..., j 3, ˆR 1 (i 1, j 1) = ( 1) i+j 1 j 1 j i i 1 ( ) i+j 3 i 3, i =, 3,...,, j = i,i + 1,...,, ˆR 1 (i, j) = ( 1) i+j 1 j 1 j i i 1 ( ) i+j i, i = 1,,...,, j = i,i + 1,...,. (13) Proof. It ust be shown that ˆR 1 ˆR = δi,j, i,j = 1,,...,. (14) For brevity, we consider only the even rows, then eq. (14) becoes ( ˆR 1 ˆR)i,j = ( 1) i j i (i 1) ( j i + k ( 1) k (k 1) k=i i j 1. (15) j k 4
5 By using forula (3) in [5] we have ( ˆR 1 ˆR)i,j = δ i,j. Siilarly we can obtain the case for odd rows. Now the explicit expression of inverse noral atrix is given. Theore 1 and M (i, j) = ( 1) i+j i+j (n 1)(n+ 1 Mod[,]) i,j = 1,,...,, M (i 1, j 1) = ( 1) i+j i,j = 1,,...,. B 1 = M 1 M (16) M 1 = ˆB 1, (17) ( +i Mod[,] i 1 i+j 4 (n 1)(n+ +Mod[,]) Proof. By Sherann-Morrison s forula [8], we have +j Mod[,], j 1 ( +i 4+Mod[,] i +j 4+Mod[,], j (18) M 1 (u 1 u T 1 + u u T ) [ I + M 1 (u 1 u T 1 + u u T ) ] 1 M1 = M, (19) then ˆBM B = u 1 u T 1 + u u T. (0) For brevity we consider the case = q. and ( ˆBM B) i,j = ( 1)q n+ 1 ( ˆBM B) i 1,j 1 = ( 1)q n+ q ( 1) k ( ) k 1 q+k 1 k 1 + ( 1) q n 1 q (n+ 1) j 1 ( 1) k ( q+k 1 k 1 q ( 1) k ( ) k q+k k + ( 1) q n 1 q (n+ ) j ( 1) k ( q+k k (1) k+j k+j 1, () k+j 4 k+j. 5
6 Since [10] ( ) q q + k 1 ( 1) k k 1 = ( 1) q q, (3) k 1 using Lea 3, the (16) follows. Proposition 4 [6] V T = DU T H, (4) 1, i = 1, D(i,i) = (5) 1, i =, 3,...,, i U(1, j 1) = ( ) j 3 j 1, j = 1,,...,, U(i 1, j 1) = ( ) j j i, i =, 3,...,, j = i,i + 1,...,, (6) and U(i, j) = ( ) j 1 j i, i = 1,,...,, j = i,i + 1,..., [ ] (i 1)(j 1) H(i,j) = ( 1) i+1 cos π, i = 1,,...,, j = 1,,...,n. (7) n 1 By ultiplying Q 1 = M 1 DU T and Q = M DU T, we obtain the final result: The Moore-Penrose atrix pseudo-inverse of V is V = (Q 1 Q )H, (8) Q 1 (i,i) = i 1 n 1, i = 1,,...,, i+j i Q 1 (i, j) = ( 1) j 1 n 1 j i ( i+j j i 1), i = 1,,...,, j = i + 1,i +,...,, ( i+j i 1 j Q 1 (i 1, j 1) = ( 1) i+j 3 n 1 j i j i 1), i = 1,,...,, j = i + 1,i +,...,, (9) 6
7 Q (i, j) = i = 1,,..., +i Mod[,] ( ( 1) +i Mod[,] (n 1)(n+ 1 Mod[,]) i i 1, j = 1,,...,, ), ( +i 4+Mod[,] Q (i 1, j 1) = (n 1)(n+ +Mod[,]) i 1 i i = 1,,...,, j =, 3,...,, ( 1) +i+mod[,] ), (30) ( 1) +i+mod[,] ( +i 4+Mod[,] Q (i 1, 1) = (n 1)(n+ +Mod[,]) i i i = 1,,...,. ), 3 Nuerical properties and experients In this section we present soe properties of the proposed forulas and the results of nuerical experients carried out in order to deonstrate the perforance of the new algorith. First note that the atrix V can be rewritten as V = 1 n 1 S( ˆQ 1 ˆQ )H (31) S(i, i) = 1 n+ 1 Mod[,], i = 1,,...,, (3) 1 S(i 1, i 1) =, i = 1,,..., n+ +Mod[,], ˆQ 1 = (n 1)S 1 Q 1 (33) and ˆQ = (n 1)S 1 Q. (34) 7
8 Moreover the atrix Q 1 = (n 1)Q 1 can be constructed using the following properties: Q 1 (1, 1) = 1, Q 1 (i,i) = Q 1 (i 1,i 1), i =, 3,...,, Q 1 (1, j 1) = ( 1) j+1, j =, 3,...,, Q 1 (i,j) = Q 1 (i 1,j 1) Q 1 (i,j ), i =, 3,...,, j = i +,i + 3,...,, i + j even. (35) It is iportant to underline that both the entries of ˆQ1 and ˆQ are integer nubers which can be stored without rounding. To construct ˆQ, let c 1 and c be defined as c 1 = ( 1) Mod[ + 1, ], c = ( 1) + Mod[, ] and consider the vector v defined as follows: v(1) = ( 1) +1+ Mod[,], v(i) = ( 1 + c 1 i 1) v(i 1), i = 1,,...,, then v(i + 1) = ( ) 1 c i v(i), i = 1,,...,, i + 1, ˆQ (i,j) = v(i), i = 1,,...,, j =, 3,...,, i + j even, ˆQ (i 1, 1) = v(i 1), i = 1,,...,. Note that the product b = H f can be constructed efficiently by considering the syetric properties of the atrix H. Define two vectors f 1 and f as: f 1 = { } n f(i), i = 1,,...,, 8
9 then b(i) = n j=1 and if n is odd then { } n f = f(n + 1 i), i = 1,,...,, H(i,j)(f 1 (j) + ( 1) i+1 f (j)), i = 1,,...,, ( ) n + 1 b(i 1) = b(i 1) + ( 1) i+1 f, i = 1,,...,. Here we report soe nuerical experients aied at investigating the effectiveness of the factorization (31). The proposed ethod costs n O() flops. We copare our algorith (EF) with the proposed one in [3] (CB) it costs 10n flops. These algoriths have been ipleented in Matheatica [13], which allows arbitrary precision nubers. For soe values of and n, we have generated one thousand vectors f, with entries uniforly distributed in [ 1, 1], and have coputed the exact solution of the proble (1) using extended precision of 56 digits. For each algorith we have coputed the axiu coponent wise relative errors E EF = ax 1 i ĉ EF i c i c i (36) E CB = ax 1 i ĉ CB i c i c i (37) ĉ EF i and ĉ CB i are the approxiate solutions (coputed in achine precision) of EF and CB algorith respectively. The ean and the axiu of E EF and E CB are reported in Tables 1 and. Tables 1 and report also the fraction of trials in which the proposed algorith gives equal or ore accurate result than the CB algorith. 4 Conclusions In this paper we have considered the proble of finding an explicit factorization of both the noral atrix, defined on Chebyshev extrea nodes, and its inverse. Such a factorization allows us to design an efficient algorith to solve least-square probles on these nodes. Fro the practical point of view the proposed forulas give an algorith that is fast and accurate as it is confired by several nuerical experients. 9
10 CB EF s.r. ax ean ax ean EF vs CB Table 1 LMS. n = 100. Maxiu and ean value of E CB and E EF. Success rate of EF algorith over 1000 runs. CB EF s.r. ax ean ax ean EF vs CB Table LMS. n = Maxiu and ean value of E CB and E EF. Success rate of EF algorith over 1000 runs. Appendix Lea 1 [ n γ = cos ( )] q k 1 n 1 π = q ( ) q (n 1) (A-1) q 10
11 Proof. By using the identity [9]: (cos x) q = 1 q ( ) q + 1 q 1 q q s=0 ( ) q cos [(q s)x], s (A-) we get: γ = 1 q ( ) q n + q n q 1 1 q s=0 ( ) [ q cos (q s) k 1 ] s n 1 π (A-3) Since [ n cos (q s) k 1 ] n 1 π = 1, (A-4) and q 1 1 q s=0 ( ) q Γ(q + 1/) = 1 s πγ(q + 1) (A-5) the (A-1) follows. Lea [1] in(i,j) ( i 1 i k j 1 = 1 j k ( ) i + j. (A-6) i + j 1 Proof. By the syetric property of binoial coefficients we get: in(i,j) ( i 1 i k j 1 = j k in(i,j) ( i 1 j 1. i 1 + k j 1 + k Supposing i = in(i,j) and taking into account the identity [10] we have: k ( ( ) r s r + s =, + k n + k r + n 11
12 0 i ( i 1 i k j 1 + j k i ( i 1 i k j 1 = j k ( ) i + j. i + j 1 Lea 3 ( q i + k q + k 1 ( 1) k = ( 1) q i 1. (A-7) i + k 1 k 1 Proof. Let f(q,k,i) be the quantity defined as follows: f(q,k,i) = ( 1) k ( i + k i + k 1 Such a quantity satisfies the recursive property: q + k 1. (A-8) k 1 f(q,k,i + 1) = ( 4 ) f(q,k,i), i = 1,,...,q 1. (A-9) i + k By suing each ter in (A-9) for k fro 1 to q, we get: S(q,i + 1) = 4S(q,i) q ( 1) k i + k ( i + k i + k 1 q + k 1, (A-10) k 1 S(q,i) = q ( 1 ( ) k i+k q+k 1 i+k 1 k 1. The suation in (A-10) can be written as: ( ) i i q i H [{i + 1/, 1 q, 1 + q}, {i +, 3/}, 1], i = 1,,...,q. (A-11) The hypergeoetric function involved, satisfies Saalschüts s conditions [11], then (A-11) has the following closed-expression: 1
13 0, i = 1,,...,q 1, ( 1) q+1 1 q q+1( q q ), i = q. (A-1) Since S(q, 1) = ( 1) q then (A-7) follows. References [1] A. Björck, Nuerical Methods for Least Squares Probles, SIAM, [] L. Brutan, Lebesgue functions for polynoial interpolation - a survey, Annals of Nuer. Math., (1997), [3] S.D. Conte, C. De Boor, Eleentary Nuerical Analysis, McGraw-Hill, Second. ed., 197. [4] C.J. Deeure, Fast QR factorization of Vanderonde atrices, Linear Algebra Appl., 1 (1989), [5] A. Eisinberg, G. Franzé, N. Salerno, Rectangular Vanderonde on Chebyshev nodes, Linear Algebra Appl., 338 (001), [6] A. Eisinberg, G. Fedele, Vanderonde systes on Gauss-Lobatto Chebyshev nodes, Applied Math. Cop., 170 (005), [7] W. Gautschi, Orthogonal Polynoials. Coputation and Approxiation, Oxford Science Publ., 004. [8] G.H. Golub, A. van Loan, Matrix Coputations, Johns Hopkins U. Press, [9] I.S. Gradshteyn, I.M. Ryzhik, Table of Integrals, Series and Products, third ed., Acadeic Press, New York, [10] D.E. Knuth, The Art of Coputer Prograing, vol. 1, second ed., Addison- Wesley, Reading, MA, [11] Y.L. Luke, The special functions and their approxiations, vol. 1, Acadeic Press, [1] P. Pugliese, On the noral atrix of the polynoial LS proble over the Chebyshev points, Linear Algebra Appl., 78 (004), [13] S. Wolfra, Matheatica: a Syste for Doing Matheatics by Coputers, Second. ed., Addison-Wesley,
Discrete Orthogonal Polynomials on Equidistant Nodes
International Mathematical Forum, 2, 2007, no. 21, 1007-1020 Discrete Orthogonal Polynomials on Equidistant Nodes Alfredo Eisinberg and Giuseppe Fedele Dip. di Elettronica, Informatica e Sistemistica Università
More informationA note on the multiplication of sparse matrices
Cent. Eur. J. Cop. Sci. 41) 2014 1-11 DOI: 10.2478/s13537-014-0201-x Central European Journal of Coputer Science A note on the ultiplication of sparse atrices Research Article Keivan Borna 12, Sohrab Aboozarkhani
More informationModel Fitting. CURM Background Material, Fall 2014 Dr. Doreen De Leon
Model Fitting CURM Background Material, Fall 014 Dr. Doreen De Leon 1 Introduction Given a set of data points, we often want to fit a selected odel or type to the data (e.g., we suspect an exponential
More informationUniform Approximation and Bernstein Polynomials with Coefficients in the Unit Interval
Unifor Approxiation and Bernstein Polynoials with Coefficients in the Unit Interval Weiang Qian and Marc D. Riedel Electrical and Coputer Engineering, University of Minnesota 200 Union St. S.E. Minneapolis,
More informationFeature Extraction Techniques
Feature Extraction Techniques Unsupervised Learning II Feature Extraction Unsupervised ethods can also be used to find features which can be useful for categorization. There are unsupervised ethods that
More informationBernoulli Wavelet Based Numerical Method for Solving Fredholm Integral Equations of the Second Kind
ISSN 746-7659, England, UK Journal of Inforation and Coputing Science Vol., No., 6, pp.-9 Bernoulli Wavelet Based Nuerical Method for Solving Fredhol Integral Equations of the Second Kind S. C. Shiralashetti*,
More informationOn 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 informationA new type of lower bound for the largest eigenvalue of a symmetric matrix
Linear Algebra and its Applications 47 7 9 9 www.elsevier.co/locate/laa A new type of lower bound for the largest eigenvalue of a syetric atrix Piet Van Mieghe Delft University of Technology, P.O. Box
More informationON THE TWO-LEVEL PRECONDITIONING IN LEAST SQUARES METHOD
PROCEEDINGS OF THE YEREVAN STATE UNIVERSITY Physical and Matheatical Sciences 04,, p. 7 5 ON THE TWO-LEVEL PRECONDITIONING IN LEAST SQUARES METHOD M a t h e a t i c s Yu. A. HAKOPIAN, R. Z. HOVHANNISYAN
More informationA Bernstein-Markov Theorem for Normed Spaces
A Bernstein-Markov Theore for Nored Spaces Lawrence A. Harris Departent of Matheatics, University of Kentucky Lexington, Kentucky 40506-0027 Abstract Let X and Y be real nored linear spaces and let φ :
More informationCurious Bounds for Floor Function Sums
1 47 6 11 Journal of Integer Sequences, Vol. 1 (018), Article 18.1.8 Curious Bounds for Floor Function Sus Thotsaporn Thanatipanonda and Elaine Wong 1 Science Division Mahidol University International
More informationThe Euler-Maclaurin Formula and Sums of Powers
DRAFT VOL 79, NO 1, FEBRUARY 26 1 The Euler-Maclaurin Forula and Sus of Powers Michael Z Spivey University of Puget Sound Tacoa, WA 98416 spivey@upsedu Matheaticians have long been intrigued by the su
More informationPage 1 Lab 1 Elementary Matrix and Linear Algebra Spring 2011
Page Lab Eleentary Matri and Linear Algebra Spring 0 Nae Due /03/0 Score /5 Probles through 4 are each worth 4 points.. Go to the Linear Algebra oolkit site ransforing a atri to reduced row echelon for
More informationHermite s Rule Surpasses Simpson s: in Mathematics Curricula Simpson s Rule. Should be Replaced by Hermite s
International Matheatical Foru, 4, 9, no. 34, 663-686 Herite s Rule Surpasses Sipson s: in Matheatics Curricula Sipson s Rule Should be Replaced by Herite s Vito Lapret University of Lublana Faculty of
More informationOn the summations involving Wigner rotation matrix elements
Journal of Matheatical Cheistry 24 (1998 123 132 123 On the suations involving Wigner rotation atrix eleents Shan-Tao Lai a, Pancracio Palting b, Ying-Nan Chiu b and Harris J. Silverstone c a Vitreous
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 informationFast Montgomery-like Square Root Computation over GF(2 m ) for All Trinomials
Fast Montgoery-like Square Root Coputation over GF( ) for All Trinoials Yin Li a, Yu Zhang a, a Departent of Coputer Science and Technology, Xinyang Noral University, Henan, P.R.China Abstract This letter
More informationa a a a a a a m a b a b
Algebra / Trig Final Exa Study Guide (Fall Seester) Moncada/Dunphy Inforation About the Final Exa The final exa is cuulative, covering Appendix A (A.1-A.5) and Chapter 1. All probles will be ultiple choice
More informationGeneralized AOR Method for Solving System of Linear Equations. Davod Khojasteh Salkuyeh. Department of Mathematics, University of Mohaghegh Ardabili,
Australian Journal of Basic and Applied Sciences, 5(3): 35-358, 20 ISSN 99-878 Generalized AOR Method for Solving Syste of Linear Equations Davod Khojasteh Salkuyeh Departent of Matheatics, University
More informationAlgebraic Montgomery-Yang problem: the log del Pezzo surface case
c 2014 The Matheatical Society of Japan J. Math. Soc. Japan Vol. 66, No. 4 (2014) pp. 1073 1089 doi: 10.2969/jsj/06641073 Algebraic Montgoery-Yang proble: the log del Pezzo surface case By DongSeon Hwang
More informationRESTARTED FULL ORTHOGONALIZATION METHOD FOR SHIFTED LINEAR SYSTEMS
BIT Nuerical Matheatics 43: 459 466, 2003. 2003 Kluwer Acadeic Publishers. Printed in The Netherlands 459 RESTARTED FULL ORTHOGONALIZATION METHOD FOR SHIFTED LINEAR SYSTEMS V. SIMONCINI Dipartiento di
More informationAlgorithms for Bernoulli and Related Polynomials
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 10 (2007, Article 07.5.4 Algoriths for Bernoulli Related Polynoials Ayhan Dil, Veli Kurt Mehet Cenci Departent of Matheatics Adeniz University Antalya,
More informationRECOVERY OF A DENSITY FROM THE EIGENVALUES OF A NONHOMOGENEOUS MEMBRANE
Proceedings of ICIPE rd International Conference on Inverse Probles in Engineering: Theory and Practice June -8, 999, Port Ludlow, Washington, USA : RECOVERY OF A DENSITY FROM THE EIGENVALUES OF A NONHOMOGENEOUS
More informationA SIMPLE METHOD FOR FINDING THE INVERSE MATRIX OF VANDERMONDE MATRIX. E. A. Rawashdeh. 1. Introduction
MATEMATIČKI VESNIK MATEMATIQKI VESNIK Corrected proof Available online 40708 research paper originalni nauqni rad A SIMPLE METHOD FOR FINDING THE INVERSE MATRIX OF VANDERMONDE MATRIX E A Rawashdeh Abstract
More informationGeneralized binomial expansion on Lorentz cones
J. Math. Anal. Appl. 79 003 66 75 www.elsevier.co/locate/jaa Generalized binoial expansion on Lorentz cones Honging Ding Departent of Matheatics and Matheatical Coputer Science, University of St. Louis,
More informationThe concavity and convexity of the Boros Moll sequences
The concavity and convexity of the Boros Moll sequences Ernest X.W. Xia Departent of Matheatics Jiangsu University Zhenjiang, Jiangsu 1013, P.R. China ernestxwxia@163.co Subitted: Oct 1, 013; Accepted:
More informationLecture 21 Nov 18, 2015
CS 388R: Randoized Algoriths Fall 05 Prof. Eric Price Lecture Nov 8, 05 Scribe: Chad Voegele, Arun Sai Overview In the last class, we defined the ters cut sparsifier and spectral sparsifier and introduced
More information1. INTRODUCTION AND RESULTS
SOME IDENTITIES INVOLVING THE FIBONACCI NUMBERS AND LUCAS NUMBERS Wenpeng Zhang Research Center for Basic Science, Xi an Jiaotong University Xi an Shaanxi, People s Republic of China (Subitted August 00
More informationAN APPLICATION OF CUBIC B-SPLINE FINITE ELEMENT METHOD FOR THE BURGERS EQUATION
Aksan, E..: An Applıcatıon of Cubıc B-Splıne Fınıte Eleent Method for... THERMAL SCIECE: Year 8, Vol., Suppl., pp. S95-S S95 A APPLICATIO OF CBIC B-SPLIE FIITE ELEMET METHOD FOR THE BRGERS EQATIO by Eine
More informationNumerical Solution of Volterra-Fredholm Integro-Differential Equation by Block Pulse Functions and Operational Matrices
Gen. Math. Notes, Vol. 4, No. 2, June 211, pp. 37-48 ISSN 2219-7184; Copyright c ICSRS Publication, 211 www.i-csrs.org Available free online at http://www.gean.in Nuerical Solution of Volterra-Fredhol
More informationThe Weierstrass Approximation Theorem
36 The Weierstrass Approxiation Theore Recall that the fundaental idea underlying the construction of the real nubers is approxiation by the sipler rational nubers. Firstly, nubers are often deterined
More informationSolving initial value problems by residual power series method
Theoretical Matheatics & Applications, vol.3, no.1, 13, 199-1 ISSN: 179-9687 (print), 179-979 (online) Scienpress Ltd, 13 Solving initial value probles by residual power series ethod Mohaed H. Al-Sadi
More information#A52 INTEGERS 10 (2010), COMBINATORIAL INTERPRETATIONS OF BINOMIAL COEFFICIENT ANALOGUES RELATED TO LUCAS SEQUENCES
#A5 INTEGERS 10 (010), 697-703 COMBINATORIAL INTERPRETATIONS OF BINOMIAL COEFFICIENT ANALOGUES RELATED TO LUCAS SEQUENCES Bruce E Sagan 1 Departent of Matheatics, Michigan State University, East Lansing,
More informationTHE POLYNOMIAL REPRESENTATION OF THE TYPE A n 1 RATIONAL CHEREDNIK ALGEBRA IN CHARACTERISTIC p n
THE POLYNOMIAL REPRESENTATION OF THE TYPE A n RATIONAL CHEREDNIK ALGEBRA IN CHARACTERISTIC p n SHEELA DEVADAS AND YI SUN Abstract. We study the polynoial representation of the rational Cherednik algebra
More informationPoly-Bernoulli Numbers and Eulerian Numbers
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 21 (2018, Article 18.6.1 Poly-Bernoulli Nubers and Eulerian Nubers Beáta Bényi Faculty of Water Sciences National University of Public Service H-1441
More informationResearch Article Some Formulae of Products of the Apostol-Bernoulli and Apostol-Euler Polynomials
Discrete Dynaics in Nature and Society Volue 202, Article ID 927953, pages doi:055/202/927953 Research Article Soe Forulae of Products of the Apostol-Bernoulli and Apostol-Euler Polynoials Yuan He and
More informationA Simplified Analytical Approach for Efficiency Evaluation of the Weaving Machines with Automatic Filling Repair
Proceedings of the 6th SEAS International Conference on Siulation, Modelling and Optiization, Lisbon, Portugal, Septeber -4, 006 0 A Siplified Analytical Approach for Efficiency Evaluation of the eaving
More informationOBJECTIVES INTRODUCTION
M7 Chapter 3 Section 1 OBJECTIVES Suarize data using easures of central tendency, such as the ean, edian, ode, and idrange. Describe data using the easures of variation, such as the range, variance, and
More informationUsing EM To Estimate A Probablity Density With A Mixture Of Gaussians
Using EM To Estiate A Probablity Density With A Mixture Of Gaussians Aaron A. D Souza adsouza@usc.edu Introduction The proble we are trying to address in this note is siple. Given a set of data points
More informationBlock designs and statistics
Bloc designs and statistics Notes for Math 447 May 3, 2011 The ain paraeters of a bloc design are nuber of varieties v, bloc size, nuber of blocs b. A design is built on a set of v eleents. Each eleent
More informationLinear recurrences and asymptotic behavior of exponential sums of symmetric boolean functions
Linear recurrences and asyptotic behavior of exponential sus of syetric boolean functions Francis N. Castro Departent of Matheatics University of Puerto Rico, San Juan, PR 00931 francis.castro@upr.edu
More informationCOS 424: Interacting with Data. Written Exercises
COS 424: Interacting with Data Hoework #4 Spring 2007 Regression Due: Wednesday, April 18 Written Exercises See the course website for iportant inforation about collaboration and late policies, as well
More informationStudy on Markov Alternative Renewal Reward. Process for VLSI Cell Partitioning
Int. Journal of Math. Analysis, Vol. 7, 2013, no. 40, 1949-1960 HIKARI Ltd, www.-hikari.co http://dx.doi.org/10.12988/ia.2013.36142 Study on Markov Alternative Renewal Reward Process for VLSI Cell Partitioning
More informationIN modern society that various systems have become more
Developent of Reliability Function in -Coponent Standby Redundant Syste with Priority Based on Maxiu Entropy Principle Ryosuke Hirata, Ikuo Arizono, Ryosuke Toohiro, Satoshi Oigawa, and Yasuhiko Takeoto
More informationNew Classes of Positive Semi-Definite Hankel Tensors
Miniax Theory and its Applications Volue 017, No., 1 xxx New Classes of Positive Sei-Definite Hankel Tensors Qun Wang Dept. of Applied Matheatics, The Hong Kong Polytechnic University, Hung Ho, Kowloon,
More informationPolygonal Designs: Existence and Construction
Polygonal Designs: Existence and Construction John Hegean Departent of Matheatics, Stanford University, Stanford, CA 9405 Jeff Langford Departent of Matheatics, Drake University, Des Moines, IA 5011 G
More informationLow complexity bit parallel multiplier for GF(2 m ) generated by equally-spaced trinomials
Inforation Processing Letters 107 008 11 15 www.elsevier.co/locate/ipl Low coplexity bit parallel ultiplier for GF generated by equally-spaced trinoials Haibin Shen a,, Yier Jin a,b a Institute of VLSI
More informationConvex Programming for Scheduling Unrelated Parallel Machines
Convex Prograing for Scheduling Unrelated Parallel Machines Yossi Azar Air Epstein Abstract We consider the classical proble of scheduling parallel unrelated achines. Each job is to be processed by exactly
More informationPOWER SUM IDENTITIES WITH GENERALIZED STIRLING NUMBERS
POWER SUM IDENTITIES WITH GENERALIZED STIRLING NUMBERS KHRISTO N. BOYADZHIEV Abstract. We prove several cobinatorial identities involving Stirling functions of the second ind with a coplex variable. The
More informationAn l 1 Regularized Method for Numerical Differentiation Using Empirical Eigenfunctions
Journal of Matheatical Research with Applications Jul., 207, Vol. 37, No. 4, pp. 496 504 DOI:0.3770/j.issn:2095-265.207.04.0 Http://jre.dlut.edu.cn An l Regularized Method for Nuerical Differentiation
More informationChapter 6 1-D Continuous Groups
Chapter 6 1-D Continuous Groups Continuous groups consist of group eleents labelled by one or ore continuous variables, say a 1, a 2,, a r, where each variable has a well- defined range. This chapter explores:
More informationarxiv: v1 [math.na] 10 Oct 2016
GREEDY GAUSS-NEWTON ALGORITHM FOR FINDING SPARSE SOLUTIONS TO NONLINEAR UNDERDETERMINED SYSTEMS OF EQUATIONS MÅRTEN GULLIKSSON AND ANNA OLEYNIK arxiv:6.395v [ath.na] Oct 26 Abstract. We consider the proble
More information1 Bounding the Margin
COS 511: Theoretical Machine Learning Lecturer: Rob Schapire Lecture #12 Scribe: Jian Min Si March 14, 2013 1 Bounding the Margin We are continuing the proof of a bound on the generalization error of AdaBoost
More informationKonrad-Zuse-Zentrum für Informationstechnik Berlin Heilbronner Str. 10, D Berlin - Wilmersdorf
Konrad-Zuse-Zentru für Inforationstechnik Berlin Heilbronner Str. 10, D-10711 Berlin - Wilersdorf Folkar A. Borneann On the Convergence of Cascadic Iterations for Elliptic Probles SC 94-8 (Marz 1994) 1
More informationBipartite subgraphs and the smallest eigenvalue
Bipartite subgraphs and the sallest eigenvalue Noga Alon Benny Sudaov Abstract Two results dealing with the relation between the sallest eigenvalue of a graph and its bipartite subgraphs are obtained.
More informationarxiv: v1 [math.co] 22 Oct 2018
The Hessenberg atrices and Catalan and its generalized nubers arxiv:80.0970v [ath.co] 22 Oct 208 Jishe Feng Departent of Matheatics, Longdong University, Qingyang, Gansu, 745000, China E-ail: gsfjs6567@26.co.
More information13.2 Fully Polynomial Randomized Approximation Scheme for Permanent of Random 0-1 Matrices
CS71 Randoness & Coputation Spring 018 Instructor: Alistair Sinclair Lecture 13: February 7 Disclaier: These notes have not been subjected to the usual scrutiny accorded to foral publications. They ay
More informationAccuracy of the Scaling Law for Experimental Natural Frequencies of Rectangular Thin Plates
The 9th Conference of Mechanical Engineering Network of Thailand 9- October 005, Phuket, Thailand Accuracy of the caling Law for Experiental Natural Frequencies of Rectangular Thin Plates Anawat Na songkhla
More informationTopic 5a Introduction to Curve Fitting & Linear Regression
/7/08 Course Instructor Dr. Rayond C. Rup Oice: A 337 Phone: (95) 747 6958 E ail: rcrup@utep.edu opic 5a Introduction to Curve Fitting & Linear Regression EE 4386/530 Coputational ethods in EE Outline
More informationClosed-form evaluations of Fibonacci Lucas reciprocal sums with three factors
Notes on Nuber Theory Discrete Matheatics Print ISSN 30-32 Online ISSN 2367-827 Vol. 23 207 No. 2 04 6 Closed-for evaluations of Fibonacci Lucas reciprocal sus with three factors Robert Frontczak Lesbank
More informationAlgorithms for parallel processor scheduling with distinct due windows and unit-time jobs
BULLETIN OF THE POLISH ACADEMY OF SCIENCES TECHNICAL SCIENCES Vol. 57, No. 3, 2009 Algoriths for parallel processor scheduling with distinct due windows and unit-tie obs A. JANIAK 1, W.A. JANIAK 2, and
More information. The univariate situation. It is well-known for a long tie that denoinators of Pade approxiants can be considered as orthogonal polynoials with respe
PROPERTIES OF MULTIVARIATE HOMOGENEOUS ORTHOGONAL POLYNOMIALS Brahi Benouahane y Annie Cuyt? Keywords Abstract It is well-known that the denoinators of Pade approxiants can be considered as orthogonal
More informationNew upper bound for the B-spline basis condition number II. K. Scherer. Institut fur Angewandte Mathematik, Universitat Bonn, Bonn, Germany.
New upper bound for the B-spline basis condition nuber II. A proof of de Boor's 2 -conjecture K. Scherer Institut fur Angewandte Matheati, Universitat Bonn, 535 Bonn, Gerany and A. Yu. Shadrin Coputing
More informationLEADING COEFFICIENTS AND THE MULTIPLICITY OF KNOWN ROOTS
LEADING COEFFICIENTS AND THE MULTIPLICITY OF KNOWN ROOTS GREGORY J. CLARK AND JOSHUA N. COOPER Abstract. We show that a onic univariate polynoial over a field of characteristic zero, with k distinct non-zero
More informationNecessity of low effective dimension
Necessity of low effective diension Art B. Owen Stanford University October 2002, Orig: July 2002 Abstract Practitioners have long noticed that quasi-monte Carlo ethods work very well on functions that
More informationThe Hilbert Schmidt version of the commutator theorem for zero trace matrices
The Hilbert Schidt version of the coutator theore for zero trace atrices Oer Angel Gideon Schechtan March 205 Abstract Let A be a coplex atrix with zero trace. Then there are atrices B and C such that
More informationA Generalized Permanent Estimator and its Application in Computing Multi- Homogeneous Bézout Number
Research Journal of Applied Sciences, Engineering and Technology 4(23): 5206-52, 202 ISSN: 2040-7467 Maxwell Scientific Organization, 202 Subitted: April 25, 202 Accepted: May 3, 202 Published: Deceber
More informationGeneralized eigenfunctions and a Borel Theorem on the Sierpinski Gasket.
Generalized eigenfunctions and a Borel Theore on the Sierpinski Gasket. Kasso A. Okoudjou, Luke G. Rogers, and Robert S. Strichartz May 26, 2006 1 Introduction There is a well developed theory (see [5,
More informationA BLOCK MONOTONE DOMAIN DECOMPOSITION ALGORITHM FOR A NONLINEAR SINGULARLY PERTURBED PARABOLIC PROBLEM
INTERNATIONAL JOURNAL OF NUMERICAL ANALYSIS AND MODELING Volue 3, Nuber 2, Pages 211 231 c 2006 Institute for Scientific Coputing and Inforation A BLOCK MONOTONE DOMAIN DECOMPOSITION ALGORITHM FOR A NONLINEAR
More informationJordan Journal of Physics
Volue 5, Nuber 3, 212. pp. 113-118 ARTILE Jordan Journal of Physics Networks of Identical apacitors with a Substitutional apacitor Departent of Physics, Al-Hussein Bin Talal University, Ma an, 2, 71111,
More informationCSE525: Randomized Algorithms and Probabilistic Analysis May 16, Lecture 13
CSE55: Randoied Algoriths and obabilistic Analysis May 6, Lecture Lecturer: Anna Karlin Scribe: Noah Siegel, Jonathan Shi Rando walks and Markov chains This lecture discusses Markov chains, which capture
More informationDedicated to Richard S. Varga on the occasion of his 80th birthday.
MATRICES, MOMENTS, AND RATIONAL QUADRATURE G. LÓPEZ LAGOMASINO, L. REICHEL, AND L. WUNDERLICH Dedicated to Richard S. Varga on the occasion of his 80th birthday. Abstract. Many probles in science and engineering
More informationSupport Vector Machine Classification of Uncertain and Imbalanced data using Robust Optimization
Recent Researches in Coputer Science Support Vector Machine Classification of Uncertain and Ibalanced data using Robust Optiization RAGHAV PAT, THEODORE B. TRAFALIS, KASH BARKER School of Industrial Engineering
More informationNon-Parametric Non-Line-of-Sight Identification 1
Non-Paraetric Non-Line-of-Sight Identification Sinan Gezici, Hisashi Kobayashi and H. Vincent Poor Departent of Electrical Engineering School of Engineering and Applied Science Princeton University, Princeton,
More informationA PROOF OF MELHAM S CONJECTURE
A PROOF OF MELHAM S CONJECTRE EMRAH KILIC 1, ILKER AKKS, AND HELMT PRODINGER 3 Abstract. In this paper, we consider Melha s conecture involving Fibonacci and Lucas nubers. After rewriting it in ters of
More informationWhen Short Runs Beat Long Runs
When Short Runs Beat Long Runs Sean Luke George Mason University http://www.cs.gu.edu/ sean/ Abstract What will yield the best results: doing one run n generations long or doing runs n/ generations long
More informationSymbolic Analysis as Universal Tool for Deriving Properties of Non-linear Algorithms Case study of EM Algorithm
Acta Polytechnica Hungarica Vol., No., 04 Sybolic Analysis as Universal Tool for Deriving Properties of Non-linear Algoriths Case study of EM Algorith Vladiir Mladenović, Miroslav Lutovac, Dana Porrat
More informationLATTICE POINT SOLUTION OF THE GENERALIZED PROBLEM OF TERQUEi. AND AN EXTENSION OF FIBONACCI NUMBERS.
i LATTICE POINT SOLUTION OF THE GENERALIZED PROBLEM OF TERQUEi. AND AN EXTENSION OF FIBONACCI NUMBERS. C. A. CHURCH, Jr. and H. W. GOULD, W. Virginia University, Morgantown, W. V a. In this paper we give
More informationPrincipal Components Analysis
Principal Coponents Analysis Cheng Li, Bingyu Wang Noveber 3, 204 What s PCA Principal coponent analysis (PCA) is a statistical procedure that uses an orthogonal transforation to convert a set of observations
More informationThe Fundamental Basis Theorem of Geometry from an algebraic point of view
Journal of Physics: Conference Series PAPER OPEN ACCESS The Fundaental Basis Theore of Geoetry fro an algebraic point of view To cite this article: U Bekbaev 2017 J Phys: Conf Ser 819 012013 View the article
More informationA note on the realignment criterion
A note on the realignent criterion Chi-Kwong Li 1, Yiu-Tung Poon and Nung-Sing Sze 3 1 Departent of Matheatics, College of Willia & Mary, Williasburg, VA 3185, USA Departent of Matheatics, Iowa State University,
More informationA PROOF OF A CONJECTURE OF MELHAM
A PROOF OF A CONJECTRE OF MELHAM EMRAH KILIC, ILKER AKKS, AND HELMT PRODINGER Abstract. In this paper, we consider Melha s conecture involving Fibonacci and Lucas nubers. After rewriting it in ters of
More informationCh 12: Variations on Backpropagation
Ch 2: Variations on Backpropagation The basic backpropagation algorith is too slow for ost practical applications. It ay take days or weeks of coputer tie. We deonstrate why the backpropagation algorith
More informationComplexity reduction in low-delay Farrowstructure-based. filters utilizing linear-phase subfilters
Coplexity reduction in low-delay Farrowstructure-based variable fractional delay FIR filters utilizing linear-phase subfilters Air Eghbali and Håkan Johansson Linköping University Post Print N.B.: When
More informationA Model for the Selection of Internet Service Providers
ISSN 0146-4116, Autoatic Control and Coputer Sciences, 2008, Vol. 42, No. 5, pp. 249 254. Allerton Press, Inc., 2008. Original Russian Text I.M. Aliev, 2008, published in Avtoatika i Vychislitel naya Tekhnika,
More informationPolynomial Division By Convolution
Applied Matheatics E-Notes, (0), 9 c ISSN 0-0 Available free at irror sites of http://wwwathnthuedutw/aen/ Polynoial Division By Convolution Feng Cheng Chang y Received 9 March 0 Abstract The division
More informationVARIABLES. Contents 1. Preliminaries 1 2. One variable Special cases 8 3. Two variables Special cases 14 References 16
q-generating FUNCTIONS FOR ONE AND TWO VARIABLES. THOMAS ERNST Contents 1. Preliinaries 1. One variable 6.1. Special cases 8 3. Two variables 10 3.1. Special cases 14 References 16 Abstract. We use a ultidiensional
More informationUpper bound on false alarm rate for landmine detection and classification using syntactic pattern recognition
Upper bound on false alar rate for landine detection and classification using syntactic pattern recognition Ahed O. Nasif, Brian L. Mark, Kenneth J. Hintz, and Nathalia Peixoto Dept. of Electrical and
More informationHomework 3 Solutions CSE 101 Summer 2017
Hoework 3 Solutions CSE 0 Suer 207. Scheduling algoriths The following n = 2 jobs with given processing ties have to be scheduled on = 3 parallel and identical processors with the objective of iniizing
More informationLeast Squares Fitting of Data
Least Squares Fitting of Data David Eberly, Geoetric Tools, Redond WA 98052 https://www.geoetrictools.co/ This work is licensed under the Creative Coons Attribution 4.0 International License. To view a
More informationThe Simplex Method is Strongly Polynomial for the Markov Decision Problem with a Fixed Discount Rate
The Siplex Method is Strongly Polynoial for the Markov Decision Proble with a Fixed Discount Rate Yinyu Ye April 20, 2010 Abstract In this note we prove that the classic siplex ethod with the ost-negativereduced-cost
More informationarxiv: v1 [cs.ds] 3 Feb 2014
arxiv:40.043v [cs.ds] 3 Feb 04 A Bound on the Expected Optiality of Rando Feasible Solutions to Cobinatorial Optiization Probles Evan A. Sultani The Johns Hopins University APL evan@sultani.co http://www.sultani.co/
More informationThe degree of a typical vertex in generalized random intersection graph models
Discrete Matheatics 306 006 15 165 www.elsevier.co/locate/disc The degree of a typical vertex in generalized rando intersection graph odels Jerzy Jaworski a, Michał Karoński a, Dudley Stark b a Departent
More informationResearch Article Approximate Multidegree Reduction of λ-bézier Curves
Matheatical Probles in Engineering Volue 6 Article ID 87 pages http://dxdoiorg//6/87 Research Article Approxiate Multidegree Reduction of λ-bézier Curves Gang Hu Huanxin Cao and Suxia Zhang Departent of
More informationAn Inverse Interpolation Method Utilizing In-Flight Strain Measurements for Determining Loads and Structural Response of Aerospace Vehicles
An Inverse Interpolation Method Utilizing In-Flight Strain Measureents for Deterining Loads and Structural Response of Aerospace Vehicles S. Shkarayev and R. Krashantisa University of Arizona, Tucson,
More informationDEPARTMENT OF ECONOMETRICS AND BUSINESS STATISTICS
ISSN 1440-771X AUSTRALIA DEPARTMENT OF ECONOMETRICS AND BUSINESS STATISTICS An Iproved Method for Bandwidth Selection When Estiating ROC Curves Peter G Hall and Rob J Hyndan Working Paper 11/00 An iproved
More informationA1. Find all ordered pairs (a, b) of positive integers for which 1 a + 1 b = 3
A. Find all ordered pairs a, b) of positive integers for which a + b = 3 08. Answer. The six ordered pairs are 009, 08), 08, 009), 009 337, 674) = 35043, 674), 009 346, 673) = 3584, 673), 674, 009 337)
More informationFeedforward Networks
Feedforward Networks Gradient Descent Learning and Backpropagation Christian Jacob CPSC 433 Christian Jacob Dept.of Coputer Science,University of Calgary CPSC 433 - Feedforward Networks 2 Adaptive "Prograing"
More informationIn this chapter, we consider several graph-theoretic and probabilistic models
THREE ONE GRAPH-THEORETIC AND STATISTICAL MODELS 3.1 INTRODUCTION In this chapter, we consider several graph-theoretic and probabilistic odels for a social network, which we do under different assuptions
More informationOptical Properties of Plasmas of High-Z Elements
Forschungszentru Karlsruhe Techni und Uwelt Wissenschaftlishe Berichte FZK Optical Properties of Plasas of High-Z Eleents V.Tolach 1, G.Miloshevsy 1, H.Würz Project Kernfusion 1 Heat and Mass Transfer
More information