|
Posted: 09/27/21
Due: 10/11/21, 11:55PM (first draft, comments will be returned, revision due on 10/18)
This is a continuation of Project 1, but instead of coarse-graining of nearest neighbors, a reduced description is sought in the eigenbasis of the stiffness matrix. Consider the non-dissipative dynamical system
(1) |
In (1), are the time-dependent coordinates of the unit point mass system, the forces acting on the system, and is the stiffness matrix.
Solutions are sought for of the form
leading to the eigenproblem
As in Project 1, consider a linear force-displacement dependence , leading to symmetric.
For , find the eigenvalues of through the Julia eigvals() function, and plot the set .
Superimpose in one plot the five eigenvectors of that correspond to the largest eigenvalues and the five eigenvectors that correspond to the smallest eigenvalues. Use the Julia eigenvec() function. Each eigenvector is to be plotted as a line graph of with the component of the eigenvector. Comment on what you observe.
Carry out model reduction by choosing a basis set formed from eigenvectors. In matrix form the eigenproblem is stated as . Assume that eigenvectors are ordered . Let denote the first columns of . Introduce the model reduction
Plot the first five eigenvectors of . How do these compare with the the eigenvectors of ?
Compare the eigenmode model reduction with coarse graining from Project 1. Which is more accurate? Carefully consider which theoretical concepts from linear algebra can be used to assess accuracy of one model versus another.
Read [1]. Write a short summary of the approach to reduced model construction based on greedy algorithms.
Jan S. Hesthaven, Benjamin Stamm, and Shun Zhang. Efficient Greedy Algorithms for High-Dimensional Parameter Spaces with Applications to Empirical Interpolation and Reduced Basis Methods. Esaim-Mathematical Modelling and Numerical Analysis-Modelisation Mathematique Et Analyse Numerique, 48(1):259–283, jan 2014. Place: Les Ulis Cedex A Publisher: Edp Sciences S A WOS:000330121800010.