Lecture

Forced Oscillator Regime: Generalized Conservative Approach

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

In course

ME-332: Mechanical vibrations

Dans ce cours on étudie la dynamique modale des structures mécaniques. Conceptes clés comme Mode Normale, Mass et Raideur effective, et Fréquences Propres sont appris pendant ce cours. ...

Description

This lecture covers the formulation of the forced oscillator regime in vibratory mechanics, focusing on the decoupling of the forced regime by decomposition and the diagonal matrix of modal rigidities. It explains the solution of the forced regime using Laplace or convolution integral methods, with a return to spatial coordinates and consideration of non-zero initial conditions. The lecture also delves into the concept of a generalized conservative approach of order n in the modal base, emphasizing clean pulsations and independence. Additionally, it explores the EPFL transfer function and the return to the physical base through a linear combination of modal solutions.

Instructor

Luis Guillermo Villanueva Torrijo

Guillermo Villanueva is a Tenure Track Assistant Professor at the Ecole Polytechnique Federale de Lausane (EPFL), Switzerland, in the Mechanical Engineering Institute (IGM). Before joining EPFL he was a Marie Curie post-doctoral scholar at DTU (Denmark) and Caltech (California, US); and before a post-doc at EPFL-LMIS1. He received his M.Sc. in Physics in Zaragoza (Spain) and his PhD from the UAB in Barcelona (Spain). Since the start of his PhD (2002), Prof. Villanueva has been active in the fields of NEMS/MEMS for sensing, having expertise from the design and fabrication to the characterization and applicability. He has co-authored more than 75 papers in peer-reviewed journals (h-index of 24 WoK, 32 GoS) and more than 100 contributions to international conferences. He is serving, or has served, on the program committees of IEEE-NEMS, IEEE-Sensors, MNE, IEEE-FCS and Transducers. He is editor of Microelectronic Engineering. He has co-organized MNE2014 and SNC2015; and he is currently co-organizing the short courses at Transducers 2019 and the 16th International Workshop on Nanomechanical Sensors (NMC2019).

Official source

Ontological neighbourhood

Mathematics

Algebra: Linear algebra

Related concepts (31)

Linear combination

In mathematics, a linear combination is an expression constructed from a set of terms by multiplying each term by a constant and adding the results (e.g. a linear combination of x and y would be any expression of the form ax + by, where a and b are constants). The concept of linear combinations is central to linear algebra and related fields of mathematics. Most of this article deals with linear combinations in the context of a vector space over a field, with some generalizations given at the end of the article.

Diagonal matrix

In linear algebra, a diagonal matrix is a matrix in which the entries outside the main diagonal are all zero; the term usually refers to square matrices. Elements of the main diagonal can either be zero or nonzero. An example of a 2×2 diagonal matrix is , while an example of a 3×3 diagonal matrix is. An identity matrix of any size, or any multiple of it (a scalar matrix), is a diagonal matrix. A diagonal matrix is sometimes called a scaling matrix, since matrix multiplication with it results in changing scale (size).

Eigenvalues and eigenvectors

In linear algebra, an eigenvector (ˈaɪgənˌvɛktər) or characteristic vector of a linear transformation is a nonzero vector that changes at most by a constant factor when that linear transformation is applied to it. The corresponding eigenvalue, often represented by , is the multiplying factor. Geometrically, a transformation matrix rotates, stretches, or shears the vectors it acts upon. The eigenvectors for a linear transformation matrix are the set of vectors that are only stretched, with no rotation or shear.

Diagonalizable matrix

In linear algebra, a square matrix is called diagonalizable or non-defective if it is similar to a diagonal matrix, i.e., if there exists an invertible matrix and a diagonal matrix such that , or equivalently . (Such , are not unique.) For a finite-dimensional vector space , a linear map is called diagonalizable if there exists an ordered basis of consisting of eigenvectors of .

Linear span

In mathematics, the linear span (also called the linear hull or just span) of a set S of vectors (from a vector space), denoted span(S), is defined as the set of all linear combinations of the vectors in S. For example, two linearly independent vectors span a plane. The linear span can be characterized either as the intersection of all linear subspaces that contain S, or as the smallest subspace containing S. The linear span of a set of vectors is therefore a vector space itself. Spans can be generalized to matroids and modules.

Related lectures (64)

Diagonalization: Theory and Examples

Explores diagonalization of matrices through eigenvalues and eigenvectors, emphasizing distinct eigenvalues and their role in the diagonalization process.

Diagonalization of Matrices: Theory and Examples

Covers the theory and examples of diagonalizing matrices, focusing on eigenvalues, eigenvectors, and linear independence.

Non-Diagonalizable Case: Simple Eigenvalue (Theory)

Explores the reduction of a linear transformation with a single real eigenvalue.

Diagonalization of Matrices

Explores the diagonalization of matrices through eigenvalues and eigenvectors, emphasizing the importance of bases and subspaces.

Diagonalization of Symmetric Matrices