Filtering of high modal frequencies for stable real-time explicit integration of deformable objects using the Finite

Iker Aguinaga1, Basil Fierz, Jonas Spillmann

  • 1Dept. of Applied Mechanics, CEIT, Manuel de Lardizabal 15, 20018 San Sebastian, Spain. iaguinaga@ceit.es

Related Concept Videos

Discrete Fourier Transform01:15

Discrete Fourier Transform

The Discrete Fourier Transform (DFT) is a fundamental tool in signal processing, extending the discrete-time Fourier transform by evaluating discrete signals at uniformly spaced frequency intervals. This transformation converts a finite sequence of time-domain samples into frequency components, each representing complex sinusoids ordered by frequency. The DFT translates these sequences into the frequency domain, effectively indicating the magnitude and phase of each frequency component present...
Deformation of Member under Multiple Loadings01:11

Deformation of Member under Multiple Loadings

When a rod is made of different materials or has various cross-sections, it must be divided into parts that meet the necessary conditions for determining the deformation. These parts are each characterized by their internal force, cross-sectional area, length, and modulus of elasticity. These parameters are then used to compute the deformation of the entire rod.
In the case of a member with a variable cross-section, the strain is not constant but depends on the position. The deformation of an...
Linear Approximation in Frequency Domain01:26

Linear Approximation in Frequency Domain

Linear systems are characterized by two main properties: superposition and homogeneity. Superposition allows the response to multiple inputs to be the sum of the responses to each individual input. Homogeneity ensures that scaling an input by a scalar results in the response being scaled by the same scalar.
In contrast, nonlinear systems do not inherently possess these properties. However, for small deviations around an operating point, a nonlinear system can often be approximated as linear.
Fast Fourier Transform01:10

Fast Fourier Transform

The Fast Fourier Transform (FFT) is a computational algorithm designed to compute the Discrete Fourier Transform (DFT) efficiently. By breaking down the calculations into smaller, manageable sections, the FFT significantly reduces the computational complexity involved. Direct computation of an N-point DFT requires N2 complex multiplications, whereas the FFT algorithm needs only (N/2)log⁡2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
Discrete-Time Fourier Series01:20

Discrete-Time Fourier Series

The Discrete-Time Fourier Series (DTFS) is a fundamental concept in signal processing, serving as the discrete-time counterpart to the continuous-time Fourier series. It allows for the representation and analysis of discrete-time periodic signals in terms of their frequency components. Unlike its continuous counterpart, which utilizes integrals, the calculation of DTFS expansion coefficients involves summations due to the discrete nature of the signal.
For a discrete-time periodic signal x[n]...
Three-Dimensional Force System01:30

Three-Dimensional Force System

In mechanical engineering, a three-dimensional force system is a system of forces acting in three dimensions, with forces applied along the x, y, and z coordinate axes. The three-dimensional force system is an important concept in mechanical engineering, as it allows engineers to understand and analyze the behavior of objects and structures in three dimensions. By understanding the forces acting on a system, engineers can design more efficient and effective mechanical systems that can withstand...