Solving ultrasonic ray tracing in parts with multiple material layers through Root-Finding methods.

Ultrasonics

Department of Electronic & Electrical Engineering (EEE), University of Strathclyde, 204 George St, Glasgow G1 1XW, UK.

Published: August 2022

Ultrasonic testing has been used for material analysis and inspection since 1930's. Nevertheless, the applicability of ultrasonic waves to new complex cases is still growing, thanks to the availability of powerful electronics and software. However, the complication that slows down the deployment of ultrasonic inspection to geometric complex parts and structures arises from the wave refraction phenomenon. A clear understanding of the ultrasound wave propagation, impacted by refractions, is crucial to interpret the data obtained from the inspection of multi-layered/multi-medium test subjects as it is not always possible to assume that mechanical waves travel in straight lines. This work presents suitable approaches for solving the ray-tracing problem in multi-layered structures. Accurate benchmarking shows that the use of the Newton-Raphson root-finding method allows a threefold reduction of the computation time, when compared to the bisection-based root-finding methods. An effective combination of the Newton-Raphson methods with bisection-type iterations is also proposed and discussed. Although the work repeatedly refers to the field of ultrasonic inspection, the presented findings are relevant and applicable to areas beyond material inspection.

Download full-text PDF

Source
http://dx.doi.org/10.1016/j.ultras.2022.106747DOI Listing

Publication Analysis

Top Keywords

root-finding methods
8
ultrasonic inspection
8
inspection
5
solving ultrasonic
4
ultrasonic ray
4
ray tracing
4
tracing parts
4
parts multiple
4
multiple material
4
material layers
4

Similar Publications

Annealing approach to root finding.

Phys Rev E

August 2024

Laboratory of Biological Modeling, National Institute of Diabetes and Digestive and Kidney Diseases, National Institutes of Health, Bethesda, Maryland 20892, USA.

The Newton-Raphson method is a fundamental root-finding technique with numerous applications in physics. In this study, we propose a parameterized variant of the Newton-Raphson method, inspired by principles from physics. Through analytical and empirical validation, we demonstrate that this approach offers increased robustness and faster convergence during root-finding iterations.

View Article and Find Full Text PDF

The Newton-Raphson method is a fundamental root-finding technique with numerous applications in physics. In this study, we propose a parameterized variant of the Newton-Raphson method, inspired by principles from physics. Through analytical and empirical validation, we demonstrate that this novel approach offers increased robustness and faster convergence during root-finding iterations.

View Article and Find Full Text PDF

Purpose: There are a number of algorithms for smooth -norm (SL0) approximation. In most of the cases, sparsity level of the reconstructed signal is controlled by using a decreasing sequence of the modulation parameter values. However, predefined decreasing sequences of the modulation parameter values cannot produce optimal sparsity or best reconstruction performance, because the best choice of the parameter values is often data-dependent and dynamically changes in each iteration.

View Article and Find Full Text PDF

To study the acoustic characteristics of sound scattered from laminated structures such as elastic plates and shells, it is usually required to solve the Lamb waves' dispersion equations. Many traditional root-finding methods such as bisection, the Newton-Raphson method, and the Muller method are not able to tackle the problem completely. A simple but powerful method named local peaks search (LPS) is proposed to overcome their drawbacks.

View Article and Find Full Text PDF

Objective: In this paper, we develop a new root-finding algorithm to solve the given non-linear equations. The proposed root-finding algorithm is based on the exponential method. This algorithm is derivative-free and converges fast.

View Article and Find Full Text PDF

Want AI Summaries of new PubMed Abstracts delivered to your In-box?

Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!