INTEGER POWERS OF ANTI-BIDIAGONAL HANKEL MATRICES
|
|
- Hugo Blake
- 6 years ago
- Views:
Transcription
1 Indian J Pure Appl Math, 49: 87-98, March 08 c Indian National Science Academy DOI: 0007/s INTEGER POWERS OF ANTI-BIDIAGONAL HANKEL MATRICES João Lita da Silva Department of Mathematics and GeoBioTec Faculty of Sciences and Technology NOVA University of Lisbon Quinta da Torre, Caparica, Portugal jfls@fctunlpt; joaolita@gmailcom Received 8 September 06; accepted 9 May 07 In this paper we derive a general expression for integer powers of real upper and lower antibidiagonal matrices with constant anti-diagonals using Chebyshev polynomials An explicit formula for the inverse of these matrices is also provided Key words : Hankel matrices; anti-bidiagonal matrices; Chebyshev polynomials INTRODUCTION The computation of integer powers of square matrices is required in several branches of mathematics such as differential equations, linear dynamical systems, graph theory or numerical analysis particularly, it is important in some numerical problems in order to know whether a square matrix is convergent or semi-convergent Recently, some authors studied this subject for a specific type of Hankel matrices see [5-8,, ] among others The main goal of this paper is to establish an expression for integer powers of real anti-bidiagonal Hankel matrices, ie matrices of the form antitridiag n a, c, 0 and antitridiag n 0, c, b, a, b, c R, proceeding with the formulas developed in [6] and [7] Recall that the shape of these matrices, namely the absence of symmetry about the northeast-southwest diagonal in general, makes the approach to this problem be more tricky than the persymmetric case To overcome this nuisance, we shall employ a useful lemma presented in [6] and suitable results about eigenvalues and eigenvectors of general tridiagonal matrices This technique will allow us to achieve the desired expressions for integer powers of both upper and lower real anti-bidiagonal Hankel matrices at the expense of Chebyshev
2 88 JOÃO LITA DA SILVA polynomials Additionally, a formula not depending on any unknown parameter for the inverse of complex anti-bidiagonal Hankel matrices will be also presented INTEGER POWERS: GENERAL EXPRESSION We begin this section by reviewing some special types of matrices that play a central role in this paper We say that an n n matrix is upper anti-bidiagonal if it has the form 0 0 a n c n a n c n 0 c n ; 0 a 3 c 3 a c c 0 0 an n n matrix is said to be lower anti-bidiagonal if it has the form 0 0 c n c n b n c n b n 0 c 3 0 c b 3 c b 0 0 We say that an n n matrix is anti-bidiagonal if it is upper anti-bidiagonal or lower antibidiagonal
3 INTEGER POWERS OF ANTI-BIDIAGONAL HANKEL MATRICES 89 Consider the n n upper anti-bidiagonal matrix with constant anti-diagonals 0 0 a c a c 0 c 0 0 antitridiag n a, c, 0 = 0 a c a c 0 c and the following n n lower bidiagonal matrix c a c 0 0 a c tridiag n a, c, 0 = c 0 0 a c a c Our first auxiliary result relates integer powers of with and the n n exchange matrix J n = The proof can be found in [6] page 34 Lemma Let P n be an n n persymmetric matrix and S n = J n P n where J n is the n n exchange matrix 3 If m is a positive integer then P S m n P n m if m is even, n = J n P n P n P n m if m is odd An n n matrix P n is said persymmetric if it is symmetric about its northeast-southwest diagonal, ie [P n ] k,l = [P n] n l+,n k+ for all k, l see [], page 93
4 90 JOÃO LITA DA SILVA Furthermore, if P n is nonsingular then S m n = P n P n m if m is even, J n P n P n P n m+ if m is odd matrix The next result will permit us to identify the eigenvalues and also eigenvectors of a tridiagonal c b 0 0 a c b 0 a 3 c 3 M n = c n b n 0 a n c n b n 0 0 a n c n where {a k } k n, {b k } k n and {c k } k n are sequences of complex numbers such that b k 0 and b n = Supposing the polynomial sequence {Q k x} k 0 characterized by a three-term recurrence relation 4 xq 0 x = c Q 0 x + b Q x xq k x = a k Q k x + c k Q k x + b k Q k x for k 5 with initial condition Q 0 x =, we can give a matrix form for this three-term recurrence relation: xqx = M n qx + Q n xe 6 where M n is given by 4, qx = Q 0 x Q x Q n x and e = 0 0 The following statement is a well-known result Lemma If λ is a zero of the polynomial Q n x obtained by 5 then λ is an eigenvalue of
5 INTEGER POWERS OF ANTI-BIDIAGONAL HANKEL MATRICES 9 the tridiagonal matrix 4 and qλ = Q 0 λ Q λ Q n λ is a corresponding eigenvector PROOF : Let λ be a zero of the polynomial Q n x From 6 we have M n qλ = λqλ and λ is an eigenvalue of M n Since Q 0 x 0 it follows also that qλ is a eigenvector associated to λ Setting P n = tridiag n a, c, 0 with ac 0 we have S n = J n P n = antitridiag n a, c, 0 and P n P n = a + c ac 0 0 ac a + c ac 0 ac a + c a + c ac 0 ac a + c ac 0 0 ac c = ac
6 9 JOÃO LITA DA SILVA where = a c Hence, integer powers of 0 0 a c a c 0 c 0 0 antitridiag n a, c, 0 = 0 a c a c 0 c can be computed at the expense of the integer powers of the following tridiagonal n n matrix T n = Let us observe that the case c = 0 is already established in [6] page 36, as well as the case a = 0 which was presented in formulae 3a, 3b, 3c and 3d of [7] In [3], the authors established a necessary condition for the eigenvalues of tridiagonal Toeplitz matrices having four corners perturbed giving also the corresponding eigenvectors, and their results can be used on matrix T n However, our approach involving Chebyshev polynomials takes advantage of many results stated in the scope of the theory of orthogonal polynomials, particularly, numerical methods developed by Grant and Rahman to determine the zeros of a linear combination of Chebyshev polynomials see [3] and [4], for details Denoting by U p x, p 0 the pth degree Chebyshev polynomial of the second kind U p x = sin[p + arccos x], < x < sinarccos x with U p ± = ± p p + see [9], the polynomial sequence {Q k x} k 0 defined in 5 for the matrix 8 will be x Q k x = U k, 0 k n 7
7 INTEGER POWERS OF ANTI-BIDIAGONAL HANKEL MATRICES 93 x and Q n x = U n +U x n It is well-known that the zeros of Q n x are all real and simple see, page 7 Thus, setting θ k, k =,, n as the solutions of the equation U n t + U n t = 0, 9 the result below will provide us important matrices in the computing process of integer powers of real anti-bidiagonal Hankel matrices As pointed out above, the solutions θ k can be obtained, at least, using numerical methods see [3] and [4] Lemma 3 Let n N and a, c R \ {0} If [ U n ]k,l = U k θ l for all k, l =,, n with θ j, j =,, n the solutions of 9 then U n U n = diag [U n θ + a c U n θ ] U n θ,, [ U n θ n + a c U n θ n ] U n θ n PROOF : Setting = a c we have [ U n U n ]k,l = n Q j + + θ k Q j + + θ l = n U j θ k U j θ l j=0 where θ k, k =,, n are the solutions of 9 From Christoffel-Darboux identities see [], pages 3 and 4 we obtain n Q j + + θ k Q j + + θ l = Q n+ +θ kq n + +θ l Q n + +θ kq n + +θ l θ k θ l j=0 j=0 = [Unθ k+u n θ k ]U n θ l U n θ k [U nθ l +U n θ l ] θ k θ l = 0 for each k, l =,, n such that k l since from 9 we have U n θ k + U n θ k = 0 for all k =,, n On the other hand, using the confluent form of the Christoffel-Darboux identity, n Q j j=0 + + θ k = [ U n θ k + U n θ k ] U n θ k U n θ k U n θ k = [ U n θ k + U n θ k ] U n θ k for each k =,, n, which establishes the thesis Remark : The values involving U px can be computed using the Chebyshev polynomials of the second kind since U px = p+u p x pu p+ x x if p > 0 0 if p = 0
8 94 JOÃO LITA DA SILVA and U p± = ± p+ p+ 3 p+ 3 whenever p > 0 Moreover, the matrix U n of Lemma 3 is nonsingular since [ U n θ k + a c U n θ k ] U n θ k > 0 for all k =,, n see, page 4, yielding U n = diag,, [U nθ + a c U n θ ]U n θ [U nθ n + a c U n θ n]u n θ n U n The result below will give us positive integer powers of real anti-bidiagonal Hankel matrices Theorem Let a, c R \ {0} and n, m N If U n = [ U k θ l ], k, l =,, n k,l and Θ n = diag a c + c a + θ,, a c + c a + θ n with θj, j =,, n the solutions of 9 then U n Θ n U n is an eigenvalue decomposition of the n n matrix T n in 8 Moreover, if A n := antitridiag n a, c, 0 then ac m Un Θ m n D n U A m n if m is even, n = ac m A n U n Θ m n D n U n if m is odd where D n = diag,, [U n θ + a c U n θ ]U n θ [U n θ n+ a c U n θ n]u n θ n PROOF : Let = a c and θ, θ,, θ n the solutions of 9 From Lemma each + + θ k, k =,, n is an eigenvalue of T n and Q θ k U 0 θ k Q + u k = + θ k U θ k = Q n + + θ k U n θ k is a corresponding non-null eigenvector of T n associated to + + θ k Hence, {u, u,, u n } is a complete set of eigenvectors of T n see [0], page 507 leading to U n = [u u u n ] and T n = U n Θ n U n The last sentence follows directly from Lemma 3 and subsequent Remark Remark : The formulas announced in Theorem can be extended to any negative integer m since deta n = detj n det [tridiag n a, c, 0] = c n nn 0 From Theorem, we can now compute the entries of any integer power of a real upper antibidiagonal Hankel matrix using the solutions of 9 and Chebyshev polynomials of the second kind The main result of this paper follows next
9 INTEGER POWERS OF ANTI-BIDIAGONAL HANKEL MATRICES 95 Theorem Let a, c R \ {0} and n, m N If A n := antitridiag n a, c, 0 and θ j, j =,, n are the solutions of 9 then [ A ±m n ]k,l = ac± m n a c + c a +θ j ± m U [U nθ j + a c U n θ j]u n θ j k θ j U l θ j 0 j= when m is even and [ A ±m n ]k,l = ac ±m cac ±m n j= n j= whenever m is odd for all k, l =,, n a c + c a +θ j ±m [au [U nθ j + a c U n θ j]u n θ j n k θ j + cu n k θ j ] U l θ j if k < n, a c + c a +θ j ±m U [U nθ j + a c U n θ j]u n θ j l θ j if k = n With the aid of Sherman-Morrison formula, we shall be able to give an explicit expression for the inverse of antitridiag n a, c, 0 Theorem 3 Let n N and a, c C\{0} If A n = antitridiag n a, c, 0, a c + c a + cos kπ n+ n 0 for all k =,, n and sin n+ kπ n+ a c + c kπ + cos a n+ c a then k= A n = ac A n V n B n V n where [V n ] k,l := n+ sin klπ n+ and [B n ] k,l := δ k,l a c + c kπ + cos a n+ + a k+l sin n+ kπ sin n+ lπ [ ] n c a sin n+ jπ n+ a j= c + a c + cos n+ jπ n+[ a c + c kπ + cos a n+][ a c + c lπ + cos a n+] with δ k,l the Kronecker delta PROOF : Suppose n N and a, c C \ {0} Setting
10 96 JOÃO LITA DA SILVA [ ] n := diag a c + c a + cos π n+,, a c + c a + cos nπ n+, a c + c a 0 0 T n := a c + c a a 0 c + c a a c + c a 0 a c + c a a 0 0 c + c a and Ê n := a c we obtain V n T n V n = V n Tn + Ên V n = n a c ww where w = n+ sin π n n+ n+ sin π n+ n+ sin nπ n+ and T n is the matrix 8 Since V n satisfies Vn = I n and V n = Vn, it follows [ ] T n = V n n + a c a c w n w n ww n V n according to the Sherman-Morrison formula see [0], page 4 Thus, Lemma implies { [ A n = J n tridiag n a, c, 0V n ac n + a c a c w n w n ww n ]} V n where J n is the exchange matrix 3 and is established The proof is complete
11 INTEGER POWERS OF ANTI-BIDIAGONAL HANKEL MATRICES 97 Remark : Note that the decomposition T n = V n n a c ww V n leads to ac m A m V n n a c ww m V n if m is even, n = ac m antitridiag n a, c, 0V n n a m c ww V n if m is odd and A m n = ac m V n n a c ww m V n if m is even, ac m+ antitridiag n a, c, 0V n n a c ww m+ V n if m is odd for any positive integer m Furthermore, it is possible to express the eigenvalues of n a c ww as the zeros of explicit rational functions and the corresponding eigenvectors, which allows us to perform an approach similar to the one presented in [8] Thereby, an alternative procedure to compute the integer powers of A n = antitridiag n a, c, 0 is also founded The formulae established throughout for integer powers of real upper anti-bidiagonal Hankel matrices can be used to compute also integer powers of real lower anti-bidiagonal Hankel matrices, 0 0 c c b c b 0 antitridiag n 0, c, b = c 0 c b c b 0 0 Indeed, antitridiag n 0, c, b = J n antitridiag n b, c, 0J n, so that, for any integer m we have [antitridiag n 0, c, b] m = J n [antitridiag n b, c, 0] m J n, ie {[antitridiag n 0, c, b] m } k,l = {[antitridiag n b, c, 0] m } n k+,n l+ and similar formulas to 0, and can be obtained for lower anti-bidiagonal Hankel matrices ACKNOWLEDGEMENT This work is a contribution to the Project UID/GEO/04035/03, funded by FCT - Fundação para a Ciência e a Tecnologia, Portugal
12 98 JOÃO LITA DA SILVA REFERENCES T S Chihara, An introduction to orthogonal polynomials, Gordon and Breach, New York 978 G H Golub and C F Van Loan, Matrix computations, The Johns Hopkins University Press, Baltimore, MD J A Grant and A A Rahman, Determination of the zeros of a linear combination of Chebyshev polynomials, IMA J Numer Anal, 3 983, J A Grant and A A Rahman, Determination of the zeros of a linear combination of generalised polynomials, J Comput Appl Math, 4 99, J Gutiérrez-Gutiérrez, Powers of complex persymmetric or skew-persymmetric anti-tridiagonal matrices with constant anti-diagonals, Appl Math Comput, 7 0, J Lita da Silva, Integer powers of anti-tridiagonal matrices of the form antitridiag n a, 0, b, a, b R, Comput Math Appl, 69 05, J Lita da Silva, Integer powers of anti-tridiagonal matrices of the form antitridiag n a, c, a, a, c C, Int J Comput Math, , J Lita da Silva, On anti-pentadiagonal persymmetric Hankel matrices with perturbed corners, Comput Math Appl, 7 06, J C Mason and D Handscomb, Chebyshev polynomials, Chapman & Hall/CRC, Boca Raton FL, C D Meyer, Matrix analysis applied linear algebra, Society for Industrial and Applied Mathematics, Philadelphia, PA 000 J Rimas, Integer powers of real odd order skew-persymmetric anti-tridiagonal matrices with constant anti-diagonals antitridiag n a, c, a, a R \ {0}, c R, Appl Math Comput, 9 03, J Rimas, Integer powers of real even order anti-tridiagonal Hankel matrices of the form antitridiag n a, c, a, Appl Math Comput, 5 03, W C Yueh and S S Cheng, Explicit eigenvalues and inverses of tridiagonal Toeplitz matrices with four perturbed corners, ANZIAM J, ,
Orthogonal diagonalization for complex skew-persymmetric anti-tridiagonal Hankel matrices
Spec. Matrices 016; 4:73 79 Research Article Open Access Jesús Gutiérrez-Gutiérrez* and Marta Zárraga-Rodríguez Orthogonal diagonalization for complex skew-persymmetric anti-tridiagonal Hankel matrices
More informationThe spectral decomposition of near-toeplitz tridiagonal matrices
Issue 4, Volume 7, 2013 115 The spectral decomposition of near-toeplitz tridiagonal matrices Nuo Shen, Zhaolin Jiang and Juan Li Abstract Some properties of near-toeplitz tridiagonal matrices with specific
More informationk-pell, k-pell-lucas and Modified k-pell Numbers: Some Identities and Norms of Hankel Matrices
International Journal of Mathematical Analysis Vol. 9, 05, no., 3-37 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/0.988/ijma.05.4370 k-pell, k-pell-lucas and Modified k-pell Numbers: Some Identities
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 informationInterpolation and Cubature at Geronimus Nodes Generated by Different Geronimus Polynomials
Interpolation and Cubature at Geronimus Nodes Generated by Different Geronimus Polynomials Lawrence A. Harris Abstract. We extend the definition of Geronimus nodes to include pairs of real numbers where
More informationMath Matrix Algebra
Math 44 - Matrix Algebra Review notes - (Alberto Bressan, Spring 7) sec: Orthogonal diagonalization of symmetric matrices When we seek to diagonalize a general n n matrix A, two difficulties may arise:
More informationDOMINO TILING. Contents 1. Introduction 1 2. Rectangular Grids 2 Acknowledgments 10 References 10
DOMINO TILING KASPER BORYS Abstract In this paper we explore the problem of domino tiling: tessellating a region with x2 rectangular dominoes First we address the question of existence for domino tilings
More informationMATH 423 Linear Algebra II Lecture 33: Diagonalization of normal operators.
MATH 423 Linear Algebra II Lecture 33: Diagonalization of normal operators. Adjoint operator and adjoint matrix Given a linear operator L on an inner product space V, the adjoint of L is a transformation
More informationAN INVERSE EIGENVALUE PROBLEM AND AN ASSOCIATED APPROXIMATION PROBLEM FOR GENERALIZED K-CENTROHERMITIAN MATRICES
AN INVERSE EIGENVALUE PROBLEM AND AN ASSOCIATED APPROXIMATION PROBLEM FOR GENERALIZED K-CENTROHERMITIAN MATRICES ZHONGYUN LIU AND HEIKE FAßBENDER Abstract: A partially described inverse eigenvalue problem
More informationThe inverse of a tridiagonal matrix
Linear Algebra and its Applications 325 (2001) 109 139 www.elsevier.com/locate/laa The inverse of a tridiagonal matrix Ranjan K. Mallik Department of Electrical Engineering, Indian Institute of Technology,
More informationThe Eigenvalue Shift Technique and Its Eigenstructure Analysis of a Matrix
The Eigenvalue Shift Technique and Its Eigenstructure Analysis of a Matrix Chun-Yueh Chiang Center for General Education, National Formosa University, Huwei 632, Taiwan. Matthew M. Lin 2, Department of
More informationFoundations of Matrix Analysis
1 Foundations of Matrix Analysis In this chapter we recall the basic elements of linear algebra which will be employed in the remainder of the text For most of the proofs as well as for the details, the
More informationIntroduction. Chapter One
Chapter One Introduction The aim of this book is to describe and explain the beautiful mathematical relationships between matrices, moments, orthogonal polynomials, quadrature rules and the Lanczos and
More informationControl Systems. Linear Algebra topics. L. Lanari
Control Systems Linear Algebra topics L Lanari outline basic facts about matrices eigenvalues - eigenvectors - characteristic polynomial - algebraic multiplicity eigenvalues invariance under similarity
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 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 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 informationEigenvalue PDFs. Peter Forrester, M&S, University of Melbourne
Outline Eigenvalue PDFs Peter Forrester, M&S, University of Melbourne Hermitian matrices with real, complex or real quaternion elements Circular ensembles and classical groups Products of random matrices
More information1. What is the determinant of the following matrix? a 1 a 2 4a 3 2a 2 b 1 b 2 4b 3 2b c 1. = 4, then det
What is the determinant of the following matrix? 3 4 3 4 3 4 4 3 A 0 B 8 C 55 D 0 E 60 If det a a a 3 b b b 3 c c c 3 = 4, then det a a 4a 3 a b b 4b 3 b c c c 3 c = A 8 B 6 C 4 D E 3 Let A be an n n matrix
More informationMATHEMATICS 217 NOTES
MATHEMATICS 27 NOTES PART I THE JORDAN CANONICAL FORM The characteristic polynomial of an n n matrix A is the polynomial χ A (λ) = det(λi A), a monic polynomial of degree n; a monic polynomial in the variable
More informationQuestion: Given an n x n matrix A, how do we find its eigenvalues? Idea: Suppose c is an eigenvalue of A, then what is the determinant of A-cI?
Section 5. The Characteristic Polynomial Question: Given an n x n matrix A, how do we find its eigenvalues? Idea: Suppose c is an eigenvalue of A, then what is the determinant of A-cI? Property The eigenvalues
More informationq n. Q T Q = I. Projections Least Squares best fit solution to Ax = b. Gram-Schmidt process for getting an orthonormal basis from any basis.
Exam Review Material covered by the exam [ Orthogonal matrices Q = q 1... ] q n. Q T Q = I. Projections Least Squares best fit solution to Ax = b. Gram-Schmidt process for getting an orthonormal basis
More informationMath 315: Linear Algebra Solutions to Assignment 7
Math 5: Linear Algebra s to Assignment 7 # Find the eigenvalues of the following matrices. (a.) 4 0 0 0 (b.) 0 0 9 5 4. (a.) The characteristic polynomial det(λi A) = (λ )(λ )(λ ), so the eigenvalues are
More informationEigenvalues for Triangular Matrices. ENGI 7825: Linear Algebra Review Finding Eigenvalues and Diagonalization
Eigenvalues for Triangular Matrices ENGI 78: Linear Algebra Review Finding Eigenvalues and Diagonalization Adapted from Notes Developed by Martin Scharlemann The eigenvalues for a triangular matrix are
More informationTwo remarks on normality preserving Borel automorphisms of R n
Proc. Indian Acad. Sci. (Math. Sci.) Vol. 3, No., February 3, pp. 75 84. c Indian Academy of Sciences Two remarks on normality preserving Borel automorphisms of R n K R PARTHASARATHY Theoretical Statistics
More informationRecurrence Relations and Fast Algorithms
Recurrence Relations and Fast Algorithms Mark Tygert Research Report YALEU/DCS/RR-343 December 29, 2005 Abstract We construct fast algorithms for decomposing into and reconstructing from linear combinations
More informationNotes on Linear Algebra and Matrix Theory
Massimo Franceschet featuring Enrico Bozzo Scalar product The scalar product (a.k.a. dot product or inner product) of two real vectors x = (x 1,..., x n ) and y = (y 1,..., y n ) is not a vector but a
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 informationSolving large scale eigenvalue problems
arge scale eigenvalue problems, Lecture 5, March 23, 2016 1/30 Lecture 5, March 23, 2016: The QR algorithm II http://people.inf.ethz.ch/arbenz/ewp/ Peter Arbenz Computer Science Department, ETH Zürich
More informationCONSTRUCTION OF A COMPLEX JACOBI MATRIX FROM TWO-SPECTRA
Hacettepe Journal of Mathematics and Statistics Volume 40(2) (2011), 297 303 CONSTRUCTION OF A COMPLEX JACOBI MATRIX FROM TWO-SPECTRA Gusein Sh Guseinov Received 21:06 :2010 : Accepted 25 :04 :2011 Abstract
More informationLecture 10: Eigenvectors and eigenvalues (Numerical Recipes, Chapter 11)
Lecture 1: Eigenvectors and eigenvalues (Numerical Recipes, Chapter 11) The eigenvalue problem, Ax= λ x, occurs in many, many contexts: classical mechanics, quantum mechanics, optics 22 Eigenvectors and
More informationExplicit inverse of a tridiagonal (p, r) Toeplitz matrix
Explicit inverse of a tridiagonal (p, r Toeplitz matrix A.M. Encinas, M.J. Jiménez Dpt. Matemàtiques, Universitat Politècnica de Catalunya - BarcelonaTech Abstract Tridiagonal matrices appears in many
More informationEigenvalues and eigenvectors of tridiagonal matrices
Electronic Journal of Linear Algebra Volume 15 Volume 15 006) Article 8 006 Eigenvalues and eigenvectors of tridiagonal matrices Said Kouachi kouachisaid@caramailcom Follow this and additional works at:
More information1 Last time: least-squares problems
MATH Linear algebra (Fall 07) Lecture Last time: least-squares problems Definition. If A is an m n matrix and b R m, then a least-squares solution to the linear system Ax = b is a vector x R n such that
More informationEigenvalues and Eigenvectors
5 Eigenvalues and Eigenvectors 5.2 THE CHARACTERISTIC EQUATION DETERMINANATS n n Let A be an matrix, let U be any echelon form obtained from A by row replacements and row interchanges (without scaling),
More informationReconstruction of sparse Legendre and Gegenbauer expansions
Reconstruction of sparse Legendre and Gegenbauer expansions Daniel Potts Manfred Tasche We present a new deterministic algorithm for the reconstruction of sparse Legendre expansions from a small number
More informationTHE SPECTRUM OF THE LAPLACIAN MATRIX OF A BALANCED 2 p -ARY TREE
Proyecciones Vol 3, N o, pp 131-149, August 004 Universidad Católica del Norte Antofagasta - Chile THE SPECTRUM OF THE LAPLACIAN MATRIX OF A BALANCED p -ARY TREE OSCAR ROJO Universidad Católica del Norte,
More informationIyad T. Abu-Jeib and Thomas S. Shores
NEW ZEALAND JOURNAL OF MATHEMATICS Volume 3 (003, 9 ON PROPERTIES OF MATRIX I ( OF SINC METHODS Iyad T. Abu-Jeib and Thomas S. Shores (Received February 00 Abstract. In this paper, we study the determinant
More informationSymmetric and anti symmetric matrices
Symmetric and anti symmetric matrices In linear algebra, a symmetric matrix is a square matrix that is equal to its transpose. Formally, matrix A is symmetric if. A = A Because equal matrices have equal
More informationComputing the pth Roots of a Matrix. with Repeated Eigenvalues
Applied Mathematical Sciences, Vol. 5, 2011, no. 53, 2645-2661 Computing the pth Roots of a Matrix with Repeated Eigenvalues Amir Sadeghi 1, Ahmad Izani Md. Ismail and Azhana Ahmad School of Mathematical
More informationOn the Inverting of a General Heptadiagonal Matrix
British Journal of Applied Science & Technology 18(5): 1-, 2016; Article no.bjast.313 ISSN: 2231-0843, NLM ID: 101664541 SCIENCEDOMAIN international www.sciencedomain.org On the Inverting of a General
More informationMarkov Chains, Stochastic Processes, and Matrix Decompositions
Markov Chains, Stochastic Processes, and Matrix Decompositions 5 May 2014 Outline 1 Markov Chains Outline 1 Markov Chains 2 Introduction Perron-Frobenius Matrix Decompositions and Markov Chains Spectral
More informationFibonacci and Lucas numbers via the determinants of tridiagonal matrix
Notes on Number Theory and Discrete Mathematics Print ISSN 30 532, Online ISSN 2367 8275 Vol 24, 208, No, 03 08 DOI: 07546/nntdm2082403-08 Fibonacci and Lucas numbers via the determinants of tridiagonal
More informationThe minimum rank of matrices and the equivalence class graph
Linear Algebra and its Applications 427 (2007) 161 170 wwwelseviercom/locate/laa The minimum rank of matrices and the equivalence class graph Rosário Fernandes, Cecília Perdigão Departamento de Matemática,
More informationTesting Hypotheses Of Covariance Structure In Multivariate Data
Electronic Journal of Linear Algebra Volume 33 Volume 33: Special Issue for the International Conference on Matrix Analysis and its Applications, MAT TRIAD 2017 Article 6 2018 Testing Hypotheses Of Covariance
More informationFrame Diagonalization of Matrices
Frame Diagonalization of Matrices Fumiko Futamura Mathematics and Computer Science Department Southwestern University 00 E University Ave Georgetown, Texas 78626 U.S.A. Phone: + (52) 863-98 Fax: + (52)
More informationInterlacing Inequalities for Totally Nonnegative Matrices
Interlacing Inequalities for Totally Nonnegative Matrices Chi-Kwong Li and Roy Mathias October 26, 2004 Dedicated to Professor T. Ando on the occasion of his 70th birthday. Abstract Suppose λ 1 λ n 0 are
More information1 Linear Algebra Problems
Linear Algebra Problems. Let A be the conjugate transpose of the complex matrix A; i.e., A = A t : A is said to be Hermitian if A = A; real symmetric if A is real and A t = A; skew-hermitian if A = A and
More informationProperties of Linear Transformations from R n to R m
Properties of Linear Transformations from R n to R m MATH 322, Linear Algebra I J. Robert Buchanan Department of Mathematics Spring 2015 Topic Overview Relationship between the properties of a matrix transformation
More informationLinear Algebra Practice Problems
Linear Algebra Practice Problems Math 24 Calculus III Summer 25, Session II. Determine whether the given set is a vector space. If not, give at least one axiom that is not satisfied. Unless otherwise stated,
More informationConvexity of the Joint Numerical Range
Convexity of the Joint Numerical Range Chi-Kwong Li and Yiu-Tung Poon October 26, 2004 Dedicated to Professor Yik-Hoi Au-Yeung on the occasion of his retirement. Abstract Let A = (A 1,..., A m ) be an
More informationMath 3191 Applied Linear Algebra
Math 9 Applied Linear Algebra Lecture 9: Diagonalization Stephen Billups University of Colorado at Denver Math 9Applied Linear Algebra p./9 Section. Diagonalization The goal here is to develop a useful
More informationMATH 304 Linear Algebra Lecture 34: Review for Test 2.
MATH 304 Linear Algebra Lecture 34: Review for Test 2. Topics for Test 2 Linear transformations (Leon 4.1 4.3) Matrix transformations Matrix of a linear mapping Similar matrices Orthogonality (Leon 5.1
More informationSparse polynomial interpolation in Chebyshev bases
Sparse polynomial interpolation in Chebyshev bases Daniel Potts Manfred Tasche We study the problem of reconstructing a sparse polynomial in a basis of Chebyshev polynomials (Chebyshev basis in short)
More informationSolution of Linear Equations
Solution of Linear Equations (Com S 477/577 Notes) Yan-Bin Jia Sep 7, 07 We have discussed general methods for solving arbitrary equations, and looked at the special class of polynomial equations A subclass
More informationSection 4.4 Reduction to Symmetric Tridiagonal Form
Section 4.4 Reduction to Symmetric Tridiagonal Form Key terms Symmetric matrix conditioning Tridiagonal matrix Similarity transformation Orthogonal matrix Orthogonal similarity transformation properties
More informationMath 102, Winter Final Exam Review. Chapter 1. Matrices and Gaussian Elimination
Math 0, Winter 07 Final Exam Review Chapter. Matrices and Gaussian Elimination { x + x =,. Different forms of a system of linear equations. Example: The x + 4x = 4. [ ] [ ] [ ] vector form (or the column
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 information1 Planar rotations. Math Abstract Linear Algebra Fall 2011, section E1 Orthogonal matrices and rotations
Math 46 - Abstract Linear Algebra Fall, section E Orthogonal matrices and rotations Planar rotations Definition: A planar rotation in R n is a linear map R: R n R n such that there is a plane P R n (through
More informationOn Powers of General Tridiagonal Matrices
Applied Mathematical Sciences, Vol. 9, 5, no., 583-59 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/.988/ams.5.49 On Powers of General Tridiagonal Matrices Qassem M. Al-Hassan Department of Mathematics
More informationRemark By definition, an eigenvector must be a nonzero vector, but eigenvalue could be zero.
Sec 6 Eigenvalues and Eigenvectors Definition An eigenvector of an n n matrix A is a nonzero vector x such that A x λ x for some scalar λ A scalar λ is called an eigenvalue of A if there is a nontrivial
More informationLinear Algebra and its Applications
Linear Algebra and its Applications 441 (2014 61 87 Contents lists available at SciVerse ScienceDirect Linear Algebra and its Applications journal homepage: wwwelseviercom/locate/laa Sparse polynomial
More informationDimension. Eigenvalue and eigenvector
Dimension. Eigenvalue and eigenvector Math 112, week 9 Goals: Bases, dimension, rank-nullity theorem. Eigenvalue and eigenvector. Suggested Textbook Readings: Sections 4.5, 4.6, 5.1, 5.2 Week 9: Dimension,
More informationETNA Kent State University
Electronic Transactions on Numerical Analysis Volume 14, pp 127-141, 22 Copyright 22, ISSN 168-9613 ETNA etna@mcskentedu RECENT TRENDS ON ANALYTIC PROPERTIES OF MATRIX ORTHONORMAL POLYNOMIALS F MARCELLÁN
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 informationLecture 9: Krylov Subspace Methods. 2 Derivation of the Conjugate Gradient Algorithm
CS 622 Data-Sparse Matrix Computations September 19, 217 Lecture 9: Krylov Subspace Methods Lecturer: Anil Damle Scribes: David Eriksson, Marc Aurele Gilles, Ariah Klages-Mundt, Sophia Novitzky 1 Introduction
More informationThe Lanczos and conjugate gradient algorithms
The Lanczos and conjugate gradient algorithms Gérard MEURANT October, 2008 1 The Lanczos algorithm 2 The Lanczos algorithm in finite precision 3 The nonsymmetric Lanczos algorithm 4 The Golub Kahan bidiagonalization
More informationChapter 2 Spectra of Finite Graphs
Chapter 2 Spectra of Finite Graphs 2.1 Characteristic Polynomials Let G = (V, E) be a finite graph on n = V vertices. Numbering the vertices, we write down its adjacency matrix in an explicit form of n
More informationInverse Eigenvalue Problems for Checkerboard Toeplitz Matrices
Inverse Eigenvalue Problems for Checkerboard Toeplitz Matrices T. H. Jones 1 and N. B. Willms 1 1 Department of Mathematics, Bishop s University. Sherbrooke, Québec, Canada, J1M 1Z7. E-mail: tjones@ubishops.ca,
More informationHankel Determinant for a Sequence that Satisfies a Three-Term Recurrence Relation
1 3 47 6 3 11 Journal of Integer Sequences, Vol. 18 (015), Article 15.1.5 Hankel Determinant for a Sequence that Satisfies a Three-Term Recurrence Relation Baghdadi Aloui Faculty of Sciences of Gabes Department
More informationEigenvalues and Eigenvectors
5 Eigenvalues and Eigenvectors 5.2 THE CHARACTERISTIC EQUATION DETERMINANATS nn Let A be an matrix, let U be any echelon form obtained from A by row replacements and row interchanges (without scaling),
More informationIntroduction to Orthogonal Polynomials: Definition and basic properties
Introduction to Orthogonal Polynomials: Definition and basic properties Prof. Dr. Mama Foupouagnigni African Institute for Mathematical Sciences, Limbe, Cameroon and Department of Mathematics, Higher Teachers
More informationTheorem A.1. If A is any nonzero m x n matrix, then A is equivalent to a partitioned matrix of the form. k k n-k. m-k k m-k n-k
I. REVIEW OF LINEAR ALGEBRA A. Equivalence Definition A1. If A and B are two m x n matrices, then A is equivalent to B if we can obtain B from A by a finite sequence of elementary row or elementary column
More informationMATH 31 - ADDITIONAL PRACTICE PROBLEMS FOR FINAL
MATH 3 - ADDITIONAL PRACTICE PROBLEMS FOR FINAL MAIN TOPICS FOR THE FINAL EXAM:. Vectors. Dot product. Cross product. Geometric applications. 2. Row reduction. Null space, column space, row space, left
More information22.3. Repeated Eigenvalues and Symmetric Matrices. Introduction. Prerequisites. Learning Outcomes
Repeated Eigenvalues and Symmetric Matrices. Introduction In this Section we further develop the theory of eigenvalues and eigenvectors in two distinct directions. Firstly we look at matrices where one
More informationTilburg University. Strongly Regular Graphs with Maximal Energy Haemers, W. H. Publication date: Link to publication
Tilburg University Strongly Regular Graphs with Maximal Energy Haemers, W. H. Publication date: 2007 Link to publication Citation for published version (APA): Haemers, W. H. (2007). Strongly Regular Graphs
More informationAbed Elhashash, Uriel G. Rothblum, and Daniel B. Szyld. Report August 2009
Paths of matrices with the strong Perron-Frobenius property converging to a given matrix with the Perron-Frobenius property Abed Elhashash, Uriel G. Rothblum, and Daniel B. Szyld Report 09-08-14 August
More informationExponentials of Symmetric Matrices through Tridiagonal Reductions
Exponentials of Symmetric Matrices through Tridiagonal Reductions Ya Yan Lu Department of Mathematics City University of Hong Kong Kowloon, Hong Kong Abstract A simple and efficient numerical algorithm
More informationThe Local Spectra of Regular Line Graphs
The Local Spectra of Regular Line Graphs M. A. Fiol a, M. Mitjana b, a Departament de Matemàtica Aplicada IV Universitat Politècnica de Catalunya Barcelona, Spain b Departament de Matemàtica Aplicada I
More informationComputing Eigenvalues and/or Eigenvectors;Part 1, Generalities and symmetric matrices
Computing Eigenvalues and/or Eigenvectors;Part 1, Generalities and symmetric matrices Tom Lyche Centre of Mathematics for Applications, Department of Informatics, University of Oslo November 9, 2008 Today
More informationEigenvalues for Triangular Matrices. ENGI 7825: Linear Algebra Review Finding Eigenvalues and Diagonalization
Eigenvalues for Triangular Matrices ENGI 78: Linear Algebra Review Finding Eigenvalues and Diagonalization Adapted from Notes Developed by Martin Scharlemann June 7, 04 The eigenvalues for a triangular
More information2 Computing complex square roots of a real matrix
On computing complex square roots of real matrices Zhongyun Liu a,, Yulin Zhang b, Jorge Santos c and Rui Ralha b a School of Math., Changsha University of Science & Technology, Hunan, 410076, China b
More information(a) If A is a 3 by 4 matrix, what does this tell us about its nullspace? Solution: dim N(A) 1, since rank(a) 3. Ax =
. (5 points) (a) If A is a 3 by 4 matrix, what does this tell us about its nullspace? dim N(A), since rank(a) 3. (b) If we also know that Ax = has no solution, what do we know about the rank of A? C(A)
More informationLeonard pairs and the q-tetrahedron algebra. Tatsuro Ito, Hjalmar Rosengren, Paul Terwilliger
Tatsuro Ito Hjalmar Rosengren Paul Terwilliger Overview Leonard pairs and the Askey-scheme of orthogonal polynomials Leonard pairs of q-racah type The LB-UB form and the compact form The q-tetrahedron
More informationPROCEEDINGS OF THE YEREVAN STATE UNIVERSITY MOORE PENROSE INVERSE OF BIDIAGONAL MATRICES. I
PROCEEDINGS OF THE YEREVAN STATE UNIVERSITY Physical and Mathematical Sciences 205, 2, p. 20 M a t h e m a t i c s MOORE PENROSE INVERSE OF BIDIAGONAL MATRICES. I Yu. R. HAKOPIAN, S. S. ALEKSANYAN 2, Chair
More informationComputing Eigenvalues and/or Eigenvectors;Part 1, Generalities and symmetric matrices
Computing Eigenvalues and/or Eigenvectors;Part 1, Generalities and symmetric matrices Tom Lyche Centre of Mathematics for Applications, Department of Informatics, University of Oslo November 8, 2009 Today
More informationPreliminary/Qualifying Exam in Numerical Analysis (Math 502a) Spring 2012
Instructions Preliminary/Qualifying Exam in Numerical Analysis (Math 502a) Spring 2012 The exam consists of four problems, each having multiple parts. You should attempt to solve all four problems. 1.
More informationPOINT VALUES AND NORMALIZATION OF TWO-DIRECTION MULTIWAVELETS AND THEIR DERIVATIVES
November 1, 1 POINT VALUES AND NORMALIZATION OF TWO-DIRECTION MULTIWAVELETS AND THEIR DERIVATIVES FRITZ KEINERT AND SOON-GEOL KWON,1 Abstract Two-direction multiscaling functions φ and two-direction multiwavelets
More informations-generalized Fibonacci Numbers: Some Identities, a Generating Function and Pythagorean Triples
International Journal of Mathematical Analysis Vol. 8, 2014, no. 36, 1757-1766 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ijma.2014.47203 s-generalized Fibonacci Numbers: Some Identities,
More informationEIGENVALUES AND EIGENVECTORS
EIGENVALUES AND EIGENVECTORS Diagonalizable linear transformations and matrices Recall, a matrix, D, is diagonal if it is square and the only non-zero entries are on the diagonal This is equivalent to
More informationON LINEAR COMBINATIONS OF CHEBYSHEV POLYNOMIALS arxiv: v1 [math.nt] 9 Nov 2013
ON LINEAR COMBINATIONS OF CHEBYSHEV POLYNOMIALS arxiv:3.2230v [math.nt] 9 Nov 203 Dragan Stankov Abstract. We investigate an infinite sequence of polynomials of the form: a 0 T n (x) + a T n (x) + + a
More informationNumerical Linear Algebra Homework Assignment - Week 2
Numerical Linear Algebra Homework Assignment - Week 2 Đoàn Trần Nguyên Tùng Student ID: 1411352 8th October 2016 Exercise 2.1: Show that if a matrix A is both triangular and unitary, then it is diagonal.
More informationLinear algebra II Homework #1 due Thursday, Feb A =
Homework #1 due Thursday, Feb. 1 1. Find the eigenvalues and the eigenvectors of the matrix [ ] 3 2 A =. 1 6 2. Find the eigenvalues and the eigenvectors of the matrix 3 2 2 A = 2 3 2. 2 2 1 3. The following
More informationEQUIVALENCE OF STURM-LIOUVILLE PROBLEM WITH FINITELY MANY ABDULLAH KABLAN, MEHMET AKİF ÇETİN
International Journal of Analysis and Applications Volume 16 Number 1 (2018) 25-37 URL: https://doi.org/10.28924/2291-8639 DOI: 10.28924/2291-8639-16-2018-25 EQUIVALENCE OF STURM-LIOUVILLE PROBLEM WITH
More informationLecture 1 INF-MAT3350/ : Some Tridiagonal Matrix Problems
Lecture 1 INF-MAT3350/4350 2007: Some Tridiagonal Matrix Problems Tom Lyche University of Oslo Norway Lecture 1 INF-MAT3350/4350 2007: Some Tridiagonal Matrix Problems p.1/33 Plan for the day 1. Notation
More informationApplied Mathematics 205. Unit V: Eigenvalue Problems. Lecturer: Dr. David Knezevic
Applied Mathematics 205 Unit V: Eigenvalue Problems Lecturer: Dr. David Knezevic Unit V: Eigenvalue Problems Chapter V.2: Fundamentals 2 / 31 Eigenvalues and Eigenvectors Eigenvalues and eigenvectors of
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 informationRepeated Eigenvalues and Symmetric Matrices
Repeated Eigenvalues and Symmetric Matrices. Introduction In this Section we further develop the theory of eigenvalues and eigenvectors in two distinct directions. Firstly we look at matrices where one
More information1.6: 16, 20, 24, 27, 28
.6: 6, 2, 24, 27, 28 6) If A is positive definite, then A is positive definite. The proof of the above statement can easily be shown for the following 2 2 matrix, a b A = b c If that matrix is positive
More informationMath 408 Advanced Linear Algebra
Math 408 Advanced Linear Algebra Chi-Kwong Li Chapter 4 Hermitian and symmetric matrices Basic properties Theorem Let A M n. The following are equivalent. Remark (a) A is Hermitian, i.e., A = A. (b) x
More information