Ray tracing in a moving medium with two‐dimensional sound‐speed variation and application to sound propagation over terrain discontinuities

1993 ◽  
Vol 93 (4) ◽  
pp. 1716-1726 ◽  
Author(s):  
J. S. Lamancusa ◽  
P. A. Daroux
Keyword(s):  
Ray Tracing ◽  
Sound Speed ◽  
Sound Propagation ◽  
Two Dimensional ◽  
Moving Medium ◽  
Speed Variation

Determination of equivalent sound speed profiles for ray tracing in near-ground sound propagation

2007 ◽  
Vol 122 (3) ◽  
pp. 1391-1403 ◽  
Author(s):  
John M. Prospathopoulos ◽  
Spyros G. Voutsinas
Keyword(s):  
Ray Tracing ◽  
Sound Speed ◽  
Sound Propagation

An Efficient Coupled-Mode Formulation for Acoustic Propagation in Inhomogeneous Waveguides

2016 ◽  
Vol 24 (01) ◽  
pp. 1550019
Author(s):  
Chunmei Yang ◽  
Wenyu Luo ◽  
Renhe Zhang ◽  
Liangang Lyu ◽  
Fangli Qiao
Keyword(s):  
Water Column ◽  
Sound Speed ◽  
Sound Propagation ◽  
Acoustic Propagation ◽  
Two Dimensional ◽  
Speed Profile ◽  
Benchmark Problem ◽  
Sound Speed Profile ◽  
Coupled Mode ◽  
Sloping Bottom

The direct-global-matrix coupled-mode model (DGMCM) for sound propagation in range-dependent waveguides was recently developed by Luo et al. [A numerically stable coupled-mode formulation for acoustic propagation in range-dependent waveguides, Sci. China G: Phys. Mech. Astron. 55 (2012) 572–588]. A brief review of the formulation and characteristics of this model is given. This paper extends this model to deal with realistic problems involving an inhomogeneous water column and a penetrable sloping bottom. To this end, the normal mode model KRAKEN is adopted to provide local modal solutions and their associated coupling matrices. As a result, the extended DGMCM model is capable of providing full two-way solutions to two-dimensional (2D) realistic problems with a depth- and range-dependent sound speed profile as well as a penetrable sloping bottom. To validate this model, it is first applied to a benchmark problem of sound propagation in a plane-parallel waveguide with a depth- and range-dependent sound speed profile, and then it is applied to a problem involving both an inhomogeneous water column and a sloping bottom. Comparisons with the analytical solution proposed by DeSanto and with the numerical model COUPLE are also provided, which show that the extended DGMCM model is accurate and efficient and hence can serve as a benchmark for realistic problems of sound propagation in an inhomogeneous waveguide.

A new primitive ray‐tracing (PRT) model to compute forward and inverse acoustic propagation in a two‐dimensional, range‐dependent, sound‐speed field

2004 ◽  
Vol 116 (4) ◽  
pp. 2550-2550
Author(s):  
Sergey V. Vinogradov ◽  
Jerald W. Caruthers ◽  
Hans E. Ngodock ◽  
Natalia A. Sidorovskaia
Keyword(s):  
Ray Tracing ◽  
Sound Speed ◽  
Acoustic Propagation ◽  
Two Dimensional ◽  
Dimensional Range

Collaborating Ray Tracing and AI Model for AUV-Assisted 3-D Underwater Sound-Speed Inversion

2021 ◽  
pp. 1-19
Author(s):  
Wei Huang ◽  
Mingliu Liu ◽  
Deshi Li ◽  
Feng Yin ◽  
Haole Chen ◽  
...  
Keyword(s):  
Ray Tracing ◽  
Sound Speed ◽  
Underwater Sound

Sound speed variation in the coastal waters off Cochin and signature of subsurface maxima

2021 ◽  
Author(s):  
Abdul Azeez S ◽  
Revichandran C ◽  
Muraleedharan K. R ◽  
Sebin John ◽  
Seena G ◽  
...  
Keyword(s):  
Coastal Waters ◽  
Sound Speed ◽  
Speed Variation

Methods to Accelerate Ray Tracing in the Monte Carlo Method for Surface-to-Surface Radiation Transport

2006 ◽  
Vol 128 (9) ◽  
pp. 945-952 ◽  
Author(s):  
Sandip Mazumder
Keyword(s):  
Monte Carlo ◽  
Ray Tracing ◽  
Radiation Transport ◽  
Three Dimensional ◽  
Intersection Point ◽  
Surface Radiation ◽  
Computational Domain ◽  
Two Dimensional ◽  
Spatial Partitioning ◽  
The Monte Carlo Method

Two different algorithms to accelerate ray tracing in surface-to-surface radiation Monte Carlo calculations are investigated. The first algorithm is the well-known binary spatial partitioning (BSP) algorithm, which recursively bisects the computational domain into a set of hierarchically linked boxes that are then made use of to narrow down the number of ray-surface intersection calculations. The second algorithm is the volume-by-volume advancement (VVA) algorithm. This algorithm is new and employs the volumetric mesh to advance the ray through the computational domain until a legitimate intersection point is found. The algorithms are tested for two classical problems, namely an open box, and a box in a box, in both two-dimensional (2D) and three-dimensional (3D) geometries with various mesh sizes. Both algorithms are found to result in orders of magnitude gains in computational efficiency over direct calculations that do not employ any acceleration strategy. For three-dimensional geometries, the VVA algorithm is found to be clearly superior to BSP, particularly for cases with obstructions within the computational domain. For two-dimensional geometries, the VVA algorithm is found to be superior to the BSP algorithm only when obstructions are present and are densely packed.

Sign in / Sign up

Export Citation Format

Share Document