University of Cambridge > > Isaac Newton Institute Seminar Series > Mechanistically evaluating the local Bloch wave approximation in graded arrays of vertical barriers

Mechanistically evaluating the local Bloch wave approximation in graded arrays of vertical barriers

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact nobody.

MWSW04 - Multiple scattering in engineering and applied sciences

Wave interaction with graded metamaterials exhibits the phenomenon of rainbow reflection, in which broadband wave signals slow down and separate into their frequency components before being reflected. This phenomenon has been qualitatively understood by describing the wave field in the metamaterial using the local Bloch wave approximation (LBWA), which locally represents the wave field as a superposition of propagating wave solutions in the cognate infinite periodic media (so-called Bloch waves). We evaluate the performance of the LBWA quantitatively in the context of two-dimensional linear water-wave scattering by graded arrays of surface-piercing vertical barriers. To do this, we implement the LBWA numerically so that the Bloch waves in one region of the graded array are coupled to Bloch waves in adjacent regions. This coupling is computed by solving the scattering of Bloch waves across the interface between two semi-infinite arrays of vertical barriers, where the barriers in each semi-infinite array can have different submergence depths. Our results suggest that the LBWA accurately predicts the free surface amplitude across a wide range of frequencies, except those just above the cutoff frequencies associated with each of the vertical barriers in the array. This highlights the importance of decaying Bloch modes above the cutoff in rainbow reflection.

This talk is part of the Isaac Newton Institute Seminar Series series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2024, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity