Résumé: Damping is usually associated with irreversibility. Here, we present a counterintuitive concept to achieve time reversal of waves propagating in a lossless medium using a transitory dissipation pulse. Applying a sudden and strong damping in a limited time generates a time-reversed wave. In the limit of a high damping shock, this amounts to "freezing"the initial wave by maintaining the wave amplitude while canceling its time derivative. The initial wave then splits in two counterpropagating waves with half of its amplitude and time evolutions in opposite directions. We implement this damping-based time reversal using phonon waves propagating in a lattice of interacting magnets placed on an air cushion. We show with computer simulations that this concept also applies to broadband time reversal in complex disordered systems.

Résumé: Dispersion curves of elastic waveguides exhibit points where the group velocity vanishes while the wavenumber remains finite. These are the so-called zero-group-velocity (ZGV) points. As the elastodynamic energy at these points remains confined close to the source, they are of practical interest for nondestructive testing and quantitative characterization of structures. These applications rely on the correct prediction of the ZGV points. In this contribution, we first model the ZGV resonances in anisotropic plates based on the appearance of an additional modal solution. The resulting governing equation is interpreted as a two-parameter eigenvalue problem. Subsequently, we present three complementary numerical procedures capable of computing ZGV points in arbitrary nondissipative elastic waveguides in the conventional sense that their axial power flux vanishes. The first method is globally convergent and guarantees to find all ZGV points but can only be used for small problems. The second procedure is a very fast, generally-applicable, Newton-type iteration that is locally convergent and requires initial guesses. The third method combines both kinds of approaches and yields a procedure that is applicable to large problems, does not require initial guesses and is likely to find all ZGV points. The algorithms are implemented in GEW ZGV computation (doi: 10.5281/zenodo.7537442).