LEVERRIER-FADEEV ALGORITHM AND CLASSICAL ORTHOGONAL POLYNOMIALS
|
|
- Benjamin Booth
- 8 years ago
- Views:
Transcription
1 This is a reprint from Revista de la Academia Colombiana de Ciencias Vol 8 (106 (004, LEVERRIER-FADEEV ALGORITHM AND CLASSICAL ORTHOGONAL POLYNOMIALS by J Hernández, F Marcellán & C Rodríguez
2 LEVERRIER-FADEEV ALGORITHM AND CLASSICAL ORTHOGONAL POLYNOMIALS by J Hernández, F Marcellán & C Rodríguez 1 To Professor Jairo Charris Castañeda, as a tribute of our mathematical friendship Resumen Hernández, J, F Marcellán & C Rodríguez: Leverrier Fadeev Algorithm and Classical Orthogonal Polynomials Rev Acad Colomb Cienc 8 (106: 39 47, 004 ISSN Usando propiedades estructurales de los polinomios ortogonales clásicos (Hermite, Laguerre, Jacobi y Bessel, se implementa el algoritmo de Leverrier-Fadeev para obtener el polinomio característico de una matriz cuadrada de elementos complejos Palabras clave: Polinomio característico, funciones de transferencia, polinomios ortogonales, funcionales lineales clásicos Abstract Using structural properties of classical orthogonal polynomials (Hermite, Laguerre, Jacobi, and Bessel, an implementation of Leverrier-Fadeev algorithm to obtain the characteristic polynomial of a square matrix with complex entries is presented Key words: Characteristic Polynomial, Transfer Functions, Orthogonal Polynomials, Classical Linear Functionals 1 Introduction For a given matrix A C n n an algorithm attributed to Leverrier, Fadeev, and others, allows the simultaneous determination of the characteristic polynomial of A and the adjoint matrix of si A, wherei denotes theidentitymatrixinc n n Indeed, if p(s =det(si A =s n + a n k s k denotes the characteristic polynomial of A and 1 Departamento de Matemáticas, Universidad Carlos III de Madrid, Avenida de la Universidad 30, 8911, Leganés, Spain jhbenite@mathuc3mes, pacomarc@inguc3mes, teijeiro@mathuc3mes AMS Classification 000: Primary 4C0, 33C4 39
3 40 n Ã(s =Adj(sI A =s I + s k B n k 1 denotes the adjoint matrix of si A, and taking into account Ã(s =p(s(si A 1, then the coefficients (a k and the matrices (B k canbe generated from a 1 = tr A, B 1 = A + a 1 I, a k = 1 k tr (AB k 1, B k = a k I + AB k 1, (11 for k =,,n 1 Here tr A denotes the trace of the matrix A Notice that (11 can be read as follows (See [3] (si AÃ(s =p(si, dp(s ds =trã(s (1 Despite the little value from a numerical point of view, this algorithm is useful for theoretical purposes as well as for the applications in linear control theory More 1 precisely, is the transfer function of a continuous time linear system with n inputs and n outputs p(sã(s The algorithm takes into account the representation of the characteristic polynomial and the adjoint matrix in terms of the canonical basis { s k} n in the linear space of polynomials with complex coefficients and degree at most n From a computational point of view the accuracy of the algorithm using an orthogonal polynomial system is improved For some particular cases of orthogonal polynomials S Barnett [1] gave an implementation of the algorithm The key idea is the relation (1 as well as the expression of the derivative of the polynomial P k,k=1,,n, in terms of the family {P k } n The aim of our contribution is to present a general approach for families of classical orthogonal polynomials (Hermite, Laguerre, Jacobi, and Bessel taking into account a characterization of such families obtained in [4] Indeed it allows to give an expression of P k as a linear combination of P k+1,p k, and P k 1 Thuswecanshowavery simple implementation of the Leverrier algorithm, where parameters associated with the three-term recurrence relation play the main role The structure of the paper is the following In the section we summarize the basic properties of classical orthogonal polynomials In the section 3 we present the adapted version of Leverrier algorithm for bases of classical orthogonal polynomials, and we analyze it for each family of classical orthogonal polynomials In the section 4, some examples are tested Classical Orthogonal Polynomials Let u be a linear functional in the linear space IP of polynomials with complex coefficients If, denotes the duality bracket then c n = u, x n is said to be the moment of order n associated with the linear functional u The linear functional u is said to be quasi-definite [] if the principal submatrices of the Hankel matrix H =(c i+j i,j=0 are non-singular In such a case, there exists a unique sequence of monic polynomials {P n } n=0 such that (i u, x k P n =0, k =0, 1,,n 1 (ii u, x n P n 0 (iii degp n = n The sequence {P n } n=0 is said to be a sequence of monic orthogonal polynomials (SMOP with respect to u It is very well known that {P n } n=0 satisfies a three-term recurrence relation xp n (x =P n+1 (x+β n P n (x+γ n P (x, (1 n =1,, with γ n 0 The converse is also true and this result is due to several authors despite the fact is known as Favard s Theorem [] If q(x denotes a polynomial, then a new linear functional ũ = q(xu can be introduced as follows ũ, p(x = u, p(xq(x ( for every p IP On the other hand, as for a distribution, the derivative of the linear functional u, Du, is given by Du, p(x = u, p (x, p IP Definition 1 A linear functional u is said to be classical if there exist polynomials φ, ψ, with deg φ and deg ψ =1 suchthat D(φu =ψu (3 Up to a linear change of variables, four cases appear
4 41 (i φ(x = 1 This leads to Hermite linear functional with ψ(x = x (ii φ(x = x This leads to Laguerre linear functional with ψ(x = x + α +1 (iii φ(x =x 1 This yields the Jacobi linear functional with ψ(x = (α + β +x + β α (iv φ(x =x This yields the Bessel linear functional with ψ(x =(α +x + Theorem (see [4] If {P n } n=0 is the SMOP associated with u, then the following statements are equivalent (i u is a classical linear functional (ii {Q n } n=0, withq n = P n+1 n +1,isaSMOP (iii P n = Q n + r n Q + s n Q n (iv φ(xq n = a n P n+ + b n P n+1 + c n P n,withc n 0 Tabla 1 Coefficients in the three-term recurrence relation (1 β n Hermite 0 γ n n Laguerre n + α +1 n(n + α Jacobi Bessel β α (n + α + β(n + α + β + α (n + α(n + α + 4n(n + α(n + β(n + α + β (n + α + β 1(n + α + β (n + α + β +1 4n(n + α (n + α 1(n + α (n + α +1 Tabla Coefficients in the relation of the Theorem (iii r n s n Hermite 0 0 Laguerre n 0 Jacobi Bessel n(α β (n + α + β(n + α + β + 4n (n + α(n + α + 4n(n 1(n + α(n + β (n + α + β 1(n + α + β (n + α + β +1 4n(n 1 (n + α 1(n + α (n + α +1 3 Leverrier-Fadeev Algorithm Let {P n } n=0 be a sequence of monic orthogonal polynomials If we expand the characteristic polynomial p(s and the adjoint matrix Ã(s ofamatrixa Cn n in terms of the above basis in the linear space of polynomials with complex coefficients, then we get: p(s =P n (s+ â n k P k (s, (31
5 4 n Ã(s =P (si + P k (s ˆB n k 1 (3 From the first identity in (1 ( n (si A P (si + P k (s ˆB n k 1 = P n (si + â n k P k (si (33 Taking into account the three-term recurrence relation (1 for the family {P n } n=0, (33 becomes P n (si + â n k P k (si =[P n (s+β P + γ P n ] I P (sa + n (P k+1 (s+β k P k (s+γ k P k 1 (s ˆB n n k 1 P k (sa ˆB n k 1 Equating coefficients of P k in the previous expression we get A ˆB 0 = â 1 I + β ˆB0 + ˆB 1, A ˆB 1 = â I + γ ˆB0 + β n ˆB1 + ˆB, A ˆB n k 1 = â n k I + γ k+1 ˆBn k + β k ˆBn k 1 + ˆB n k, k =1,,,n 3, (34 A ˆB = â n I + γ 1 ˆBn + β 0 ˆB, with ˆB 0 = I Inamatrixform ˆB A ˆB 0 = M ˆB ˆB 0 where M = J n [0 â] J n is the Jacobi matrix of dimension n associated with the SMOP {P n } n=0 i e β 0 γ β 1 γ J n = 0 0 γ β and â = â n â â 1 In the literature, the matrix M is called the comrade matrix of A with respect to the orthogonal system {P n } n=0 His characteristic polynomial is p(s In particular, we get tr A = β j â 1 j=0 On the other hand, from the second relation in (1 for n =, 3, we have n P n(s+ â n k P k(s =np (s+ P k (str ˆB n k 1 (3 If {P n } n=0 is a classical family then, from theorem (iii, we get P k (s = P k+1 (s k +1 + r P k (s k k P k 1 + s (s k,k=, 3, k 1
6 43 Thus, substitution in (3 yields P n(s+ â n k P k(s = P n n(s+r n 1 P n (s+s n P n (s+ n ( P + k+1 (s k +1 + r P k (s P k 1 k + s (s k tr k k 1 ˆB n k 1 + k= ( +tr ˆB P 1(s+tr ˆB P (s n + r 1 P 1(s Finally, equating the coefficients of P k in both hand sides we get (n 1â 1 = nr +tr ˆB 1, (n â = ns + r n tr ˆB 1 +tr ˆB, kâ n k = s k+1 tr ˆB n k + r k tr ˆB n k 1 +tr ˆB n k, k =1,,,n 3 (36 Thus, in order to obtain (â k and(ˆb k we will proceed as follows First Step â 1 = n (β r tr A (37 Indeed, taking traces in the first equation of (34, and (36 { tr A = nâ 1 + nβ +tr ˆB 1, (n 1â 1 = nr +tr ˆB 1, and (37 follows Second Step ˆB 1 = A ˆB 0 +â 1 I β ˆB0 (38 Thus, for k =1,,,n 3, (n kâ n k =(β k r k tr ˆB n k 1 + (γ k+1 s k+1 tr ˆB n k tr n k 1, (311 as well as ˆB n k = A ˆB n k 1 +â n k I γ k+1 ˆBn k β k ˆBn k 1 These results follow from the expressions in (34 and (36 for k =1,,n 3 Finally, taking traces in the last equation of (34 we get nâ n = β 0 tr ˆB + γ 1 tr ˆB n tr Third Step â =(γ s tr ˆB 0 + (β n r n tr ˆB 1 tr 1 (39 As a conclusion we get Theorem 31 (i For k =0, 1,,n 1, Indeed, from the second equation in (34 and (36 { tr 1 = n (γ â +β n tr ˆB 1 +tr ˆB, tr ˆB = (n â ns r n tr ˆB 1, (n kâ n k =(β k r k tr ˆB n k 1 + (γ k+1 s k+1 tr ˆB n k tr n k 1, (31 and (39 follows Fourth Step ˆB = A ˆB 1 +â I γ ˆB0 β n ˆB1 (310 with the convention ˆB 1 =0, r 0 =0, s 1 =0 (ii For k =1,,,n 1 ˆB n k = A ˆB n k 1 +â n k I γ k+1 ˆBn k β k ˆBn k 1 (313
7 44 The implementation of the algorithm is as follows DATA: {β k }, {γ k} n k=1, {r k}, {s k} n k=1 Initial Condition: ˆB 1 =0, ˆB 0 = I 1 From ˆB n k and ˆB n k 1 taking into account (31 we get â n k From (313 we get ˆB n k END and, for each family of monic orthogonal polynomials, is given in below 3 Laguerre Case According to Theorem 31 we get (i (n kâ n k =[(k + α +1 k]tr ˆB n k 1 + (k+1(k+α+1tr ˆB n k tr n k 1 ie (n kâ n k =(k + α + 1tr ˆB n k 1 + (k +1(k + α + 1tr ˆB n k tr n k 1 31 Hermite Case According to Theorem 31 we get (i (n kâ n k = k+1 tr ˆB n k tr n k 1 (ii ˆB n k = A ˆB n k 1 +â n k I k +1 ˆB n k (314 In particular, taking traces in (ii and using (i we get tr ˆB n k = kâ n k This is formula (31 in [1] Furthermore, substituting in (i we get (n kâ n k = (k +1(k + â n k tr ie tr n k 1 = n k 1, (31 (k +1(k + â n k (n kâ n k 4k(k +1(k +1+α(k +1+β (k + α + β + 1(k + α + β + (k + α + β +3 (ii ˆB n k = A ˆB n k 1 +â n k I (k +1(k + α +1ˆB n k (k + α +1ˆB n k 1 (316 Taking traces in (ii and using (i we get tr ˆB n k = kâ n k ktr ˆB n k 1 Thus we deduce (n kâ n k =(k + α + 1tr ˆB n k 1 + (k + α +1 [(k +1â n k 1 tr ˆB ] n k 1 tr n k 1, ie (n kâ n k =(k + α +1(k +1â n k 1 tr n k 1 (317 Up to a normalization this is the formula (33b in [1], when α =0 33 Jacobi Case According to Theorem 31 we get ( β α (n kâ n k = (k + α + β(k + α + β + k(α β tr (k + α + β(k + α + β + ˆB n k 1 + ( 4(k +1(k +1+α(k +1+β(k +1+α + β (k + α + β + 1(k + α + β + (k + α + β +3 tr ˆB n k tr n k 1 = β α k + α + β + tr ˆB n k 1 + 4(k +1(k +1+α(k +1+β (k + α + β + (k + α + β +3 tr ˆB n k tr n k 1 On the other hand, if α = β then we are in the Gegenbauer case The linear functional is symmetric and thus get 4(k +1(k +1+α (n kâ n k = (k +α + (k +α +3 tr ˆB n k tr n k 1 = k +1 k +α +3 tr ˆB n k tr n k 1, (318
8 4 or, equivalently tr ˆB 4k(k +1(k +1+α n k = kâ n k + (k +α + 1(k +α + (k +α +3 tr ˆB n k, ie tr ˆB k(k +1 n k = kâ n k + (k +α + 1(k +α +3 ˆB n k Notice that the symmetry of the linear functional yields an important simplification in our algorithm Furthermore ˆB n k = A ˆB 4(k +1(k + α +1 (k +α +1 n k 1 +â n k I (k +α + 1(k +α + (k +α +3 ˆB n k = A ˆB n k 1 +â n k I (k +1(k +α +1 (k +α + 1(k +α +3 ˆB n k This is, up to the corresponding normalization, the formula (30 in [1] for α =0 ( Bessel Case According to Theorem 31 we get (n kâ n k = ie = α 4k (k + α(k + α + tr ˆB 4(k + 1(k + α +1 n k 1 (k + α + 1(k + α + (k + α +3 tr ˆB n k tr k + α + tr ˆB 4(k +1 n k 1 (k + α + (k + α +3 tr ˆB n k tr n k 1, 1 (n kâ n k + k +1+ α tr ˆB n k 1 +tr together with ˆB n k = A ˆB n k 1 +â n k I + 4 Example n k 1 + ( k +1+ α n k 1 k +1 tr ˆB n k =0, (30 (k + α +3 4(k +1(k + α +1 (k + α + 1(k + α + (k + α +3 ˆB α n k + (k + α(k + α + ˆB n k 1 (31 Consider A = which has characteristic polynomial a(s =s 4 s 3 +9s 7s + We apply the algorithm for each basis 41 Hermite Basis From (31, a 1 = tr A =, and from ( B 1 = a 1 I + A = Using (31, we get and from (314 B = a I 3 B 0 + AB 1 = Using again (31 and from (314 a =3 1 tr (AB 1=1, a 3 = a tr (AB = 9,
9 46 B 3 = a 3 I B 1 + AB = 1 Finally a 4 = 1 4 a 1 4 tr (AB 3= 9 4 Hence, the characteristic polynomial of A is given by (31 as a(s =H 4 (s H 3 (s+1h (s 9 H 1(s+ 9 4 H 0(s 4,, Laguerre Basis We consider the family {L 0 n} n=0 From (317, a 1 =16 tr A =11, and from ( B 1 = a 1 I 7B 0 + A = Using (317, we get a = 9 a 1 1 tr (AB 1=36, and from (316 B = a I 9B 0 B 1 + AB = Using again (317 a 3 = 4 3 a 1 3 tr (AB =3, and from (316 B 3 = a 3 I 4B 1 3B + AB = Finally a 4 = 1 4 a tr (AB 3=7 Hence, the characteristic polynomial of A is given by (31 as a(s =L 0 4(s+11L 0 3(s+36L 0 (s+3l 0 1(s+7L 0 0(s 43 Jacobi Basis We consider the family P n = P n (0,0 (Legendre Polynomials From (318, a 1 = tr A =, and from (319 B 1 = a 1 I + A = Using (318, we get and from ( a = tr (AB 1= 69 7, B = a I 9 3 B 0 + AB 1 = Using again ( a 3 = 1 tr B tr (AB = 10, and from (319 B 3 = a 3 I 4 1 B 1 + AB Finally = a 4 = 1 1 tr B 1 4 tr (AB 3= 6 Hence, the characteristic polynomial of A is given by (31 as a(s =P 4 (s P 3 (s P (s 10P 1 (s+ 6 P 0(s Now, We consider the family U n = P ( 1, 1 n (Chebyshev Polynomials of the second kind From (318, a 1 = tr A =, and from (319 B 1 = a 1 I + A = Using (318, we get a = tr (AB 1= 39 4,
10 47 and from (319 B = a I 1 4 B 0 + AB 1 = Using again (318 a 3 = 1 9 tr B tr (AB = 19, and from (319 Finally B 3 = a 3 I 1 4 B 1 + AB = a 4 = 1 16 tr B 1 4 tr (AB 3= 3 8 Hence, the characteristic polynomial of A is given by (31 as a(s =U 4 (s U 3 (s U (s 19 U 1(s+ 3 8 U 0(s 44 Bessel Basis We consider the family B n = Bn 0 From (30, a 1 = 1 tr A = 6, and from ( B 1 = a 1 I + A = Using (30, we get a = tr B 1 1 tr (AB 1= 10 7, and from (31 B = a I B 0 + AB 1 = Using again (30 a 3 = 1 30 tr B tr B 1 3 tr (AB = 89 1, and from (31 Finally B 3 = a 3 I B 1 + AB = a 4 = 1 1 tr B 1 4 tr B tr (AB 3= 84 Hence, the characteristic polynomial of A is given by (31 as a(s =B 4 (s 6B 3 (s B (s 89 1 B 1(s+ 84 B 0(s Acknowledgements The work of the first author has been supported by Fundación Universidad Carlos III de Madrid The work of the second author has received the financial support from Dirección General de Investigación (Ministerio de Ciencia y Tecnología of Spain, grant BFM C03-0 References [1] S Barnett, Leverrier s algorithm for orthogonal polynomials bases, Linear Alg and Appl 36 (1996, 4 63 [] T S Chihara, An introduction to orthogonal polynomials, Gordon and Breach, New York, 1978 [3] J S Frame, Matrix functions and applications IV: Matrix functions and constituent matrices, IEEE Spectrum 1 (1964, [4] F Marcellán, A Branquinho, & J C Petronilho, Classical orthogonal polynomials: A functional approach, Acta Appl Math 34 (1994,
A simple application of the implicit function theorem
Boletín de la Asociación Matemática Venezolana, Vol. XIX, No. 1 (2012) 71 DIVULGACIÓN MATEMÁTICA A simple application of the implicit function theorem Germán Lozada-Cruz Abstract. In this note we show
More informationA Simple Observation Concerning Contraction Mappings
Revista Colombiana de Matemáticas Volumen 46202)2, páginas 229-233 A Simple Observation Concerning Contraction Mappings Una simple observación acerca de las contracciones German Lozada-Cruz a Universidade
More informationFactorization Theorems
Chapter 7 Factorization Theorems This chapter highlights a few of the many factorization theorems for matrices While some factorization results are relatively direct, others are iterative While some factorization
More informationThe Characteristic Polynomial
Physics 116A Winter 2011 The Characteristic Polynomial 1 Coefficients of the characteristic polynomial Consider the eigenvalue problem for an n n matrix A, A v = λ v, v 0 (1) The solution to this problem
More informationPowers of Two in Generalized Fibonacci Sequences
Revista Colombiana de Matemáticas Volumen 462012)1, páginas 67-79 Powers of Two in Generalized Fibonacci Sequences Potencias de dos en sucesiones generalizadas de Fibonacci Jhon J. Bravo 1,a,B, Florian
More informationVariance Reduction. Pricing American Options. Monte Carlo Option Pricing. Delta and Common Random Numbers
Variance Reduction The statistical efficiency of Monte Carlo simulation can be measured by the variance of its output If this variance can be lowered without changing the expected value, fewer replications
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS Systems of Equations and Matrices Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a
More informationDirect Methods for Solving Linear Systems. Matrix Factorization
Direct Methods for Solving Linear Systems Matrix Factorization Numerical Analysis (9th Edition) R L Burden & J D Faires Beamer Presentation Slides prepared by John Carroll Dublin City University c 2011
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS 1. SYSTEMS OF EQUATIONS AND MATRICES 1.1. Representation of a linear system. The general system of m equations in n unknowns can be written a 11 x 1 + a 12 x 2 +
More informationSimilarity and Diagonalization. Similar Matrices
MATH022 Linear Algebra Brief lecture notes 48 Similarity and Diagonalization Similar Matrices Let A and B be n n matrices. We say that A is similar to B if there is an invertible n n matrix P such that
More informationCONTROLLABILITY. Chapter 2. 2.1 Reachable Set and Controllability. Suppose we have a linear system described by the state equation
Chapter 2 CONTROLLABILITY 2 Reachable Set and Controllability Suppose we have a linear system described by the state equation ẋ Ax + Bu (2) x() x Consider the following problem For a given vector x in
More informationA SURVEY ON CONTINUOUS ELLIPTICAL VECTOR DISTRIBUTIONS
A SURVEY ON CONTINUOUS ELLIPTICAL VECTOR DISTRIBUTIONS Eusebio GÓMEZ, Miguel A. GÓMEZ-VILLEGAS and J. Miguel MARÍN Abstract In this paper it is taken up a revision and characterization of the class of
More informationIntroduction to Matrix Algebra
Psychology 7291: Multivariate Statistics (Carey) 8/27/98 Matrix Algebra - 1 Introduction to Matrix Algebra Definitions: A matrix is a collection of numbers ordered by rows and columns. It is customary
More informationDOCUMENTS DE TREBALL DE LA FACULTAT D ECONOMIA I EMPRESA. Col.lecció d Economia
DOCUMENTS DE TREBALL DE LA FACULTAT D ECONOMIA I EMPRESA Col.lecció d Economia E13/89 On the nucleolus of x assignment games F. Javier Martínez de Albéniz Carles Rafels Neus Ybern F. Javier Martínez de
More informationPUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include 2 + 5.
PUTNAM TRAINING POLYNOMIALS (Last updated: November 17, 2015) Remark. This is a list of exercises on polynomials. Miguel A. Lerma Exercises 1. Find a polynomial with integral coefficients whose zeros include
More informationFactoring Cubic Polynomials
Factoring Cubic Polynomials Robert G. Underwood 1. Introduction There are at least two ways in which using the famous Cardano formulas (1545) to factor cubic polynomials present more difficulties than
More informationChebyshev Expansions
Chapter 3 Chebyshev Expansions The best is the cheapest. Benjamin Franklin 3.1 Introduction In Chapter, approximations were considered consisting of expansions around a specific value of the variable (finite
More informationStarting algorithms for partitioned Runge-Kutta methods: the pair Lobatto IIIA-IIIB
Monografías de la Real Academia de Ciencias de Zaragoza. : 49 8, 4). Starting algorithms for partitioned Runge-Kutta methods: the pair Lobatto IIIA-IIIB I. Higueras and T. Roldán Departamento de Matemática
More informationA PRIORI ESTIMATES FOR SEMISTABLE SOLUTIONS OF SEMILINEAR ELLIPTIC EQUATIONS. In memory of Rou-Huai Wang
A PRIORI ESTIMATES FOR SEMISTABLE SOLUTIONS OF SEMILINEAR ELLIPTIC EQUATIONS XAVIER CABRÉ, MANEL SANCHÓN, AND JOEL SPRUCK In memory of Rou-Huai Wang 1. Introduction In this note we consider semistable
More informationDIVISORS IN A DEDEKIND DOMAIN. Javier Cilleruelo and Jorge Jiménez-Urroz. 1 Introduction
DIVISORS IN A DEDEKIND DOMAIN Javier Cilleruelo and Jorge Jiménez-Urroz 1 Introduction Let A be a Dedekind domain in which we can define a notion of distance. We are interested in the number of divisors
More information1 Sets and Set Notation.
LINEAR ALGEBRA MATH 27.6 SPRING 23 (COHEN) LECTURE NOTES Sets and Set Notation. Definition (Naive Definition of a Set). A set is any collection of objects, called the elements of that set. We will most
More informationa 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.
Chapter 1 LINEAR EQUATIONS 1.1 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,..., a n, b are given
More informationCharacterization Of Polynomials Using Reflection Coefficients
Applied Mathematics E-Notes, 4(2004), 114-121 c ISSN 1607-2510 Available free at mirror sites of http://www.math.nthu.edu.tw/ amen/ Characterization Of Polynomials Using Reflection Coefficients José LuisDíaz-Barrero,JuanJosé
More informationMATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set.
MATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set. Vector space A vector space is a set V equipped with two operations, addition V V (x,y) x + y V and scalar
More informationA number field is a field of finite degree over Q. By the Primitive Element Theorem, any number
Number Fields Introduction A number field is a field of finite degree over Q. By the Primitive Element Theorem, any number field K = Q(α) for some α K. The minimal polynomial Let K be a number field and
More information1 VECTOR SPACES AND SUBSPACES
1 VECTOR SPACES AND SUBSPACES What is a vector? Many are familiar with the concept of a vector as: Something which has magnitude and direction. an ordered pair or triple. a description for quantities such
More informationJUST THE MATHS UNIT NUMBER 1.8. ALGEBRA 8 (Polynomials) A.J.Hobson
JUST THE MATHS UNIT NUMBER 1.8 ALGEBRA 8 (Polynomials) by A.J.Hobson 1.8.1 The factor theorem 1.8.2 Application to quadratic and cubic expressions 1.8.3 Cubic equations 1.8.4 Long division of polynomials
More information2.3. Finding polynomial functions. An Introduction:
2.3. Finding polynomial functions. An Introduction: As is usually the case when learning a new concept in mathematics, the new concept is the reverse of the previous one. Remember how you first learned
More informationFactorization Algorithms for Polynomials over Finite Fields
Degree Project Factorization Algorithms for Polynomials over Finite Fields Sajid Hanif, Muhammad Imran 2011-05-03 Subject: Mathematics Level: Master Course code: 4MA11E Abstract Integer factorization is
More information= 2 + 1 2 2 = 3 4, Now assume that P (k) is true for some fixed k 2. This means that
Instructions. Answer each of the questions on your own paper, and be sure to show your work so that partial credit can be adequately assessed. Credit will not be given for answers (even correct ones) without
More informationA note on companion matrices
Linear Algebra and its Applications 372 (2003) 325 33 www.elsevier.com/locate/laa A note on companion matrices Miroslav Fiedler Academy of Sciences of the Czech Republic Institute of Computer Science Pod
More informationSome probability and statistics
Appendix A Some probability and statistics A Probabilities, random variables and their distribution We summarize a few of the basic concepts of random variables, usually denoted by capital letters, X,Y,
More informationFactoring analytic multivariate polynomials and non-standard Cauchy-Riemann conditions
Factoring analytic multivariate polynomials and non-standard Cauchy-Riemann conditions Tomas Recio a J Rafael Sendra b Luis Felipe Tabera a, Carlos Villarino b a Dpto de Matemáticas, Universidad de Cantabria,
More informationDynamic Eigenvalues for Scalar Linear Time-Varying Systems
Dynamic Eigenvalues for Scalar Linear Time-Varying Systems P. van der Kloet and F.L. Neerhoff Department of Electrical Engineering Delft University of Technology Mekelweg 4 2628 CD Delft The Netherlands
More informationLecture 4: Partitioned Matrices and Determinants
Lecture 4: Partitioned Matrices and Determinants 1 Elementary row operations Recall the elementary operations on the rows of a matrix, equivalent to premultiplying by an elementary matrix E: (1) multiplying
More informationChapter 6. Orthogonality
6.3 Orthogonal Matrices 1 Chapter 6. Orthogonality 6.3 Orthogonal Matrices Definition 6.4. An n n matrix A is orthogonal if A T A = I. Note. We will see that the columns of an orthogonal matrix must be
More information13 MATH FACTS 101. 2 a = 1. 7. The elements of a vector have a graphical interpretation, which is particularly easy to see in two or three dimensions.
3 MATH FACTS 0 3 MATH FACTS 3. Vectors 3.. Definition We use the overhead arrow to denote a column vector, i.e., a linear segment with a direction. For example, in three-space, we write a vector in terms
More informationDecember 4, 2013 MATH 171 BASIC LINEAR ALGEBRA B. KITCHENS
December 4, 2013 MATH 171 BASIC LINEAR ALGEBRA B KITCHENS The equation 1 Lines in two-dimensional space (1) 2x y = 3 describes a line in two-dimensional space The coefficients of x and y in the equation
More informationa 1 x + a 0 =0. (3) ax 2 + bx + c =0. (4)
ROOTS OF POLYNOMIAL EQUATIONS In this unit we discuss polynomial equations. A polynomial in x of degree n, where n 0 is an integer, is an expression of the form P n (x) =a n x n + a n 1 x n 1 + + a 1 x
More informationSolution to Homework 2
Solution to Homework 2 Olena Bormashenko September 23, 2011 Section 1.4: 1(a)(b)(i)(k), 4, 5, 14; Section 1.5: 1(a)(b)(c)(d)(e)(n), 2(a)(c), 13, 16, 17, 18, 27 Section 1.4 1. Compute the following, if
More informationThe Matrix Elements of a 3 3 Orthogonal Matrix Revisited
Physics 116A Winter 2011 The Matrix Elements of a 3 3 Orthogonal Matrix Revisited 1. Introduction In a class handout entitled, Three-Dimensional Proper and Improper Rotation Matrices, I provided a derivation
More informationContinued Fractions. Darren C. Collins
Continued Fractions Darren C Collins Abstract In this paper, we discuss continued fractions First, we discuss the definition and notation Second, we discuss the development of the subject throughout history
More informationLINEAR ALGEBRA. September 23, 2010
LINEAR ALGEBRA September 3, 00 Contents 0. LU-decomposition.................................... 0. Inverses and Transposes................................. 0.3 Column Spaces and NullSpaces.............................
More informationNonlinear Iterative Partial Least Squares Method
Numerical Methods for Determining Principal Component Analysis Abstract Factors Béchu, S., Richard-Plouet, M., Fernandez, V., Walton, J., and Fairley, N. (2016) Developments in numerical treatments for
More information4.5 Chebyshev Polynomials
230 CHAP. 4 INTERPOLATION AND POLYNOMIAL APPROXIMATION 4.5 Chebyshev Polynomials We now turn our attention to polynomial interpolation for f (x) over [ 1, 1] based on the nodes 1 x 0 < x 1 < < x N 1. Both
More informationThe Singular Value Decomposition in Symmetric (Löwdin) Orthogonalization and Data Compression
The Singular Value Decomposition in Symmetric (Löwdin) Orthogonalization and Data Compression The SVD is the most generally applicable of the orthogonal-diagonal-orthogonal type matrix decompositions Every
More informationcalculating the result modulo 3, as follows: p(0) = 0 3 + 0 + 1 = 1 0,
Homework #02, due 1/27/10 = 9.4.1, 9.4.2, 9.4.5, 9.4.6, 9.4.7. Additional problems recommended for study: (9.4.3), 9.4.4, 9.4.9, 9.4.11, 9.4.13, (9.4.14), 9.4.17 9.4.1 Determine whether the following polynomials
More informationMath 115A HW4 Solutions University of California, Los Angeles. 5 2i 6 + 4i. (5 2i)7i (6 + 4i)( 3 + i) = 35i + 14 ( 22 6i) = 36 + 41i.
Math 5A HW4 Solutions September 5, 202 University of California, Los Angeles Problem 4..3b Calculate the determinant, 5 2i 6 + 4i 3 + i 7i Solution: The textbook s instructions give us, (5 2i)7i (6 + 4i)(
More informationContinued Fractions and the Euclidean Algorithm
Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction
More informationApplied Linear Algebra I Review page 1
Applied Linear Algebra Review 1 I. Determinants A. Definition of a determinant 1. Using sum a. Permutations i. Sign of a permutation ii. Cycle 2. Uniqueness of the determinant function in terms of properties
More informationMath 312 Homework 1 Solutions
Math 31 Homework 1 Solutions Last modified: July 15, 01 This homework is due on Thursday, July 1th, 01 at 1:10pm Please turn it in during class, or in my mailbox in the main math office (next to 4W1) Please
More informationSusana Sanduvete-Chaves, Salvador Chacón-Moscoso, Milagrosa Sánchez- Martín y José Antonio Pérez-Gil ( )
ACCIÓN PSICOLÓGICA, junio 2014, vol. 10, n. o 2, 3-20. ISSN: 1578-908X 19 THE REVISED OSTERLIND INDEX. A COMPARATIVE ANALYSIS IN CONTENT VALIDITY STUDIES 1 EL ÍNDICE DE OSTERLIND REVISADO. UN ANÁLISIS
More informationON LIMIT LAWS FOR CENTRAL ORDER STATISTICS UNDER POWER NORMALIZATION. E. I. Pancheva, A. Gacovska-Barandovska
Pliska Stud. Math. Bulgar. 22 (2015), STUDIA MATHEMATICA BULGARICA ON LIMIT LAWS FOR CENTRAL ORDER STATISTICS UNDER POWER NORMALIZATION E. I. Pancheva, A. Gacovska-Barandovska Smirnov (1949) derived four
More informationName: Section Registered In:
Name: Section Registered In: Math 125 Exam 3 Version 1 April 24, 2006 60 total points possible 1. (5pts) Use Cramer s Rule to solve 3x + 4y = 30 x 2y = 8. Be sure to show enough detail that shows you are
More informationDyna ISSN: 0012-7353 dyna@unalmed.edu.co Universidad Nacional de Colombia Colombia
Dyna ISSN: 0012-7353 dyna@unalmed.edu.co Universidad Nacional de Colombia Colombia VELÁSQUEZ HENAO, JUAN DAVID; RUEDA MEJIA, VIVIANA MARIA; FRANCO CARDONA, CARLOS JAIME ELECTRICITY DEMAND FORECASTING USING
More informationRecall that two vectors in are perpendicular or orthogonal provided that their dot
Orthogonal Complements and Projections Recall that two vectors in are perpendicular or orthogonal provided that their dot product vanishes That is, if and only if Example 1 The vectors in are orthogonal
More informationComputing divisors and common multiples of quasi-linear ordinary differential equations
Computing divisors and common multiples of quasi-linear ordinary differential equations Dima Grigoriev CNRS, Mathématiques, Université de Lille Villeneuve d Ascq, 59655, France Dmitry.Grigoryev@math.univ-lille1.fr
More informationWinter Camp 2011 Polynomials Alexander Remorov. Polynomials. Alexander Remorov alexanderrem@gmail.com
Polynomials Alexander Remorov alexanderrem@gmail.com Warm-up Problem 1: Let f(x) be a quadratic polynomial. Prove that there exist quadratic polynomials g(x) and h(x) such that f(x)f(x + 1) = g(h(x)).
More informationFUZZY CLUSTERING ANALYSIS OF DATA MINING: APPLICATION TO AN ACCIDENT MINING SYSTEM
International Journal of Innovative Computing, Information and Control ICIC International c 0 ISSN 34-48 Volume 8, Number 8, August 0 pp. 4 FUZZY CLUSTERING ANALYSIS OF DATA MINING: APPLICATION TO AN ACCIDENT
More informationBig Data Interpolation: An Effcient Sampling Alternative for Sensor Data Aggregation
Big Data Interpolation: An Effcient Sampling Alternative for Sensor Data Aggregation Hadassa Daltrophe, Shlomi Dolev, Zvi Lotker Ben-Gurion University Outline Introduction Motivation Problem definition
More informationOn the existence of multiple principal eigenvalues for some indefinite linear eigenvalue problems
RACSAM Rev. R. Acad. Cien. Serie A. Mat. VOL. 97 (3), 2003, pp. 461 466 Matemática Aplicada / Applied Mathematics Comunicación Preliminar / Preliminary Communication On the existence of multiple principal
More information2 Polynomials over a field
2 Polynomials over a field A polynomial over a field F is a sequence (a 0, a 1, a 2,, a n, ) where a i F i with a i = 0 from some point on a i is called the i th coefficient of f We define three special
More informationA New Extension of the Exponential Distribution
Revista Colombiana de Estadística Junio 2014, volumen 37, no. 1, pp. 25 a 34 A New Extension of the Exponential Distribution Una nueva extensión de la distribución exponencial Yolanda M. Gómez 1,a, Heleno
More informationMathematics for Computer Science/Software Engineering. Notes for the course MSM1F3 Dr. R. A. Wilson
Mathematics for Computer Science/Software Engineering Notes for the course MSM1F3 Dr. R. A. Wilson October 1996 Chapter 1 Logic Lecture no. 1. We introduce the concept of a proposition, which is a statement
More informationON GALOIS REALIZATIONS OF THE 2-COVERABLE SYMMETRIC AND ALTERNATING GROUPS
ON GALOIS REALIZATIONS OF THE 2-COVERABLE SYMMETRIC AND ALTERNATING GROUPS DANIEL RABAYEV AND JACK SONN Abstract. Let f(x) be a monic polynomial in Z[x] with no rational roots but with roots in Q p for
More informationUniversity of Lille I PC first year list of exercises n 7. Review
University of Lille I PC first year list of exercises n 7 Review Exercise Solve the following systems in 4 different ways (by substitution, by the Gauss method, by inverting the matrix of coefficients
More information15. Symmetric polynomials
15. Symmetric polynomials 15.1 The theorem 15.2 First examples 15.3 A variant: discriminants 1. The theorem Let S n be the group of permutations of {1,, n}, also called the symmetric group on n things.
More informationBindel, Spring 2012 Intro to Scientific Computing (CS 3220) Week 3: Wednesday, Feb 8
Spaces and bases Week 3: Wednesday, Feb 8 I have two favorite vector spaces 1 : R n and the space P d of polynomials of degree at most d. For R n, we have a canonical basis: R n = span{e 1, e 2,..., e
More informationElasticity Theory Basics
G22.3033-002: Topics in Computer Graphics: Lecture #7 Geometric Modeling New York University Elasticity Theory Basics Lecture #7: 20 October 2003 Lecturer: Denis Zorin Scribe: Adrian Secord, Yotam Gingold
More informationMATHEMATICS FOR ENGINEERS BASIC MATRIX THEORY TUTORIAL 2
MATHEMATICS FO ENGINEES BASIC MATIX THEOY TUTOIAL This is the second of two tutorials on matrix theory. On completion you should be able to do the following. Explain the general method for solving simultaneous
More informationProbability Generating Functions
page 39 Chapter 3 Probability Generating Functions 3 Preamble: Generating Functions Generating functions are widely used in mathematics, and play an important role in probability theory Consider a sequence
More informationRow Ideals and Fibers of Morphisms
Michigan Math. J. 57 (2008) Row Ideals and Fibers of Morphisms David Eisenbud & Bernd Ulrich Affectionately dedicated to Mel Hochster, who has been an inspiration to us for many years, on the occasion
More informationSecond Order Differential Equations with Hypergeometric Solutions of Degree Three
Second Order Differential Equations with Hypergeometric Solutions of Degree Three Vijay Jung Kunwar, Mark van Hoeij Department of Mathematics, Florida State University Tallahassee, FL 0-07, USA vkunwar@mathfsuedu,
More informationSOLVING POLYNOMIAL EQUATIONS
C SOLVING POLYNOMIAL EQUATIONS We will assume in this appendix that you know how to divide polynomials using long division and synthetic division. If you need to review those techniques, refer to an algebra
More informationMathematics Course 111: Algebra I Part IV: Vector Spaces
Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are
More informationU.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009. Notes on Algebra
U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009 Notes on Algebra These notes contain as little theory as possible, and most results are stated without proof. Any introductory
More informationIntroduction to Partial Differential Equations. John Douglas Moore
Introduction to Partial Differential Equations John Douglas Moore May 2, 2003 Preface Partial differential equations are often used to construct models of the most basic theories underlying physics and
More informationInfluences in low-degree polynomials
Influences in low-degree polynomials Artūrs Bačkurs December 12, 2012 1 Introduction In 3] it is conjectured that every bounded real polynomial has a highly influential variable The conjecture is known
More informationSolving Systems of Linear Equations
LECTURE 5 Solving Systems of Linear Equations Recall that we introduced the notion of matrices as a way of standardizing the expression of systems of linear equations In today s lecture I shall show how
More informationCharacterization of some binary words with few squares
Characterization of some binary words with few squares Golnaz Badkobeh a, Pascal Ochem b a Department of Computer Science, University of Sheffield, UK b CNRS - LIRMM, Montpellier, France Abstract Thue
More informationMAT188H1S Lec0101 Burbulla
Winter 206 Linear Transformations A linear transformation T : R m R n is a function that takes vectors in R m to vectors in R n such that and T (u + v) T (u) + T (v) T (k v) k T (v), for all vectors u
More informationSOME PROPERTIES OF FIBER PRODUCT PRESERVING BUNDLE FUNCTORS
SOME PROPERTIES OF FIBER PRODUCT PRESERVING BUNDLE FUNCTORS Ivan Kolář Abstract. Let F be a fiber product preserving bundle functor on the category FM m of the proper base order r. We deduce that the r-th
More informationNew Methods Providing High Degree Polynomials with Small Mahler Measure
New Methods Providing High Degree Polynomials with Small Mahler Measure G. Rhin and J.-M. Sac-Épée CONTENTS 1. Introduction 2. A Statistical Method 3. A Minimization Method 4. Conclusion and Prospects
More informationFactoring Polynomials
Factoring Polynomials Sue Geller June 19, 2006 Factoring polynomials over the rational numbers, real numbers, and complex numbers has long been a standard topic of high school algebra. With the advent
More information5. Factoring by the QF method
5. Factoring by the QF method 5.0 Preliminaries 5.1 The QF view of factorability 5.2 Illustration of the QF view of factorability 5.3 The QF approach to factorization 5.4 Alternative factorization by the
More informationLinear Control Systems
Chapter 3 Linear Control Systems Topics : 1. Controllability 2. Observability 3. Linear Feedback 4. Realization Theory Copyright c Claudiu C. Remsing, 26. All rights reserved. 7 C.C. Remsing 71 Intuitively,
More informationChapter 7. Permutation Groups
Chapter 7 Permutation Groups () We started the study of groups by considering planar isometries In the previous chapter, we learnt that finite groups of planar isometries can only be cyclic or dihedral
More informationUNCORRECTED PAGE PROOFS
number and and algebra TopIC 17 Polynomials 17.1 Overview Why learn this? Just as number is learned in stages, so too are graphs. You have been building your knowledge of graphs and functions over time.
More informationLecture Notes to Accompany. Scientific Computing An Introductory Survey. by Michael T. Heath. Chapter 10
Lecture Notes to Accompany Scientific Computing An Introductory Survey Second Edition by Michael T. Heath Chapter 10 Boundary Value Problems for Ordinary Differential Equations Copyright c 2001. Reproduction
More informationMATHEMATICS KNOWLEDGE FOR TEACHING WITHIN A FUNCTIONAL PERSPECTIVE OF PRESERVICE TEACHER TRAINING
MATHEMATICS KNOWLEDGE FOR TEACHING WITHIN A FUNCTIONAL PERSPECTIVE OF PRESERVICE TEACHER TRAINING Pedro Gómez Universidad de Granada C/. Alisios 17, Albolote 18820, Spain Phone/Fax: (34)958537304 pgomez@valnet.es
More information1 Introduction to Matrices
1 Introduction to Matrices In this section, important definitions and results from matrix algebra that are useful in regression analysis are introduced. While all statements below regarding the columns
More informationMATH 423 Linear Algebra II Lecture 38: Generalized eigenvectors. Jordan canonical form (continued).
MATH 423 Linear Algebra II Lecture 38: Generalized eigenvectors Jordan canonical form (continued) Jordan canonical form A Jordan block is a square matrix of the form λ 1 0 0 0 0 λ 1 0 0 0 0 λ 0 0 J = 0
More informationAs we have seen, there is a close connection between Legendre symbols of the form
Gauss Sums As we have seen, there is a close connection between Legendre symbols of the form 3 and cube roots of unity. Secifically, if is a rimitive cube root of unity, then 2 ± i 3 and hence 2 2 3 In
More informationFinite dimensional C -algebras
Finite dimensional C -algebras S. Sundar September 14, 2012 Throughout H, K stand for finite dimensional Hilbert spaces. 1 Spectral theorem for self-adjoint opertors Let A B(H) and let {ξ 1, ξ 2,, ξ n
More informationThe van Hoeij Algorithm for Factoring Polynomials
The van Hoeij Algorithm for Factoring Polynomials Jürgen Klüners Abstract In this survey we report about a new algorithm for factoring polynomials due to Mark van Hoeij. The main idea is that the combinatorial
More informationMath 55: Discrete Mathematics
Math 55: Discrete Mathematics UC Berkeley, Spring 2012 Homework # 9, due Wednesday, April 11 8.1.5 How many ways are there to pay a bill of 17 pesos using a currency with coins of values of 1 peso, 2 pesos,
More informationRoots of Polynomials
Roots of Polynomials (Com S 477/577 Notes) Yan-Bin Jia Sep 24, 2015 A direct corollary of the fundamental theorem of algebra is that p(x) can be factorized over the complex domain into a product a n (x
More informationInner Product Spaces
Math 571 Inner Product Spaces 1. Preliminaries An inner product space is a vector space V along with a function, called an inner product which associates each pair of vectors u, v with a scalar u, v, and
More information9.2 Summation Notation
9. Summation Notation 66 9. Summation Notation In the previous section, we introduced sequences and now we shall present notation and theorems concerning the sum of terms of a sequence. We begin with a
More information