Related Experiment Video
Updated: Mar 11, 2026

04:54
Author Spotlight: A Stable Phantom Material for Optical and Acoustic Imaging
Published on: June 16, 2023
3.9K
Fast computation of time-dependent acoustic fields
Michael Carley1, Ghader Ghorbaniasl2
1Department of Mechanical Engineering, University of Bath, Bath BA2 7AY, United Kingdom.
The Journal of the Acoustical Society of America
|December 3, 2016
Summary
This study introduces a fast method for calculating time-dependent acoustic fields from complex sources. The technique significantly reduces computation time for transient signals, especially with numerous sources.
Area of Science:
- Acoustics
- Computational physics
- Numerical methods
Background:
- Evaluating time-dependent acoustic fields from complex sources is computationally intensive.
- Existing methods often struggle with the computational demands of large-scale acoustic simulations.
- Accurate transient acoustic field prediction is crucial for applications like noise control and structural acoustics.
Purpose of the Study:
- To present a novel, fast method for evaluating time-dependent acoustic fields from complex sources.
- To demonstrate the computational efficiency of the proposed technique for transient acoustic signal calculation.
- To assess the scalability of the method with an increasing number of acoustic sources.
Main Methods:
- The method employs a fast integration technique for boundary integrals within a Kirchhoff formulation.
- It involves a pre-processing stage followed by a rapid computation of transient acoustic signals.
- The approach was tested using single rotor, counter-rotating open rotor, and broadband volume source configurations.
Main Results:
- The developed method achieves a fast evaluation of time-dependent acoustic fields.
- Transient signal computation requires a small and relatively constant computation time after pre-processing.
- For an array of 16,384 sources, transient field calculations were an order of magnitude faster than traditional methods.
- The computational advantage increases with a higher number of sources.
Conclusions:
- The presented method offers a significant computational speed-up for time-dependent acoustic field evaluations.
- The technique is particularly advantageous for complex sources with a large number of individual emitters.
- This fast evaluation method has the potential to enhance simulations in acoustics and related fields.
Related Concept Videos
Echo
1.1K
The human ear cannot distinguish between two sources of sound if they happen to reach within a specific time interval, typically 0.1 seconds apart. More than this, and they are perceived as separate sources.
Imagine the sound is reflected back to the ears. Assuming that the source is very close to the human, the difference between hearing the two sounds—the emitted sound and the reflected sound—may be more than the minimum time for perceiving distinct sounds. If this is the case,...
Imagine the sound is reflected back to the ears. Assuming that the source is very close to the human, the difference between hearing the two sounds—the emitted sound and the reflected sound—may be more than the minimum time for perceiving distinct sounds. If this is the case,...
1.1K
Fast Fourier Transform
1.1K
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)log2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
The computational efficiency of the FFT becomes...
1.1K
Deriving the Speed of Sound in a Liquid
1.0K
As with waves on a string, the speed of sound or a mechanical wave in a fluid depends on the fluid's elastic modulus and inertia. The two relevant physical quantities are the bulk modulus and the density of the material. Indeed, it turns out that the relationship between speed and the bulk modulus and density in fluids is the same as that between the speed and the Young's modulus and density in solids.
The speed of sound in fluids can be derived by considering a mechanical wave...
The speed of sound in fluids can be derived by considering a mechanical wave...
1.0K
Properties of DTFT II
602
In the study of discrete-time signal processing, understanding the properties of the Discrete-Time Fourier Transform (DTFT) is crucial for analyzing and manipulating signals in the frequency domain. Several properties, including frequency differentiation, convolution, accumulation, and Parseval's relation, offer powerful tools for signal analysis.
The frequency differentiation property is illustrated by considering a DTFT pair and differentiating both sides with respect to ω.
The frequency differentiation property is illustrated by considering a DTFT pair and differentiating both sides with respect to ω.
602
Linear Approximation in Time Domain
387
Nonlinear systems often require sophisticated approaches for accurate modeling and analysis, with state-space representation being particularly effective. This method is especially useful for systems where variables and parameters vary with time or operating conditions, such as in a simple pendulum or a translational mechanical system with nonlinear springs.
For a simple pendulum with a mass evenly distributed along its length and the center of mass located at half the pendulum's length,...
For a simple pendulum with a mass evenly distributed along its length and the center of mass located at half the pendulum's length,...
387
Discrete Fourier Transform
1.0K
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...
1.0K

