Issue |
EPJ Appl. Metamat.
Volume 9, 2022
|
|
---|---|---|
Article Number | 2 | |
Number of page(s) | 19 | |
DOI | https://doi.org/10.1051/epjam/2021011 | |
Published online | 03 February 2022 |
https://doi.org/10.1051/epjam/2021011
Research Article
Morphing for faster computations with finite difference time domain algorithms
1
Aix-Marseille Université, CNRS, Centrale Marseille, Institut Fresnel, 13013 Marseille, France
2
UMI 2004 Abraham de Moivre-CNRS, Imperial College London, London SW7 2AZ, UK
3
Department of Mathematics, Imperial College London, London SW7 2AZ, UK
4
BTU Trust, 77700 Magny le Hongre, France
* e-mail: ronald.aznavourian@fresnel.fr
Received:
23
July
2021
Accepted:
13
December
2021
Published online: 3 February 2022
In the framework of wave propagation, finite difference time domain (FDTD) algorithms, yield high computational time. We propose to use morphing algorithms to deduce some approximate wave pictures of their interactions with fluid-solid structures of various shapes and different sizes deduced from FDTD computations of scattering by solids of three given shapes: triangular, circular and elliptic ones. The error in the L2 norm between the FDTD solution and approximate solution deduced via morphing from the source and destination images are typically less than 1% if control points are judiciously chosen. We thus propose to use a morphing algorithm to deduce approximate wave pictures: at intermediate time steps from the FDTD computation of wave pictures at a time step before and after this event, and at the same time step, but for an average frequency signal between FDTD computation of wave pictures with two different signal frequencies. We stress that our approach might greatly accelerate FDTD computations as discretizations in space and time are inherently linked via the Courant–Friedrichs–Lewy stability condition. Our approach requires some human intervention since the accuracy of morphing highly depends upon control points, but compared to the direct computational method our approach is much faster and requires fewer resources. We also compared our approach to some neural style transfer (NST) algorithm, which is an image transformation method based on a neural network. Our approach outperforms NST in terms of the L2 norm, Mean Structural SIMilarity, expected signal to error ratio.
Key words: Morphing / finite difference time domain / elastodynamic waves
© R. Aznavourian et al., Published by EDP Sciences, 2022
This is an Open Access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.