Inverse Eigenvalue Problem with Non-simple Eigenvalues for Damped Vibration Systems
|
|
- Scott Newton
- 5 years ago
- Views:
Transcription
1 Journal of Informatics Mathematical Sciences Volume 1 (2009), Numbers 2 & 3, pp RGN Publications (Invited paper) Inverse Eigenvalue Problem with Non-simple Eigenvalues for Damped Vibration Systems M. Mohseni Moghadam A. Tajaddini Abstract. In this paper, we will present a general form of real symmetric n n matrices M, C K for a quadratic inverse eigenvalue problem QIEP: Q(λ) (λ 2 M + λc + K)x 0, so that Q(λ) has a prescribed set of k eigenvalues with algebraic multiplicity n i, i 1,, k (which 2n 1 + 2n n l + n l n k 2n). This paper generalizes the method of inverse problem for selfadjoint linear pencils, to self-adjoint quadratic pencils Q(λ). It is shown that this inverse problem involves certain free parameters. Via appropriate choice of free variables in the general form of QIEP, we solve a QIEP. 1. Introduction The problem of finding scalars λ nontrivial vector x n such that Q(λ)x (λ 2 M + λc + K)x 0, (1.1) where M, C K are given n n real matrices, is known as the quadratic eigenvalue problem QEP. The nonzero vectors x the corresponding scalars λ are called eigenvectors eigenvalues of the QEP, respectively. It is known that if the leading coefficient matrix M is nonsingular, then the quadratic pencil will have 2n eigenvalues over. A theoretical analysis of QEPs can be found in the book by written Gohberg, Lancaster Rodman [5]. Many applications, mathematical properties a variety of numerical techniques for the QEP are surveyed in the treatise by Tisseur Meerbergen [4]. Generally, in many mathematical modeling, there is a correspondence between the internal parameters the external behavior of a system from a priori known physical parameters such as mass, length, elasticity, inductance, capacitance, 2000 Mathematics Subject Classification.15-; 15-02; 15A29. Key words phrases.inverse problem; Quadratic form; Non-simple eigenvalues. This work has been partially supported by the Center of Excellence of Linear Algebra Optimization, Shahid Bahonar University of Kerman.
2 92 M. Mohseni Moghadam A. Tajaddini so on, is referred to a direct problem. In contrast, the inverse problem is to determine or estimate the parameters of the system according to its measured or expected behavior. The concern in the direct problem is to express the behavior in term of parameters whereas in the inverse problem concern is to express the parameters in terms of behavior. The inverse problem is as important as the direct problem in applications. The purpose of this paper is to make use of a parametrization method of inverse eigenvalue problems for self-adjoint linear pencils, that Chu, Datta, Lin u developed earlier [1], to self-adjoint quadratic pencils Q(λ). Recently, Kuo, Lin u [2], Chu u [3] proposed to parametrize a self-adjoint inverse eigenvalue problem. We shall limit a quadratic inverse eigenvalue problem QIEP to the following realm. Determine a general solution of real symmetric coefficients matrices M, C K so that the resulting QEP has a prescribed set of an eigenpair.more precisely, by a QIEP we refer to the following inverse problem: QIEP: Let (Λ, ) R 2n 2n R n 2n be a given pair of matrices, where Λ diag{λ [2] 1,..., λ[2], λ l l+1 I nl+1,..., λ k I nk }, (1.2) λ [2] αi I i ni β i I ni, i 1,..., l, (1.3) β i I ni α i I ni [ 1R, 1I,..., lr, li, l+1,..., k ], (1.4) where n i, i 1,, k are algebraic multiplicity corresponding to λ i ir, ii R n n i, i 1,..., l, i R n n i, i l+1,..., k, so is nonsingular. The true eigenvalues eigenvectors are readily identifiable by the transformation 1 In1 I R : diag 2 n1 1 Inl I,, nl, I ii n1 ii n1 2 ii nl ii nl+1,, I nk, (1.5) nl with i 1. That is, by defining Λ R H ΛR diag{λ 1 I n1, λ 2 I n1,, λ 2l 1 I nl, λ 2l I nl, λ 2l+1 I nl+1,, λ k I nk } 2n 2n, (1.6) R [ 1, 2,, 2l 1, 2l, 2l+1,, k ] n 2n. (1.7) The true (complex-valued) eigenvalues eigenvectors of the desired quadratic pencil Q(λ) can be induced from the pair (Λ, ) of real matrices. In this case, note that 2 j 1 jr + i ji, 2j jr i ji, λ 2j 1 α j + iβ j, λ 2 j α j iβ j, for j 1,, l, where as j λ j are all real-valued for j 2l + 1,, k. Find a general form for symmetric matrices M,C K which satisfy in the following eqnarray M 2 + C + K 0. (1.8)
3 Inverse Eigenvalue Problem with Non-simple Eigenvalues for Damped Vibration Systems 93 Now, we define a stard eigenpair for the quadratic pencil that introduced in [5]. Definition 1.1. A pair of matrices (Λ, ) R 2n 2n R n 2n is called a stard eigenpair for the quadratic pencil Q(λ) if only if the matrix Y : (1.9) is nonsingular the eqnarray holds. M 2 + C + K 0 2. Solving IQEP In this section, we shall solve the IQEP for a given matrix pair (Λ, ) R 2n 2n R n 2n as in (1.2) (1.4) under assumption is nonsingular. It is easy to see that Q(λ)x 0 if only if x L(λ) 0, (2.1) λx where C M K 0 L(λ) : λ. (2.2) M 0 0 M We want to construct a general form for M, C K. We first tell the theorem that Chu, Datta, Lin u [1] prove for self-adjoint linear pencils. Theorem 2.1. A self-adjoint linear pencil can have arbitrary eigenstructure with distinct eigenvalues linearly independent eigenvectors. Indeed, given an eigenstructure (, Λ), the solutions (A, B) form a subspace of dimensionality n in the product space R n n R n n can be parametrized by the diagonal matrix Γ via the following relationships A T Γ 1, B T ΓΛ 1. We consider the problem quadratic that its eigenvalues are non-simple so Y is nonsingular. In order to, we construct a general form for matrices M, C K, we make use of Lancaster linearization Chu, Datta, Lin u s proof idea. We know that Λ, Y is an eigenpair for linear pencil L(λ). Let us consider the linear pencil λa B where C M A (2.3) M 0
4 94 M. Mohseni Moghadam A. Tajaddini B K 0. (2.4) 0 M For the linear pencil λa B to have eigenstructure (Λ, Y ), it is necessary that I2n Λ2n T Y T B T Y T A T 0. (2.5) On the other h, it is trivial that I2n Λ2n T Λ T S 0, (2.6) S for any S R 2n 2n. Thus we obtain a parametric representation A S T Y 1, (2.7) B S T ΛY 1. (2.8) We are interested in selecting S so as to construct self-adjoint pencils. For matrix A to be symmetric, the matrix S must be such that S T Y 1 Y T S implying that the matrix Γ defined by Γ : Y T S T SY, (2.9) its inverse are symmetric. For matrix B to be symmetric, the matrix S must also be such that implying that S T ΛY 1 Y T Λ T S, Γ 1 Λ T ΛΓ 1. (2.10) Partition Γ 1 according to the sizes of sub-matrices in Λ, we will have: Γ 11 Γ 12 Γ 1l Γ 1k Γ 21 Γ 22 Γ 2l Γ 2k Γ 1, (2.11) Γ k 11 Γ k 12 Γ k 1l Γ k 1k Γ k1 Γ k2 Γ kl Γ kk where Γ ii is 2n i 2n i matrix, i 1, 2,..., l, Γ ii is n i n i matrix, i l+1,..., k. Substituting (2.11), (1.2) into (2.10), we obtain Γ i j (λ [2] j ) T λ [2] i Γ i j if 1 i, j l, Γ i j λ j λ [2] i Γ i j if 1 i l, l + 1 j k, (2.12) Γ i j λ j λ i Γ i j if l + 1 i, j k. First let us consider the case 1 i, j l. Without loss of generality, if we write U W Γ i j W V then (αi α j )U + (β i β j )W β i U + (α i α j )W β j V 0 0. β j U + (α i α j )W + β i V (β i β j )W (α i α j )V 0 0
5 Inverse Eigenvalue Problem with Non-simple Eigenvalues for Damped Vibration Systems 95 It is clear that if i j then Ui W i Γ ii, W i U i where U i W i are symmetric, give rise n i (n i + 1) degree of freedom.if i j, Γ i j 0. If 1 i l, l + 1 j k, then Γ i j is a 2 1 block matrix is equal to zero. Finally for l + 1 i, j k, if i j, then Γ i j 0, otherwise, Γ ii U i is arbitrary. Thus, we conclude that the symmetric matrix Γ 1 is equal to the following block-diagonal Γ 1 U1 W diag 1 Ul W,, l, U W 1 U 1 W l U l+1,, U k, (2.13) l where U i, i 1,, k, W i, i 1,, l are symmetric. Upon choosing an arbitrary Γ, a substitution by S T Y T Γ implies that the pencil λa B with A Y T ΓY 1, (2.14) B Y T ΓΛY 1 (2.15) is self-adjoint has eigenstructure (Λ, Y ). Moreover matrix A is invertible, its inverse matrix is 0 M A 1 1 M 1 M 1 C M 1. (2.16) We set A 1 Y Γ 1 Y T. (2.17) Substituting (2.16), (1.9) into (2.17), we have M ( Γ 1 Λ T T ) 1, (2.18) C M Γ 1 Λ T T M, (2.19) Γ 1 T 0. (2.20) Post-multiplying (1.8) by Γ 1 Λ T T applying (2.18) (2.19), we obtain K M 3 Γ 1 T M + C M 1 C. (2.21) We thus declare the following theorem. Theorem 2.2. Let a stard eigenpair (Λ, ) R 2n 2n R n 2n as (1.2), (1.4), be given then the general solution of QIEP forms are as: M ( Γ 1 Λ T T ) 1, C M Γ 1 Λ T T M, K M 3 Γ 1 T M + C M 1 C, where Γ 1 is given by (2.13), Γ 1 T 0. The following result can be regarded as the converse of Theorem 2.2.
6 96 M. Mohseni Moghadam A. Tajaddini Theorem 2.3. Let (Λ, ) R 2n 2n R n 2n be given matrices as in (1.2), (1.4). suppose there exists a symmetric nonsingular matrix Γ 1 R 2n 2n such that Γ 1 Λ T T is nonsingular, (2.20) (2.10) hold, then is nonsingular the eqnarray (1.8) holds for the self-adjoint quadratic pencil Q(λ) whose matrix coefficients M, C, K are defined according to (2.18), (2.19), (2.21), respectively. That is, (Λ, ) is a stard eigenpair for Q(λ). Proof. Since Γ 1 Λ T T is nonsingular, M can be defined. We want to show that in invertible. By substitution (2.16), (2.2) into (2.17), we have Γ 1 T Γ 1 T 0 M 1, (2.22) Γ 1 Λ T T M 1 Γ 1 Λ T T M 1 C M 1. (2.23) Hence (2.22) implies Γ 1 T M Also (2.23) implies 0. (2.24) I n Γ 1 Λ T T In M 1 M 1. (2.25) C post-multiplying (2.25) by M applying (2.24), we obtain (Γ 1 Λ T T M + Γ 1 T C) By (2.24), (2.26), we observe that Γ 1 Λ T T M + Γ 1 T C Γ 1 T M implies that the matrix is nonsingular. It follows that In. (2.26) 0 In 0, 0 I n 1 M 2 M 2 Γ 1 Λ T T M + Γ 1 T M Γ 1 T M K C, which is equivalent to M 2 + C + K 0.
7 Inverse Eigenvalue Problem with Non-simple Eigenvalues for Damped Vibration Systems Conclusion In this paper, we mainly present a general solution of an QIEP with a prescribed stard eigenpair (Λ, ) R 2n 2n R n 2n. Via appropriate choice of free variables in the general solution we can solve a quadratic pencil Q(λ) λ 2 M + λc + K with M, C K being symmetric.how to choice the total degree of freedoms in the general form of QIEP to obtain more exact quadratic pencil Q(λ). References [1] M.T. Chu, B.N. Datta, W.-W. Lin S.-F. u, The spill-over phenomenon in quadratic model updating, AIAA Journal 46 (2008), [2] Y.-C. Kuo, W.-W. Lin S.-F. u, On a general solution of partially described inverse quadratic eigenvalue problems its applications, NCTS Technical Report , National Tsing-Hua Univ., Taiwan. Mathematics/preprints/preprints/prep [3] M.T. Chu S-F. u, Spectral decomposition of self-adjoint quadratic pencils its applications, Math. Comput. 78 (2009), [4] T. Francoise M. Karl, The quadratic eigenvalue problem, SIAM Review 43 (2) (2001), [5] I. Gohberge, P. Lancaster L. Rodman, Matrix Polynomials, Academic Press, Inc., New York London, [6] D.J. Inman A.N. Andry, Jr., Some results on the nature of eigenvalues of discrete damped linear systems, Journal of Applied Mechanics 47(1980), [7] P. Lancaster, Inverse spectral problems for semi-simple problems damped vibrating systems, SIAM J. Matrix Anal. Appl. 29(2007), M. Mohseni Moghadam, Mahani Mathematical Research Center, Kerman , Iran. Mohseni@mail.uk.ac.ir A. Tajaddini, Department of Mathematics, Shahid Bahonar university of Kerman, Kerman , Iran. Azita_Tajaddinii@yahoo.com Received May 18, 2009 Accepted July 1, 2009
Updating quadratic models with no spillover effect on unmeasured spectral data
INSTITUTE OF PHYSICS PUBLISHING Inverse Problems 3 (007) 43 56 INVERSE PROBLEMS doi:0.088/066-56/3//03 Updating quadratic models with no spillover effect on unmeasured spectral data Moody T Chu,4, Wen-Wei
More informationON INVERSE QUADRATIC EIGENVALUE PROBLEMS WITH PARTIALLY PRESCRIBED EIGENSTRUCTURE
ON INVERSE QUADRATIC EIGENVALUE PROBLEMS WITH PARTIALLY PRESCRIBED EIGENSTRUCTURE MOODY T. CHU, YUEN-CHENG KUO, AND WEN-WEI LIN Abstract. The inverse eigenvalue problem of constructing real and symmetric
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 informationA Multi-Step Hybrid Method for Multi-Input Partial Quadratic Eigenvalue Assignment with Time Delay
A Multi-Step Hybrid Method for Multi-Input Partial Quadratic Eigenvalue Assignment with Time Delay Zheng-Jian Bai Mei-Xiang Chen Jin-Ku Yang April 14, 2012 Abstract A hybrid method was given by Ram, Mottershead,
More informationComputational Methods for Feedback Control in Damped Gyroscopic Second-order Systems 1
Computational Methods for Feedback Control in Damped Gyroscopic Second-order Systems 1 B. N. Datta, IEEE Fellow 2 D. R. Sarkissian 3 Abstract Two new computationally viable algorithms are proposed for
More informationDefinite versus Indefinite Linear Algebra. Christian Mehl Institut für Mathematik TU Berlin Germany. 10th SIAM Conference on Applied Linear Algebra
Definite versus Indefinite Linear Algebra Christian Mehl Institut für Mathematik TU Berlin Germany 10th SIAM Conference on Applied Linear Algebra Monterey Bay Seaside, October 26-29, 2009 Indefinite Linear
More informationQuadratic Matrix Polynomials
Research Triangularization Matters of Quadratic Matrix Polynomials February 25, 2009 Nick Françoise Higham Tisseur Director School of of Research Mathematics The University of Manchester School of Mathematics
More informationAlgorithms for Solving the Polynomial Eigenvalue Problem
Algorithms for Solving the Polynomial Eigenvalue Problem Nick Higham School of Mathematics The University of Manchester higham@ma.man.ac.uk http://www.ma.man.ac.uk/~higham/ Joint work with D. Steven Mackey
More informationRecent Advances in the Numerical Solution of Quadratic Eigenvalue Problems
Recent Advances in the Numerical Solution of Quadratic Eigenvalue Problems Françoise Tisseur School of Mathematics The University of Manchester ftisseur@ma.man.ac.uk http://www.ma.man.ac.uk/~ftisseur/
More informationABSTRACT QUADRATIC INVERSE EIGENVALUE PROBLEMS: THEORY, METHODS, AND APPLICATIONS
ABSTRACT QUADRATIC INVERSE EIGENVALUE PROBLEMS: THEORY, METHODS, AND APPLICATIONS Vadim Olegovich Sokolov, Ph.D. Department of Mathematical Sciences Northern Illinois University, 2008 Biswa Nath Datta,
More informationHigher rank numerical ranges of rectangular matrix polynomials
Journal of Linear and Topological Algebra Vol. 03, No. 03, 2014, 173-184 Higher rank numerical ranges of rectangular matrix polynomials Gh. Aghamollaei a, M. Zahraei b a Department of Mathematics, Shahid
More informationAn Algorithm for. Nick Higham. Françoise Tisseur. Director of Research School of Mathematics.
An Algorithm for the Research Complete Matters Solution of Quadratic February Eigenvalue 25, 2009 Problems Nick Higham Françoise Tisseur Director of Research School of Mathematics The School University
More informationFamily Feud Review. Linear Algebra. October 22, 2013
Review Linear Algebra October 22, 2013 Question 1 Let A and B be matrices. If AB is a 4 7 matrix, then determine the dimensions of A and B if A has 19 columns. Answer 1 Answer A is a 4 19 matrix, while
More informationSymmetric Tridiagonal Inverse Quadratic Eigenvalue Problems with Partial Eigendata
Symmetric Tridiagonal Inverse Quadratic Eigenvalue Problems with Partial Eigendata Zheng-Jian Bai Revised: October 18, 2007 Abstract In this paper we concern the inverse problem of constructing the n-by-n
More informationQuadratic Inverse Eigenvalue Problems, Active Vibration Control and Model Updating
Quadratic Inverse Eigenvalue Problems, Active Vibration Control and Model Updating Biswa N. Datta,1,2 Northern Illinois University, Mathematical Sciences, Watson Hall 320 DeKalb, IL 60115-2888, USA Vadim
More informationPOLYNOMIAL EQUATIONS OVER MATRICES. Robert Lee Wilson. Here are two well-known facts about polynomial equations over the complex numbers
POLYNOMIAL EQUATIONS OVER MATRICES Robert Lee Wilson Here are two well-known facts about polynomial equations over the complex numbers (C): (I) (Vieta Theorem) For any complex numbers x,..., x n (not necessarily
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 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 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 informationPartial Eigenvalue Assignment in Linear Systems: Existence, Uniqueness and Numerical Solution
Partial Eigenvalue Assignment in Linear Systems: Existence, Uniqueness and Numerical Solution Biswa N. Datta, IEEE Fellow Department of Mathematics Northern Illinois University DeKalb, IL, 60115 USA e-mail:
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 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 informationOff-diagonal perturbation, first-order approximation and quadratic residual bounds for matrix eigenvalue problems
Off-diagonal perturbation, first-order approximation and quadratic residual bounds for matrix eigenvalue problems Yuji Nakatsukasa Abstract When a symmetric block diagonal matrix [ A 1 A2 ] undergoes an
More informationThe quadratic eigenvalue problem (QEP) is to find scalars λ and nonzero vectors u satisfying
I.2 Quadratic Eigenvalue Problems 1 Introduction The quadratic eigenvalue problem QEP is to find scalars λ and nonzero vectors u satisfying where Qλx = 0, 1.1 Qλ = λ 2 M + λd + K, M, D and K are given
More informationImproved Newton s method with exact line searches to solve quadratic matrix equation
Journal of Computational and Applied Mathematics 222 (2008) 645 654 wwwelseviercom/locate/cam Improved Newton s method with exact line searches to solve quadratic matrix equation Jian-hui Long, Xi-yan
More information5 Compact linear operators
5 Compact linear operators One of the most important results of Linear Algebra is that for every selfadjoint linear map A on a finite-dimensional space, there exists a basis consisting of eigenvectors.
More informationPerturbation theory for eigenvalues of Hermitian pencils. Christian Mehl Institut für Mathematik TU Berlin, Germany. 9th Elgersburg Workshop
Perturbation theory for eigenvalues of Hermitian pencils Christian Mehl Institut für Mathematik TU Berlin, Germany 9th Elgersburg Workshop Elgersburg, March 3, 2014 joint work with Shreemayee Bora, Michael
More informationLec 2: Mathematical Economics
Lec 2: Mathematical Economics to Spectral Theory Sugata Bag Delhi School of Economics 24th August 2012 [SB] (Delhi School of Economics) Introductory Math Econ 24th August 2012 1 / 17 Definition: Eigen
More informationSemi-definite Programming Techniques for Quadratic Inverse Eigenvalue Problem
Semi-definite Programming Techniques for Quadratic Inverse Eigenvalue Problem Moody T. Chu North Carolina State University March 31, 2010 @ National Chiao Tung University Outline Basic Ideas General Quadratic
More informationA numerical method for polynomial eigenvalue problems using contour integral
A numerical method for polynomial eigenvalue problems using contour integral Junko Asakura a Tetsuya Sakurai b Hiroto Tadano b Tsutomu Ikegami c Kinji Kimura d a Graduate School of Systems and Information
More information( 9x + 3y. y 3y = (λ 9)x 3x + y = λy 9x + 3y = 3λy 9x + (λ 9)x = λ(λ 9)x. (λ 2 10λ)x = 0
Math 46 (Lesieutre Practice final ( minutes December 9, 8 Problem Consider the matrix M ( 9 a Prove that there is a basis for R consisting of orthonormal eigenvectors for M This is just the spectral theorem:
More informationTriangularizing matrix polynomials. Taslaman, Leo and Tisseur, Francoise and Zaballa, Ion. MIMS EPrint:
Triangularizing matrix polynomials Taslaman, Leo and Tisseur, Francoise and Zaballa, Ion 2012 MIMS EPrint: 2012.77 Manchester Institute for Mathematical Sciences School of Mathematics The University of
More informationScaling, Sensitivity and Stability in Numerical Solution of the Quadratic Eigenvalue Problem
Scaling, Sensitivity and Stability in Numerical Solution of the Quadratic Eigenvalue Problem Nick Higham School of Mathematics The University of Manchester higham@ma.man.ac.uk http://www.ma.man.ac.uk/~higham/
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 informationDefinition (T -invariant subspace) Example. Example
Eigenvalues, Eigenvectors, Similarity, and Diagonalization We now turn our attention to linear transformations of the form T : V V. To better understand the effect of T on the vector space V, we begin
More informationMathematical foundations - linear algebra
Mathematical foundations - linear algebra Andrea Passerini passerini@disi.unitn.it Machine Learning Vector space Definition (over reals) A set X is called a vector space over IR if addition and scalar
More informationMathematical foundations - linear algebra
Mathematical foundations - linear algebra Andrea Passerini passerini@disi.unitn.it Machine Learning Vector space Definition (over reals) A set X is called a vector space over IR if addition and scalar
More informationPolynomial Jacobi Davidson Method for Large/Sparse Eigenvalue Problems
Polynomial Jacobi Davidson Method for Large/Sparse Eigenvalue Problems Tsung-Ming Huang Department of Mathematics National Taiwan Normal University, Taiwan April 28, 2011 T.M. Huang (Taiwan Normal Univ.)
More informationRemark 1 By definition, an eigenvector must be a nonzero vector, but eigenvalue could be zero.
Sec 5 Eigenvectors and Eigenvalues In this chapter, vector means column vector 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
More informationNotes on Eigenvalues, Singular Values and QR
Notes on Eigenvalues, Singular Values and QR Michael Overton, Numerical Computing, Spring 2017 March 30, 2017 1 Eigenvalues Everyone who has studied linear algebra knows the definition: given a square
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 informationSolving the Polynomial Eigenvalue Problem by Linearization
Solving the Polynomial Eigenvalue Problem by Linearization Nick Higham School of Mathematics The University of Manchester higham@ma.man.ac.uk http://www.ma.man.ac.uk/~higham/ Joint work with Ren-Cang Li,
More informationIntroduction to Matrix Algebra
Introduction to Matrix Algebra August 18, 2010 1 Vectors 1.1 Notations A p-dimensional vector is p numbers put together. Written as x 1 x =. x p. When p = 1, this represents a point in the line. When p
More informationSOLVING RATIONAL EIGENVALUE PROBLEMS VIA LINEARIZATION
SOLVNG RATONAL EGENVALUE PROBLEMS VA LNEARZATON YANGFENG SU AND ZHAOJUN BA Abstract Rational eigenvalue problem is an emerging class of nonlinear eigenvalue problems arising from a variety of physical
More informationChapter 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 informationNonlinear eigenvalue problems - A Review
Nonlinear eigenvalue problems - A Review Namita Behera Department of Electrical Engineering Indian Institute of Technology Bombay Mumbai 8 th March, 2016 Outline 1 Nonlinear Eigenvalue Problems 2 Polynomial
More informationKU Leuven Department of Computer Science
Backward error of polynomial eigenvalue problems solved by linearization of Lagrange interpolants Piers W. Lawrence Robert M. Corless Report TW 655, September 214 KU Leuven Department of Computer Science
More informationLecture 10 - Eigenvalues problem
Lecture 10 - Eigenvalues problem Department of Computer Science University of Houston February 28, 2008 1 Lecture 10 - Eigenvalues problem Introduction Eigenvalue problems form an important class of problems
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 informationLecture 2 INF-MAT : , LU, symmetric LU, Positve (semi)definite, Cholesky, Semi-Cholesky
Lecture 2 INF-MAT 4350 2009: 7.1-7.6, LU, symmetric LU, Positve (semi)definite, Cholesky, Semi-Cholesky Tom Lyche and Michael Floater Centre of Mathematics for Applications, Department of Informatics,
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 informationELA
SHARP LOWER BOUNDS FOR THE DIMENSION OF LINEARIZATIONS OF MATRIX POLYNOMIALS FERNANDO DE TERÁN AND FROILÁN M. DOPICO Abstract. A standard way of dealing with matrixpolynomial eigenvalue problems is to
More informationthat determines x up to a complex scalar of modulus 1, in the real case ±1. Another condition to normalize x is by requesting that
Chapter 3 Newton methods 3. Linear and nonlinear eigenvalue problems When solving linear eigenvalue problems we want to find values λ C such that λi A is singular. Here A F n n is a given real or complex
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 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 informationA Structure-Preserving Doubling Algorithm for Quadratic Eigenvalue Problems Arising from Time-Delay Systems
A Structure-Preserving Doubling Algorithm for Quadratic Eigenvalue Problems Arising from Time-Delay Systems Tie-xiang Li Eric King-wah Chu Wen-Wei Lin Abstract We propose a structure-preserving doubling
More informationSolving Polynomial Eigenproblems by Linearization
Solving Polynomial Eigenproblems by Linearization Nick Higham School of Mathematics University of Manchester higham@ma.man.ac.uk http://www.ma.man.ac.uk/~higham/ Joint work with D. Steven Mackey and Françoise
More informationA q x k+q + A q 1 x k+q A 0 x k = 0 (1.1) where k = 0, 1, 2,..., N q, or equivalently. A(σ)x k = 0, k = 0, 1, 2,..., N q (1.
A SPECTRAL CHARACTERIZATION OF THE BEHAVIOR OF DISCRETE TIME AR-REPRESENTATIONS OVER A FINITE TIME INTERVAL E.N.Antoniou, A.I.G.Vardulakis, N.P.Karampetakis Aristotle University of Thessaloniki Faculty
More informationAN ELEMENTARY PROOF OF THE SPECTRAL RADIUS FORMULA FOR MATRICES
AN ELEMENTARY PROOF OF THE SPECTRAL RADIUS FORMULA FOR MATRICES JOEL A. TROPP Abstract. We present an elementary proof that the spectral radius of a matrix A may be obtained using the formula ρ(a) lim
More informationUniversity of Colorado Denver Department of Mathematical and Statistical Sciences Applied Linear Algebra Ph.D. Preliminary Exam June 8, 2012
University of Colorado Denver Department of Mathematical and Statistical Sciences Applied Linear Algebra Ph.D. Preliminary Exam June 8, 2012 Name: Exam Rules: This is a closed book exam. Once the exam
More informationarxiv: v2 [math.na] 27 Dec 2016
An algorithm for constructing Equiangular vectors Azim rivaz a,, Danial Sadeghi a a Department of Mathematics, Shahid Bahonar University of Kerman, Kerman 76169-14111, IRAN arxiv:1412.7552v2 [math.na]
More informationOn the Eigenstructure of Hermitian Toeplitz Matrices with Prescribed Eigenpairs
The Eighth International Symposium on Operations Research and Its Applications (ISORA 09) Zhangjiajie, China, September 20 22, 2009 Copyright 2009 ORSC & APORC, pp 298 305 On the Eigenstructure of Hermitian
More informationLinear 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 informationInverse 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 information1. In this problem, if the statement is always true, circle T; otherwise, circle F.
Math 1553, Extra Practice for Midterm 3 (sections 45-65) Solutions 1 In this problem, if the statement is always true, circle T; otherwise, circle F a) T F If A is a square matrix and the homogeneous equation
More informationCHAPTER 3. Matrix Eigenvalue Problems
A SERIES OF CLASS NOTES FOR 2005-2006 TO INTRODUCE LINEAR AND NONLINEAR PROBLEMS TO ENGINEERS, SCIENTISTS, AND APPLIED MATHEMATICIANS DE CLASS NOTES 3 A COLLECTION OF HANDOUTS ON SYSTEMS OF ORDINARY DIFFERENTIAL
More informationEigenvalues and Eigenvectors
Contents Eigenvalues and Eigenvectors. Basic Concepts. Applications of Eigenvalues and Eigenvectors 8.3 Repeated Eigenvalues and Symmetric Matrices 3.4 Numerical Determination of Eigenvalues and Eigenvectors
More informationPALINDROMIC LINEARIZATIONS OF A MATRIX POLYNOMIAL OF ODD DEGREE OBTAINED FROM FIEDLER PENCILS WITH REPETITION.
PALINDROMIC LINEARIZATIONS OF A MATRIX POLYNOMIAL OF ODD DEGREE OBTAINED FROM FIEDLER PENCILS WITH REPETITION. M.I. BUENO AND S. FURTADO Abstract. Many applications give rise to structured, in particular
More informationLecture Notes 6: Dynamic Equations Part C: Linear Difference Equation Systems
University of Warwick, EC9A0 Maths for Economists Peter J. Hammond 1 of 45 Lecture Notes 6: Dynamic Equations Part C: Linear Difference Equation Systems Peter J. Hammond latest revision 2017 September
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 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 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 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 informationWhat is A + B? What is A B? What is AB? What is BA? What is A 2? and B = QUESTION 2. What is the reduced row echelon matrix of A =
STUDENT S COMPANIONS IN BASIC MATH: THE ELEVENTH Matrix Reloaded by Block Buster Presumably you know the first part of matrix story, including its basic operations (addition and multiplication) and row
More informationA = 3 1. We conclude that the algebraic multiplicity of the eigenvalues are both one, that is,
65 Diagonalizable Matrices It is useful to introduce few more concepts, that are common in the literature Definition 65 The characteristic polynomial of an n n matrix A is the function p(λ) det(a λi) Example
More informationHomework sheet 4: EIGENVALUES AND EIGENVECTORS. DIAGONALIZATION (with solutions) Year ? Why or why not? 6 9
Bachelor in Statistics and Business Universidad Carlos III de Madrid Mathematical Methods II María Barbero Liñán Homework sheet 4: EIGENVALUES AND EIGENVECTORS DIAGONALIZATION (with solutions) Year - Is
More information(b) If a multiple of one row of A is added to another row to produce B then det(b) =det(a).
.(5pts) Let B = 5 5. Compute det(b). (a) (b) (c) 6 (d) (e) 6.(5pts) Determine which statement is not always true for n n matrices A and B. (a) If two rows of A are interchanged to produce B, then det(b)
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 informationChapter 5. Eigenvalues and Eigenvectors
Chapter 5 Eigenvalues and Eigenvectors Section 5. Eigenvectors and Eigenvalues Motivation: Difference equations A Biology Question How to predict a population of rabbits with given dynamics:. half of the
More informationTrimmed linearizations for structured matrix polynomials
Trimmed linearizations for structured matrix polynomials Ralph Byers Volker Mehrmann Hongguo Xu January 5 28 Dedicated to Richard S Varga on the occasion of his 8th birthday Abstract We discuss the eigenvalue
More informationPerturbation of Palindromic Eigenvalue Problems
Numerische Mathematik manuscript No. (will be inserted by the editor) Eric King-wah Chu Wen-Wei Lin Chern-Shuh Wang Perturbation of Palindromic Eigenvalue Problems Received: date / Revised version: date
More informationOn the computation of the Jordan canonical form of regular matrix polynomials
On the computation of the Jordan canonical form of regular matrix polynomials G Kalogeropoulos, P Psarrakos 2 and N Karcanias 3 Dedicated to Professor Peter Lancaster on the occasion of his 75th birthday
More informationChapter 3. Determinants and Eigenvalues
Chapter 3. Determinants and Eigenvalues 3.1. Determinants With each square matrix we can associate a real number called the determinant of the matrix. Determinants have important applications to the theory
More informationELE/MCE 503 Linear Algebra Facts Fall 2018
ELE/MCE 503 Linear Algebra Facts Fall 2018 Fact N.1 A set of vectors is linearly independent if and only if none of the vectors in the set can be written as a linear combination of the others. Fact N.2
More informationStudy Guide for Linear Algebra Exam 2
Study Guide for Linear Algebra Exam 2 Term Vector Space Definition A Vector Space is a nonempty set V of objects, on which are defined two operations, called addition and multiplication by scalars (real
More informationEigenvalues 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 informationResearch Matters. February 25, The Nonlinear Eigenvalue Problem. Nick Higham. Part III. Director of Research School of Mathematics
Research Matters February 25, 2009 The Nonlinear Eigenvalue Problem Nick Higham Part III Director of Research School of Mathematics Françoise Tisseur School of Mathematics The University of Manchester
More informationANSWERS. E k E 2 E 1 A = B
MATH 7- Final Exam Spring ANSWERS Essay Questions points Define an Elementary Matrix Display the fundamental matrix multiply equation which summarizes a sequence of swap, combination and multiply operations,
More informationw T 1 w T 2. w T n 0 if i j 1 if i = j
Lyapunov Operator Let A F n n be given, and define a linear operator L A : C n n C n n as L A (X) := A X + XA Suppose A is diagonalizable (what follows can be generalized even if this is not possible -
More informationc c c c c c c c c c a 3x3 matrix C= has a determinant determined by
Linear Algebra Determinants and Eigenvalues Introduction: Many important geometric and algebraic properties of square matrices are associated with a single real number revealed by what s known as the determinant.
More informationEigenvector error bound and perturbation for nonlinear eigenvalue problems
Eigenvector error bound and perturbation for nonlinear eigenvalue problems Yuji Nakatsukasa School of Mathematics University of Tokyo Joint work with Françoise Tisseur Workshop on Nonlinear Eigenvalue
More informationMath 2331 Linear Algebra
5. Eigenvectors & Eigenvalues Math 233 Linear Algebra 5. Eigenvectors & Eigenvalues Shang-Huan Chiu Department of Mathematics, University of Houston schiu@math.uh.edu math.uh.edu/ schiu/ Shang-Huan Chiu,
More informationAN ITERATION. In part as motivation, we consider an iteration method for solving a system of linear equations which has the form x Ax = b
AN ITERATION In part as motivation, we consider an iteration method for solving a system of linear equations which has the form x Ax = b In this, A is an n n matrix and b R n.systemsof this form arise
More informationEigenvalues and Eigenvectors
Eigenvalues and Eigenvectors Philippe B. Laval KSU Fall 2015 Philippe B. Laval (KSU) Eigenvalues and Eigenvectors Fall 2015 1 / 14 Introduction We define eigenvalues and eigenvectors. We discuss how to
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 informationStructured Krylov Subspace Methods for Eigenproblems with Spectral Symmetries
Structured Krylov Subspace Methods for Eigenproblems with Spectral Symmetries Fakultät für Mathematik TU Chemnitz, Germany Peter Benner benner@mathematik.tu-chemnitz.de joint work with Heike Faßbender
More information(VI.C) Rational Canonical Form
(VI.C) Rational Canonical Form Let s agree to call a transformation T : F n F n semisimple if there is a basis B = { v,..., v n } such that T v = λ v, T v 2 = λ 2 v 2,..., T v n = λ n for some scalars
More informationJordan Journal of Mathematics and Statistics (JJMS) 5(3), 2012, pp A NEW ITERATIVE METHOD FOR SOLVING LINEAR SYSTEMS OF EQUATIONS
Jordan Journal of Mathematics and Statistics JJMS) 53), 2012, pp.169-184 A NEW ITERATIVE METHOD FOR SOLVING LINEAR SYSTEMS OF EQUATIONS ADEL H. AL-RABTAH Abstract. The Jacobi and Gauss-Seidel iterative
More informationMATH 583A REVIEW SESSION #1
MATH 583A REVIEW SESSION #1 BOJAN DURICKOVIC 1. Vector Spaces Very quick review of the basic linear algebra concepts (see any linear algebra textbook): (finite dimensional) vector space (or linear space),
More informationYORK UNIVERSITY. Faculty of Science Department of Mathematics and Statistics MATH M Test #1. July 11, 2013 Solutions
YORK UNIVERSITY Faculty of Science Department of Mathematics and Statistics MATH 222 3. M Test # July, 23 Solutions. For each statement indicate whether it is always TRUE or sometimes FALSE. Note: For
More information