Assignment 7/MATH 247/Winter, 2010 Due: Friday, March 19. Powers of a square matrix

Similar documents
MOLECULAR VIBRATIONS

Chapter 9 Jordan Block Matrices

MATH 247/Winter Notes on the adjoint and on normal operators.

( q Modal Analysis. Eigenvectors = Mode Shapes? Eigenproblem (cont) = x x 2 u 2. u 1. x 1 (4.55) vector and M and K are matrices.

. The set of these sums. be a partition of [ ab, ]. Consider the sum f( x) f( x 1)

Mu Sequences/Series Solutions National Convention 2014

Chapter 5. Curve fitting

LINEAR RECURRENT SEQUENCES AND POWERS OF A SQUARE MATRIX

h-analogue of Fibonacci Numbers

Log1 Contest Round 2 Theta Complex Numbers. 4 points each. 5 points each

Assignment 5/MATH 247/Winter Due: Friday, February 19 in class (!) (answers will be posted right after class)

Numerical Analysis Formulae Booklet

Lecture 07: Poles and Zeros

{ }{ ( )} (, ) = ( ) ( ) ( ) Chapter 14 Exercises in Sampling Theory. Exercise 1 (Simple random sampling): Solution:

CHAPTER 4 RADICAL EXPRESSIONS

means the first term, a2 means the term, etc. Infinite Sequences: follow the same pattern forever.

1 Mixed Quantum State. 2 Density Matrix. CS Density Matrices, von Neumann Entropy 3/7/07 Spring 2007 Lecture 13. ψ = α x x. ρ = p i ψ i ψ i.

#A27 INTEGERS 13 (2013) SOME WEIGHTED SUMS OF PRODUCTS OF LUCAS SEQUENCES

Application of Legendre Bernstein basis transformations to degree elevation and degree reduction

QR Factorization and Singular Value Decomposition COS 323

LECTURE 8: Topics in Chaos Ricker Equation. Period doubling bifurcation. Period doubling cascade. A Quadratic Equation Ricker Equation 1.0. x x 4 0.

MATH 371 Homework assignment 1 August 29, 2013

3. RECURSIVE ALGORITHMS AND RECURRENCE RELATIONS

Derivation of 3-Point Block Method Formula for Solving First Order Stiff Ordinary Differential Equations

A Class of Deformed Hyperbolic Secant Distributions Using Two Parametric Functions. S. A. El-Shehawy

ELEMENTARY PROBLEMS AND SOLUTIONS

Feature Selection: Part 2. 1 Greedy Algorithms (continued from the last lecture)

Chapter 2 - Free Vibration of Multi-Degree-of-Freedom Systems - II

Third handout: On the Gini Index

18.413: Error Correcting Codes Lab March 2, Lecture 8

Bivariate Vieta-Fibonacci and Bivariate Vieta-Lucas Polynomials

ON THE ELEMENTARY SYMMETRIC FUNCTIONS OF A SUM OF MATRICES

On the construction of symmetric nonnegative matrix with prescribed Ritz values

Maps on Triangular Matrix Algebras

Lecture 3 Probability review (cont d)

A scalar t is an eigenvalue of A if and only if t satisfies the characteristic equation of A: det (A ti) =0

Bounds on the expected entropy and KL-divergence of sampled multinomial distributions. Brandon C. Roy

UNIT 2 SOLUTION OF ALGEBRAIC AND TRANSCENDENTAL EQUATIONS

Arithmetic Mean and Geometric Mean

α1 α2 Simplex and Rectangle Elements Multi-index Notation of polynomials of degree Definition: The set P k will be the set of all functions:

1 Lyapunov Stability Theory

F. Inequalities. HKAL Pure Mathematics. 進佳數學團隊 Dr. Herbert Lam 林康榮博士. [Solution] Example Basic properties

( ) ( ) ( ( )) ( ) ( ) ( ) ( ) ( ) = ( ) ( ) + ( ) ( ) = ( ( )) ( ) + ( ( )) ( ) Review. Second Derivatives for f : y R. Let A be an m n matrix.

X X X E[ ] E X E X. is the ()m n where the ( i,)th. j element is the mean of the ( i,)th., then

n 1 n 2 n 2 n n 1 ln n 2 1 n Express the number as a ratio of integers

Exercises for Square-Congruence Modulo n ver 11

Initial-Value Problems for ODEs. numerical errors (round-off and truncation errors) Consider a perturbed system: dz dt

Chapter 5 Properties of a Random Sample

4 Inner Product Spaces

PTAS for Bin-Packing

On quaternions with generalized Fibonacci and Lucas number components

Singular Value Decomposition. Linear Algebra (3) Singular Value Decomposition. SVD and Eigenvectors. Solving LEs with SVD

Given a table of data poins of an unknown or complicated function f : we want to find a (simpler) function p s.t. px (

THE COMPLETE ENUMERATION OF FINITE GROUPS OF THE FORM R 2 i ={R i R j ) k -i=i

Lecture Note to Rice Chapter 8

Some results and conjectures about recurrence relations for certain sequences of binomial sums.

Qualifying Exam Statistical Theory Problem Solutions August 2005

TESTS BASED ON MAXIMUM LIKELIHOOD

Matricial Potentiation

Analyzing Control Structures

Cubic Nonpolynomial Spline Approach to the Solution of a Second Order Two-Point Boundary Value Problem

AN UPPER BOUND FOR THE PERMANENT VERSUS DETERMINANT PROBLEM BRUNO GRENET

Solutions to problem set ); (, ) (

Numerical Simulations of the Complex Modied Korteweg-de Vries Equation. Thiab R. Taha. The University of Georgia. Abstract

9 U-STATISTICS. Eh =(m!) 1 Eh(X (1),..., X (m ) ) i.i.d

The Mathematical Appendix

Introduction to Computer Design. Standard Forms for Boolean Functions. Sums and Products. Standard Forms for Boolean Functions (cont ) CMPT-150

KURODA S METHOD FOR CONSTRUCTING CONSISTENT INPUT-OUTPUT DATA SETS. Peter J. Wilcoxen. Impact Research Centre, University of Melbourne.

Functions of Random Variables

Research Article Gauss-Lobatto Formulae and Extremal Problems

Class 13,14 June 17, 19, 2015

CS286.2 Lecture 4: Dinur s Proof of the PCP Theorem

Overview of the weighting constants and the points where we evaluate the function for The Gaussian quadrature Project two

Generalized Linear Regression with Regularization

Engineering Vibration 1. Introduction

Lecture 9: Tolerant Testing

ANALYSIS ON THE NATURE OF THE BASIC EQUATIONS IN SYNERGETIC INTER-REPRESENTATION NETWORK

Analysis of System Performance IN2072 Chapter 5 Analysis of Non Markov Systems

3D Geometry for Computer Graphics. Lesson 2: PCA & SVD

ICS141: Discrete Mathematics for Computer Science I

Complete Convergence and Some Maximal Inequalities for Weighted Sums of Random Variables

Fibonacci Identities as Binomial Sums

1 Convergence of the Arnoldi method for eigenvalue problems

A Study on Generalized Generalized Quasi hyperbolic Kac Moody algebra QHGGH of rank 10

EECE 301 Signals & Systems

Greatest Common Divisor and Least Common Multiple Matrices on Factor Closed Sets in a Principal Ideal Domain

for each of its columns. A quick calculation will verify that: thus m < dim(v). Then a basis of V with respect to which T has the form: A

Investigating Cellular Automata

MA/CSSE 473 Day 27. Dynamic programming

Dimensionality Reduction and Learning

Homework 1: Solutions Sid Banerjee Problem 1: (Practice with Asymptotic Notation) ORIE 4520: Stochastics at Scale Fall 2015

ENGI 4430 Numerical Integration Page 5-01

Introduction to Numerical Differentiation and Interpolation March 10, !=1 1!=1 2!=2 3!=6 4!=24 5!= 120

Discrete Mathematics and Probability Theory Fall 2016 Seshia and Walrand DIS 10b

Introduction to local (nonparametric) density estimation. methods

UNIVERSITY OF OSLO DEPARTMENT OF ECONOMICS

For combinatorial problems we might need to generate all permutations, combinations, or subsets of a set.

2006 Jamie Trahan, Autar Kaw, Kevin Martin University of South Florida United States of America

Lecture 12 APPROXIMATION OF FIRST ORDER DERIVATIVES

x y exp λ'. x exp λ 2. x exp 1.

Transcription:

Assgmet 7/MATH 47/Wter, 00 Due: Frday, March 9 Powers o a square matrx Gve a square matrx A, ts powers A or large, or eve arbtrary, teger expoets ca be calculated by dagoalzg A -- that s possble (!) Namely, A P B P, the A A A A P B P P B P P B P P B B B P P B P ; ad B dag ( λ, λ,, λ ), the (( ),( ) B dag λ λ,,( λ ) ) 0 Example: Let A The char A ( λ ) λ( λ) λ λ ; thus the egevalues o A are λ, (± + 4 (± 5) ; egevectors : P, P ; + 5 5 ad wth P, 5 P, + 5 5 4 5 ad ally, + 5 0 A P dag( λ, λ) P P P 0 5 ; (+ 5) 0 A P dag( λ, λ ) P P P 0 ( 5) (+ 5) 0 5 ( ) + 5 5 0 ( 5) 4 5 5 + 5 ( + 5) ( 5) 5 + + (+ 5) ( 5) 5

+ 5 4( a b ) ( a b ) ( a b ) a b + + where we used the abbrevatos a + 5, b 5 (We also used that (+ 5)( 5) 4 ; ad so (+ 5) ( 5) (+ 5) (+ 5)( 5) (+ 5) ( 4) ; ad smlar urther equaltes) Fboacc umbers ad recurrece equatos The Fboacc umbers,, 3,, are deed as ollows: the rst two terms are deed as,, ad the terms 3, 4, are deed by the recursve ormula + () + + We derve a explct ormula or Thus,, as ollows Let us wrte or the vector,, 3, + + + + + 0 Let A be the matrx A Next, ote that the equato () gves the vector/matrx equato A + ; () deed, the rst etry the product s 0 + +, whch s the same as +, the rst etry + ; the secod etry the product s + +, whch, by the recurso equato (), s equal to +, the secod etry + Thereore, we have

A, A A A A, 3 A A A A, 3 4 3 ad geeral (,,3,) A We ca use the explct ormula or A derved above to get: whch gves + 5 a b a b 4( ) ( ) a b a b ( ) Ths ca be rewrtte as ( ( a b ) + a 5 b ) ( a ( + a) b ( +b) ) ; ad 5 [ (+ 5) (3 + 5) ( 5) (3 5) ] 5 Ths s ot a very smple ormula; partcular, t gves the teger terms o rratoal quattes such as 5 But, or large values o, t s a useul way to get, at least approxmately; the orgal recursve ormula requres perormg addtos to arrve at A smlar method wll apply to ay recurrece relato x a x + a x + + a x + + + 0 provded a certa matrx has dstct egevalues; see problem [] below 3

[] ) Cosder the matrces 3 A 3 3, 0 0 0 B 0 0 Gve ormulas or A ad B or a geeral postve teger ) Cosder the ollowg recurrece relato: x 6x x + 6 (3) + 3 + + x Ths dees a sequece x, x, x3, x4, x5, x 6, whch the rst three terms x, x, x 3 are uspeced, ad every other term s gve by the ormula (3) terms o the three prevous terms Use the method appled above or the Fboacc sequece, ad gve a explct ormula or x, vald or 4, terms o x, x, x 3 (The result wll be smpler tha the oe or the Fboacc sequece) roots 3) Let ( λ) λ a λ a λ a 0 be a polyomal, wth λ, λ, λ Cosder the recurrece relato dstct x a x + a x + + a x (4) + + + 0 Prove that a) or every,,, the sequece x, x λ, x ( λ), s a soluto to the recurrece equato (4) ; ad b) or every sequece { x },, satsyg (4), we have costats c, c, c such that x c λ c λ c ( ) + ( ) + + ( λ ) (5) or all,, (I other words, (5) gves the geeral soluto or (4) ) c) Prove that the characterstc polyomal o the matrx 4

0 0 0 0 0 0 A 0 0 0 0 0 a0 a a a s the gve polyomal ( λ) λ a λ a λ a 0 Ht: c) ca be show drectly, or by rst showg that the vector egevector o A or the egevalue 0 Λ ( λ) ( λ ) λ The asserto s true or ay polyomal λ s a ( λ) λ a λ a λ a, wthout assumg that t has dstct roots d) Use the result b) to derve the explct ormula or the geeral term o the Fboacc sequece dscussed above; ad also or the problem part ) 4) Let A ( ) a j be a upper tragular matrx: a j 0 wheever > j, ad also assume that the dagoal elemets are all the same: a a or all Prove that A s ever dagoalzable uless t s already dagoal: a j 0 wheever j (Ths at least tells us that there are may o-dagoalzable matrces!) [] Gve the geeral real soluto o each o the ollowg systems o deretal equatos: ) A ) B 3) C 5

3 0 4 3 0 Here, A ad B are the matrces gve [] ); ad C 0 0 0 x (O course, ) ad ), s a 3-vector y, o uctos o t : z x xt (), y yt (), z z() t ; ad 3), x y ; x xt (), y yt (), z zt (), w wt ()) z w [3] ) Determe the geeral real soluto o the ollowg system o secod order deretal equatos: x x+ y, y 4x y (6) x ) Fd a soluto y x(0) x(0) y(0) y(0) o the system (6) that satses the tal codtos [4] For all parts ) to 4), A s a (real) symmetrc matrx, wth (ot ecessarly dstct) egevalues λ, λ,, λ, wth correspodg orthogoal system o egevectors P, P, P ) Prove that A ( ), P P λ PP, (O course,, Y deotes the dot-product tr Y ) ) Suppose that each λ 0 Prove that 6

, P ( A ( ) P λ PP, ) 3) Assume that λ > or all,, Prove that or every o-zero vector we have that < A 4) Assume that there s such that λ ad there s j such that λ Prove that there s a o-zero vector such that A j 5) For the matrx A, d a o-zero vector A such that 7