Compressive sampling and dynamic mode decomposition Steven L. Brunton1, Joshua L. Proctor2, J. Nathan Kutz1 , Journal of Computational Dynamics, Submitted.

Slides:



Advertisements
Similar presentations
3D Geometry for Computer Graphics
Advertisements

Differential Equations
Lect.3 Modeling in The Time Domain Basil Hamed
Analysis of the time-varying cortical neural connectivity in the newborn EEG: a time-frequency approach Amir Omidvarnia, Mostefa Mesbah, John M. O’Toole,
Principal Component Analysis Based on L1-Norm Maximization Nojun Kwak IEEE Transactions on Pattern Analysis and Machine Intelligence, 2008.
Compressive Sensing IT530, Lecture Notes.
Color Imaging Analysis of Spatio-chromatic Decorrelation for Colour Image Reconstruction Mark S. Drew and Steven Bergner
Slide 1 Bayesian Model Fusion: Large-Scale Performance Modeling of Analog and Mixed- Signal Circuits by Reusing Early-Stage Data Fa Wang*, Wangyang Zhang*,
ECE 8443 – Pattern Recognition ECE 3163 – Signals and Systems Objectives: Review Resources: Wiki: State Variables YMZ: State Variable Technique Wiki: Controllability.
More MR Fingerprinting
Solving Dynamic Stochastic General Equilibrium Models Eric Zwick ’07 Swarthmore College, Department of Mathematics & Statistics References Boyd and Smith.
Principal Component Analysis CMPUT 466/551 Nilanjan Ray.
Petroleum Reservoir Management Based on Approximate Dynamic Programming Zheng Wen, Benjamin Van Roy, Louis Durlofsky and Khalid Aziz Smart Field Consortium,
example: four masses on springs
Prénom Nom Document Analysis: Data Analysis and Clustering Prof. Rolf Ingold, University of Fribourg Master course, spring semester 2008.
Real-time Combined 2D+3D Active Appearance Models Jing Xiao, Simon Baker,Iain Matthew, and Takeo Kanade CVPR 2004 Presented by Pat Chan 23/11/2004.
Dynamical Systems Tools for Ocean Studies: Chaotic Advection versus Turbulence Reza Malek-Madani.
3D Geometry for Computer Graphics
Modal Testing and Analysis
Nonlinear Dimensionality Reduction by Locally Linear Embedding Sam T. Roweis and Lawrence K. Saul Reference: "Nonlinear dimensionality reduction by locally.
MATH 685/ CSI 700/ OR 682 Lecture Notes Lecture 6. Eigenvalue problems.
CS 485/685 Computer Vision Face Recognition Using Principal Components Analysis (PCA) M. Turk, A. Pentland, "Eigenfaces for Recognition", Journal of Cognitive.
Linear Algebra and Image Processing
Reduced-order modeling of stochastic transport processes Materials Process Design and Control Laboratory Swagato Acharjee and Nicholas Zabaras Materials.
Empirical Modeling Dongsup Kim Department of Biosystems, KAIST Fall, 2004.
Summarized by Soo-Jin Kim
NUS CS5247 A dimensionality reduction approach to modeling protein flexibility By, By Miguel L. Teodoro, George N. Phillips J* and Lydia E. Kavraki Rice.
Autumn 2008 EEE8013 Revision lecture 1 Ordinary Differential Equations.
Machine Learning CUNY Graduate Center Lecture 3: Linear Regression.
Algorithms for a large sparse nonlinear eigenvalue problem Yusaku Yamamoto Dept. of Computational Science & Engineering Nagoya University.
Cs: compressed sensing
1 Recognition by Appearance Appearance-based recognition is a competing paradigm to features and alignment. No features are extracted! Images are represented.
Scalable Symbolic Model Order Reduction Yiyu Shi*, Lei He* and C. J. Richard Shi + *Electrical Engineering Department, UCLA + Electrical Engineering Department,
© 2011 Autodesk Freely licensed for use by educational institutions. Reuse and changes require a note indicating that content has been modified from the.
Progress in identification of damping: Energy-based method with incomplete and noisy data Marco Prandina University of Liverpool.
Hanjo Lim School of Electrical & Computer Engineering Lecture 2. Basic Theory of PhCs : EM waves in mixed dielectric.
Solution of a Partial Differential Equations using the Method of Lines
1 Reduced-Order Modeling in the Frequency Domain for Actuated Flows Guy Ben-Dov* and Arne J. Pearlstein Department of Mechanical Science and Engineering.
Motivation Thus far we have dealt primarily with the input/output characteristics of linear systems. State variable, or state space, representations describe.
Feedback Control Systems (FCS) Dr. Imtiaz Hussain URL :
Linear Subspace Transforms PCA, Karhunen- Loeve, Hotelling C306, 2000.
Reduces time complexity: Less computation Reduces space complexity: Less parameters Simpler models are more robust on small datasets More interpretable;
Z bigniew Leonowicz, Wroclaw University of Technology Z bigniew Leonowicz, Wroclaw University of Technology, Poland XXIX  IC-SPETO.
Lecture 7: State-Space Modeling 1.Introduction to state-space modeling Definitions How it relates to other modeling formalisms 2.State-space examples 3.Transforming.
Bypass transition in thermoacoustics (Triggering) IIIT Pune & Idea Research, 3 rd Jan 2011 Matthew Juniper Engineering Department,
Spectrum Sensing In Cognitive Radio Networks
STATIC ANALYSIS OF UNCERTAIN STRUCTURES USING INTERVAL EIGENVALUE DECOMPOSITION Mehdi Modares Tufts University Robert L. Mullen Case Western Reserve University.
Value Function Approximation with Diffusion Wavelets and Laplacian Eigenfunctions by S. Mahadevan & M. Maggioni Discussion led by Qi An ECE, Duke University.
ECE 530 – Analysis Techniques for Large-Scale Electrical Systems Prof. Hao Zhu Dept. of Electrical and Computer Engineering University of Illinois at Urbana-Champaign.
MA237: Linear Algebra I Chapters 1 and 2: What have we learned?
Lecture XXVII. Orthonormal Bases and Projections Suppose that a set of vectors {x 1,…,x r } for a basis for some space S in R m space such that r  m.
Lectures 15: Principal Component Analysis (PCA) and
Compressive Coded Aperture Video Reconstruction
Data-driven approaches to dynamical networks: Integrating equation-free methods, machine learning and sparsity J. Nathan Kutz Department of Applied Mathematics.
OSE801 Engineering System Identification Spring 2010
9.3 Filtered delay embeddings
Blair Ebeling MATH441: Spring 2017
Spectral Methods Tutorial 6 1 © Maks Ovsjanikov
LOCATION AND IDENTIFICATION OF DAMPING PARAMETERS
Topics in Phase-Space Jeffrey Eldred
Digital Control Systems (DCS)
Digital Control Systems (DCS)
Multivariate Analysis: Theory and Geometric Interpretation
Filtering and State Estimation: Basic Concepts
Matrix Algebra and Random Vectors
Generally Discriminant Analysis
INFONET Seminar Application Group
ECE 576 POWER SYSTEM DYNAMICS AND STABILITY
Steven L. Brunton, Joshua L. Proctor, J. Nathan Kutz
Outline Sparse Reconstruction RIP Condition
Presentation transcript:

Compressive sampling and dynamic mode decomposition Steven L. Brunton1, Joshua L. Proctor2, J. Nathan Kutz1 , Journal of Computational Dynamics, Submitted in DEC,2013.

Dynamic Mode Decomposition Fluid simulation is very important in engineering. in that most fluid mechanical systems of interest are described by the same governing equations: the Navier–Stokes equations. Unfortunately, the Navier–Stokes equations are a set of nonlinear partial differential equations that give rise to all manner of dynamics, including those characterized by bifurcations, limit cycles, resonances, and full-blown turbulence. In some cases, It’s difficult to find analytic solutions. This forces people to rely on experiments and high-performance computations when studying such systems.  Motivation

Dynamic Mode Decomposition As experiments and computations become more advanced, they generate ever increasing amounts of data. Manipulating such data to find anything but the most obvious trends requires a skillset all its own. This has led to a growing need for data-driven methods that can take a dataset and characterize it in meaningful ways with minimal guidance.  Motivation

Dynamic Mode Decomposition Many in fluid mechanics have turned to modal decomposition as the tool of choice for data-driven analysis. It is a powerful new technique introduced in the fluid dynamics community to isolate spatially coherent modes that oscillate at a fixed frequency. Generally, a modal decomposition takes a set of data and from it computes a set of modes, or characteristic features. The meaning of the modes depends on the particular type of decomposition used. However, in all cases, the hope is that the modes identify features of the data that elucidate the underlying physics.  Definition

Dynamic Mode Decomposition DMD is a modal decomposition developed specifically for analyzing the dynamics of nonlinearly evolving fluid flows. It was first introduced in Proper orthogonal decomposition (POD), perhaps the most common modal decomposition in the fluids community. but the POD modes are not necessarily optimal for modeling those dynamics. For instance, when analyzing a time-series, the POD modes remain unchanged if the data are reordered; the modes do not depend on the time evolution/dynamics encoded in the data.  Difference between traditional methods

Dynamic Mode Decomposition The DMD is a data-driven and equation-free method that applies equally well to data from experiments or simulations. An underlying principle is that even if the data is high-dimensional, it may be described by a low dimensional attractor subspace defined by a few coherent structures. DMD not only provides modes, but also a linear model for how the modes evolve n time.  features of DMD

Compressive Sampling and DMD This Paper deviates from the prior studies combining compressive sampling and DMD, in that we utilize sparsity of the spatial coherent structures to reconstruct full-state DMD modes from few measurements. The resulting DMD eigenvalues are equal to DMD eigenvalues from the full-state data. It is then possible to reconstruct full-state DMD eigenvectors using l 1 minimization.  Main contribution

Consider the following data snapshot matrices:  Compute DMD

 Compressive sampling The theory of compressive sampling suggests that instead of measuring the high-dimensional signal x and then compressing, it is possible to measure a low-dimensional subsample or random projection of the data and then directly solve for the few non- zero coefficients in the transform basis. C is the measurement matrix. If x is sparse, then we would like to solve the underdetermined system of equations

 Compressive DMD This paper establish basic connections between the DMD on full- state and projected data. These connections facilitate the two main applied results of this work:  It is possible to compute DMD on projected data and reconstruct full-state DMD modes through compressive sampling  If full-state measurements are available, it is advantageous to compress the data, compute the projected DMD, and then compute full-state DMD modes by linearly combining snapshots according to the projected DMD transforms.

 Compressive DMD

Invariance of DMD to unitary transformations

 Compressive DMD Various approaches and algorithms Compressed DMD Compressive sampling DMD

 Experiments Double gyre flow

 Experiments Double gyre flow

 Experiments Double gyre flow

 Experiments Flow around a cylinder

 Experiments Flow around a cylinder