Worst-Case Gust Prediction through Surrogate Models applied to SVD-reduced Gust Databases

Size: px
Start display at page:

Download "Worst-Case Gust Prediction through Surrogate Models applied to SVD-reduced Gust Databases"

Transcription

1 Worst-Case Gust Prediction through Surrogate Models applied to SVD-reduced Gust Databases EngD Student: Supervisors: Simone Simeone T. Rendall and J. E. Cooper DiPaRT

2 Motivation Certification specifications require that enough points, on or within the boundary of the design envelope, are investigated to ensure that the most extreme loads for each part of the aircraft structure are identified. The flight conditions and manoeuvres, which provide the largest aircraft loads, are not known a- priori but Gusts are often the most critical load case for structural design Gusts are the main fatigue loading source for the majority of the structure Hence, worst-case gusts need to be somehow identified DiPaRT

3 Background Source: Calculating time-correlated gust loads using matched filter and random process theories, A.S. Pototzky et al., AIAA Journal of Aircraft, Vol. 28, No. 5. Source: Determining Worst-Case Gust Loads on Aircraft Structures Using an Evolutionary Algorithm, Karr, Zeiler and Mehrotra, Applied Intelligence 20, , Source: Rapid Prediction of Worst Case Gust Loads, H.H. Khodaparast et al., AIAA DiPaRT

4 Contents Objectives Methodology Singular Value Decomposition Surrogate model and optimisation Application Gust database Aircraft model Preliminary Results Concluding Remarks & Future Work DiPaRT

5 Objectives To apply the singular value decomposition technique to decompose a gust matrix built over n reconstructed gust profiles To construct a surrogate model that associates the weighing coefficients of the SVD to the max and min values of the aircraft gust response To use the surrogate model into an optimisation framework to find out the combination of coefficients that generates the worst case gust DiPaRT

6 Methodology Overview W g U L L L Z g Gust time histories Coefficients that define each gust time history Reduced set of characteristic gust shapes (fixed!) A/C response to gusts in the form of time histories Surrogate Model ധZ g The SVD technique is used to decompose the gust matrix W g into a coefficient matrix and a subset of characteristic gust shapes A surrogate model is built on a training set where for each combination of coefficients correspond the max and min value of the A/C response The surrogate model is then used within an optimisation framework to find out which combination of coefficients maximise the response (e.g. bending moment, displacement, lift, etc.) The resulting coefficients are finally multiplied by the fixed set of characteristic shapes to find out what makes the worst case gust DiPaRT

7 Methodology Singular Value Decomposition (1/2) Singular Value Decomposition (SVD) is a matrix decomposition technique that can be used to identify trends, patterns or consistencies effectively and is widely used in many engineering fields It was recently used in a work between AIRBUS and Queen s University Belfast to obtain a concise representation of characteristic loads cases (S.H.M. McGuinness, 2011) Less than 50 SVD-derived loads were used to reconstruct the full A350 XWB loads envelope (M. Hockenhull, 2010) SVD was also used in conjunction with surrogate models to enable a fast computation of correlated loads envelopes in systems where the effects of variation of design parameters need to be considered (I. Tartaruga et al., 2016) The approach was also extended to efficiently quantify the effects of uncertainty in the system parameters DiPaRT

8 Methodology Singular Value Decomposition (2/2) W = U Σ V T W = m n (m m)(m n)(n n) W is the gust matrix, Σ is a diagonal matrix that contains on its diagonal the non-negative singular values and U and V are orthogonal matrices that contain singular vectors m is the number of gust events, n is the number of time steps (i.e. length of time histories) An approximation can be built such that: T W U L L where L = Σ L V L L is a matrix of characteristic gust shapes constructed over a reduced set of k singular values (i.e. first non-negligible terms of Σ) The U L matrix contains the coefficients needed to superimpose these characteristic gust shapes to reconstruct the original set DiPaRT m n, n m

9 Methodology Surrogate Model Surrogate models are defined as analytical models that approximate the input/output behaviour of a complex system They are constructed over a reduced set of training data that is obtained by running expensive simulations at particular points of interest in the design space Here, a surrogate model is constructed to associate each singular vector of the SVD-reduced U L matrix to the maxima and minima values of the aircraft response of interest (accelerations, bending moments, torque, shear, etc.) k inputs Input U L Output ധZ g (m (m k) Surrogate Model 2) 2 outputs The construction is carried out by an automatic algorithm* that selects the most suitable modelling technique available (e.g. Kriging or GP based methods, Neural Networks, Regression Tree, Polynomial RBFs and others) for the considered training dataset DiPaRT *Datadvance MACROS Generic Toolkit

10 Methodology Optimisation The design variables of the optimisation are the coefficients of the SVD-reduced matrix U L and the aim of the objective function is to maximise the aircraft response Generate new set of parameters Input new parameters to Surrogate Model Execute Surrogate Model no Objective reached? yes Evaluate Objective Function min ധZ g U L Multiply parameters by characteristic gust shapes U L L Worst Case Gust DiPaRT

11 Application DiPaRT

12 Gust Database Von Karman spectrum Φ Ω = σ w 2 L π LΩ LΩ y n t = m=1 Φ ω m Δω cos(ω m t + Ψ m ) 200 Hanning Window DiPaRT

13 Aircraft Model FFAST using RFA for GAF matrices A/C Parameters: mass t span = m chord = m U = m/s M = alt = 7,620 m ω 2 ഥM ሚξ + iωഥd i ሚξ + ഥK i ሚξ = Q e + F Aero F Aero = q dyn Q hh M, k ሚξ h + Q hx M, k ሚδ x + Q hg M, k w g N Poles Q i, j k, M Q 0 + ikq 1 + ik 2 Q 2 + l=1 ik ik + b l, b l = k max l Nodal displacements, velocities, accelerations and loads max & min DiPaRT

14 Preliminary Results SVD of gust matrix W g = U Σ V T ( )( ) W g U L L ( ) L = Σ L V L T (50 50)( ) Notice: σ diag(σ L ) σ diag(σ) = 69.4% DiPaRT

15 Preliminary Results Surrogate model Input U L (200 (200 2) 50) Surrogate Model Surrogate model dimensions: [200 52] Effective input size: 50 Effective output size: 2 Output നN z RMSE = σ i=1 m y i y 2 i m MAX = max y i y i, i = 1,, m RMSE = MAX = Total number of samples: 200 Training algorithm: High Dimensional Approximation with Gaussian Process (MACROS GT Approx) RMSE = MAX = DiPaRT

16 Preliminary Results Optimisation min U L നN z നN z = max min N z, max N z Find the highest possible acceleration obtainable by an arbitrary gust profile of constrained max and min amplitude m/s U L L 100.0m/s Optimisation algorithm: Sequential quadratic constrained programming (SQ 2 P) DiPaRT

17 Preliminary Results Worst-Case gust DiPaRT

18 Preliminary Results A/C Response to Worst-Case gust ~ 2.45g increment DiPaRT

19 Concluding Remarks & Future Work SVD has successfully been applied to a large matrix of gust profiles constructed over a range of Von Karman profiles approximated in time A subset of ¼ of the total number of singular values has been used to construct an approximation of the gust matrix The approximation was necessary to reduce the dimensions of the problem A surrogate model has been successfully built over a training dataset of 200 samples with 50 inputs (coefficients that multiply the characteristic gust shapes) and 2 outputs (max and min acceleration response at the A/C c.g.) The surrogate model has been successfully used within an optimisation framework to find out the combination of coefficients that generates the worst A/C response Extend this approach to cover the entire design space with the aid of an additional surrogate model Apply SVD to a database of gust profiles reconstructed from real events (i.e. using data from flight data recorders) DiPaRT

20 Thank you for your attention! Questions? The Industrial Doctorate Centre in Systems, EPSRC and Airbus are gratefully acknowledged. DiPaRT

21 Back-up slides DiPaRT

22 SVD for gusts? W = U Σ V T m n = (m m)(m n)(n n) W is the gust matrix m is the number of gust events n is the number of time steps (i.e. length of time histories) must be equal for all events An approximation can be built such that: W U L L where L = Σ L V L T Here, L is a matrix of characteristic gust shapes constructed over a reduced set of n singular values (i.e. first non-negligible terms of Σ) The U L matrix contains the coefficients needed to superimpose these characteristic gust shapes to reconstruct the original set 22 11th August 2017 SVD for gust - Overview

23 Use of SVD to determine worst case gust sequence (1/3) Assume that gust time histories are all the same length Start at the same point and append zeros if necessary Set up matrix of input time histories A = m n, n m Perform skinny SVD (may have to transpose everything to work with SVD(A, φ) command) Truncate (p) from singular values so that: A = U Σ V T m m m n n n A ഥU ഥΣ ഥV T m p p p p n ഥU L Basis of inputs Scaling to get particular gust inputs An example follows in the next slide 23 11th August 2017 SVD for gust - Overview

24 Use of SVD to determine worst case gust sequence (2/3) W g = U Σ V T = ( )( )( ) If only a relatively small number of singular values (Σ) are non-zero and non-negligible, then this reduced set can be used to recreate the W g matrix For example, if only the first 50 values of the set above are non-zero and non-negligible, an approximation of the W g matrix can be obtained using only these 50 singular values i.e. W g U L Σ L V L T (500 50)(50 50)( ) This is the same as setting all the negligible terms of Σ equal to 0 As a result, for gust shapes, the matrix W g = L 1,1 L 1,n T can be written as W g U L L where L = Σ L V L L m,1 L m,n The L matrix is thus a matrix of characteristic shapes as each row is analogous to a gust shape The U L matrix contains the coefficients needed to superimpose these characteristic shapes to reconstruct the original set The characteristic shapes can be extracted by choosing the first k singular values 24 11th August 2017 SVD for gust - Overview

25 Surrogate Model - Decision Tree 25 11th August 2017 SVD for gust - Overview

Lecture 6. Numerical methods. Approximation of functions

Lecture 6. Numerical methods. Approximation of functions Lecture 6 Numerical methods Approximation of functions Lecture 6 OUTLINE 1. Approximation and interpolation 2. Least-square method basis functions design matrix residual weighted least squares normal equation

More information

Towards Reduced Order Modeling (ROM) for Gust Simulations

Towards Reduced Order Modeling (ROM) for Gust Simulations Towards Reduced Order Modeling (ROM) for Gust Simulations S. Görtz, M. Ripepi DLR, Institute of Aerodynamics and Flow Technology, Braunschweig, Germany Deutscher Luft und Raumfahrtkongress 2017 5. 7. September

More information

University of Bristol - Explore Bristol Research. Peer reviewed version. Link to published version (if available): /j.ast

University of Bristol - Explore Bristol Research. Peer reviewed version. Link to published version (if available): /j.ast Castellani, M., Lemmens, Y., & Cooper, J. E. (6). Parametric reduced order model approach for rapid dynamic loads prediction. Aerospace Science and Technology, 5, 9-4. https://doi.org/.6/j.ast.6..5 Peer

More information

Linear Algebra Review. Vectors

Linear Algebra Review. Vectors Linear Algebra Review 9/4/7 Linear Algebra Review By Tim K. Marks UCSD Borrows heavily from: Jana Kosecka http://cs.gmu.edu/~kosecka/cs682.html Virginia de Sa (UCSD) Cogsci 8F Linear Algebra review Vectors

More information

Linear Algebra (Review) Volker Tresp 2018

Linear Algebra (Review) Volker Tresp 2018 Linear Algebra (Review) Volker Tresp 2018 1 Vectors k, M, N are scalars A one-dimensional array c is a column vector. Thus in two dimensions, ( ) c1 c = c 2 c i is the i-th component of c c T = (c 1, c

More information

A model order reduction technique for speeding up computational homogenisation

A model order reduction technique for speeding up computational homogenisation A model order reduction technique for speeding up computational homogenisation Olivier Goury, Pierre Kerfriden, Wing Kam Liu, Stéphane Bordas Cardiff University Outline Introduction Heterogeneous materials

More information

Uncertainty Quantification in Gust Loads Analysis of a Highly Flexible Aircraft Wing

Uncertainty Quantification in Gust Loads Analysis of a Highly Flexible Aircraft Wing Uncertainty Quantification in Gust Loads Analysis of a Highly Flexible Aircraft Wing IFASD 2017 25 th - 28 th June 2017, Como R. G. Cook, C. Wales, A. L. Gaitonde, D. P. Jones and Jonathan Cooper University

More information

Efficient Modelling of a Nonlinear Gust Loads Process for Uncertainty Quantification of Highly Flexible Aircraft

Efficient Modelling of a Nonlinear Gust Loads Process for Uncertainty Quantification of Highly Flexible Aircraft Efficient Modelling of a Nonlinear Gust Loads Process for Uncertainty Quantification of Highly Flexible Aircraft SciTech, 8 th -12 th January 2018 Kissimmee, Florida Robert Cook, Chris Wales, Ann Gaitonde,

More information

CS 231A Section 1: Linear Algebra & Probability Review

CS 231A Section 1: Linear Algebra & Probability Review CS 231A Section 1: Linear Algebra & Probability Review 1 Topics Support Vector Machines Boosting Viola-Jones face detector Linear Algebra Review Notation Operations & Properties Matrix Calculus Probability

More information

Machine learning for pervasive systems Classification in high-dimensional spaces

Machine learning for pervasive systems Classification in high-dimensional spaces Machine learning for pervasive systems Classification in high-dimensional spaces Department of Communications and Networking Aalto University, School of Electrical Engineering stephan.sigg@aalto.fi Version

More information

A beam reduction method for wing aeroelastic design optimisation with detailed stress constraints

A beam reduction method for wing aeroelastic design optimisation with detailed stress constraints A beam reduction method for wing aeroelastic design optimisation with detailed stress constraints O. Stodieck, J. E. Cooper, S. A. Neild, M. H. Lowenberg University of Bristol N.L. Iorga Airbus Operations

More information

A Blade Element Approach to Modeling Aerodynamic Flight of an Insect-scale Robot

A Blade Element Approach to Modeling Aerodynamic Flight of an Insect-scale Robot A Blade Element Approach to Modeling Aerodynamic Flight of an Insect-scale Robot Taylor S. Clawson, Sawyer B. Fuller Robert J. Wood, Silvia Ferrari American Control Conference Seattle, WA May 25, 2016

More information

Linear Algebra for Machine Learning. Sargur N. Srihari

Linear Algebra for Machine Learning. Sargur N. Srihari Linear Algebra for Machine Learning Sargur N. srihari@cedar.buffalo.edu 1 Overview Linear Algebra is based on continuous math rather than discrete math Computer scientists have little experience with it

More information

CS6964: Notes On Linear Systems

CS6964: Notes On Linear Systems CS6964: Notes On Linear Systems 1 Linear Systems Systems of equations that are linear in the unknowns are said to be linear systems For instance ax 1 + bx 2 dx 1 + ex 2 = c = f gives 2 equations and 2

More information

Aeroelastic Gust Response

Aeroelastic Gust Response Aeroelastic Gust Response Civil Transport Aircraft - xxx Presented By: Fausto Gill Di Vincenzo 04-06-2012 What is Aeroelasticity? Aeroelasticity studies the effect of aerodynamic loads on flexible structures,

More information

Aircraft Design I Tail loads

Aircraft Design I Tail loads Horizontal tail loads Aircraft Design I Tail loads What is the source of loads? How to compute it? What cases should be taken under consideration? Tail small wing but strongly deflected Linearized pressure

More information

Dynamic Response of an Aircraft to Atmospheric Turbulence Cissy Thomas Civil Engineering Dept, M.G university

Dynamic Response of an Aircraft to Atmospheric Turbulence Cissy Thomas Civil Engineering Dept, M.G university Dynamic Response of an Aircraft to Atmospheric Turbulence Cissy Thomas Civil Engineering Dept, M.G university cissyvp@gmail.com Jancy Rose K Scientist/Engineer,VSSC, Thiruvananthapuram, India R Neetha

More information

S. Freitag, B. T. Cao, J. Ninić & G. Meschke

S. Freitag, B. T. Cao, J. Ninić & G. Meschke SFB 837 Interaction Modeling Mechanized Tunneling S Freitag, B T Cao, J Ninić & G Meschke Institute for Structural Mechanics Ruhr University Bochum 1 Content 1 Motivation 2 Process-oriented FE model for

More information

Lecture: Face Recognition and Feature Reduction

Lecture: Face Recognition and Feature Reduction Lecture: Face Recognition and Feature Reduction Juan Carlos Niebles and Ranjay Krishna Stanford Vision and Learning Lab Lecture 11-1 Recap - Curse of dimensionality Assume 5000 points uniformly distributed

More information

CS 231A Section 1: Linear Algebra & Probability Review. Kevin Tang

CS 231A Section 1: Linear Algebra & Probability Review. Kevin Tang CS 231A Section 1: Linear Algebra & Probability Review Kevin Tang Kevin Tang Section 1-1 9/30/2011 Topics Support Vector Machines Boosting Viola Jones face detector Linear Algebra Review Notation Operations

More information

A New Trust Region Algorithm Using Radial Basis Function Models

A New Trust Region Algorithm Using Radial Basis Function Models A New Trust Region Algorithm Using Radial Basis Function Models Seppo Pulkkinen University of Turku Department of Mathematics July 14, 2010 Outline 1 Introduction 2 Background Taylor series approximations

More information

Assignment #10: Diagonalization of Symmetric Matrices, Quadratic Forms, Optimization, Singular Value Decomposition. Name:

Assignment #10: Diagonalization of Symmetric Matrices, Quadratic Forms, Optimization, Singular Value Decomposition. Name: Assignment #10: Diagonalization of Symmetric Matrices, Quadratic Forms, Optimization, Singular Value Decomposition Due date: Friday, May 4, 2018 (1:35pm) Name: Section Number Assignment #10: Diagonalization

More information

arxiv: v1 [cs.ce] 13 Nov 2018

arxiv: v1 [cs.ce] 13 Nov 2018 Prediction of Preliminary Maximum Wing Bending Moments under Discrete Gust arxiv:1811.06534v1 [cs.ce] 13 Nov 2018 Edouard Fournier 1,2,4, Stéphane Grihon 2, Christian Bes 3, and Thierry Klein 1,4 1 Institut

More information

Example: Face Detection

Example: Face Detection Announcements HW1 returned New attendance policy Face Recognition: Dimensionality Reduction On time: 1 point Five minutes or more late: 0.5 points Absent: 0 points Biometrics CSE 190 Lecture 14 CSE190,

More information

Linear Algebra (Review) Volker Tresp 2017

Linear Algebra (Review) Volker Tresp 2017 Linear Algebra (Review) Volker Tresp 2017 1 Vectors k is a scalar (a number) c is a column vector. Thus in two dimensions, c = ( c1 c 2 ) (Advanced: More precisely, a vector is defined in a vector space.

More information

CPSC 340: Machine Learning and Data Mining. More PCA Fall 2017

CPSC 340: Machine Learning and Data Mining. More PCA Fall 2017 CPSC 340: Machine Learning and Data Mining More PCA Fall 2017 Admin Assignment 4: Due Friday of next week. No class Monday due to holiday. There will be tutorials next week on MAP/PCA (except Monday).

More information

Computation. For QDA we need to calculate: Lets first consider the case that

Computation. For QDA we need to calculate: Lets first consider the case that Computation For QDA we need to calculate: δ (x) = 1 2 log( Σ ) 1 2 (x µ ) Σ 1 (x µ ) + log(π ) Lets first consider the case that Σ = I,. This is the case where each distribution is spherical, around the

More information

14 Singular Value Decomposition

14 Singular Value Decomposition 14 Singular Value Decomposition For any high-dimensional data analysis, one s first thought should often be: can I use an SVD? The singular value decomposition is an invaluable analysis tool for dealing

More information

Exercise 8: Frequency Response of MIMO Systems

Exercise 8: Frequency Response of MIMO Systems Exercise 8: Frequency Response of MIMO Systems 8 Singular Value Decomposition (SVD The Singular Value Decomposition plays a central role in MIMO frequency response analysis Let s recall some concepts from

More information

Karhunen-Loève Transform KLT. JanKees van der Poel D.Sc. Student, Mechanical Engineering

Karhunen-Loève Transform KLT. JanKees van der Poel D.Sc. Student, Mechanical Engineering Karhunen-Loève Transform KLT JanKees van der Poel D.Sc. Student, Mechanical Engineering Karhunen-Loève Transform Has many names cited in literature: Karhunen-Loève Transform (KLT); Karhunen-Loève Decomposition

More information

German Aerospace Center (DLR)

German Aerospace Center (DLR) German Aerospace Center (DLR) AEROGUST M30 Progress Meeting 23-24 November 2017, Bordeaux Presented by P. Bekemeryer / J. Nitzsche With contributions of C. Kaiser 1, S. Görtz 2, R. Heinrich 2, J. Nitzsche

More information

B553 Lecture 5: Matrix Algebra Review

B553 Lecture 5: Matrix Algebra Review B553 Lecture 5: Matrix Algebra Review Kris Hauser January 19, 2012 We have seen in prior lectures how vectors represent points in R n and gradients of functions. Matrices represent linear transformations

More information

CS 143 Linear Algebra Review

CS 143 Linear Algebra Review CS 143 Linear Algebra Review Stefan Roth September 29, 2003 Introductory Remarks This review does not aim at mathematical rigor very much, but instead at ease of understanding and conciseness. Please see

More information

MATH 590: Meshfree Methods

MATH 590: Meshfree Methods MATH 590: Meshfree Methods Chapter 34: Improving the Condition Number of the Interpolation Matrix Greg Fasshauer Department of Applied Mathematics Illinois Institute of Technology Fall 2010 fasshauer@iit.edu

More information

Image Registration Lecture 2: Vectors and Matrices

Image Registration Lecture 2: Vectors and Matrices Image Registration Lecture 2: Vectors and Matrices Prof. Charlene Tsai Lecture Overview Vectors Matrices Basics Orthogonal matrices Singular Value Decomposition (SVD) 2 1 Preliminary Comments Some of this

More information

Singular Value Decomposition

Singular Value Decomposition Singular Value Decomposition Motivatation The diagonalization theorem play a part in many interesting applications. Unfortunately not all matrices can be factored as A = PDP However a factorization A =

More information

Linear Models for Regression

Linear Models for Regression Linear Models for Regression CSE 4309 Machine Learning Vassilis Athitsos Computer Science and Engineering Department University of Texas at Arlington 1 The Regression Problem Training data: A set of input-output

More information

Numerical Methods for Inverse Kinematics

Numerical Methods for Inverse Kinematics Numerical Methods for Inverse Kinematics Niels Joubert, UC Berkeley, CS184 2008-11-25 Inverse Kinematics is used to pose models by specifying endpoints of segments rather than individual joint angles.

More information

Introduction PCA classic Generative models Beyond and summary. PCA, ICA and beyond

Introduction PCA classic Generative models Beyond and summary. PCA, ICA and beyond PCA, ICA and beyond Summer School on Manifold Learning in Image and Signal Analysis, August 17-21, 2009, Hven Technical University of Denmark (DTU) & University of Copenhagen (KU) August 18, 2009 Motivation

More information

Matrices, Vector Spaces, and Information Retrieval

Matrices, Vector Spaces, and Information Retrieval Matrices, Vector Spaces, and Information Authors: M. W. Berry and Z. Drmac and E. R. Jessup SIAM 1999: Society for Industrial and Applied Mathematics Speaker: Mattia Parigiani 1 Introduction Large volumes

More information

DS-GA 1002 Lecture notes 10 November 23, Linear models

DS-GA 1002 Lecture notes 10 November 23, Linear models DS-GA 2 Lecture notes November 23, 2 Linear functions Linear models A linear model encodes the assumption that two quantities are linearly related. Mathematically, this is characterized using linear functions.

More information

Kul Aircraft Structural Design (4 cr) Fatigue Analyses

Kul Aircraft Structural Design (4 cr) Fatigue Analyses Kul-34.4300 Aircraft Structural Design (4 cr) M Kanerva 2016 Objective and Contents of the Module The objective of the module is to describe (1) how aircraft fatigue analyses are performed and (2) how

More information

MATH 350: Introduction to Computational Mathematics

MATH 350: Introduction to Computational Mathematics MATH 350: Introduction to Computational Mathematics Chapter V: Least Squares Problems Greg Fasshauer Department of Applied Mathematics Illinois Institute of Technology Spring 2011 fasshauer@iit.edu MATH

More information

Lecture: Face Recognition and Feature Reduction

Lecture: Face Recognition and Feature Reduction Lecture: Face Recognition and Feature Reduction Juan Carlos Niebles and Ranjay Krishna Stanford Vision and Learning Lab 1 Recap - Curse of dimensionality Assume 5000 points uniformly distributed in the

More information

Matrix assembly by low rank tensor approximation

Matrix assembly by low rank tensor approximation Matrix assembly by low rank tensor approximation Felix Scholz 13.02.2017 References Angelos Mantzaflaris, Bert Juettler, Boris Khoromskij, and Ulrich Langer. Matrix generation in isogeometric analysis

More information

ANALYTICAL MATHEMATICS FOR APPLICATIONS 2018 LECTURE NOTES 3

ANALYTICAL MATHEMATICS FOR APPLICATIONS 2018 LECTURE NOTES 3 ANALYTICAL MATHEMATICS FOR APPLICATIONS 2018 LECTURE NOTES 3 ISSUED 24 FEBRUARY 2018 1 Gaussian elimination Let A be an (m n)-matrix Consider the following row operations on A (1) Swap the positions any

More information

A orthonormal basis for Radial Basis Function approximation

A orthonormal basis for Radial Basis Function approximation A orthonormal basis for Radial Basis Function approximation 9th ISAAC Congress Krakow, August 5-9, 2013 Gabriele Santin, joint work with S. De Marchi Department of Mathematics. Doctoral School in Mathematical

More information

Linear Least Squares. Using SVD Decomposition.

Linear Least Squares. Using SVD Decomposition. Linear Least Squares. Using SVD Decomposition. Dmitriy Leykekhman Spring 2011 Goals SVD-decomposition. Solving LLS with SVD-decomposition. D. Leykekhman Linear Least Squares 1 SVD Decomposition. For any

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

Dimension reduction, PCA & eigenanalysis Based in part on slides from textbook, slides of Susan Holmes. October 3, Statistics 202: Data Mining

Dimension reduction, PCA & eigenanalysis Based in part on slides from textbook, slides of Susan Holmes. October 3, Statistics 202: Data Mining Dimension reduction, PCA & eigenanalysis Based in part on slides from textbook, slides of Susan Holmes October 3, 2012 1 / 1 Combinations of features Given a data matrix X n p with p fairly large, it can

More information

Aircraft Structures Design Example

Aircraft Structures Design Example University of Liège Aerospace & Mechanical Engineering Aircraft Structures Design Example Ludovic Noels Computational & Multiscale Mechanics of Materials CM3 http://www.ltas-cm3.ulg.ac.be/ Chemin des Chevreuils

More information

Data Fitting and Uncertainty

Data Fitting and Uncertainty TiloStrutz Data Fitting and Uncertainty A practical introduction to weighted least squares and beyond With 124 figures, 23 tables and 71 test questions and examples VIEWEG+ TEUBNER IX Contents I Framework

More information

(Mathematical Operations with Arrays) Applied Linear Algebra in Geoscience Using MATLAB

(Mathematical Operations with Arrays) Applied Linear Algebra in Geoscience Using MATLAB Applied Linear Algebra in Geoscience Using MATLAB (Mathematical Operations with Arrays) Contents Getting Started Matrices Creating Arrays Linear equations Mathematical Operations with Arrays Using Script

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

Linear Algebra and Eigenproblems

Linear Algebra and Eigenproblems Appendix A A Linear Algebra and Eigenproblems A working knowledge of linear algebra is key to understanding many of the issues raised in this work. In particular, many of the discussions of the details

More information

be a Householder matrix. Then prove the followings H = I 2 uut Hu = (I 2 uu u T u )u = u 2 uut u

be a Householder matrix. Then prove the followings H = I 2 uut Hu = (I 2 uu u T u )u = u 2 uut u MATH 434/534 Theoretical Assignment 7 Solution Chapter 7 (71) Let H = I 2uuT Hu = u (ii) Hv = v if = 0 be a Householder matrix Then prove the followings H = I 2 uut Hu = (I 2 uu )u = u 2 uut u = u 2u =

More information

Matrices and Vectors. Definition of Matrix. An MxN matrix A is a two-dimensional array of numbers A =

Matrices and Vectors. Definition of Matrix. An MxN matrix A is a two-dimensional array of numbers A = 30 MATHEMATICS REVIEW G A.1.1 Matrices and Vectors Definition of Matrix. An MxN matrix A is a two-dimensional array of numbers A = a 11 a 12... a 1N a 21 a 22... a 2N...... a M1 a M2... a MN A matrix can

More information

FREQUENCY DOMAIN FLUTTER ANALYSIS OF AIRCRAFT WING IN SUBSONIC FLOW

FREQUENCY DOMAIN FLUTTER ANALYSIS OF AIRCRAFT WING IN SUBSONIC FLOW FREQUENCY DOMAIN FLUTTER ANALYSIS OF AIRCRAFT WING IN SUBSONIC FLOW Ms.K.Niranjana 1, Mr.A.Daniel Antony 2 1 UG Student, Department of Aerospace Engineering, Karunya University, (India) 2 Assistant professor,

More information

15 Singular Value Decomposition

15 Singular Value Decomposition 15 Singular Value Decomposition For any high-dimensional data analysis, one s first thought should often be: can I use an SVD? The singular value decomposition is an invaluable analysis tool for dealing

More information

Uncertainty quantification for RANS simulation of flow over a wavy wall

Uncertainty quantification for RANS simulation of flow over a wavy wall Uncertainty quantification for RANS simulation of flow over a wavy wall Catherine Gorlé 1,2,3, Riccardo Rossi 1,4, and Gianluca Iaccarino 1 1 Center for Turbulence Research, Stanford University, Stanford,

More information

AE 714 Aeroelastic Effects in Structures Term Project (Revised Version 20/05/2009) Flutter Analysis of a Tapered Wing Using Assumed Modes Method

AE 714 Aeroelastic Effects in Structures Term Project (Revised Version 20/05/2009) Flutter Analysis of a Tapered Wing Using Assumed Modes Method AE 714 Aeroelastic Effects in Structures Term Project (Revised Version 20/05/2009) Flutter Analysis of a Tapered Wing Using Assumed Modes Method Project Description In this project, you will perform classical

More information

DATA MINING AND MACHINE LEARNING. Lecture 4: Linear models for regression and classification Lecturer: Simone Scardapane

DATA MINING AND MACHINE LEARNING. Lecture 4: Linear models for regression and classification Lecturer: Simone Scardapane DATA MINING AND MACHINE LEARNING Lecture 4: Linear models for regression and classification Lecturer: Simone Scardapane Academic Year 2016/2017 Table of contents Linear models for regression Regularized

More information

CHAPTER 2. Frequency Domain Analysis

CHAPTER 2. Frequency Domain Analysis FREQUENCY DOMAIN ANALYSIS 16 CHAPTER 2 Frequency Domain Analysis ASSESSMENTOF FREQUENCY DOMAIN FORCE IDENTIFICATION PROCEDURES CHAPTE,R 2. FREQUENCY DOMAINANALYSIS 17 2. FREQUENCY DOMAIN ANALYSIS The force

More information

Linear Algebra and Matrices

Linear Algebra and Matrices Linear Algebra and Matrices 4 Overview In this chapter we studying true matrix operations, not element operations as was done in earlier chapters. Working with MAT- LAB functions should now be fairly routine.

More information

c Springer, Reprinted with permission.

c Springer, Reprinted with permission. Zhijian Yuan and Erkki Oja. A FastICA Algorithm for Non-negative Independent Component Analysis. In Puntonet, Carlos G.; Prieto, Alberto (Eds.), Proceedings of the Fifth International Symposium on Independent

More information

Salt Dome Detection and Tracking Using Texture Analysis and Tensor-based Subspace Learning

Salt Dome Detection and Tracking Using Texture Analysis and Tensor-based Subspace Learning Salt Dome Detection and Tracking Using Texture Analysis and Tensor-based Subspace Learning Zhen Wang*, Dr. Tamir Hegazy*, Dr. Zhiling Long, and Prof. Ghassan AlRegib 02/18/2015 1 /42 Outline Introduction

More information

CS246 Final Exam, Winter 2011

CS246 Final Exam, Winter 2011 CS246 Final Exam, Winter 2011 1. Your name and student ID. Name:... Student ID:... 2. I agree to comply with Stanford Honor Code. Signature:... 3. There should be 17 numbered pages in this exam (including

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

An approach to predict gust effects by means of hybrid ROM/CFD simulations

An approach to predict gust effects by means of hybrid ROM/CFD simulations An approach to predict gust effects by means of hybrid ROM/CFD simulations M. Bergmann 1, A. Ferrero 1, A. Iollo 1, H. Telib 2 1 Inria Bordeaux Sud-Ouest and Université de Bordeaux, Talence, France 2 Optimad

More information

The Caterpillar -SSA approach: automatic trend extraction and other applications. Theodore Alexandrov

The Caterpillar -SSA approach: automatic trend extraction and other applications. Theodore Alexandrov The Caterpillar -SSA approach: automatic trend extraction and other applications Theodore Alexandrov theo@pdmi.ras.ru St.Petersburg State University, Russia Bremen University, 28 Feb 2006 AutoSSA: http://www.pdmi.ras.ru/

More information

linearly indepedent eigenvectors as the multiplicity of the root, but in general there may be no more than one. For further discussion, assume matrice

linearly indepedent eigenvectors as the multiplicity of the root, but in general there may be no more than one. For further discussion, assume matrice 3. Eigenvalues and Eigenvectors, Spectral Representation 3.. Eigenvalues and Eigenvectors A vector ' is eigenvector of a matrix K, if K' is parallel to ' and ' 6, i.e., K' k' k is the eigenvalue. If is

More information

Sound Recognition in Mixtures

Sound Recognition in Mixtures Sound Recognition in Mixtures Juhan Nam, Gautham J. Mysore 2, and Paris Smaragdis 2,3 Center for Computer Research in Music and Acoustics, Stanford University, 2 Advanced Technology Labs, Adobe Systems

More information

Math 671: Tensor Train decomposition methods

Math 671: Tensor Train decomposition methods Math 671: Eduardo Corona 1 1 University of Michigan at Ann Arbor December 8, 2016 Table of Contents 1 Preliminaries and goal 2 Unfolding matrices for tensorized arrays The Tensor Train decomposition 3

More information

Automated Estimation of an Aircraft s Center of Gravity Using Static and Dynamic Measurements

Automated Estimation of an Aircraft s Center of Gravity Using Static and Dynamic Measurements Proceedings of the IMAC-XXVII February 9-, 009 Orlando, Florida USA 009 Society for Experimental Mechanics Inc. Automated Estimation of an Aircraft s Center of Gravity Using Static and Dynamic Measurements

More information

3 (Maths) Linear Algebra

3 (Maths) Linear Algebra 3 (Maths) Linear Algebra References: Simon and Blume, chapters 6 to 11, 16 and 23; Pemberton and Rau, chapters 11 to 13 and 25; Sundaram, sections 1.3 and 1.5. The methods and concepts of linear algebra

More information

HST.582J/6.555J/16.456J

HST.582J/6.555J/16.456J Blind Source Separation: PCA & ICA HST.582J/6.555J/16.456J Gari D. Clifford gari [at] mit. edu http://www.mit.edu/~gari G. D. Clifford 2005-2009 What is BSS? Assume an observation (signal) is a linear

More information

CSC 576: Linear System

CSC 576: Linear System CSC 576: Linear System Ji Liu Department of Computer Science, University of Rochester September 3, 206 Linear Equations Consider solving linear equations where A R m n and b R n m and n could be extremely

More information

Codal Provisions IS 1893 (Part 1) 2002

Codal Provisions IS 1893 (Part 1) 2002 Abstract Codal Provisions IS 1893 (Part 1) 00 Paresh V. Patel Assistant Professor, Civil Engineering Department, Nirma Institute of Technology, Ahmedabad 38481 In this article codal provisions of IS 1893

More information

Gaussian Processes: We demand rigorously defined areas of uncertainty and doubt

Gaussian Processes: We demand rigorously defined areas of uncertainty and doubt Gaussian Processes: We demand rigorously defined areas of uncertainty and doubt ACS Spring National Meeting. COMP, March 16 th 2016 Matthew Segall, Peter Hunt, Ed Champness matt.segall@optibrium.com Optibrium,

More information

Image Compression Using Singular Value Decomposition

Image Compression Using Singular Value Decomposition Image Compression Using Singular Value Decomposition Ian Cooper and Craig Lorenc December 15, 2006 Abstract Singular value decomposition (SVD) is an effective tool for minimizing data storage and data

More information

MATH 3795 Lecture 10. Regularized Linear Least Squares.

MATH 3795 Lecture 10. Regularized Linear Least Squares. MATH 3795 Lecture 10. Regularized Linear Least Squares. Dmitriy Leykekhman Fall 2008 Goals Understanding the regularization. D. Leykekhman - MATH 3795 Introduction to Computational Mathematics Linear Least

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

Mathematical foundations - linear algebra

Mathematical foundations - linear algebra Mathematical foundations - linear algebra Andrea Passerini passerini@disi.unitn.it Machine Learning Vector space Definition (over reals) A set X is called a vector space over IR if addition and scalar

More information

Aeroelasticity. Lecture 4: Flight Flutter Testing. G. Dimitriadis. AERO0032-1, Aeroelasticity and Experimental Aerodynamics, Lecture 4

Aeroelasticity. Lecture 4: Flight Flutter Testing. G. Dimitriadis. AERO0032-1, Aeroelasticity and Experimental Aerodynamics, Lecture 4 Aeroelasticity Lecture 4: Flight Flutter Testing G. Dimitriadis AERO0032-1, Aeroelasticity and Experimental Aerodynamics, Lecture 4 1 Main reference A Historical Overview of Flight Flutter Testing, Michael

More information

Main matrix factorizations

Main matrix factorizations Main matrix factorizations A P L U P permutation matrix, L lower triangular, U upper triangular Key use: Solve square linear system Ax b. A Q R Q unitary, R upper triangular Key use: Solve square or overdetrmined

More information

Hands-on Matrix Algebra Using R

Hands-on Matrix Algebra Using R Preface vii 1. R Preliminaries 1 1.1 Matrix Defined, Deeper Understanding Using Software.. 1 1.2 Introduction, Why R?.................... 2 1.3 Obtaining R.......................... 4 1.4 Reference Manuals

More information

Vector Space Concepts

Vector Space Concepts Vector Space Concepts ECE 174 Introduction to Linear & Nonlinear Optimization Ken Kreutz-Delgado ECE Department, UC San Diego Ken Kreutz-Delgado (UC San Diego) ECE 174 Fall 2016 1 / 25 Vector Space Theory

More information

The Singular Value Decomposition

The Singular Value Decomposition The Singular Value Decomposition An Important topic in NLA Radu Tiberiu Trîmbiţaş Babeş-Bolyai University February 23, 2009 Radu Tiberiu Trîmbiţaş ( Babeş-Bolyai University)The Singular Value Decomposition

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

System 1 (last lecture) : limited to rigidly structured shapes. System 2 : recognition of a class of varying shapes. Need to:

System 1 (last lecture) : limited to rigidly structured shapes. System 2 : recognition of a class of varying shapes. Need to: System 2 : Modelling & Recognising Modelling and Recognising Classes of Classes of Shapes Shape : PDM & PCA All the same shape? System 1 (last lecture) : limited to rigidly structured shapes System 2 :

More information

Kronecker Decomposition for Image Classification

Kronecker Decomposition for Image Classification university of innsbruck institute of computer science intelligent and interactive systems Kronecker Decomposition for Image Classification Sabrina Fontanella 1,2, Antonio Rodríguez-Sánchez 1, Justus Piater

More information

CS264: Beyond Worst-Case Analysis Lecture #15: Topic Modeling and Nonnegative Matrix Factorization

CS264: Beyond Worst-Case Analysis Lecture #15: Topic Modeling and Nonnegative Matrix Factorization CS264: Beyond Worst-Case Analysis Lecture #15: Topic Modeling and Nonnegative Matrix Factorization Tim Roughgarden February 28, 2017 1 Preamble This lecture fulfills a promise made back in Lecture #1,

More information

Robotics 2 Data Association. Giorgio Grisetti, Cyrill Stachniss, Kai Arras, Wolfram Burgard

Robotics 2 Data Association. Giorgio Grisetti, Cyrill Stachniss, Kai Arras, Wolfram Burgard Robotics 2 Data Association Giorgio Grisetti, Cyrill Stachniss, Kai Arras, Wolfram Burgard Data Association Data association is the process of associating uncertain measurements to known tracks. Problem

More information

MARN 5898 Regularized Linear Least Squares.

MARN 5898 Regularized Linear Least Squares. MARN 5898 Regularized Linear Least Squares. Dmitriy Leykekhman Spring 2010 Goals Understanding the regularization. D. Leykekhman - MARN 5898 Parameter estimation in marine sciences Linear Least Squares

More information

MATRICES. a m,1 a m,n A =

MATRICES. a m,1 a m,n A = MATRICES Matrices are rectangular arrays of real or complex numbers With them, we define arithmetic operations that are generalizations of those for real and complex numbers The general form a matrix of

More information

Constrained data assimilation. W. Carlisle Thacker Atlantic Oceanographic and Meteorological Laboratory Miami, Florida USA

Constrained data assimilation. W. Carlisle Thacker Atlantic Oceanographic and Meteorological Laboratory Miami, Florida USA Constrained data assimilation W. Carlisle Thacker Atlantic Oceanographic and Meteorological Laboratory Miami, Florida 33149 USA Plan Range constraints: : HYCOM layers have minimum thickness. Optimal interpolation:

More information

COMP 558 lecture 18 Nov. 15, 2010

COMP 558 lecture 18 Nov. 15, 2010 Least squares We have seen several least squares problems thus far, and we will see more in the upcoming lectures. For this reason it is good to have a more general picture of these problems and how to

More information

Anomaly Detection for the CERN Large Hadron Collider injection magnets

Anomaly Detection for the CERN Large Hadron Collider injection magnets Anomaly Detection for the CERN Large Hadron Collider injection magnets Armin Halilovic KU Leuven - Department of Computer Science In cooperation with CERN 2018-07-27 0 Outline 1 Context 2 Data 3 Preprocessing

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