1 Spring 2003 Prof. Tim Warburton MA557/MA578/CS557 Lecture 13.

Slides:



Advertisements
Similar presentations
Polynomial Inequalities in One Variable
Advertisements

Numerical Methods for Partial Differential Equations CAAM 452 Spring 2005 Lecture 9 Instructor: Tim Warburton.
Chapter 28 – Part II Matrix Operations. Gaussian elimination Gaussian elimination LU factorization LU factorization Gaussian elimination with partial.
Scientific Computing QR Factorization Part 2 – Algorithm to Find Eigenvalues.
1 Spring 2003 Prof. Tim Warburton MA557/MA578/CS557 Lecture 29.
6.1 Eigenvalues and Diagonalization. Definitions A is n x n. is an eigenvalue of A if AX = X has non zero solutions X (called eigenvectors) If is an eigenvalue.
Lecture 17 Introduction to Eigenvalue Problems
Eigenvalues and Eigenvectors
Prof. David R. Jackson ECE Dept. Spring 2014 Notes 30 ECE
1cs542g-term High Dimensional Data  So far we’ve considered scalar data values f i (or interpolated/approximated each component of vector values.
Determinants Bases, linear Indep., etc Gram-Schmidt Eigenvalue and Eigenvectors Misc
Symmetric Matrices and Quadratic Forms
Weak Formulation ( variational formulation)
Chapter 3 Determinants and Matrices
NUU Department of Electrical Engineering Linear Algebra---Meiling CHEN1 Lecture 28 is positive definite Similar matrices Jordan form.
Boot Camp in Linear Algebra Joel Barajas Karla L Caballero University of California Silicon Valley Center October 8th, 2008.
1cs542g-term Notes  Extra class next week (Oct 12, not this Friday)  To submit your assignment: me the URL of a page containing (links to)
Matrices CS485/685 Computer Vision Dr. George Bebis.
Numerical Methods for Partial Differential Equations CAAM 452 Spring 2005 Lecture 6 Various Finite Difference Discretizations for the Advection Equations.
1 Statistical Analysis Professor Lynne Stokes Department of Statistical Science Lecture 5QF Introduction to Vector and Matrix Operations Needed for the.
Pseudospectral Methods
Linear Algebra Review 1 CS479/679 Pattern Recognition Dr. George Bebis.
1 February 24 Matrices 3.2 Matrices; Row reduction Standard form of a set of linear equations: Chapter 3 Linear Algebra Matrix of coefficients: Augmented.
1 MAC 2103 Module 12 Eigenvalues and Eigenvectors.
1 MA557/MA578/CS557 Numerical Partial Differential Equations Spring 2002 Prof. Tim Warburton
Eigenvalues and Eigenvectors
1 Spring 2003 Prof. Tim Warburton MA557/MA578/CS557 Lecture 5a.
1 Spring 2003 Prof. Tim Warburton MA557/MA578/CS557 Lecture 21.
SVD: Singular Value Decomposition
Linear algebra: matrix Eigen-value Problems
1 Spring 2003 Prof. Tim Warburton MA557/MA578/CS557 Lecture 31.
1 Spring 2003 Prof. Tim Warburton MA557/MA578/CS557 Lecture 8.
Computing Eigen Information for Small Matrices The eigen equation can be rearranged as follows: Ax = x  Ax = I n x  Ax - I n x = 0  (A - I n )x = 0.
6. Introduction to Spectral method. Finite difference method – approximate a function locally using lower order interpolating polynomials. Spectral method.
Linear algebra: matrix Eigen-value Problems Eng. Hassan S. Migdadi Part 1.
Eigenvectors and Linear Transformations Recall the definition of similar matrices: Let A and C be n  n matrices. We say that A is similar to C in case.
12/1/ Trapezoidal Rule of Integration Civil Engineering Majors Authors: Autar Kaw, Charlie Barker
Elementary Linear Algebra Anton & Rorres, 9 th Edition Lecture Set – 07 Chapter 7: Eigenvalues, Eigenvectors.
1 Spring 2003 Prof. Tim Warburton MA557/MA578/CS557 Lecture 24.
1 Spring 2003 Prof. Tim Warburton MA557/MA578/CS557 Lecture 23.
Lecture 17 - Approximation Methods CVEN 302 July 17, 2002.
Signal & Weight Vector Spaces
3.Spherical Tensors Spherical tensors : Objects that transform like 2 nd tensors under rotations.  {Y l m ; m =  l, …, l } is a (2l+1)-D basis for (irreducible)
Stats & Summary. The Woodbury Theorem where the inverses.
1 Spring 2003 Prof. Tim Warburton MA557/MA578/CS557 Lecture 17.
Instructor: Mircea Nicolescu Lecture 8 CS 485 / 685 Computer Vision.
1 Spring 2003 Prof. Tim Warburton MA557/MA578/CS557 Lecture 19.
1 Spring 2003 Prof. Tim Warburton MA557/MA578/CS557 Lecture 25.
1 Spring 2003 Prof. Tim Warburton MA557/MA578/CS557 Lecture 32.
1 Spring 2003 Prof. Tim Warburton MA557/MA578/CS557 Lecture 28.
Boot Camp in Linear Algebra TIM 209 Prof. Ram Akella.
ALGEBRAIC EIGEN VALUE PROBLEMS
Review of Eigenvectors and Eigenvalues from CliffsNotes Online mining-the-Eigenvectors-of-a- Matrix.topicArticleId-20807,articleId-
Characteristic Polynomial Hung-yi Lee. Outline Last lecture: Given eigenvalues, we know how to find eigenvectors or eigenspaces Check eigenvalues This.
Tutorial 6. Eigenvalues & Eigenvectors Reminder: Eigenvectors A vector x invariant up to a scaling by λ to a multiplication by matrix A is called.
Lecture 4 Complex numbers, matrix algebra, and partial derivatives
Review of Eigenvectors and Eigenvalues
Finding the Inverse of a Matrix
Markov Chains Mixing Times Lecture 5
Systems of Inequalities
CS485/685 Computer Vision Dr. George Bebis
Polynomial and Rational Inequalities
Chapter 3 Linear Algebra
  CW: Pg (27, 31, 33, 43, 47, 48, 69, 73, 77, 79, 83, 85, 87, 89)
Symmetric Matrices and Quadratic Forms
Maths for Signals and Systems Linear Algebra in Engineering Lectures 13 – 14, Tuesday 8th November 2016 DR TANIA STATHAKI READER (ASSOCIATE PROFFESOR)
Eigenvalues and Eigenvectors
Subject :- Applied Mathematics
Eigenvalues and Eigenvectors
Symmetric Matrices and Quadratic Forms
Presentation transcript:

1 Spring 2003 Prof. Tim Warburton MA557/MA578/CS557 Lecture 13

2 Recall Notation

3 Inverse Trace Inequality The following inverse trace inequality will be useful:

4 Orthonormal Basis We can scale each Legendre polynomial so that the integral of their square is unity:

5 Proof of Inverse Trace Inequality First we note that:

6 Proof cont Note that: So F~ is a rank one, symmetric, matrix with non-zero eigenvalue and eigenvector:

7 Proof cont So: By the orthonormality of the scaled Legendre polynomials. QED

8 Extension to a General Interval Now consider the interval [a,b] then a simple scaling argument gives:

9 Useful Paper Check out :

10 Back To DG Analysis We are now going to check to see how well DG propagates waves. The following is taken from –S.J.Sherwin, “Dispersion Analysis of the Continuous and Discontinuous Galerkin Formulations”, from “Discontinuous Galerkin Methods: Theory, Computation and Applications”, Ed.s, B.Cockburn, G.Em Karniadakis and C.-W. Shu, Lecture Notes in Computational Science and Engineering, Springer 2000.

11 In Matrix Notation For a 4 cell case with periodicity the matrix system looks like:

12 DG Phase Analysis So let’s seek solutions of the form: For periodicity

13 Plug in.. Here we have a generalized eigenvalue problem for theta since we know D,M,F,G Dimension of the matrix is (p+1)x(p+1)

14 P=0 DG Phase Analysis

15 What does this mean In the j’th cell: The solution looks like: rho(omega*(t-u*x) + dissipation error + phase error)

16 Interpretation 1) The analysis points out that the numerical waves do not travel with speed ubar dispersion 2) The waves decay in time (dissipation) dissipationdispersion

17 Homework 5 1)Find the analytic values of the multiple roots of the matrix for p=0,1,2 with 2)For each p=0,1,2 plot the graphs of each of the solutions 3) Compute the analytic first and second order “error terms” for the phase/dissipation for p=1

18 Homework 5 cont USE Mathematica, Maple or similar to compute the possible multiple analytic eigenvalues Due Friday 02/21/03 DO NOT SPEND 30 HOURS ON THIS. SPEND NO MORE THAN 3 HOURS MAX