Orthogonal diagonalization for complex skew-persymmetric anti-tridiagonal Hankel matrices

Size: px
Start display at page:

Download "Orthogonal diagonalization for complex skew-persymmetric anti-tridiagonal Hankel matrices"

Transcription

1 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 DOI /spma Received May 13, 015; accepted November 1, 015 Abstract: In this paper, we obtain an eigenvalue decomposition for any complex skew-persymmetric antitridiagonal Hankel matrix where the eigenvector matrix is orthogonal. Keywords: Anti-tridiagonal matrices; Hankel matrices; orthogonal diagonalization; skew-persymmetric matrices. 1 Introduction An n n complex anti-tridiagonal Hankel matrix is a matrix of the form antitridiag n (a 1, a 0, a 1 ) : 0 0 a 1 a a 1 a 0 a a 1 a 0 a a a 0 a 1 0 0, n N, a 1, a 0, a 1 C, where N is the set of natural numbers (that is, the set of positive integers) and C denotes the set of (finite) complex numbers. In [1, Theorem 4] an orthogonal diagonalization for any real persymmetric anti-tridiagonal Hankel matrix was presented. The following result, which was given in [, Theorem 5 and Lemma 1], is a generalization of [1, Theorem 4] to complex matrices ([3] is another recent reference where the eigenvalues of certain persymmetric anti-tridiagonal Hankel matrices are given). Theorem 1. Let n N and a 1, a 0 C. Then antitridiag n (a 1, a 0, a 1 ) Υ n diag(τ 1,..., τ n )Υ 1 n, where diag(τ 1,..., τ n ) : (τ j δ ) n 1, with δ being the Kronecker delta and ) τ j ( 1) ( a j+1 jπ 0 + a 1, j {1,..., n}, *Corresponding Author: Jesús Gutiérrez-Gutiérrez: Ceit, Manuel Lardizábal 15, 0018 San Sebastián, Spain and Tecnun (University of Navarra), Manuel Lardizábal 13, 0018 San Sebastián, Spain, jgutierrez@ceit.es Marta Zárraga-Rodríguez: ISSA (University of Navarra), Ediffcio Amigos, Campus Universitario, Pamplona, Spain and Tecnun (University of Navarra), Manuel Lardizábal 13, 0018 San Sebastián, Spain, mzarraga@tecnun.es 016 Jesús Gutiérrez-Gutiérrez and Marta Zárraga-Rodríguez, published by De Gruyter Open. This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivs 3.0 License. Download Date 4/10/18 :13 PM

2 74 Jesús Gutiérrez-Gutiérrez and Marta Zárraga-Rodríguez and Υ n is the n n real symmetric orthogonal matrix whose entries are given by [Υ n ] jkπ sin, j, k {1,..., n}. In the present paper we give an orthogonal diagonalization for any complex skew-persymmetric antitridiagonal Hankel matrix, i.e., for any matrix of the form antitridiag n (a, 0, a) with a C and n N. Orthogonal diagonalization We first give an orthogonal diagonalization for any complex skew-persymmetric anti-tridiagonal Hankel matrix of odd order. Theorem. Consider a C and n p + 1 with p N {0}. Let Υ n be as in Theorem 1. Then antitridiag n (a, 0, a) U n diag(λ 1,..., λ n )U 1 n, where λ j a and U n is the n n real orthogonal matrix given by jπ, j {1,..., n}, [U n ] s [Υ n ], j, k {1,..., n}, with Proof. See A. s { ( 1) j+1 if j is odd, ( 1) j+1+n+k if j is even, j, k {1,..., n}. (1) We now give an orthogonal diagonalization for any complex skew-persymmetric anti-tridiagonal Hankel matrix of even order. Theorem 3. Consider a C and n p with p N. Let Υ n be as in Theorem 1. Then antitridiag n (a, 0, a) U n diag(λ 1,..., λ n )U 1 n, where λ j a and U n is the n n real orthogonal matrix given by jπ, j {1,..., n}, [U n ] s [Υ n ], j, k {1,..., n}, with s ( 1) j 1 +( 1) n+k+j+1 if j is odd, ( 1) j +( 1) n+k+j if j is even, j, k {1,..., n}. () Proof. See B. In [4, 5] Rimas gave a diagonalization for the matrix antitridiag n (1, 0, 1) of the form ( antitridiag n (1, 0, 1) W n diag π, π,..., nπ ) W 1 n, (3) Download Date 4/10/18 :13 PM

3 Orthogonal diagonalization 75 where the eigenvector matrix W n is real and not orthogonal. Although W n is not orthogonal it satisfies [W n W n ] 0 whenever j, k {1,..., n} and j k, because eigenvectors of a real symmetric matrix corresponding to different eigenvalues are orthogonal (see, e.g., [6, p. 548]). From (3) we have antitridiag n (a, 0, a) W n diag (λ 1,..., λ n) W 1 n (4) for all a C. Thus, the difference between the diagonalization in (4) and the one given in Theorems and 3 for the matrix antitridiag n (a, 0, a) lies in the eigenvector matrix. Since the algebraic multiplicity of λ k is 1 with a 0, its geometric multiplicity is also 1 (see, e.g., [7, Section 4.1]), and consequently, there exists r k R such that [U n ] 1:n,k r k [W n ] 1:n,k, k {1,..., n}, where [U n ] 1:n,k and [W n ] 1:n,k denote the kth column of the matrix U n and W n, respectively. Therefore, 1 [I n ] k,k [U n U n ] k,k [U n ] 1:n,k[U n ] 1:n,k r k[w n ] 1:n,k[W n ] 1:n,k r k [W n] 1:n,k, k {1,..., n}, and hence, r k 1 [W n ] 1:n,k, k {1,..., n}, where denotes the Euclidean norm. Thus, { [Wn ] [U n ] 1:n,k 1:n,k, [W } n] 1:n,k, [W n ] 1:n,k [W n ] 1:n,k k {1,..., n}. (5) Observe that to prove (5) is another way to prove Theorems and 3. We finish by mentioning that Theorems and 3 are useful to obtain the natural powers of the considered matrix antitridiag n (a, 0, a): ( antitridiagn (a, 0, a) ) q Un diag(λ 1 q,..., λ n q )U n, q N. The natural powers of complex skew-persymmetric anti-tridiagonal Hankel matrices were also studied in [4, 5, 8, 9]. In [8] the expression for those powers was obtained by using the eigenvalue decomposition of the complex tridiagonal Toeplitz matrices presented in [10]. Acknowledgement: The authors thank the two anonymous reviewers for their helpful comments. This work was supported in part by the Spanish Ministry of Economy and Competitiveness through the RACHEL project (TEC C4--R). A Proof of Theorem We divide the proof into two steps. In the first step we prove that U n is an orthogonal matrix, or equivalently, that Un U n I n, where denotes transpose and I n is the n n identity matrix. For convenience we rewrite (1) as ) s ( 1) j ( 1) 1+n+k j+1, j, k {1,..., n}, where x denotes the smallest integer not less than x. Applying the basic trigonometric formula sin x sin y (x + y) (x y) (see, e.g., [11, p. 97]) yields [ U n U n ] Un [U n] h,k j,h [U n] h,j [U n] h,k Download Date 4/10/18 :13 PM

4 76 Jesús Gutiérrez-Gutiérrez and Marta Zárraga-Rodríguez ( 1) h ( 1) 1+n+j ) h+1 [Υn ] h,j ( 1) h ) ( 1) 1+n+k h+1 [Υn ] h,k ( 1) j+k) h+1 hjπ hkπ (( 1) j+k ) h+1 1 ( 1)j+k+1 (( 1) j+k ) h ( (j k)hπ ) (j k)hπ, j, k {1,..., n}. Consequently, using and ( 1) h mhπ mhπ 0 if m is odd, n if m Ω, 1 if m N \ Ω, 0 if + m is odd, n if + m Ω and m Ω, n 1 if + m Ω and m N \ Ω, n 1 if + m N \ Ω and m Ω, 1 if + m N \ Ω and m N \ Ω, where m N {0} and Ω {()k : k N {0}} (see [1, Eqs. (5) and (7)]), we obtain 1 ] [ Un [ 1 n] 1 if j k, U n 1 [ 1 ( 1)] 0 if j k and j + k is even, 1 [0 0] 0 if j k and j + k is odd, [I n ], j, k {1,..., n}. (6) (7) In the second step we prove that antitridiag n (a, 0, a) U n D n U 1 n, or equivalently, antitridiag n (a, 0, a) U n D n U n, where D n diag(λ 1,..., λ n ). Applying the basic trigonometric formulas sin x sin y (x + y) (x y) and (x + y) x y sin x sin y (see, e.g., [11, pp ]) yields hπ 1 ( (j+k)hπ (j k)hπ ) 1 (j+k)hπ hπ (j k)hπ hπ 1 ( 1 (j+k+1)hπ + (j+k 1)hπ ) 1 ( (j k+1)hπ + (j k 1)hπ ) 1 (j+k+1)hπ + (j+k 1)hπ (j k+1)hπ (j k 1)hπ 4 (8) for all h, j, k {1,..., n}, and hence, [ U n D n U n 4at at ] [U n] j,h [ D n Un ] h,k [U n] j,h [D n] h,l [ Un ] l,k [U n] j,h [D n] h,l [U n] k,l [U n] j,h [D n] h,h [U n] k,h 4a ( 1) j + k ( 1) j+k) h l1 ( 1) 1+n+h ) j+k l1 ( 1) j+k) h (j + k + 1)hπ (j + k 1)hπ (j k + 1)hπ + (j k 1)hπ, Download Date 4/10/18 :13 PM

5 Orthogonal diagonalization 77 ) where t ( 1) j j+k + k ( 1) 1+n and j, k {1,..., n}. Therefore, using (6) and (7) we conclude that U n D n Un [ ] n + ( 1) ( 1) ( 1) at if j + k n, [ ] ( 1) + n ( 1) ( 1) at if j + k n +, [ ] 0 if j + k is even, [ ] ( 1) + ( 1) ( 1) ( 1) 0 otherwise, at at at at a( 1) j + k+1 1+n ( 1) a( 1) a if j + k n and j is even, a( 1) j+1 + k 1+n ( 1) a( 1) a if j + k n and j is odd, a( 1) j + k+1 1+n ( 1) a( 1) n+ a if j + k n + and j is even, a( 1) j+1 + k ( 1) 1+n a( 1) n+ a if j + k n + and j is odd, 0 otherwise, [antitridiag n (a, 0, a)], j, k {1,..., n}. B Proof of Theorem 3 We divide the proof into two steps. In the first step we prove that U n is an orthogonal matrix. For convenience we rewrite () as ) ( 1) j ( 1) j 1 + ( 1) n+j+k s, j, k {1,..., n}. Applying (6) and (7) yields [ Un U n ] [U n] h,j [U n] h,k 1 ( 1) h ( 1) h 1 + ( 1) n+h+j ( 1) n+h+j 1 + ( 1)j+k () 1 + ( 1) n+h+j ) ) ) 1 + ( 1) n+h+k [Υ n] h,j [Υ n] h,k ) ( 1) h ( 1) h 1 + ( 1) n+h+k [Υ n] h,j [Υ n] h,k ) ) 1 + ( 1) n+h+k sin hjπ hkπ sin [ 1 + ( 1) j+k) + ( 1) h ( 1) n ( 1) j + ( 1) k) ] 1 ( ( 1) h (j k)hπ ( 1) n ( 1)j + ( 1) k (j k)hπ () 1 [ 1 n] ( 1) n ( 1)j [0 0] 1 if j k, 1 [ 1 ( 1)] ( 1) n ( 1)j +( 1) k [0 0] 0 if j k and j + k is even, () if j k and j + k is odd, [I n ], j, k {1,..., n}. (j k)hπ ) Download Date 4/10/18 :13 PM

6 78 Jesús Gutiérrez-Gutiérrez and Marta Zárraga-Rodríguez In the second step we prove that antitridiag n (a, 0, a) U n D n Un 1, or equivalently, antitridiag n (a, 0, a) U n D n Un, where D n diag(λ 1,..., λ n ). We have U n D n Un [U n] j,h [D n] h,h [U n] k,h ( 1) j + k ( 1) j+k ( 1) j + k ( 1) j+k ( 1) j + k ( 1) j+k at 1 + ( 1) j+k + ( 1) h ( 1) n 1 + ( 1) n+j+h ) 1 + ( 1) n+k+h ( 1) j + ( 1) k) ) λ h [Υ n ] j,h [Υ n ] k,h ) λ h [Υ n ] j,h [Υ n ] k,h ( ) 1+( 1) j+k) λ h [Υ n ] j,h [Υ n ] k,h +( 1) n ( 1) j +( 1) k) ( 1) h λ h [Υ n ] j,h [Υ n ] k,h ar where t ( 1) j + k (1 + ( 1) j+k ), r ( 1) j + k ( 1) n (6), (7), and (8) we conclude that U n D n Un at (j+k+1)hπ ( 1) h + (j+k 1)hπ, ( 1) j + ( 1) k), and j, k {1,..., n}. Using (j k+1)hπ (j k 1)hπ () + ar ( 1) h (j+k+1)hπ + (j+k 1)hπ (j k+1)hπ (j k 1)hπ () at () [ ] + ar [ ] ar () n + ( 1) ( 1) ( 1) if j + k n, at () [ ] + ar [ ] ar () 1 + n ( 1) ( 1) if j + k n +, 0 if j + k is odd, at () [ ] + ar [ ] () 1 + ( 1) ( 1) ( 1) 0 otherwise, a ( 1) j + k n ( 1) a( 1) n a if j + k n and j is even, j+1 a ( 1) + k+1 n ( 1) ( ) a( 1) a if j + k n and j is odd, a ( 1) j + k n ( 1) a( 1) a if j + k n + and j is even, j+1 a ( 1) + k+1 n ( 1) ( ) a( 1) n+ a if j + k n + and j is odd, 0 otherwise, [antitridiag n (a, 0, a)], j, k {1,..., n}. References [1] J. Gutiérrez-Gutiérrez, Powers of real persymmetric anti-tridiagonal matrices with constant anti-diagonals, Applied Mathematics and Computation 06 (008) [] J. Gutiérrez-Gutiérrez, Eigenvalue decomposition for persymmetric Hankel matrices with at most three non-zero antidiagonals, Applied Mathematics and Computation 34 (014) [3] M. Akbulak, C. M. da Fonseca, F. Yılmaz, The eigenvalues of a family of persymmetric anti-tridiagonal -Hankel matrices, Applied Mathematics and Computation 5 (013) [4] J. Rimas, On computing of arbitrary integer powers of even order anti-tridiagonal matrices with zeros in main skew diagonal and elements 1, 1, 1,..., 1; 1, 1, 1,..., 1 in neighbouring diagonals, Applied Mathematics and Computation 04 (008) [5] J. Rimas, On computing of arbitrary positive integer powers of odd order anti-tridiagonal matrices with zeros in main skew diagonal and elements 1, 1, 1,..., 1; 1, 1, 1,..., 1 in neighbouring diagonals, Applied Mathematics and Computation 10 (009) Download Date 4/10/18 :13 PM

7 Orthogonal diagonalization 79 [6] C. D. Meyer, Matrix Analysis and Applied Linear Algebra, SIAM, 000. [7] P. Lancaster, M. Tismenetsky, The Theory of Matrices, Academic Press, [8] J. Gutiérrez-Gutiérrez, Powers of complex persymmetric or skew-persymmetric anti-tridiagonal matrices with constant antidiagonals, Applied Mathematics and Computation 17 (011) [9] J. Lita da Silva, Integer powers of anti-tridiagonal matrices of the form antitridiag n (a, c, a), a, c C, International Journal of Computer Mathematics (015) DOI: / [10] J. Gutiérrez-Gutiérrez, Powers of tridiagonal matrices with constant diagonals, Applied Mathematics and Computation 06 (008) [11] T. M. Apostol, Calculus, Vol. 1, John Wiley & Sons, Download Date 4/10/18 :13 PM

INTEGER POWERS OF ANTI-BIDIAGONAL HANKEL MATRICES

INTEGER 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 information

The spectral decomposition of near-toeplitz tridiagonal matrices

The 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 information

Determinant evaluations for binary circulant matrices

Determinant evaluations for binary circulant matrices Spec Matrices 014; :187 199 Research Article Open Access Christos Kravvaritis* Determinant evaluations for binary circulant matrices Abstract: Determinant formulas for special binary circulant matrices

More information

Sparse polynomial interpolation in Chebyshev bases

Sparse 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 information

Lecture 2 INF-MAT : A boundary value problem and an eigenvalue problem; Block Multiplication; Tridiagonal Systems

Lecture 2 INF-MAT : A boundary value problem and an eigenvalue problem; Block Multiplication; Tridiagonal Systems Lecture 2 INF-MAT 4350 2008: A boundary value problem and an eigenvalue problem; Block Multiplication; Tridiagonal Systems Tom Lyche Centre of Mathematics for Applications, Department of Informatics, University

More information

The Solvability Conditions for the Inverse Eigenvalue Problem of Hermitian and Generalized Skew-Hamiltonian Matrices and Its Approximation

The Solvability Conditions for the Inverse Eigenvalue Problem of Hermitian and Generalized Skew-Hamiltonian Matrices and Its Approximation The Solvability Conditions for the Inverse Eigenvalue Problem of Hermitian and Generalized Skew-Hamiltonian Matrices and Its Approximation Zheng-jian Bai Abstract In this paper, we first consider the inverse

More information

= main diagonal, in the order in which their corresponding eigenvectors appear as columns of E.

= main diagonal, in the order in which their corresponding eigenvectors appear as columns of E. 3.3 Diagonalization Let A = 4. Then and are eigenvectors of A, with corresponding eigenvalues 2 and 6 respectively (check). This means 4 = 2, 4 = 6. 2 2 2 2 Thus 4 = 2 2 6 2 = 2 6 4 2 We have 4 = 2 0 0

More information

Lecture4 INF-MAT : 5. Fast Direct Solution of Large Linear Systems

Lecture4 INF-MAT : 5. Fast Direct Solution of Large Linear Systems Lecture4 INF-MAT 4350 2010: 5. Fast Direct Solution of Large Linear Systems Tom Lyche Centre of Mathematics for Applications, Department of Informatics, University of Oslo September 16, 2010 Test Matrix

More information

Reconstruction of sparse Legendre and Gegenbauer expansions

Reconstruction 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 information

j=1 u 1jv 1j. 1/ 2 Lemma 1. An orthogonal set of vectors must be linearly independent.

j=1 u 1jv 1j. 1/ 2 Lemma 1. An orthogonal set of vectors must be linearly independent. Lecture Notes: Orthogonal and Symmetric Matrices Yufei Tao Department of Computer Science and Engineering Chinese University of Hong Kong taoyf@cse.cuhk.edu.hk Orthogonal Matrix Definition. Let u = [u

More information

Linear Algebra and its Applications

Linear 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 information

Exercise Set 7.2. Skills

Exercise Set 7.2. Skills Orthogonally diagonalizable matrix Spectral decomposition (or eigenvalue decomposition) Schur decomposition Subdiagonal Upper Hessenburg form Upper Hessenburg decomposition Skills Be able to recognize

More information

Symmetric and anti symmetric matrices

Symmetric 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 information

MATH 423 Linear Algebra II Lecture 33: Diagonalization of normal operators.

MATH 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 information

Review of Linear Algebra

Review of Linear Algebra Review of Linear Algebra Definitions An m n (read "m by n") matrix, is a rectangular array of entries, where m is the number of rows and n the number of columns. 2 Definitions (Con t) A is square if m=

More information

ALGORITHMS FOR CENTROSYMMETRIC AND SKEW-CENTROSYMMETRIC MATRICES. Iyad T. Abu-Jeib

ALGORITHMS FOR CENTROSYMMETRIC AND SKEW-CENTROSYMMETRIC MATRICES. Iyad T. Abu-Jeib ALGORITHMS FOR CENTROSYMMETRIC AND SKEW-CENTROSYMMETRIC MATRICES Iyad T. Abu-Jeib Abstract. We present a simple algorithm that reduces the time complexity of solving the linear system Gx = b where G is

More information

Discrete Applied Mathematics

Discrete Applied Mathematics Discrete Applied Mathematics 194 (015) 37 59 Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: wwwelseviercom/locate/dam Loopy, Hankel, and combinatorially skew-hankel

More information

Research Article The Adjacency Matrix of One Type of Directed Graph and the Jacobsthal Numbers and Their Determinantal Representation

Research Article The Adjacency Matrix of One Type of Directed Graph and the Jacobsthal Numbers and Their Determinantal Representation Applied Mathematics Volume 20, Article ID 423163, 14 pages doi:101155/20/423163 Research Article The Adjacency Matrix of One Type of Directed Graph and the Jacobsthal Numbers and Their Determinantal Representation

More information

Numerical Methods I: Eigenvalues and eigenvectors

Numerical Methods I: Eigenvalues and eigenvectors 1/25 Numerical Methods I: Eigenvalues and eigenvectors Georg Stadler Courant Institute, NYU stadler@cims.nyu.edu November 2, 2017 Overview 2/25 Conditioning Eigenvalues and eigenvectors How hard are they

More information

Representation of doubly infinite matrices as non-commutative Laurent series

Representation of doubly infinite matrices as non-commutative Laurent series Spec. Matrices 217; 5:25 257 Research Article Open Access María Ivonne Arenas-Herrera and Luis Verde-Star* Representation of doubly infinite matrices as non-commutative Laurent series https://doi.org/1.1515/spma-217-18

More information

On Powers of General Tridiagonal Matrices

On 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 information

2 Two-Point Boundary Value Problems

2 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 information

Orthogonal Symmetric Toeplitz Matrices

Orthogonal Symmetric Toeplitz Matrices Orthogonal Symmetric Toeplitz Matrices Albrecht Böttcher In Memory of Georgii Litvinchuk (1931-2006 Abstract We show that the number of orthogonal and symmetric Toeplitz matrices of a given order is finite

More information

Jordan normal form notes (version date: 11/21/07)

Jordan normal form notes (version date: 11/21/07) Jordan normal form notes (version date: /2/7) If A has an eigenbasis {u,, u n }, ie a basis made up of eigenvectors, so that Au j = λ j u j, then A is diagonal with respect to that basis To see this, let

More information

Chapter 3 Transformations

Chapter 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 information

PAijpam.eu ON THE BOUNDS FOR THE NORMS OF R-CIRCULANT MATRICES WITH THE JACOBSTHAL AND JACOBSTHAL LUCAS NUMBERS Ş. Uygun 1, S.

PAijpam.eu ON THE BOUNDS FOR THE NORMS OF R-CIRCULANT MATRICES WITH THE JACOBSTHAL AND JACOBSTHAL LUCAS NUMBERS Ş. Uygun 1, S. International Journal of Pure and Applied Mathematics Volume 11 No 1 017, 3-10 ISSN: 1311-8080 (printed version); ISSN: 1314-335 (on-line version) url: http://wwwijpameu doi: 10173/ijpamv11i17 PAijpameu

More information

A Cholesky LR algorithm for the positive definite symmetric diagonal-plus-semiseparable eigenproblem

A Cholesky LR algorithm for the positive definite symmetric diagonal-plus-semiseparable eigenproblem A Cholesky LR algorithm for the positive definite symmetric diagonal-plus-semiseparable eigenproblem Bor Plestenjak Department of Mathematics University of Ljubljana Slovenia Ellen Van Camp and Marc Van

More information

LINEAR ALGEBRA 1, 2012-I PARTIAL EXAM 3 SOLUTIONS TO PRACTICE PROBLEMS

LINEAR ALGEBRA 1, 2012-I PARTIAL EXAM 3 SOLUTIONS TO PRACTICE PROBLEMS LINEAR ALGEBRA, -I PARTIAL EXAM SOLUTIONS TO PRACTICE PROBLEMS Problem (a) For each of the two matrices below, (i) determine whether it is diagonalizable, (ii) determine whether it is orthogonally diagonalizable,

More information

Linear Algebra: Matrix Eigenvalue Problems

Linear 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 information

Math 108b: Notes on the Spectral Theorem

Math 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 information

A Family of Nonnegative Matrices with Prescribed Spectrum and Elementary Divisors 1

A Family of Nonnegative Matrices with Prescribed Spectrum and Elementary Divisors 1 International Mathematical Forum, Vol, 06, no 3, 599-63 HIKARI Ltd, wwwm-hikaricom http://dxdoiorg/0988/imf0668 A Family of Nonnegative Matrices with Prescribed Spectrum and Elementary Divisors Ricardo

More information

ON ANGLES BETWEEN SUBSPACES OF INNER PRODUCT SPACES

ON ANGLES BETWEEN SUBSPACES OF INNER PRODUCT SPACES ON ANGLES BETWEEN SUBSPACES OF INNER PRODUCT SPACES HENDRA GUNAWAN AND OKI NESWAN Abstract. We discuss the notion of angles between two subspaces of an inner product space, as introduced by Risteski and

More information

Lecture notes on Quantum Computing. Chapter 1 Mathematical Background

Lecture notes on Quantum Computing. Chapter 1 Mathematical Background Lecture notes on Quantum Computing Chapter 1 Mathematical Background Vector states of a quantum system with n physical states are represented by unique vectors in C n, the set of n 1 column vectors 1 For

More information

NOTES ON LINEAR ALGEBRA CLASS HANDOUT

NOTES ON LINEAR ALGEBRA CLASS HANDOUT NOTES ON LINEAR ALGEBRA CLASS HANDOUT ANTHONY S. MAIDA CONTENTS 1. Introduction 2 2. Basis Vectors 2 3. Linear Transformations 2 3.1. Example: Rotation Transformation 3 4. Matrix Multiplication and Function

More information

Math 315: Linear Algebra Solutions to Assignment 7

Math 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 information

MATH 23a, FALL 2002 THEORETICAL LINEAR ALGEBRA AND MULTIVARIABLE CALCULUS Solutions to Final Exam (in-class portion) January 22, 2003

MATH 23a, FALL 2002 THEORETICAL LINEAR ALGEBRA AND MULTIVARIABLE CALCULUS Solutions to Final Exam (in-class portion) January 22, 2003 MATH 23a, FALL 2002 THEORETICAL LINEAR ALGEBRA AND MULTIVARIABLE CALCULUS Solutions to Final Exam (in-class portion) January 22, 2003 1. True or False (28 points, 2 each) T or F If V is a vector space

More information

A NOVEL METHOD TO DERIVE EXPLICIT KLT KERNEL FOR AR(1) PROCESS. Mustafa U. Torun and Ali N. Akansu

A NOVEL METHOD TO DERIVE EXPLICIT KLT KERNEL FOR AR(1) PROCESS. Mustafa U. Torun and Ali N. Akansu A NOVEL METHOD TO DERIVE EXPLICIT KLT KERNEL FOR AR() PROCESS Mustafa U. Torun and Ali N. Akansu Department of Electrical and Computer Engineering New Jersey Institute of Technology University Heights,

More information

Linear Algebra (Review) Volker Tresp 2017

Linear Algebra (Review) Volker Tresp 2017 Linear Algebra (Review) Volker Tresp 2017 1 Vectors k is a scalar (a number) c is a column vector. Thus in two dimensions, c = ( c1 c 2 ) (Advanced: More precisely, a vector is defined in a vector space.

More information

3.5 Finite Differences and Fast Poisson Solvers

3.5 Finite Differences and Fast Poisson Solvers 3.5 Finite Differences and Fast Poisson Solvers It is extremely unusual to use eigenvectors to solve a linear system KU = F. You need to know all the eigenvectors of K, and (much more than that) the eigenvector

More information

Trace inequalities for positive semidefinite matrices with centrosymmetric structure

Trace inequalities for positive semidefinite matrices with centrosymmetric structure Zhao et al Journal of Inequalities pplications 1, 1:6 http://wwwjournalofinequalitiesapplicationscom/content/1/1/6 RESERCH Trace inequalities for positive semidefinite matrices with centrosymmetric structure

More information

Inverse Eigenvalue Problems for Checkerboard Toeplitz Matrices

Inverse 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 information

An LMI description for the cone of Lorentz-positive maps II

An LMI description for the cone of Lorentz-positive maps II An LMI description for the cone of Lorentz-positive maps II Roland Hildebrand October 6, 2008 Abstract Let L n be the n-dimensional second order cone. A linear map from R m to R n is called positive if

More information

Comparing iterative methods to compute the overlap Dirac operator at nonzero chemical potential

Comparing iterative methods to compute the overlap Dirac operator at nonzero chemical potential Comparing iterative methods to compute the overlap Dirac operator at nonzero chemical potential, Tobias Breu, and Tilo Wettig Institute for Theoretical Physics, University of Regensburg, 93040 Regensburg,

More information

Approximating the matrix exponential of an advection-diffusion operator using the incomplete orthogonalization method

Approximating the matrix exponential of an advection-diffusion operator using the incomplete orthogonalization method Approximating the matrix exponential of an advection-diffusion operator using the incomplete orthogonalization method Antti Koskela KTH Royal Institute of Technology, Lindstedtvägen 25, 10044 Stockholm,

More information

Linear Algebra in Actuarial Science: Slides to the lecture

Linear Algebra in Actuarial Science: Slides to the lecture Linear Algebra in Actuarial Science: Slides to the lecture Fall Semester 2010/2011 Linear Algebra is a Tool-Box Linear Equation Systems Discretization of differential equations: solving linear equations

More information

Linear Algebra (Review) Volker Tresp 2018

Linear Algebra (Review) Volker Tresp 2018 Linear Algebra (Review) Volker Tresp 2018 1 Vectors k, M, N are scalars A one-dimensional array c is a column vector. Thus in two dimensions, ( ) c1 c = c 2 c i is the i-th component of c c T = (c 1, c

More information

The spectra of super line multigraphs

The spectra of super line multigraphs The spectra of super line multigraphs Jay Bagga Department of Computer Science Ball State University Muncie, IN jbagga@bsuedu Robert B Ellis Department of Applied Mathematics Illinois Institute of Technology

More information

Convexity of the Joint Numerical Range

Convexity 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 information

Research Article A Note on Kantorovich Inequality for Hermite Matrices

Research Article A Note on Kantorovich Inequality for Hermite Matrices Hindawi Publishing Corporation Journal of Inequalities and Applications Volume 0, Article ID 5767, 6 pages doi:0.55/0/5767 Research Article A Note on Kantorovich Inequality for Hermite Matrices Zhibing

More information

The Spectral Norms of Geometric Circulant Matrices with Generalized Tribonacci Sequence

The Spectral Norms of Geometric Circulant Matrices with Generalized Tribonacci Sequence International Journal of Scientific and Innovative Mathematical Research (IJSIMR) Volume 6, Issue 6, 2018, PP 34-41 ISSN No. (Print) 2347-307X & ISSN No. (Online) 2347-3142 DOI: http://dx.doi.org/10.20431/2347-3142.0606005

More information

Linear Algebra: Characteristic Value Problem

Linear 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 information

C O M P L E X FACTORIZATIONS O F T H E F I B O N A C C I AND LUCAS NUMBERS

C O M P L E X FACTORIZATIONS O F T H E F I B O N A C C I AND LUCAS NUMBERS C O M P L E X FACTORIZATIONS O F T H E F I B O N A C C I AND LUCAS NUMBERS Nathan D. Cahill, John R. D'Errico, and John P* Spence Eastman Kodak Company, 343 State Street, Rochester, NY 4650 {natfaan. cahill,

More information

6.4 Krylov Subspaces and Conjugate Gradients

6.4 Krylov Subspaces and Conjugate Gradients 6.4 Krylov Subspaces and Conjugate Gradients Our original equation is Ax = b. The preconditioned equation is P Ax = P b. When we write P, we never intend that an inverse will be explicitly computed. P

More information

New duality operator for complex circulant matrices and a conjecture of Ryser

New duality operator for complex circulant matrices and a conjecture of Ryser New duality operator for complex circulant matrices and a conjecture of Ryser Luis H. Gallardo Mathematics University of Brest Brest, France Luis.Gallardo@univ-brest.fr Submitted: May 6, 2015; Accepted:

More information

Quantum Entanglement and the Bell Matrix

Quantum Entanglement and the Bell Matrix Quantum Entanglement and the Bell Matrix Marco Pedicini (Roma Tre University) in collaboration with Anna Chiara Lai and Silvia Rognone (La Sapienza University of Rome) SIMAI2018 - MS27: Discrete Mathematics,

More information

3 (Maths) Linear Algebra

3 (Maths) Linear Algebra 3 (Maths) Linear Algebra References: Simon and Blume, chapters 6 to 11, 16 and 23; Pemberton and Rau, chapters 11 to 13 and 25; Sundaram, sections 1.3 and 1.5. The methods and concepts of linear algebra

More information

Image Registration Lecture 2: Vectors and Matrices

Image Registration Lecture 2: Vectors and Matrices Image Registration Lecture 2: Vectors and Matrices Prof. Charlene Tsai Lecture Overview Vectors Matrices Basics Orthogonal matrices Singular Value Decomposition (SVD) 2 1 Preliminary Comments Some of this

More information

12.4 The Diagonalization Process

12.4 The Diagonalization Process Chapter - More Matrix Algebra.4 The Diagonalization Process We now have the background to understand the main ideas behind the diagonalization process. Definition: Eigenvalue, Eigenvector. Let A be an

More information

Duke 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 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 information

Quadrature formulas for the Laplace and Mellin transforms

Quadrature formulas for the Laplace and Mellin transforms arxiv:74.84v1 [math.na] 1 Apr 7 Quadrature formulas for the Laplace and Mellin transforms Rafael G. Campos and Francisco Mejía Facultad de Ciencias Físico-Matemáticas, Universidad Michoacana, 586, Morelia,

More information

Linear Algebra 2 Spectral Notes

Linear Algebra 2 Spectral Notes Linear Algebra 2 Spectral Notes In what follows, V is an inner product vector space over F, where F = R or C. We will use results seen so far; in particular that every linear operator T L(V ) has a complex

More information

Algebra C Numerical Linear Algebra Sample Exam Problems

Algebra C Numerical Linear Algebra Sample Exam Problems Algebra C Numerical Linear Algebra Sample Exam Problems Notation. Denote by V a finite-dimensional Hilbert space with inner product (, ) and corresponding norm. The abbreviation SPD is used for symmetric

More information

Eigenvalues and Eigenvectors

Eigenvalues and Eigenvectors Chapter 1 Eigenvalues and Eigenvectors Among problems in numerical linear algebra, the determination of the eigenvalues and eigenvectors of matrices is second in importance only to the solution of linear

More information

The Reconstruction of An Hermitian Toeplitz Matrices with Prescribed Eigenpairs

The Reconstruction of An Hermitian Toeplitz Matrices with Prescribed Eigenpairs The Reconstruction of An Hermitian Toeplitz Matrices with Prescribed Eigenpairs Zhongyun LIU Lu CHEN YuLin ZHANG Received: c 2009 Springer Science + Business Media, LLC Abstract Toeplitz matrices have

More information

Lecture 8 Nature of ensemble: Role of symmetry, interactions and other system conditions: Part II

Lecture 8 Nature of ensemble: Role of symmetry, interactions and other system conditions: Part II Lecture 8 Nature of ensemble: Role of symmetry, interactions and other system conditions: Part II We continue our discussion of symmetries and their role in matrix representation in this lecture. An example

More information

Constrained controllability of semilinear systems with delayed controls

Constrained controllability of semilinear systems with delayed controls BULLETIN OF THE POLISH ACADEMY OF SCIENCES TECHNICAL SCIENCES Vol. 56, No. 4, 28 Constrained controllability of semilinear systems with delayed controls J. KLAMKA Institute of Control Engineering, Silesian

More information

AMS526: Numerical Analysis I (Numerical Linear Algebra)

AMS526: Numerical Analysis I (Numerical Linear Algebra) AMS526: Numerical Analysis I (Numerical Linear Algebra) Lecture 2: Orthogonal Vectors and Matrices; Vector Norms Xiangmin Jiao SUNY Stony Brook Xiangmin Jiao Numerical Analysis I 1 / 11 Outline 1 Orthogonal

More information

An Even Order Symmetric B Tensor is Positive Definite

An Even Order Symmetric B Tensor is Positive Definite An Even Order Symmetric B Tensor is Positive Definite Liqun Qi, Yisheng Song arxiv:1404.0452v4 [math.sp] 14 May 2014 October 17, 2018 Abstract It is easily checkable if a given tensor is a B tensor, or

More information

5 Linear Algebra and Inverse Problem

5 Linear Algebra and Inverse Problem 5 Linear Algebra and Inverse Problem 5.1 Introduction Direct problem ( Forward problem) is to find field quantities satisfying Governing equations, Boundary conditions, Initial conditions. The direct problem

More information

Lecture 7. Econ August 18

Lecture 7. Econ August 18 Lecture 7 Econ 2001 2015 August 18 Lecture 7 Outline First, the theorem of the maximum, an amazing result about continuity in optimization problems. Then, we start linear algebra, mostly looking at familiar

More information

DEN: Linear algebra numerical view (GEM: Gauss elimination method for reducing a full rank matrix to upper-triangular

DEN: Linear algebra numerical view (GEM: Gauss elimination method for reducing a full rank matrix to upper-triangular form) Given: matrix C = (c i,j ) n,m i,j=1 ODE and num math: Linear algebra (N) [lectures] c phabala 2016 DEN: Linear algebra numerical view (GEM: Gauss elimination method for reducing a full rank matrix

More information

On the Complexity of the Dual Bases of the Gaussian Normal Bases

On the Complexity of the Dual Bases of the Gaussian Normal Bases Algebra Colloquium 22 (Spec ) (205) 909 922 DOI: 0.42/S00538675000760 Algebra Colloquium c 205 AMSS CAS & SUZHOU UNIV On the Complexity of the Dual Bases of the Gaussian Normal Bases Algebra Colloq. 205.22:909-922.

More information

EQUIVALENCE OF STURM-LIOUVILLE PROBLEM WITH FINITELY MANY ABDULLAH KABLAN, MEHMET AKİF ÇETİN

EQUIVALENCE 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 information

On Expected Gaussian Random Determinants

On Expected Gaussian Random Determinants On Expected Gaussian Random Determinants Moo K. Chung 1 Department of Statistics University of Wisconsin-Madison 1210 West Dayton St. Madison, WI 53706 Abstract The expectation of random determinants whose

More information

Preliminary/Qualifying Exam in Numerical Analysis (Math 502a) Spring 2012

Preliminary/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 information

Chapter 1. Matrix Algebra

Chapter 1. Matrix Algebra ST4233, Linear Models, Semester 1 2008-2009 Chapter 1. Matrix Algebra 1 Matrix and vector notation Definition 1.1 A matrix is a rectangular or square array of numbers of variables. We use uppercase boldface

More information

Linear Algebra Review. Vectors

Linear Algebra Review. Vectors Linear Algebra Review 9/4/7 Linear Algebra Review By Tim K. Marks UCSD Borrows heavily from: Jana Kosecka http://cs.gmu.edu/~kosecka/cs682.html Virginia de Sa (UCSD) Cogsci 8F Linear Algebra review Vectors

More information

Discrete Simulation of Power Law Noise

Discrete Simulation of Power Law Noise Discrete Simulation of Power Law Noise Neil Ashby 1,2 1 University of Colorado, Boulder, CO 80309-0390 USA 2 National Institute of Standards and Technology, Boulder, CO 80305 USA ashby@boulder.nist.gov

More information

Inverse Eigenvalue Problems and Their Associated Approximation Problems for Matrices with J-(Skew) Centrosymmetry

Inverse Eigenvalue Problems and Their Associated Approximation Problems for Matrices with J-(Skew) Centrosymmetry Inverse Eigenvalue Problems and Their Associated Approximation Problems for Matrices with -(Skew) Centrosymmetry Zhong-Yun Liu 1 You-Cai Duan 1 Yun-Feng Lai 1 Yu-Lin Zhang 1 School of Math., Changsha University

More information

Throughout these notes we assume V, W are finite dimensional inner product spaces over C.

Throughout these notes we assume V, W are finite dimensional inner product spaces over C. Math 342 - Linear Algebra II Notes Throughout these notes we assume V, W are finite dimensional inner product spaces over C 1 Upper Triangular Representation Proposition: Let T L(V ) There exists an orthonormal

More information

1 Linear Algebra Problems

1 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 information

On the Inverting of a General Heptadiagonal Matrix

On 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 information

EE/ACM Applications of Convex Optimization in Signal Processing and Communications Lecture 2

EE/ACM Applications of Convex Optimization in Signal Processing and Communications Lecture 2 EE/ACM 150 - Applications of Convex Optimization in Signal Processing and Communications Lecture 2 Andre Tkacenko Signal Processing Research Group Jet Propulsion Laboratory April 5, 2012 Andre Tkacenko

More information

Linear Algebra, part 2 Eigenvalues, eigenvectors and least squares solutions

Linear Algebra, part 2 Eigenvalues, eigenvectors and least squares solutions Linear Algebra, part 2 Eigenvalues, eigenvectors and least squares solutions Anna-Karin Tornberg Mathematical Models, Analysis and Simulation Fall semester, 2013 Main problem of linear algebra 2: Given

More information

e jk :=< e k, e j >, e[t ] e = E 1 ( e [T ] e ) h E.

e jk :=< e k, e j >, e[t ] e = E 1 ( e [T ] e ) h E. onjb.tex 14.02.23 Orthonormal Jordan bases in finite dimensional Hilbert spaces 1. Introduction and terminology The aim of this paper is twofold: first, we give a necessary and sufficient condition for

More information

Tutorial 5 Clifford Algebra and so(n)

Tutorial 5 Clifford Algebra and so(n) Tutorial 5 Clifford Algebra and so(n) 1 Definition of Clifford Algebra A set of N Hermitian matrices γ 1, γ,..., γ N obeying the anti-commutator γ i, γ j } = δ ij I (1) is the basis for an algebra called

More information

A matrix over a field F is a rectangular array of elements from F. The symbol

A matrix over a field F is a rectangular array of elements from F. The symbol Chapter MATRICES Matrix arithmetic A matrix over a field F is a rectangular array of elements from F The symbol M m n (F ) denotes the collection of all m n matrices over F Matrices will usually be denoted

More information

Markov Chains, Stochastic Processes, and Matrix Decompositions

Markov 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 information

This appendix provides a very basic introduction to linear algebra concepts.

This appendix provides a very basic introduction to linear algebra concepts. APPENDIX Basic Linear Algebra Concepts This appendix provides a very basic introduction to linear algebra concepts. Some of these concepts are intentionally presented here in a somewhat simplified (not

More information

The inverse of a tridiagonal matrix

The 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 information

AMS526: Numerical Analysis I (Numerical Linear Algebra)

AMS526: Numerical Analysis I (Numerical Linear Algebra) AMS526: Numerical Analysis I (Numerical Linear Algebra) Lecture 3: Positive-Definite Systems; Cholesky Factorization Xiangmin Jiao Stony Brook University Xiangmin Jiao Numerical Analysis I 1 / 11 Symmetric

More information

Banded symmetric Toeplitz matrices: where linear algebra borrows from difference equations. William F. Trench Professor Emeritus Trinity University

Banded symmetric Toeplitz matrices: where linear algebra borrows from difference equations. William F. Trench Professor Emeritus Trinity University Banded symmetric Toeplitz matrices: where linear algebra borrows from difference equations William F. Trench Professor Emeritus Trinity University This is a lecture presented the the Trinity University

More information

We denote the derivative at x by DF (x) = L. With respect to the standard bases of R n and R m, DF (x) is simply the matrix of partial derivatives,

We denote the derivative at x by DF (x) = L. With respect to the standard bases of R n and R m, DF (x) is simply the matrix of partial derivatives, The derivative Let O be an open subset of R n, and F : O R m a continuous function We say F is differentiable at a point x O, with derivative L, if L : R n R m is a linear transformation such that, for

More information

Linear Algebra 1. M.T.Nair Department of Mathematics, IIT Madras. and in that case x is called an eigenvector of T corresponding to the eigenvalue λ.

Linear Algebra 1. M.T.Nair Department of Mathematics, IIT Madras. and in that case x is called an eigenvector of T corresponding to the eigenvalue λ. Linear Algebra 1 M.T.Nair Department of Mathematics, IIT Madras 1 Eigenvalues and Eigenvectors 1.1 Definition and Examples Definition 1.1. Let V be a vector space (over a field F) and T : V V be a linear

More information

Def. The euclidian distance between two points x = (x 1,...,x p ) t and y = (y 1,...,y p ) t in the p-dimensional space R p is defined as

Def. The euclidian distance between two points x = (x 1,...,x p ) t and y = (y 1,...,y p ) t in the p-dimensional space R p is defined as MAHALANOBIS DISTANCE Def. The euclidian distance between two points x = (x 1,...,x p ) t and y = (y 1,...,y p ) t in the p-dimensional space R p is defined as d E (x, y) = (x 1 y 1 ) 2 + +(x p y p ) 2

More information

The skew-symmetric orthogonal solutions of the matrix equation AX = B

The skew-symmetric orthogonal solutions of the matrix equation AX = B Linear Algebra and its Applications 402 (2005) 303 318 www.elsevier.com/locate/laa The skew-symmetric orthogonal solutions of the matrix equation AX = B Chunjun Meng, Xiyan Hu, Lei Zhang College of Mathematics

More information

AN 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 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 information

Absolute value equations

Absolute value equations Linear Algebra and its Applications 419 (2006) 359 367 www.elsevier.com/locate/laa Absolute value equations O.L. Mangasarian, R.R. Meyer Computer Sciences Department, University of Wisconsin, 1210 West

More information

Multivariate Statistical Analysis

Multivariate Statistical Analysis Multivariate Statistical Analysis Fall 2011 C. L. Williams, Ph.D. Lecture 4 for Applied Multivariate Analysis Outline 1 Eigen values and eigen vectors Characteristic equation Some properties of eigendecompositions

More information

Lecture 1 INF-MAT3350/ : Some Tridiagonal Matrix Problems

Lecture 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 information