CONSTRUCTION OF A COMPLEX JACOBI MATRIX FROM TWO-SPECTRA
|
|
- Emery Walters
- 5 years ago
- Views:
Transcription
1 Hacettepe Journal of Mathematics and Statistics Volume 40(2) (2011), CONSTRUCTION OF A COMPLEX JACOBI MATRIX FROM TWO-SPECTRA Gusein Sh Guseinov Received 21:06 :2010 : Accepted 25 :04 :2011 Abstract In this paper we study the inverse spectral problem for two-spectra of finite order complex Jacobi matrices (tri-diagonal matrices) The problem is to reconstruct the matrix using two sets of eigenvalues, one for the original Jacobi matrix and one for the matrix obtained by deleting the first column and the first row of the Jacobi matrix An explicit procedure of reconstruction of the matrix from the two-spectra is given Keywords: Jacobi matrix, Spectral data, Inverse spectral problem 2010 AMS Classification: 15 A29 1 Introduction Communicated by Cihan Orhan An N N complex Jacobi matrix is a matrix of the form b 0 a a 0 b 1 a a 1 b (11) J =, b N 3 a N a N 3 b N 2 a N a N 2 b N 1 where for each n, a n and b n are arbitrary complex numbers such that a n is different from zero: (12) a n, b n C, a n 0 The general inverse spectral problem is to reconstruct the matrix given some of its spectral characteristics (spectral data) Department of Mathematics, Atilim Universty, Incek, Ankara, Turkey guseinov@atilimedutr
2 298 G Sh Guseinov In the real case (13) a n, b n R, a n 0, many versions of the inverse spectral problem for J have been investigated in the literature, see [1] and references given therein In [9, 10] Hochstadt investigated the following version of the inverse problem for twospectra Let J 1 be the (N 1) (N 1) matrix obtained from J by deleting its first row and first column Let {λ k } and {µ k } be the eigenvalues of J and J 1, respectively The eigenvalues of a Jacobi matrix with entries satisfying (13) are real and distinct, and the eigenvalues of J and J 1 interlace: λ 1 < µ 1 < λ 2 < µ 2 < λ 3 < < µ N 1 < λ N The author showed in [9, 10] that if the {λ k } are the eigenvalues of some Jacobi matrix of the form (11) with the entries a n, b n R, a n > 0, and if {µ k } are the eigenvalues of the corresponding J 1, then there is precisely one such matrix with these {λ k, µ k }, and gave a constructive method for calculating the entries of J in terms of the given eigenvalues The same problem was subsequently considered in [5, 8, 4], where different proofs of the uniqueness and existence of J were offered (for the case of infinite Jacobi matrices see [2, 6, 3]) In the present paper, we consider the above formulated problem about two-spectra for complex Jacobi matrices of the form (11) with entries satisfying (12) In the complex case in general the matrix J is no longer selfadjoint and therefore its eigenvalues may be complex and multiple Recently, the author introduced in [7] the concept of spectral data for complex Jacobi matrices of finite order and solved the inverse problem of recovering the matrix from its spectral data Here we show that the inverse problem for two-spectra of complex Jacobi matrices can be solved by reducing it to the inverse problem for spectral data 2 Spectral data and the inverse problem In this auxiliary section we follow the author s paper [7] Let J be a complex Jacobi matrix of the form (11) with entries satisfying (12) Further, let R(λ) = (J λi) 1 be the resolvent of the matrix J (by I we denote the identity matrix of needed dimension) and let e 0 be the N-dimensional column vector with the components 1, 0,, 0 The rational function (21) w(λ) = ((R(λ)e 0, e 0) = ( (λi J) 1 e 0, e 0 ) we call the resolvent function of the matrix J, where (, ) denotes the standard inner product in C N Denote by λ 1,, λ p all the distinct eigenvalues of the matrix J, and by m 1,, m p their multiplicities, respectively, as the roots of the characteristic polynomial det(j λi), so that 1 p N and m m p = N We can decompose the rational function w(λ) into partial fractions to get (22) w(λ) = m p k k=1 j=1 β kj (λ λ k ) j, where β kj are some complex numbers uniquely determined by the matrix J
3 Construction of a Complex Jacobi Matrix from Two-Spectra Definition The collection of quantities (23) {λ k, β kj (j = 1,, m k ; k = 1,, p)}, we call the spectral data of the matrix J For each k {1,, p} the (finite) sequence {β k1,, β kmk } we call the normalizing chain (of the matrix J) associated with the eigenvalue λ k Determining the spectral data of a given Jacobi matrix is called the direct spectral problem for this matrix Let us indicate a convenient way to compute the spectral data of complex Jacobi matrices For this purpose we should describe the resolvent function w(λ) of the Jacobi matrix Given a Jacobi matrix J of the form (11) with the entries (12), consider the eigenvalue problem Jy = λy for a column vector y = {y n} N 1 n=0, that is equivalent to the second order linear difference equation (24) a n 1y n 1 + b ny n + a ny n+1 = λy n, n {0, 1,, N 1}, a 1 = a N 1 = 1, for {y n} N n= 1, with the boundary conditions y 1 = y N = 0 Denote by {P n(λ)} N n= 1 and {Q n(λ)} N n= 1 the solutions of equation (24) satisfying the initial conditions (25) (26) P 1(λ) = 0, P 0(λ) = 1; Q 1(λ) = 1, Q 0(λ) = 0 For each n 0, P n(λ) is a polynomial of degree n called a polynomial of the first kind, and Q n(λ) is a polynomial of degree n 1 known as a polynomial of second kind The equality (27) det (J λi) = ( 1) N a 0a 1 a N 2P N(λ) holds, so that the eigenvalues of the matrix J coincide with the roots of the polynomial P N(λ) In [7] it is shown that the entries R nm(λ) of the matrix R(λ) = (J λi) 1 (resolvent of J) are of the form { P n(λ)[q m(λ) + M(λ)P m(λ)], 0 n m N 1, R nm(λ) = P m(λ)[q n(λ) + M(λ)P n(λ)], 0 m n N 1, where M(λ) = QN(λ) P N(λ) Therefore according to (21) and using initial conditions (25), (26), we get (28) w(λ) = R 00(λ) = M(λ) = QN(λ) P N(λ) Denote by λ 1,, λ p all the distinct roots of the polynomial P N(λ) (which coincide by (27) with the eigenvalues of the matrix J), and by m 1,, m p their multiplicities, respectively: P N(λ) = c(λ λ 1) m1 (λ λ p) mp, where c is a constant We have 1 p N and m 1+ +m p = N Therefore by (28) the decomposition (22) can be obtained by rewriting the rational function Q N(λ)/P N(λ) as the sum of partial fractions
4 300 G Sh Guseinov We can also get another convenient representation for the resolvent function as follows If we delete the first row and the first column of the matrix J given in (11), then we get the new matrix where J 1 = N N N 4 N 3 N N 3 N 2 n = a n+1, n {0, 1,, N 3}, n = b n+1, n {0, 1,, N 2} The matrix J 1 is called the first truncated matrix (with respect to the matrix J) 22 Theorem The equality holds det(j1 λi) w(λ) = det(j λi) Proof Let us denote the polynomials of the first and the second kinds, corresponding to the matrix J 1, by P n (1) (λ) and Q (1) n (λ), respectively It is easily seen that (29) P (1) n (λ) = a 0Q n+1(λ), n {0, 1,, N 1},, Q (1) n (λ) = 1 a 0 {(λ b 0)Q n+1(λ) P n+1(λ)}, n {0,1,, N 1} Indeed, both sides of each of these equalities are solutions of the same difference equation n 1yn 1 + b(1) n y n + n y n+1 = λy n, n {0, 1,, N 2}, N 2 = 1, and the sides coincide for n = 1 and n = 0 Therefore the equalities hold by the uniqueness theorem for solutions Consequently, taking into account (27) for the matrix J 1 instead of J and using (29), we find (210) det(j 1 λi) = ( 1) N 1 0 a(1) 1 N 3 P (1) N 1 (λ) Comparing this with (27), we get = ( 1) N 1 a 1 a N 2a 0Q N(λ) Q N(λ) det(j(1) P = λi) N(λ) det(j λi) so that the statement of the theorem follows by (28) The inverse spectral problem is stated as follows: (i) To see if it is possible to reconstruct the matrix J given its spectral data (23) If it is possible, to describe the reconstruction procedure (ii) To find the necessary and sufficient conditions for a given collection (23) to be the spectral data for some matrix J of the form (11) with entries belonging to the class (12)
5 Construction of a Complex Jacobi Matrix from Two-Spectra 301 This problem was recently solved by the author in [7] and the following results were established Given the collection (23) define the numbers ( ) m p k l (211) s l = j 1 k=1 j=1 where ( l j 1 s l let us introduce the determinants s 0 s 1 s n β kj λ l j+1 k, l = 0, 1,2,, ) ( is a binomial coefficient and we put l j 1) = 0 if j 1 > l Using the numbers s 1 s 2 s n+1 (212) D n =, n = 0, 1,, N s n s n+1 s 2n 23 Theorem Let an arbitrary collection (23) of complex numbers be given, where λ 1,, λ p, (1 p N) are distinct, 1 m k N, and m m p = N In order for this collection to be the spectral data for some Jacobi matrix J of the form (11) with entries belonging to the class (12), it is necessary and sufficient that the following two conditions be satisfied: (i) p k=1 β k1 = 1; (ii) D n 0 for n {1, 2,, N 1}, and D N = 0, where D n is the determinant defined by (212), (211) Under the conditions of Theorem 23, the entries a n and b n of the matrix J for which the collection (23) is spectral data, are recovered by the formulas (213) (214) a n = ± D n 1D n+1 D n, n {0,1,, N 2}, D 1 = 1, b n = n D n n 1 D n 1, n {0, 1,, N 1}, 1 = 0, 0 = s 1, where D n is defined by (212) and (211), and n is the determinant obtained from the determinant D n by replacing in D n the last column by the column with the components s n+1, s n+2,, s 2n+1 24 Remark It follows from the above solution of the inverse problem that the matrix (11) is not uniquely restored from the spectral data This is linked with the fact that the a n are determined from (213) uniquely up to a sign To ensure that the inverse problem is uniquely solvable, we have to specify additionally a sequence of signs + and Namely, let {σ 1, σ 2,, σ N 1} be a given finite sequence, where for n {1, 2,, N 1} each σ n is + or We have 2 N 1 such different sequences Now to determine a n uniquely from (213) for n {0, 1,, N 2} we can choose the sign σ n when extracting the square root In this way we get precisely 2 N 1 distinct Jacobi matrices possessing the same spectral data The inverse problem is solved uniquely from the data consisting of the spectral data and a sequence {σ 1, σ 2,, σ N 1} of signs + and Thus, we can say that the inverse problem with respect to the spectral data is solved uniquely up to signs of the off-diagonal elements of the recovered Jacobi matrix 3 Inverse problem for two-spectra Let J be an N N Jacobi matrix of the form (11) with entries satisfying (12) Denote by λ 1,, λ p all the distinct eigenvalues of the matrix J and by m 1,, m p their multiplicities, respectively, as the roots of the characteristic polynomial det(j λi), so
6 302 G Sh Guseinov that 1 p N and m 1 + +m p = N Further, let J 1 be the (N 1) (N 1) matrix obtained from J by deleting its first row and first column Denote by µ 1,, µ q all the distinct eigenvalues of the matrix J 1, and by n 1,, n q their multiplicities, respectively, as the roots of the characteristic polynomial det(j 1 λi), so that 1 q N 1 and n n q = N 1 The collections (31) {λ k, m k (k = 1,, p)} and {µ k, n k (k = 1,, q)} form the spectra of the matrices J and J 1, respectively We call these collections the two-spectra of the matrix J The inverse problem for two-spectra consists in the reconstruction of the matrix J by its two-spectra We will reduce the inverse problem for two-spectra to the inverse problem for the spectral data solved above in Section 2 First let us study some necessary properties of the two-spectra of the Jacobi matrix J Having the matrix J consider the difference equation (24) and let {P n(λ)} N n= 1 and {Q n(λ)} N n= 1 be the solutions of this equation satisfying the initial conditions (25) and (26), respectively Then by (27) and (210), we have (32) (33) det(j λi) = ( 1) N a 0a 1 a N 2P N(λ), det (J 1 λi) = ( 1) N 1 a 0a 1 a N 2Q N(λ), so that the eigenvalues and their multiplicities of the matrix J coincide with the roots and their multiplicities of the polynomial P N(λ) and the eigenvalues and their multiplicities of the matrix J 1 coincide with the roots and their multiplicities of the polynomial Q N(λ) The equation (34) P N 1(λ)Q N(λ) P N(λ)Q N 1(λ) = 1 holds (see [7, Lemma 4]) 31 Lemma The matrices J and J 1 have no common eigenvalues, that is, λ k µ j for all possible values of k and j Proof Suppose that λ is an eigenvalue of the matrices J and J 1 Then by (32) and (33) we have P N(λ) = Q N(λ) = 0 But this is impossible by (34) In virtue of (22) and Theorem 22, we have Hence, m p k k=1 j=1 β kj = β kj (λ λ k ) j = 1 (m k j)! q (λ µ i) n i p (λ λ l ) m l i=1 l=1 lim λ λ k d mk j dλ m k j (λ λ k) m k q (λ µ i) n i p (λ λ l ) m l i=1 l=1
7 Construction of a Complex Jacobi Matrix from Two-Spectra 303 Therefore (35) β kj = 1 (m k j)! lim λ λ k d mk j dλ m k j (j = 1,, m k ; k = 1,, p) q (λ µ i) n i i=1 p (λ λ l ) m l l=1 l k Formula (35) shows that the normalizing numbers β kj of the matrix J are determined uniquely by the two-spectra {λ k, m k (k = 1,, p)} and {µ k, n k (k = 1,, q)} of this matrix Since the inverse problem for spectral data is solved uniquely up to the signs of the off-diagonal elements of the recovered matrix (see Remark 24 made above in Section 2), we get the following result 32 Theorem The two spectra in (31) determine the matrix J uniquely up to signs of the off-diagonal elements of J The procedure of reconstruction of the matrix J from its two-spectra consists in the following If we are given the two-spectra {λ k, m k (k = 1,, p)} and {µ k, n k (k = 1,, q)}, we find the quantities β kj from (35) and then solve the inverse problem with respect to the spectral data {λ k, β kj (j = 1,, m k ; k = 1,, p)} to recover the matrix J by using formulas (213) and (214) References [1] Chu, M T and Golub, G H Inverse Eigenvalue Problems: Theory, Algorithms, and Applications (Oxford University Press, New York, 2005) [2] Fu, L and Hochstadt, H Inverse theorems for Jacobi matrices, J Math Anal Appl 47, , 1974 [3] Gasymov, M G and Guseinov, G Sh On inverse problems of spectral analysis for infinite Jacobi matrices in the limit-circle case, Dokl Akad Nauk SSSR 309, , 1989; English transl in Soviet Math Dokl 40, , 1990 [4] Gesztesy, F and Simon, B M M-functions and inverse spectral analysis for finite and semi-infinite Jacobi matrices, J Anal Math 73, , 1997 [5] Gray, L J and Wilson, DG Construction of a Jacobi matrix from spectral data, Linear Algebra Appl 14, , 1976 [6] Guseinov, G Sh Determination of the infinite Jacobi matrix with respect to two-spectra, Mat Zametki 23, , 1978; English transl in Math Notes 23, , 1978 [7] Guseinov, G Sh Inverse spectral problems for tridiagonal N by N complex Hamiltonians, Symmetry, Integrability and Geometry: Methods and Applications (SIGMA) 5, Paper 018, 28 pages, 2009 [8] Hald, OH Inverse eigenvalue problems for Jacobi matrices, Linear Algebra Appl 14, 63 85, 1976 [9] Hochstadt, H On some inverse problems in matrix theory, Arch Math 18, , 1967 [10] Hochstadt, H On construction of a Jacobi matrix from spectral data, Linear Algebra Appl 8, , 1974
RETRACTED On construction of a complex finite Jacobi matrix from two spectra
Electronic Journal of Linear Algebra Volume 26 Volume 26 (203) Article 8 203 On construction of a complex finite Jacobi matrix from two spectra Gusein Sh. Guseinov guseinov@ati.edu.tr Follow this and additional
More informationAn Inverse Problem for Two Spectra of Complex Finite Jacobi Matrices
Coyright 202 Tech Science Press CMES, vol.86, no.4,.30-39, 202 An Inverse Problem for Two Sectra of Comlex Finite Jacobi Matrices Gusein Sh. Guseinov Abstract: This aer deals with the inverse sectral roblem
More informationOn an Inverse Problem for a Quadratic Eigenvalue Problem
International Journal of Difference Equations ISSN 0973-6069, Volume 12, Number 1, pp. 13 26 (2017) http://campus.mst.edu/ijde On an Inverse Problem for a Quadratic Eigenvalue Problem Ebru Ergun and Adil
More informationIntegration of the Finite Toda Lattice with Complex-Valued Initial Data
Integration of the Finite Toda Lattie with Complex-Valued Initial Data Aydin Huseynov* and Gusein Sh Guseinov** *Institute of Mathematis and Mehanis, Azerbaijan National Aademy of Sienes, AZ4 Baku, Azerbaijan
More informationIMRN Inverse Spectral Analysis with Partial Information on the Potential III. Updating Boundary Conditions Rafael del Rio Fritz Gesztesy
IMRN International Mathematics Research Notices 1997, No. 15 Inverse Spectral Analysis with Partial Information on the Potential, III. Updating Boundary Conditions Rafael del Rio, Fritz Gesztesy, and Barry
More informationCOMPLETENESS THEOREM FOR THE DISSIPATIVE STURM-LIOUVILLE OPERATOR ON BOUNDED TIME SCALES. Hüseyin Tuna
Indian J. Pure Appl. Math., 47(3): 535-544, September 2016 c Indian National Science Academy DOI: 10.1007/s13226-016-0196-1 COMPLETENESS THEOREM FOR THE DISSIPATIVE STURM-LIOUVILLE OPERATOR ON BOUNDED
More informationOlga Boyko, Olga Martinyuk, and Vyacheslav Pivovarchik
Opuscula Math. 36, no. 3 016), 301 314 http://dx.doi.org/10.7494/opmath.016.36.3.301 Opuscula Mathematica HIGHER ORDER NEVANLINNA FUNCTIONS AND THE INVERSE THREE SPECTRA PROBLEM Olga Boyo, Olga Martinyu,
More informationSolution of the Inverse Eigenvalue Problem for Certain (Anti-) Hermitian Matrices Using Newton s Method
Journal of Mathematics Research; Vol 6, No ; 014 ISSN 1916-9795 E-ISSN 1916-9809 Published by Canadian Center of Science and Education Solution of the Inverse Eigenvalue Problem for Certain (Anti-) Hermitian
More informationAn extension of Knopp s core theorem for complex bounded sequences
Mathematical Communications 13(2008, 57-61 57 An extension of Knopp s core theorem for complex bounded sequences Şeyhmus Yardimic Abstract. In this paper, using the idea used by Choudhary, we extend previously
More informationEXISTENCE OF SOLUTIONS FOR BOUNDARY VALUE PROBLEMS ON INFINITE INTERVALS. We consider the second order nonlinear differential equation
Dynamic Systems and Applications 17 (28) 653-662 EXISTECE OF SOLUTIOS FOR BOUDARY VALUE PROBLEMS O IFIITE ITERVALS İSMAİL YASLA Department of Mathematics, Pamukkale University, Denizli 27, Turkey ABSTRACT.
More informationLinear Algebra: Matrix Eigenvalue Problems
CHAPTER8 Linear Algebra: Matrix Eigenvalue Problems Chapter 8 p1 A matrix eigenvalue problem considers the vector equation (1) Ax = λx. 8.0 Linear Algebra: Matrix Eigenvalue Problems Here A is a given
More informationCAAM 335 Matrix Analysis
CAAM 335 Matrix Analysis Solutions to Homework 8 Problem (5+5+5=5 points The partial fraction expansion of the resolvent for the matrix B = is given by (si B = s } {{ } =P + s + } {{ } =P + (s (5 points
More informationJUST THE MATHS UNIT NUMBER 9.9. MATRICES 9 (Modal & spectral matrices) A.J.Hobson
JUST THE MATHS UNIT NUMBER 9.9 MATRICES 9 (Modal & spectral matrices) by A.J.Hobson 9.9. Assumptions and definitions 9.9.2 Diagonalisation of a matrix 9.9.3 Exercises 9.9.4 Answers to exercises UNIT 9.9
More informationPerturbation Theory for Self-Adjoint Operators in Krein spaces
Perturbation Theory for Self-Adjoint Operators in Krein spaces Carsten Trunk Institut für Mathematik, Technische Universität Ilmenau, Postfach 10 05 65, 98684 Ilmenau, Germany E-mail: carsten.trunk@tu-ilmenau.de
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 informationIrina Pchelintseva A FIRST-ORDER SPECTRAL PHASE TRANSITION IN A CLASS OF PERIODICALLY MODULATED HERMITIAN JACOBI MATRICES
Opuscula Mathematica Vol. 8 No. 008 Irina Pchelintseva A FIRST-ORDER SPECTRAL PHASE TRANSITION IN A CLASS OF PERIODICALLY MODULATED HERMITIAN JACOBI MATRICES Abstract. We consider self-adjoint unbounded
More informationLinear Algebra review Powers of a diagonalizable matrix Spectral decomposition
Linear Algebra review Powers of a diagonalizable matrix Spectral decomposition Prof. Tesler Math 283 Fall 2016 Also see the separate version of this with Matlab and R commands. Prof. Tesler Diagonalizing
More informationLinear Algebra Practice Problems
Math 7, Professor Ramras Linear Algebra Practice Problems () Consider the following system of linear equations in the variables x, y, and z, in which the constants a and b are real numbers. x y + z = a
More informationMAIN ARTICLES. In present paper we consider the Neumann problem for the operator equation
Volume 14, 2010 1 MAIN ARTICLES THE NEUMANN PROBLEM FOR A DEGENERATE DIFFERENTIAL OPERATOR EQUATION Liparit Tepoyan Yerevan State University, Faculty of mathematics and mechanics Abstract. We consider
More informationSubmitted Version to CAMWA, September 30, 2009 THE LAPLACE TRANSFORM ON ISOLATED TIME SCALES
Submitted Version to CAMWA, September 30, 2009 THE LAPLACE TRANSFORM ON ISOLATED TIME SCALES MARTIN BOHNER AND GUSEIN SH. GUSEINOV Missouri University of Science and Technology, Department of Mathematics
More informationarxiv: v2 [math.sp] 3 Sep 2015
Symmetries of the Feinberg-Zee Random Hopping Matrix Raffael Hagger November 6, 7 arxiv:4937v [mathsp] 3 Sep 5 Abstract We study the symmetries of the spectrum of the Feinberg-Zee Random Hopping Matrix
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 informationInverse Eigenvalue Problems
Constructing Matrices with Prescribed Eigenvalues N. Jackson Department of Mathematics Math 45 Term Project, Fall 2010 Outline Introduction Eigenvalues and Eigenvectors (IEP s) One Simple Algorithm Heuvers
More informationINTEGER POWERS OF ANTI-BIDIAGONAL HANKEL MATRICES
Indian J Pure Appl Math, 49: 87-98, March 08 c Indian National Science Academy DOI: 0007/s36-08-056-9 INTEGER POWERS OF ANTI-BIDIAGONAL HANKEL MATRICES João Lita da Silva Department of Mathematics and
More informationOn the closures of orbits of fourth order matrix pencils
On the closures of orbits of fourth order matrix pencils Dmitri D. Pervouchine Abstract In this work we state a simple criterion for nilpotentness of a square n n matrix pencil with respect to the action
More informationInverse Eigenvalue Problems for Two Special Acyclic Matrices
mathematics Communication Inverse Eigenvalue Problems for Two Special Acyclic Matrices Debashish Sharma, *, and Mausumi Sen, Department of Mathematics, Gurucharan College, College Road, Silchar 788004,
More informationFinding eigenvalues for matrices acting on subspaces
Finding eigenvalues for matrices acting on subspaces Jakeniah Christiansen Department of Mathematics and Statistics Calvin College Grand Rapids, MI 49546 Faculty advisor: Prof Todd Kapitula Department
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 informationUniqueness of the potential function for the vectorial Sturm-Liouville equation on a finite interval
RESEARCH Uniqueness of the potential function for the vectorial Sturm-Liouville equation on a finite interval Tsorng-Hwa Chang 1,2 and Chung-Tsun Shieh 1* Open Access * Correspondence: ctshieh@mail. tku.edu.tw
More informationarxiv:math/ v1 [math.sp] 18 Jan 2003
INVERSE SPECTRAL PROBLEMS FOR STURM-LIOUVILLE OPERATORS WITH SINGULAR POTENTIALS, II. RECONSTRUCTION BY TWO SPECTRA arxiv:math/31193v1 [math.sp] 18 Jan 23 ROSTYSLAV O. HRYNIV AND YAROSLAV V. MYKYTYUK Abstract.
More informationON QUADRAPELL NUMBERS AND QUADRAPELL POLYNOMIALS
Hacettepe Journal of Mathematics and Statistics Volume 8() (009), 65 75 ON QUADRAPELL NUMBERS AND QUADRAPELL POLYNOMIALS Dursun Tascı Received 09:0 :009 : Accepted 04 :05 :009 Abstract In this paper we
More informationInverse Nodal Problems for Second Order Differential Operators with a Regular Singularity
International Journal of Difference Equations. ISSN 973-669 Volume 1 Number 6), pp. 41 47 c Research India Publications http://www.ripublication.com/ide.htm Inverse Nodal Problems for Second Order Differential
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 informationLinear Algebra review Powers of a diagonalizable matrix Spectral decomposition
Linear Algebra review Powers of a diagonalizable matrix Spectral decomposition Prof. Tesler Math 283 Fall 2018 Also see the separate version of this with Matlab and R commands. Prof. Tesler Diagonalizing
More informationEigenvectors and Reconstruction
Eigenvectors and Reconstruction Hongyu He Department of Mathematics Louisiana State University, Baton Rouge, USA hongyu@mathlsuedu Submitted: Jul 6, 2006; Accepted: Jun 14, 2007; Published: Jul 5, 2007
More informationDiagonalization of Matrix
of Matrix King Saud University August 29, 2018 of Matrix Table of contents 1 2 of Matrix Definition If A M n (R) and λ R. We say that λ is an eigenvalue of the matrix A if there is X R n \ {0} such that
More informationDeterminant formulas for multidimensional hypergeometric period matrices
Advances in Applied Mathematics 29 (2002 137 151 www.academicpress.com Determinant formulas for multidimensional hypergeometric period matrices Donald Richards a,b,,1 andqifuzheng c,2 a School of Mathematics,
More informationTHE THIRD REGULARIZED TRACE FORMULA FOR SECOND ORDER DIFFERENTIAL EQUATIONS WITH SELF-ADJOINT NUCLEAR CLASS OPERATOR COEFFICIENTS
Mathematica Aeterna, Vol.,, no. 5, 49-4 THE THIRD REGULARIZED TRACE FORMULA FOR SECOND ORDER DIFFERENTIAL EQUATIONS WITH SELF-ADJOINT NUCLEAR CLASS OPERATOR COEFFICIENTS Gamidulla I. Aslanov Institute
More informationand let s calculate the image of some vectors under the transformation T.
Chapter 5 Eigenvalues and Eigenvectors 5. Eigenvalues and Eigenvectors Let T : R n R n be a linear transformation. Then T can be represented by a matrix (the standard matrix), and we can write T ( v) =
More informationDepartment of Mathematics California State University, Los Angeles Master s Degree Comprehensive Examination in. NUMERICAL ANALYSIS Spring 2015
Department of Mathematics California State University, Los Angeles Master s Degree Comprehensive Examination in NUMERICAL ANALYSIS Spring 2015 Instructions: Do exactly two problems from Part A AND two
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 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 informationTRACE FORMULAE AND INVERSE SPECTRAL THEORY FOR SCHRÖDINGER OPERATORS. F. Gesztesy, H. Holden, B. Simon, and Z. Zhao
APPEARED IN BULLETIN OF THE AMERICAN MATHEMATICAL SOCIETY Volume 29, Number 2, October 993, Pages 250-255 TRACE FORMULAE AND INVERSE SPECTRAL THEORY FOR SCHRÖDINGER OPERATORS F. Gesztesy, H. Holden, B.
More informationChapter 7. Canonical Forms. 7.1 Eigenvalues and Eigenvectors
Chapter 7 Canonical Forms 7.1 Eigenvalues and Eigenvectors Definition 7.1.1. Let V be a vector space over the field F and let T be a linear operator on V. An eigenvalue of T is a scalar λ F such that there
More informationMath 108b: Notes on the Spectral Theorem
Math 108b: Notes on the Spectral Theorem From section 6.3, we know that every linear operator T on a finite dimensional inner product space V has an adjoint. (T is defined as the unique linear operator
More information1 Number Systems and Errors 1
Contents 1 Number Systems and Errors 1 1.1 Introduction................................ 1 1.2 Number Representation and Base of Numbers............. 1 1.2.1 Normalized Floating-point Representation...........
More informationAN EXAMPLE OF SPECTRAL PHASE TRANSITION PHENOMENON IN A CLASS OF JACOBI MATRICES WITH PERIODICALLY MODULATED WEIGHTS
AN EXAMPLE OF SPECTRAL PHASE TRANSITION PHENOMENON IN A CLASS OF JACOBI MATRICES WITH PERIODICALLY MODULATED WEIGHTS SERGEY SIMONOV Abstract We consider self-adjoint unbounded Jacobi matrices with diagonal
More informationWe will discuss matrix diagonalization algorithms in Numerical Recipes in the context of the eigenvalue problem in quantum mechanics, m A n = λ m
Eigensystems We will discuss matrix diagonalization algorithms in umerical Recipes in the context of the eigenvalue problem in quantum mechanics, A n = λ n n, (1) where A is a real, symmetric Hamiltonian
More informationQuantum Computing Lecture 2. Review of Linear Algebra
Quantum Computing Lecture 2 Review of Linear Algebra Maris Ozols Linear algebra States of a quantum system form a vector space and their transformations are described by linear operators Vector spaces
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 informationOscillation theorems for the Dirac operator with spectral parameter in the boundary condition
Electronic Journal of Qualitative Theory of Differential Equations 216, No. 115, 1 1; doi: 1.14232/ejqtde.216.1.115 http://www.math.u-szeged.hu/ejqtde/ Oscillation theorems for the Dirac operator with
More informationLinear Algebra: Characteristic Value Problem
Linear Algebra: Characteristic Value Problem . The Characteristic Value Problem Let < be the set of real numbers and { be the set of complex numbers. Given an n n real matrix A; does there exist a number
More informationA PERIODICITY PROBLEM FOR THE KORTEWEG DE VRIES AND STURM LIOUVILLE EQUATIONS. THEIR CONNECTION WITH ALGEBRAIC GEOMETRY
A PERIODICITY PROBLEM FOR THE KORTEWEG DE VRIES AND STURM LIOUVILLE EQUATIONS. THEIR CONNECTION WITH ALGEBRAIC GEOMETRY B. A. DUBROVIN AND S. P. NOVIKOV 1. As was shown in the remarkable communication
More informationRecursion Formulae for the Characteristic Polynomial of Symmetric Banded Matrices
Recursion Formulae for the Characteristic Polynomial of Symmetric Banded Matrices Werner Kratz und Markus Tentler Preprint Series: 2007-15 Fakultät für Mathematik und Wirtschaftswissenschaften UNIVERSITÄT
More informationA Modified Method for Reconstructing Periodic Jacobi Matrices
mathematics of computation volume 42. number 165 january 1984, pages 143 15 A Modified Method for Reconstructing Periodic Jacobi Matrices By Daniel Boley and Gene H. Golub* Abstract. In this note, we discuss
More informationLast Time. Social Network Graphs Betweenness. Graph Laplacian. Girvan-Newman Algorithm. Spectral Bisection
Eigenvalue Problems Last Time Social Network Graphs Betweenness Girvan-Newman Algorithm Graph Laplacian Spectral Bisection λ 2, w 2 Today Small deviation into eigenvalue problems Formulation Standard eigenvalue
More informationarxiv: v3 [math.ra] 10 Jun 2016
To appear in Linear and Multilinear Algebra Vol. 00, No. 00, Month 0XX, 1 10 The critical exponent for generalized doubly nonnegative matrices arxiv:1407.7059v3 [math.ra] 10 Jun 016 Xuchen Han a, Charles
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 informationLU Factorization. A m x n matrix A admits an LU factorization if it can be written in the form of A = LU
LU Factorization A m n matri A admits an LU factorization if it can be written in the form of Where, A = LU L : is a m m lower triangular matri with s on the diagonal. The matri L is invertible and is
More informationON POISSON BRACKETS COMPATIBLE WITH ALGEBRAIC GEOMETRY AND KORTEWEG DE VRIES DYNAMICS ON THE SET OF FINITE-ZONE POTENTIALS
ON POISSON BRACKETS COMPATIBLE WITH ALGEBRAIC GEOMETRY AND KORTEWEG DE VRIES DYNAMICS ON THE SET OF FINITE-ZONE POTENTIALS A. P. VESELOV AND S. P. NOVIKOV I. Some information regarding finite-zone potentials.
More informationTHE WORK OF EFIM ZELMANOV (FIELDS MEDAL 1994)
THE WORK OF EFIM ZELMANOV (FIELDS MEDAL 1994) KAPIL H. PARANJAPE 1. Introduction Last year at the International Congress of Mathematicians (ICM 94) in Zürich, Switzerland one of the four recipients of
More informationEigenvalue and Eigenvector Homework
Eigenvalue and Eigenvector Homework Olena Bormashenko November 4, 2 For each of the matrices A below, do the following:. Find the characteristic polynomial of A, and use it to find all the eigenvalues
More informationA UNIFIED APPROACH TO FIEDLER-LIKE PENCILS VIA STRONG BLOCK MINIMAL BASES PENCILS.
A UNIFIED APPROACH TO FIEDLER-LIKE PENCILS VIA STRONG BLOCK MINIMAL BASES PENCILS M I BUENO, F M DOPICO, J PÉREZ, R SAAVEDRA, AND B ZYKOSKI Abstract The standard way of solving the polynomial eigenvalue
More informationBanach Algebras of Matrix Transformations Between Spaces of Strongly Bounded and Summable Sequences
Advances in Dynamical Systems and Applications ISSN 0973-532, Volume 6, Number, pp. 9 09 20 http://campus.mst.edu/adsa Banach Algebras of Matrix Transformations Between Spaces of Strongly Bounded and Summable
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 informationAPPENDIX A. Background Mathematics. A.1 Linear Algebra. Vector algebra. Let x denote the n-dimensional column vector with components x 1 x 2.
APPENDIX A Background Mathematics A. Linear Algebra A.. Vector algebra Let x denote the n-dimensional column vector with components 0 x x 2 B C @. A x n Definition 6 (scalar product). The scalar product
More informationSolution for Homework 5
Solution for Homework 5 ME243A/ECE23A Fall 27 Exercise 1 The computation of the reachable subspace in continuous time can be handled easily introducing the concepts of inner product, orthogonal complement
More informationarxiv: v1 [math.sp] 4 Sep 2015
Partial inverse problems for Sturm-Liouville operators on trees Natalia Bondarenko, Chung-Tsun Shieh arxiv:1509.01534v1 [math.sp] 4 Sep 2015 Abstract. In this paper, inverse spectral problems for Sturm-Liouville
More informationA STRUCTURED INVERSE SPECTRUM PROBLEM FOR INFINITE GRAPHS
A STRUCTURED INVERSE SPECTRUM PROBLEM FOR INFINITE GRAPHS KEIVAN HASSANI MONFARED AND EHSSAN KHANMOHAMMADI Abstract It is shown that for a given infinite graph G on countably many vertices, and a compact,
More informationThe Eigenvalue Problem: Perturbation Theory
Jim Lambers MAT 610 Summer Session 2009-10 Lecture 13 Notes These notes correspond to Sections 7.2 and 8.1 in the text. The Eigenvalue Problem: Perturbation Theory The Unsymmetric Eigenvalue Problem Just
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 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 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 informationTopic 1: Matrix diagonalization
Topic : Matrix diagonalization Review of Matrices and Determinants Definition A matrix is a rectangular array of real numbers a a a m a A = a a m a n a n a nm The matrix is said to be of order n m if it
More informationSPECTRAL THEOREM FOR SYMMETRIC OPERATORS WITH COMPACT RESOLVENT
SPECTRAL THEOREM FOR SYMMETRIC OPERATORS WITH COMPACT RESOLVENT Abstract. These are the letcure notes prepared for the workshop on Functional Analysis and Operator Algebras to be held at NIT-Karnataka,
More informationORTHOGONAL RANDOM VECTORS AND THE HURWITZ-RADON-ECKMANN THEOREM
Georgian Mathematical Journal 1(1994), No. 1, 99-113 ORTHOGONAL RANDOM VECTORS AND THE HURWITZ-RADON-ECKMANN THEOREM N. VAKHANIA Abstract. In several different aspects of algebra and topology the following
More informationCS 143 Linear Algebra Review
CS 143 Linear Algebra Review Stefan Roth September 29, 2003 Introductory Remarks This review does not aim at mathematical rigor very much, but instead at ease of understanding and conciseness. Please see
More informationMath Camp Notes: Linear Algebra II
Math Camp Notes: Linear Algebra II Eigenvalues Let A be a square matrix. An eigenvalue is a number λ which when subtracted from the diagonal elements of the matrix A creates a singular matrix. In other
More informationLecture 6. Numerical methods. Approximation of functions
Lecture 6 Numerical methods Approximation of functions Lecture 6 OUTLINE 1. Approximation and interpolation 2. Least-square method basis functions design matrix residual weighted least squares normal equation
More informationKrein s formula and perturbation theory
ISSN: 40-567 Krein s formula and perturbation theory P.Kurasov S.T.Kuroda Research Reports in athematics Number 6, 2000 Department of athematics Stockholm University Electronic versions of this document
More informationOn the Non-Symmetric Spectra of Certain Graphs
College of William and Mary W&M Publish College of William & Mary Undergraduate Honors Theses Theses, Dissertations, & Master Projects 5-2015 On the Non-Symmetric Spectra of Certain Graphs Owen Hill College
More informationOn the reduction of matrix polynomials to Hessenberg form
Electronic Journal of Linear Algebra Volume 3 Volume 3: (26) Article 24 26 On the reduction of matrix polynomials to Hessenberg form Thomas R. Cameron Washington State University, tcameron@math.wsu.edu
More informationLinear Algebra and its Applications
Linear Algebra and its Applications 430 (2009) 579 586 Contents lists available at ScienceDirect Linear Algebra and its Applications journal homepage: www.elsevier.com/locate/laa Low rank perturbation
More informationChapter 3 Transformations
Chapter 3 Transformations An Introduction to Optimization Spring, 2014 Wei-Ta Chu 1 Linear Transformations A function is called a linear transformation if 1. for every and 2. for every If we fix the bases
More informationDuke University, Department of Electrical and Computer Engineering Optimization for Scientists and Engineers c Alex Bronstein, 2014
Duke University, Department of Electrical and Computer Engineering Optimization for Scientists and Engineers c Alex Bronstein, 2014 Linear Algebra A Brief Reminder Purpose. The purpose of this document
More informationThe Finite Spectrum of Sturm-Liouville Operator With δ-interactions
Available at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 93-9466 Applications and Applied Mathematics: An International Journal (AAM) Vol. 3, Issue (June 08), pp. 496 507 The Finite Spectrum of Sturm-Liouville
More information2 Two-Point Boundary Value Problems
2 Two-Point Boundary Value Problems Another fundamental equation, in addition to the heat eq. and the wave eq., is Poisson s equation: n j=1 2 u x 2 j The unknown is the function u = u(x 1, x 2,..., x
More informationEigenvalues and Eigenvectors A =
Eigenvalues and Eigenvectors Definition 0 Let A R n n be an n n real matrix A number λ R is a real eigenvalue of A if there exists a nonzero vector v R n such that A v = λ v The vector v is called an eigenvector
More informationReview of some mathematical tools
MATHEMATICAL FOUNDATIONS OF SIGNAL PROCESSING Fall 2016 Benjamín Béjar Haro, Mihailo Kolundžija, Reza Parhizkar, Adam Scholefield Teaching assistants: Golnoosh Elhami, Hanjie Pan Review of some mathematical
More informationOn the Dimension of the Stability Group for a Levi Non-Degenerate Hypersurface
1 On the Dimension of the Stability Group for a Levi Non-Degenerate Hypersurface Vladimir Ezhov and Alexander Isaev We classify locally defined non-spherical real-analytic hypersurfaces in complex space
More information7 Planar systems of linear ODE
7 Planar systems of linear ODE Here I restrict my attention to a very special class of autonomous ODE: linear ODE with constant coefficients This is arguably the only class of ODE for which explicit solution
More informationSOME PROPERTIES OF THE CANONICAL DIVISOR IN THE BERGMAN SPACE
SOME PROPERTIES OF THE CANONICAL DIVISOR IN THE BERGMAN SPACE Cyrus Luciano 1, Lothar Narins 2, Alexander Schuster 3 1 Department of Mathematics, SFSU, San Francisco, CA 94132,USA e-mail: lucianca@sfsu.edu
More informationOn the inverse of the adjacency matrix of a graph
Special Matrices Research Article DOI: 10.2478/spma-2013-0006 Special Matrices 2013 28-41 On the inverse of the adjacency matrix of a graph Abstract A real symmetric matrix G with zero diagonal encodes
More informationIntroduction to Applied Linear Algebra with MATLAB
Sigam Series in Applied Mathematics Volume 7 Rizwan Butt Introduction to Applied Linear Algebra with MATLAB Heldermann Verlag Contents Number Systems and Errors 1 1.1 Introduction 1 1.2 Number Representation
More informationVarious symmetries in matrix theory with application to modeling dynamic systems
Available online at wwwtjnsacom J Nonlinear Sci Appl 7 (2014), 63 69 Research Article Various symmetries in matrix theory with application to modeling dynamic systems Arya Aghili Ashtiani a,, Pandora Raja
More informationLinear algebra and applications to graphs Part 1
Linear algebra and applications to graphs Part 1 Written up by Mikhail Belkin and Moon Duchin Instructor: Laszlo Babai June 17, 2001 1 Basic Linear Algebra Exercise 1.1 Let V and W be linear subspaces
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 informationEXPLICIT BLOCK-STRUCTURES FOR BLOCK-SYMMETRIC FIEDLER-LIKE PENCILS
EXPLICIT BLOCK-STRUCTURES FOR BLOCK-SYMMETRIC FIEDLER-LIKE PENCILS M I BUENO, M MARTIN, J PÉREZ, A SONG, AND I VIVIANO Abstract In the last decade, there has been a continued effort to produce families
More informationq-counting hypercubes in Lucas cubes
Turkish Journal of Mathematics http:// journals. tubitak. gov. tr/ math/ Research Article Turk J Math (2018) 42: 190 203 c TÜBİTAK doi:10.3906/mat-1605-2 q-counting hypercubes in Lucas cubes Elif SAYGI
More informationSpectrally arbitrary star sign patterns
Linear Algebra and its Applications 400 (2005) 99 119 wwwelseviercom/locate/laa Spectrally arbitrary star sign patterns G MacGillivray, RM Tifenbach, P van den Driessche Department of Mathematics and Statistics,
More information