The Receptance Approach to Complex Operational Mode Normalization

Size: px
Start display at page:

Download "The Receptance Approach to Complex Operational Mode Normalization"

Transcription

1 he Receptance Approach to Complex Operational Mode Normalization Dionisio Bernal Northeastern University, Civil and Environmental Engineering Department, Center for Digital Signal Processing, Boston, MA 19. ABSRAC: Normalization of modes obtained from operational modal analysis has received significant attention since the seminal paper on the use of mass perturbations by Parloo et.al. (). he present paper extends a recently developed formulation known as the Receptance Based Normalization (RBN) scheme to the case of the complex modal model. 1. NRODUCON nput output maps in a modal model are described using eigenvalues, eigenvectors and modal constants. A common notation sets the modal constants to unity and the associated scaled eigenvectors are then said to be normalized. Normalized eigenvectors cannot be obtained from a single test when identification is carried out without deterministic information on the inputs but the information can be obtained by performing complementary tests where the structure is perturbed in a known fashion. ntroduction of the perturbation concept is credited to Parloo et. al.(a), who used estimates of eigenvalue derivatives to extract the information required. he approach in Parloo et al.(a) can run into difficulty when the eigenvalue vs perturbation magnitude is strongly nonlinear because the frequency shift required for accuracy may be too small, given the inherent variability of output-only identification. he obvious modification to deal with this issue is to formulate the problem in terms of total eigenvalue changes and several efforts in this direction have been carried out (Parloo et. al., b, Brinker and Andersen, 3, Bernal 4, 11). his paper extends the normalization scheme recently presented in Bernal (11) to the case where the normalization desired is on the complex modal model.. HE RECEPANCE APPROACH O EGENVECOR NORMALZAON.1 Derivation Let ΔM be the mass perturbation and λ and φ be the pole and arbitrarily scaled (complex) eigenvector in the mass perturbed condition for the th mode quantities without the supra-bar referring to the same quantity in the unperturbed condition. n the derivation that follows it is convenient to treat the eigenvectors as if they are available at all the coordinates, although it will be apparent at the end that only measured coordinates are needed. From the polynomial eigenvalue problem, focusing on the perturbed condition, one has ( ) M + ΔM λ + Cλ + K φ = (1)

2 OMAC'11 4 th nternational Operational Modal Analysis Conference from where it follows that 1 Mλ + Cλ + K ΔM λ φ = φ () nspection of Eq. shows that the inverted matrix is the Receptance of the original system evaluated at s =λ, therefore N φφρ ( l l l ) Δ λφ = φ l= 1 λ λl M (3) where ρ is the square of the constant that is needed to normalize the modes; defining ψ l =φl ρl (4) t follows that the transfer matrix is given by Gs () = N l l= 1 s l ψψ λ l (5) One gathers, therefore, that ψ is the normalized mode and ρ is the square of the normalization constant. For notational convenience we specify this constant as κ, namely κ l = ρl (6) Getting back to eq.3 one notes that with some simple rearranging it can be written as N ( ) l l M l l= 1 λl λ φ φ Δ φ λ ρ =φ (7) Eq.7 describes m equations in the N (squares) of the modal constants formulated using the th polynomial eigenvalue equation of the perturbed system. By combining the equations for each perturbed mode a linear system of the type Qρ = bis obtained. n practice there are only n identified modes so the summation upper limit in Eq.4 has to be taken as n and, after evaluating it at each of the identified modes, the coefficient matrix dimensions is (mxn)xn. Except for approximation resulting from modal truncation the RBN formulation is.. Obtaining the Coefficient Matrices he linear system of equations implicit in Eq.7 can be conveniently formulated as follows: let Φ be the set of identified modes in the original state, at whatever coordinates are measured, and Φ the set in the mass modified state (in both cases including the conugate pairs). he system of equations can be written as Q ρ = vec ( Φ ) (8)

3 3 where {. } ρ = ρ ρ ρ, and 1 n with Φχ1 Φχ Q = (9). Φχn 1 n diag a a a χ = (,,... ) and λ i = ( ) φi Δ φ λi λ a M (1) As can be seen from Eq.8, the constants ρ are coefficients in a proection of the perturbed modes on the basis of the original system. From this perspective one concludes that if the subspace of identified eigenvectors (over all coordinates) has the same span in the original and the perturbed conditions the RBN solution is, independently of truncation. 3. HE SENSVY APPROACH Since we shall use sensitivity to provide contrast for the RBN solution, we derive the formula for the scaling constant of the sensitivity scheme for the case of complex eigenvectors. aking the mass change as Δ M =βm 1, with β a scalar with units of mass and M 1 as a distribution, one has ( ) M +βm1 λ + Cλ+ K ψ= (11) Differentiating Eq.11 with respect to β, pre-multiplying by ψ and evaluating the result at β= one gets, after some simple algebra ( λφ Mφ + φ Cφ) λ + φ M φλ = (1) 1 aking the eigenvector to be the one for which ρ = 1and, using the fact for ρ= 1 one has Balmes(1997) gives λψmψ +ψc ψ = 1 (13) λ+ψ M ψλ = (14) 1 and it follows, adding the subscript for specificity, that ρ = φ λ M1 φ λ On the premise that only two tests are available the derivative of the eigenvalue has to be estimated with the forward difference and one has (15) λ λ ρ φδ φλ M (16)

4 4 OMAC'11 4 th nternational Operational Modal Analysis Conference 4. NUMERCAL EXAMNAONS his section presents numerical results illustrating the performance of RBN as well as some observations relative to the sensitivity solution. he structure is a 16-DOF chain system with a mass distribution [1 1.. etc] and a uniform stiffness equal to 5, in some consistent set of units. he mass change consists of three equal masses located at coordinates {4 8 and 13}, with the magnitude varied to achieve different eigenvalue shifts. Sensors are placed at coordinates {4,8,13 and 16}. he damping matrix is defined by prescribing % modal damping and adding externally grounded dashpots at DOF #1 and # with constants that increase the diagonal entries at these two DOF by a factor of 1. able#1 lists the weighted modal collinearity index (mpcw) for the first 8 modal pairs Pappa et. al.(1993), as well as the poles, the magnitude of the poles, and the damping ratios, defined in standard fashion as the real component of the pole divided by its magnitude. For interest the table also shows the undamped natural frequencies, which are not equal to the magnitude of the poles because the system is not classically damped. As can be seen, the system includes some nearly real modes (1 and ) and some highly complex ones (4-7). able 1. Some parameters of the 16-DOF structure used in the numerical evaluations Mode # (pair) Pole Absolute Value of Pole (rad/sec) Exact undamped frequency (rad/sec) % Damping Ratio Mpcw i i i i i i i i Systematic Bias in the Sensitivity Approach he systematic error in the sensitivity approach derives from the approximation of the derivative with a forward difference. An expression for the percent error in κ due to the nonlinearity of the eigenvalue vs. perturbation is ( λ λ) 1 ϑ= 1 ( ) 1 β λ Plots of ϑ vs. β are feasible but it is more practically meaningful to display the error with respect to the % change in the magnitude of the pole since this is the factor that has to be kept above some limit to prevent variability in the identification to govern the solution. Results showing ϑ as a function of frequency change in percent, for three of the system modes are presented in fig.1. (14)

5 5 ϑ Mode#1 Mode#6 Mode#8 5 R R -5 R % change in λ -1 5 Figure 1: Percent error in the sensitivity estimation of the normalization constant coming from curvature in the eigenvalue vs. perturbation relation. As can be seen, error in the sensitivity estimate in modes 1 and 6 would be small, at reasonable frequency shifts, but unacceptably large in the eighth mode. f high curvatures near the origin in the eigenvalue vs. perturbation are limited to higher modes then the bias in the sensitivity solution is not of much practical significance, given that higher modes are seldom identified. Examination of this matter, however, has not been carried out at the time of writing. 4. Error from Variability in the dentification One anticipates that the bulk of the error in the computation of normalization constants derives from variability in the identification. o provide a pilot examination of this matter in the complex normalization case we look at the relative error in percent in the normalization constant, namely η Rκ ( = ) Rκ ( (k)) η κ ( = ) κ ( (k)) R(k) 1 (k) 1 Rκ ( ) κ ( ) (15a,b) We compute the distribution of η using Monte Carlo simulations with variability simulated as follows: eigenvalues are assigned lognormal distributions with mean values for the real and the imaginary equal to the true values and coefficient of variation of.6, and as.3 respectively. Eigenvector variability is considered by multiplying the magnitude and phase of the eigenvector entries by factors selected from uniform distributions with limits of {.95 and 1.5} and {-.5 and.5} degrees, respectively. We note that when eigenvector error is considered the scaling constant depends on which measured coordinate is used to evaluate it and here, for specificity, we use the location where the (perturbed) mode has the largest amplitude. he mean and the standard deviation of the percent error for the normalization constant of the 8 th mode as a function of frequency shift are depicted in fig.. he top row is the result for RBN and the bottom for sensitivity. n the top row the dotted lines correspond to no truncation and the full lines to computations based on the first 1 eigenvector pairs. he trends are as one anticipates from the theory, namely: in RBN the mean values are small and quite flat, the

6 6 OMAC'11 4 th nternational Operational Modal Analysis Conference downward trend on the real part in the truncated case being the strongest and only reaching about 5% mean error at 5% frequency shift. n the sensitivity the mean error increases sharply with frequency shift, the numerical values consistent with what is anticipates from inspection of fig.1. Since the variability in the eigenvalues becomes less important as the frequency shift increases the standard deviation of the error in both methods decreases as the shift increases. 5 3 (a) 4 (b) 1 mean (η R ) std(η R ) 3 1 mean (η ) std(η ) % freq shift % freq shift (c) mean (η R ) 4 3 (d) mean (η ) 1 std(η R ) 1 std(η ) % freq shift % freq shift Figure : Results for the 8 th mode of a16-dof chain system, top row is RBN and bottom row sensitivity, dotted lines = no truncation, full lines in RBN 1 pairs of complex modes. Based on fig.1 one anticipates that the performance of sensitivity should be adequate on the 6 th mode.his anticipated result is confirmed in fig.3 which shows that the performance of RBN and sensitivity in this case are essentially the same

7 RBN Sensitivity RBN Sensitivity 1 std(η R ) 15 1 std(η ) mean (η R ) 5 mean (η ) % freq shift % freq shift Figure 3: Mean and standard deviations of the percent error defined in eq.15 for the 6 th mode of the 16- DOF system described in the text (RBN based on truncated solution). 5. CONCLUDNG REMARKS he paper presents a generalization of the RBN formulation to the complex modal model and compares results with those obtained using the sensitivity approach. t is noted that since the equation error in the sensitivity approach derives from the difference between the derivative of the eigenvalue (with the respect to the perturbation) and the forward difference estimate, bias depends strongly on the second derivative near the origin. For the variability assigned to eigenvalues and eigenvectors in the numerical example it appears that 3% is a reasonable recommendation for a lower bound on the frequency shift. 6. REFERENCES Balmes E., New results in the identification of normal modes from experimental complex modes, Mechanical Systems and Signal Processing, 11 (), Bernal D., 4. Modal scaling from known mass perturbations, J. Eng. Mech. 13 (9) Bernal D., 11. A Receptance Based Formulation for Modal Scaling Using Mass Perturbations, Mechanical Systems and Signal Processing, 5() Brinker R. and Andersen P., 3. A way of getting scaled mode shapes in output-only modal testing, Proc. of the 1st nt. Modal Anal. Conf., Kissimmee, Fl on CD. Pappa R.S., Elliott K.B., and Schenk A., Consistent-mode indicator for the eigensystem realization algorithm, J. Guidance, Control, and Dynamics, 16 (5), Parloo, E., Verboven, P., Guillaume, P. and Van Overmeire, M., a. Sensitivity-based operational mode shape normalization, Mechanical Systems and Signal Processing, 16, Parloo, E., Verboven, P., Guillaume, P. and Van Overmeire, M., b. terative calculation of nonlinear changes by first-order approximations, Proc. of the th nt. Modal Anal. Conf., Orlando FL.,

IOMAC'15 6 th International Operational Modal Analysis Conference

IOMAC'15 6 th International Operational Modal Analysis Conference IOMAC'15 6 th International Operational Modal Analysis Conference 2015 May12-14 Gijón - Spain COMPARISON OF DIFFERENT TECHNIQUES TO SCALE MODE SHAPES IN OPERATIONAL MODAL ANALYSIS. Luis Borja Peral Mtnez

More information

OBSERVER/KALMAN AND SUBSPACE IDENTIFICATION OF THE UBC BENCHMARK STRUCTURAL MODEL

OBSERVER/KALMAN AND SUBSPACE IDENTIFICATION OF THE UBC BENCHMARK STRUCTURAL MODEL OBSERVER/KALMAN AND SUBSPACE IDENTIFICATION OF THE UBC BENCHMARK STRUCTURAL MODEL Dionisio Bernal, Burcu Gunes Associate Proessor, Graduate Student Department o Civil and Environmental Engineering, 7 Snell

More information

and let s calculate the image of some vectors under the transformation T.

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

COMPARISON OF MODE SHAPE VECTORS IN OPERATIONAL MODAL ANALYSIS DEALING WITH CLOSELY SPACED MODES.

COMPARISON OF MODE SHAPE VECTORS IN OPERATIONAL MODAL ANALYSIS DEALING WITH CLOSELY SPACED MODES. IOMAC'5 6 th International Operational Modal Analysis Conference 5 May-4 Gijón - Spain COMPARISON OF MODE SHAPE VECTORS IN OPERATIONAL MODAL ANALYSIS DEALING WITH CLOSELY SPACED MODES. Olsen P., and Brincker

More information

MATH 221, Spring Homework 10 Solutions

MATH 221, Spring Homework 10 Solutions MATH 22, Spring 28 - Homework Solutions Due Tuesday, May Section 52 Page 279, Problem 2: 4 λ A λi = and the characteristic polynomial is det(a λi) = ( 4 λ)( λ) ( )(6) = λ 6 λ 2 +λ+2 The solutions to the

More information

Eigenvalues and Eigenvectors

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

Remark By definition, an eigenvector must be a nonzero vector, but eigenvalue could be zero.

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

Reduction in number of dofs

Reduction in number of dofs Reduction in number of dofs Reduction in the number of dof to represent a structure reduces the size of matrices and, hence, computational cost. Because a subset of the original dof represent the whole

More information

Linear Algebra Practice Problems

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

Study Guide for Linear Algebra Exam 2

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

Eigenvalues and Eigenvectors

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

Remark 1 By definition, an eigenvector must be a nonzero vector, but eigenvalue could be zero.

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

FREE VIBRATION RESPONSE OF UNDAMPED SYSTEMS

FREE VIBRATION RESPONSE OF UNDAMPED SYSTEMS Lecture Notes: STRUCTURAL DYNAMICS / FALL 2011 / Page: 1 FREE VIBRATION RESPONSE OF UNDAMPED SYSTEMS : : 0, 0 As demonstrated previously, the above Equation of Motion (free-vibration equation) has a solution

More information

Chapter 3. Determinants and Eigenvalues

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

22.3. Repeated Eigenvalues and Symmetric Matrices. Introduction. Prerequisites. Learning Outcomes

22.3. Repeated Eigenvalues and Symmetric Matrices. Introduction. Prerequisites. Learning Outcomes Repeated Eigenvalues and Symmetric Matrices. Introduction In this Section we further develop the theory of eigenvalues and eigenvectors in two distinct directions. Firstly we look at matrices where one

More information

Name: Final Exam MATH 3320

Name: Final Exam MATH 3320 Name: Final Exam MATH 3320 Directions: Make sure to show all necessary work to receive full credit. If you need extra space please use the back of the sheet with appropriate labeling. (1) State the following

More information

First of all, the notion of linearity does not depend on which coordinates are used. Recall that a map T : R n R m is linear if

First of all, the notion of linearity does not depend on which coordinates are used. Recall that a map T : R n R m is linear if 5 Matrices in Different Coordinates In this section we discuss finding matrices of linear maps in different coordinates Earlier in the class was the matrix that multiplied by x to give ( x) in standard

More information

Linear Algebra. and

Linear Algebra. and Instructions Please answer the six problems on your own paper. These are essay questions: you should write in complete sentences. 1. Are the two matrices 1 2 2 1 3 5 2 7 and 1 1 1 4 4 2 5 5 2 row equivalent?

More information

Problem 1: Solving a linear equation

Problem 1: Solving a linear equation Math 38 Practice Final Exam ANSWERS Page Problem : Solving a linear equation Given matrix A = 2 2 3 7 4 and vector y = 5 8 9. (a) Solve Ax = y (if the equation is consistent) and write the general solution

More information

UNCERTAINTY MODELING VIA FREQUENCY DOMAIN MODEL VALIDATION

UNCERTAINTY MODELING VIA FREQUENCY DOMAIN MODEL VALIDATION AIAA 99-3959 UNCERTAINTY MODELING VIA FREQUENCY DOMAIN MODEL VALIDATION Martin R. Waszak, * NASA Langley Research Center, Hampton, Virginia Dominick Andrisani II, Purdue University, West Lafayette, Indiana

More information

Final Review Written by Victoria Kala SH 6432u Office Hours R 12:30 1:30pm Last Updated 11/30/2015

Final Review Written by Victoria Kala SH 6432u Office Hours R 12:30 1:30pm Last Updated 11/30/2015 Final Review Written by Victoria Kala vtkala@mathucsbedu SH 6432u Office Hours R 12:30 1:30pm Last Updated 11/30/2015 Summary This review contains notes on sections 44 47, 51 53, 61, 62, 65 For your final,

More information

Linear algebra II Tutorial solutions #1 A = x 1

Linear algebra II Tutorial solutions #1 A = x 1 Linear algebra II Tutorial solutions #. Find the eigenvalues and the eigenvectors of the matrix [ ] 5 2 A =. 4 3 Since tra = 8 and deta = 5 8 = 7, the characteristic polynomial is f(λ) = λ 2 (tra)λ+deta

More information

2 Eigenvectors and Eigenvalues in abstract spaces.

2 Eigenvectors and Eigenvalues in abstract spaces. MA322 Sathaye Notes on Eigenvalues Spring 27 Introduction In these notes, we start with the definition of eigenvectors in abstract vector spaces and follow with the more common definition of eigenvectors

More information

Linear Algebra review Powers of a diagonalizable matrix Spectral decomposition

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

Eigenvalue and Eigenvector Homework

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

Repeated Eigenvalues and Symmetric Matrices

Repeated Eigenvalues and Symmetric Matrices Repeated Eigenvalues and Symmetric Matrices. Introduction In this Section we further develop the theory of eigenvalues and eigenvectors in two distinct directions. Firstly we look at matrices where one

More information

3. Mathematical Properties of MDOF Systems

3. Mathematical Properties of MDOF Systems 3. Mathematical Properties of MDOF Systems 3.1 The Generalized Eigenvalue Problem Recall that the natural frequencies ω and modes a are found from [ - ω 2 M + K ] a = 0 or K a = ω 2 M a Where M and K are

More information

Advanced Engineering Mathematics Prof. Pratima Panigrahi Department of Mathematics Indian Institute of Technology, Kharagpur

Advanced Engineering Mathematics Prof. Pratima Panigrahi Department of Mathematics Indian Institute of Technology, Kharagpur Advanced Engineering Mathematics Prof. Pratima Panigrahi Department of Mathematics Indian Institute of Technology, Kharagpur Lecture No. #07 Jordan Canonical Form Cayley Hamilton Theorem (Refer Slide Time:

More information

Conceptual Questions for Review

Conceptual Questions for Review Conceptual Questions for Review Chapter 1 1.1 Which vectors are linear combinations of v = (3, 1) and w = (4, 3)? 1.2 Compare the dot product of v = (3, 1) and w = (4, 3) to the product of their lengths.

More information

Introduction to Quantitative Techniques for MSc Programmes SCHOOL OF ECONOMICS, MATHEMATICS AND STATISTICS MALET STREET LONDON WC1E 7HX

Introduction to Quantitative Techniques for MSc Programmes SCHOOL OF ECONOMICS, MATHEMATICS AND STATISTICS MALET STREET LONDON WC1E 7HX Introduction to Quantitative Techniques for MSc Programmes SCHOOL OF ECONOMICS, MATHEMATICS AND STATISTICS MALET STREET LONDON WC1E 7HX September 2007 MSc Sep Intro QT 1 Who are these course for? The September

More information

The Jordan Canonical Form

The Jordan Canonical Form The Jordan Canonical Form The Jordan canonical form describes the structure of an arbitrary linear transformation on a finite-dimensional vector space over an algebraically closed field. Here we develop

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

Dimension. Eigenvalue and eigenvector

Dimension. 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 information

Math 314/ Exam 2 Blue Exam Solutions December 4, 2008 Instructor: Dr. S. Cooper. Name:

Math 314/ Exam 2 Blue Exam Solutions December 4, 2008 Instructor: Dr. S. Cooper. Name: Math 34/84 - Exam Blue Exam Solutions December 4, 8 Instructor: Dr. S. Cooper Name: Read each question carefully. Be sure to show all of your work and not just your final conclusion. You may not use your

More information

Eigenvalues, Eigenvectors, and Diagonalization

Eigenvalues, Eigenvectors, and Diagonalization Math 240 TA: Shuyi Weng Winter 207 February 23, 207 Eigenvalues, Eigenvectors, and Diagonalization The concepts of eigenvalues, eigenvectors, and diagonalization are best studied with examples. We will

More information

Linear Algebra review Powers of a diagonalizable matrix Spectral decomposition

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

Diagonalization of Matrix

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

Lecture 2 Supplementary Notes: Derivation of the Phase Equation

Lecture 2 Supplementary Notes: Derivation of the Phase Equation Lecture 2 Supplementary Notes: Derivation of the Phase Equation Michael Cross, 25 Derivation from Amplitude Equation Near threshold the phase reduces to the phase of the complex amplitude, and the phase

More information

COMPLEX MODES IN LINEAR STOCHASTIC SYSTEMS

COMPLEX MODES IN LINEAR STOCHASTIC SYSTEMS Proceedings of VETOMAC-I October 25-27, 2, Bangalore, INDIA COMPLEX MODES IN LINEAR STOCHASTIC SYSTEMS S. Adhikari Cambridge University Engineering Department Trumpington Street Cambridge CB2 1PZ (U.K.)

More information

Elementary maths for GMT

Elementary maths for GMT Elementary maths for GMT Linear Algebra Part 2: Matrices, Elimination and Determinant m n matrices The system of m linear equations in n variables x 1, x 2,, x n a 11 x 1 + a 12 x 2 + + a 1n x n = b 1

More information

Calculating determinants for larger matrices

Calculating determinants for larger matrices Day 26 Calculating determinants for larger matrices We now proceed to define det A for n n matrices A As before, we are looking for a function of A that satisfies the product formula det(ab) = det A det

More information

Eigenvalues and Eigenvectors

Eigenvalues and Eigenvectors Eigenvalues and Eigenvectors week -2 Fall 26 Eigenvalues and eigenvectors The most simple linear transformation from R n to R n may be the transformation of the form: T (x,,, x n ) (λ x, λ 2,, λ n x n

More information

Jim Lambers MAT 610 Summer Session Lecture 2 Notes

Jim Lambers MAT 610 Summer Session Lecture 2 Notes Jim Lambers MAT 610 Summer Session 2009-10 Lecture 2 Notes These notes correspond to Sections 2.2-2.4 in the text. Vector Norms Given vectors x and y of length one, which are simply scalars x and y, the

More information

A GENERALIZED APPROACH FOR CALCULATION OF THE EIGENVECTOR SENSITIVITY FOR VARIOUS EIGENVECTOR NORMALIZATIONS

A GENERALIZED APPROACH FOR CALCULATION OF THE EIGENVECTOR SENSITIVITY FOR VARIOUS EIGENVECTOR NORMALIZATIONS A GENERALIZED APPROACH FOR CALCULATION OF THE EIGENVECTOR SENSITIVITY FOR VARIOUS EIGENVECTOR NORMALIZATIONS A Thesis presented to the Faculty of the Graduate School University of Missouri - Columbia In

More information

A priori verification of local FE model based force identification.

A priori verification of local FE model based force identification. A priori verification of local FE model based force identification. M. Corus, E. Balmès École Centrale Paris,MSSMat Grande voie des Vignes, 92295 Châtenay Malabry, France e-mail: corus@mssmat.ecp.fr balmes@ecp.fr

More information

LINEAR ALGEBRA REVIEW

LINEAR ALGEBRA REVIEW LINEAR ALGEBRA REVIEW SPENCER BECKER-KAHN Basic Definitions Domain and Codomain. Let f : X Y be any function. This notation means that X is the domain of f and Y is the codomain of f. This means that for

More information

Finite-Horizon Statistics for Markov chains

Finite-Horizon Statistics for Markov chains Analyzing FSDT Markov chains Friday, September 30, 2011 2:03 PM Simulating FSDT Markov chains, as we have said is very straightforward, either by using probability transition matrix or stochastic update

More information

Math 1553, Introduction to Linear Algebra

Math 1553, Introduction to Linear Algebra Learning goals articulate what students are expected to be able to do in a course that can be measured. This course has course-level learning goals that pertain to the entire course, and section-level

More information

Generalized Eigenvectors and Jordan Form

Generalized Eigenvectors and Jordan Form Generalized Eigenvectors and Jordan Form We have seen that an n n matrix A is diagonalizable precisely when the dimensions of its eigenspaces sum to n. So if A is not diagonalizable, there is at least

More information

Econ Slides from Lecture 7

Econ Slides from Lecture 7 Econ 205 Sobel Econ 205 - Slides from Lecture 7 Joel Sobel August 31, 2010 Linear Algebra: Main Theory A linear combination of a collection of vectors {x 1,..., x k } is a vector of the form k λ ix i for

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

Eigenvalues & Eigenvectors

Eigenvalues & Eigenvectors Eigenvalues & Eigenvectors Page 1 Eigenvalues are a very important concept in linear algebra, and one that comes up in other mathematics courses as well. The word eigen is German for inherent or characteristic,

More information

Math 308 Practice Final Exam Page and vector y =

Math 308 Practice Final Exam Page and vector y = Math 308 Practice Final Exam Page Problem : Solving a linear equation 2 0 2 5 Given matrix A = 3 7 0 0 and vector y = 8. 4 0 0 9 (a) Solve Ax = y (if the equation is consistent) and write the general solution

More information

A reduced-order stochastic finite element analysis for structures with uncertainties

A reduced-order stochastic finite element analysis for structures with uncertainties A reduced-order stochastic finite element analysis for structures with uncertainties Ji Yang 1, Béatrice Faverjon 1,2, Herwig Peters 1, icole Kessissoglou 1 1 School of Mechanical and Manufacturing Engineering,

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 (MATH ) Spring 2011 Final Exam Practice Problem Solutions

Linear Algebra (MATH ) Spring 2011 Final Exam Practice Problem Solutions Linear Algebra (MATH 4) Spring 2 Final Exam Practice Problem Solutions Instructions: Try the following on your own, then use the book and notes where you need help. Afterwards, check your solutions with

More information

Eigenvalues and Eigenvectors

Eigenvalues and Eigenvectors 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 information

Smooth Orthogonal Decomposition for Modal Analysis of Randomly Excited Systems

Smooth Orthogonal Decomposition for Modal Analysis of Randomly Excited Systems Smooth Orthogonal Decomposition for Modal Analysis of Randomly Excited Systems U. Farooq and B. F. Feeny Department of Mechanical Engineering, Michigan State University, East Lansing, Michigan 48824 Abstract

More information

Chapter 6: Orthogonality

Chapter 6: Orthogonality Chapter 6: Orthogonality (Last Updated: November 7, 7) These notes are derived primarily from Linear Algebra and its applications by David Lay (4ed). A few theorems have been moved around.. Inner products

More information

1. Linear systems of equations. Chapters 7-8: Linear Algebra. Solution(s) of a linear system of equations (continued)

1. Linear systems of equations. Chapters 7-8: Linear Algebra. Solution(s) of a linear system of equations (continued) 1 A linear system of equations of the form Sections 75, 78 & 81 a 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2 a m1 x 1 + a m2 x 2 + + a mn x n = b m can be written in matrix

More information

Random Eigenvalue Problems in Structural Dynamics: An Experimental Investigation

Random Eigenvalue Problems in Structural Dynamics: An Experimental Investigation Random Eigenvalue Problems in Structural Dynamics: An Experimental Investigation S. Adhikari, A. Srikantha Phani and D. A. Pape School of Engineering, Swansea University, Swansea, UK Email: S.Adhikari@swansea.ac.uk

More information

Identification of modal parameters from ambient vibration data using eigensystem realization algorithm with correlation technique

Identification of modal parameters from ambient vibration data using eigensystem realization algorithm with correlation technique Journal of Mechanical Science and Technology 4 (1) (010) 377~38 www.springerlink.com/content/1738-494x DOI 107/s106-010-1005-0 Identification of modal parameters from ambient vibration data using eigensystem

More information

Cayley-Hamilton Theorem

Cayley-Hamilton Theorem Cayley-Hamilton Theorem Massoud Malek In all that follows, the n n identity matrix is denoted by I n, the n n zero matrix by Z n, and the zero vector by θ n Let A be an n n matrix Although det (λ I n A

More information

CSL361 Problem set 4: Basic linear algebra

CSL361 Problem set 4: Basic linear algebra CSL361 Problem set 4: Basic linear algebra February 21, 2017 [Note:] If the numerical matrix computations turn out to be tedious, you may use the function rref in Matlab. 1 Row-reduced echelon matrices

More information

Foundations of Matrix Analysis

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

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

Diagonalizing Matrices

Diagonalizing Matrices Diagonalizing Matrices Massoud Malek A A Let A = A k be an n n non-singular matrix and let B = A = [B, B,, B k,, B n ] Then A n A B = A A 0 0 A k [B, B,, B k,, B n ] = 0 0 = I n 0 A n Notice that A i B

More information

TMA Calculus 3. Lecture 21, April 3. Toke Meier Carlsen Norwegian University of Science and Technology Spring 2013

TMA Calculus 3. Lecture 21, April 3. Toke Meier Carlsen Norwegian University of Science and Technology Spring 2013 TMA4115 - Calculus 3 Lecture 21, April 3 Toke Meier Carlsen Norwegian University of Science and Technology Spring 2013 www.ntnu.no TMA4115 - Calculus 3, Lecture 21 Review of last week s lecture Last week

More information

Math 217: Eigenspaces and Characteristic Polynomials Professor Karen Smith

Math 217: Eigenspaces and Characteristic Polynomials Professor Karen Smith Math 217: Eigenspaces and Characteristic Polynomials Professor Karen Smith (c)2015 UM Math Dept licensed under a Creative Commons By-NC-SA 4.0 International License. Definition: Let V T V be a linear transformation.

More information

Scattering Parameters

Scattering Parameters Berkeley Scattering Parameters Prof. Ali M. Niknejad U.C. Berkeley Copyright c 2016 by Ali M. Niknejad September 7, 2017 1 / 57 Scattering Parameters 2 / 57 Scattering Matrix Voltages and currents are

More information

Eigenvalues and Eigenvectors A =

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

Math 240 Calculus III

Math 240 Calculus III Generalized Calculus III Summer 2015, Session II Thursday, July 23, 2015 Agenda 1. 2. 3. 4. Motivation Defective matrices cannot be diagonalized because they do not possess enough eigenvectors to make

More information

SOME PROPERTIES OF SYMPLECTIC RUNGE-KUTTA METHODS

SOME PROPERTIES OF SYMPLECTIC RUNGE-KUTTA METHODS SOME PROPERTIES OF SYMPLECTIC RUNGE-KUTTA METHODS ERNST HAIRER AND PIERRE LEONE Abstract. We prove that to every rational function R(z) satisfying R( z)r(z) = 1, there exists a symplectic Runge-Kutta method

More information

Structural Characterization of Rakanji Stone Arch Bridge by Numerical Model Updating

Structural Characterization of Rakanji Stone Arch Bridge by Numerical Model Updating Structural Analysis of Historical Constructions, New Delhi 2006 P.B. ourenço, P. Roca, C. Modena, S. Agrawal (Eds.) Structural Characterization of Rakanji Stone Arch Bridge by Numerical Model Updating

More information

IDENTIFICATION OF THE MODAL MASSES OF AN UAV STRUCTURE IN OPERATIONAL ENVIRONMENT

IDENTIFICATION OF THE MODAL MASSES OF AN UAV STRUCTURE IN OPERATIONAL ENVIRONMENT IDENTIFICATION OF THE MODAL MASSES OF AN UAV STRUCTURE IN OPERATIONAL ENVIRONMENT M.S. Cardinale 1, M. Arras 2, G. Coppotelli 3 1 Graduated Student, University of Rome La Sapienza, mariosalvatore.cardinale@gmail.com.

More information

B. Differential Equations A differential equation is an equation of the form

B. Differential Equations A differential equation is an equation of the form B Differential Equations A differential equation is an equation of the form ( n) F[ t; x(, xʹ (, x ʹ ʹ (, x ( ; α] = 0 dx d x ( n) d x where x ʹ ( =, x ʹ ʹ ( =,, x ( = n A differential equation describes

More information

Collocated versus non-collocated control [H04Q7]

Collocated versus non-collocated control [H04Q7] Collocated versus non-collocated control [H04Q7] Jan Swevers September 2008 0-0 Contents Some concepts of structural dynamics Collocated versus non-collocated control Summary This lecture is based on parts

More information

MTH50 Spring 07 HW Assignment 7 {From [FIS0]}: Sec 44 #4a h 6; Sec 5 #ad ac 4ae 4 7 The due date for this assignment is 04/05/7 Sec 44 #4a h Evaluate the erminant of the following matrices by any legitimate

More information

Section 8.2 : Homogeneous Linear Systems

Section 8.2 : Homogeneous Linear Systems Section 8.2 : Homogeneous Linear Systems Review: Eigenvalues and Eigenvectors Let A be an n n matrix with constant real components a ij. An eigenvector of A is a nonzero n 1 column vector v such that Av

More information

Efficient Reduced Order Modeling of Low- to Mid-Frequency Vibration and Power Flow in Complex Structures

Efficient Reduced Order Modeling of Low- to Mid-Frequency Vibration and Power Flow in Complex Structures Efficient Reduced Order Modeling of Low- to Mid-Frequency Vibration and Power Flow in Complex Structures Yung-Chang Tan Graduate Student Research Assistant Matthew P. Castanier Assistant Research Scientist

More information

Recall : Eigenvalues and Eigenvectors

Recall : Eigenvalues and Eigenvectors Recall : Eigenvalues and Eigenvectors Let A be an n n matrix. If a nonzero vector x in R n satisfies Ax λx for a scalar λ, then : The scalar λ is called an eigenvalue of A. The vector x is called an eigenvector

More information

Linear Algebra Massoud Malek

Linear Algebra Massoud Malek CSUEB Linear Algebra Massoud Malek Inner Product and Normed Space In all that follows, the n n identity matrix is denoted by I n, the n n zero matrix by Z n, and the zero vector by θ n An inner product

More information

Eigenvalues, Eigenvectors and the Jordan Form

Eigenvalues, Eigenvectors and the Jordan Form EE/ME 701: Advanced Linear Systems Eigenvalues, Eigenvectors and the Jordan Form Contents 1 Introduction 3 1.1 Review of basic facts about eigenvectors and eigenvalues..... 3 1.1.1 Looking at eigenvalues

More information

Structural Dynamics Modification and Modal Modeling

Structural Dynamics Modification and Modal Modeling SEM Handboo of Experimental Structural Dynamics - Structural Dynamics Modification and Modal Modeling Structural Dynamics Modification and Modal Modeling Structural Dynamics Modification (SDM) also nown

More information

MAT 1302B Mathematical Methods II

MAT 1302B Mathematical Methods II MAT 1302B Mathematical Methods II Alistair Savage Mathematics and Statistics University of Ottawa Winter 2015 Lecture 19 Alistair Savage (uottawa) MAT 1302B Mathematical Methods II Winter 2015 Lecture

More information

Computational Stiffness Method

Computational Stiffness Method Computational Stiffness Method Hand calculations are central in the classical stiffness method. In that approach, the stiffness matrix is established column-by-column by setting the degrees of freedom

More information

An example of correlation matrix based mode shape expansion in OMA

An example of correlation matrix based mode shape expansion in OMA An example of correlation matrix based mode shape expansion in OMA Rune Brincker 1 Edilson Alexandre Camargo 2 Anders Skafte 1 1 : Department of Engineering, Aarhus University, Aarhus, Denmark 2 : Institute

More information

Linear Algebra & Geometry why is linear algebra useful in computer vision?

Linear Algebra & Geometry why is linear algebra useful in computer vision? Linear Algebra & Geometry why is linear algebra useful in computer vision? References: -Any book on linear algebra! -[HZ] chapters 2, 4 Some of the slides in this lecture are courtesy to Prof. Octavia

More information

Announcements Wednesday, November 01

Announcements Wednesday, November 01 Announcements Wednesday, November 01 WeBWorK 3.1, 3.2 are due today at 11:59pm. The quiz on Friday covers 3.1, 3.2. My office is Skiles 244. Rabinoffice hours are Monday, 1 3pm and Tuesday, 9 11am. Section

More information

MATH 304 Linear Algebra Lecture 34: Review for Test 2.

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

Definitions for Quizzes

Definitions for Quizzes Definitions for Quizzes Italicized text (or something close to it) will be given to you. Plain text is (an example of) what you should write as a definition. [Bracketed text will not be given, nor does

More information

. D CR Nomenclature D 1

. D CR Nomenclature D 1 . D CR Nomenclature D 1 Appendix D: CR NOMENCLATURE D 2 The notation used by different investigators working in CR formulations has not coalesced, since the topic is in flux. This Appendix identifies the

More information

(a) II and III (b) I (c) I and III (d) I and II and III (e) None are true.

(a) II and III (b) I (c) I and III (d) I and II and III (e) None are true. 1 Which of the following statements is always true? I The null space of an m n matrix is a subspace of R m II If the set B = {v 1,, v n } spans a vector space V and dimv = n, then B is a basis for V III

More information

DIAGONALIZATION. In order to see the implications of this definition, let us consider the following example Example 1. Consider the matrix

DIAGONALIZATION. In order to see the implications of this definition, let us consider the following example Example 1. Consider the matrix DIAGONALIZATION Definition We say that a matrix A of size n n is diagonalizable if there is a basis of R n consisting of eigenvectors of A ie if there are n linearly independent vectors v v n such that

More information

Polynomial Chaos and Karhunen-Loeve Expansion

Polynomial Chaos and Karhunen-Loeve Expansion Polynomial Chaos and Karhunen-Loeve Expansion 1) Random Variables Consider a system that is modeled by R = M(x, t, X) where X is a random variable. We are interested in determining the probability of the

More information

Math Linear Algebra Final Exam Review Sheet

Math Linear Algebra Final Exam Review Sheet Math 15-1 Linear Algebra Final Exam Review Sheet Vector Operations Vector addition is a component-wise operation. Two vectors v and w may be added together as long as they contain the same number n of

More information

PY 351 Modern Physics Short assignment 4, Nov. 9, 2018, to be returned in class on Nov. 15.

PY 351 Modern Physics Short assignment 4, Nov. 9, 2018, to be returned in class on Nov. 15. PY 351 Modern Physics Short assignment 4, Nov. 9, 2018, to be returned in class on Nov. 15. You may write your answers on this sheet or on a separate paper. Remember to write your name on top. Please note:

More information

Linear Algebra - Part II

Linear Algebra - Part II Linear Algebra - Part II Projection, Eigendecomposition, SVD (Adapted from Sargur Srihari s slides) Brief Review from Part 1 Symmetric Matrix: A = A T Orthogonal Matrix: A T A = AA T = I and A 1 = A T

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