Practical numerical considerations for the Alekseev–Mikhailenko method

1990 ◽  
Vol 27 (8) ◽  
pp. 1023-1030 ◽  
Author(s):  
P. F. Daley ◽  
F. Hron

Programs that utilize the Alekseev–Mikhailenko method are becoming viable seismic interpretation aids because of the availability of a new generation of supercomputers. This method is highly numerically accurate, employing a combination of finite integral transforms and finite difference methods, for the solution of hyperbolic partial differential equations, to yield the total seismic wave field.In this paper two questions of a numerical nature are addressed. For coupled P–Sv wave propagation with radial symmetry, Hankel transforms of order 0 and 1 are required to cast the problem in a form suitable for solution by finite difference methods. The inverse series summations would normally require that the two sets of roots of the transcendental equations be employed, corresponding to the zeroes of the Bessel functions of order 0 and 1. This matter is clarified, and it is shown that both inverse series summations may be performed by considering only one set of roots.The second topic involves providing practical means of determining the lower and upper bounds of a truncated series that suitably approximates the infinite inverse series summation of the finite Hankel transform. It is shown that the number of terms in the truncated series generally decreases with increasing duration of the source pulse and that the truncated series may be further reduced if near-vertical-incidence seismic traces are avoided.

Robotica ◽  
2021 ◽  
pp. 1-12
Author(s):  
Xu-Qian Fan ◽  
Wenyong Gong

Abstract Path planning has been widely investigated by many researchers and engineers for its extensive applications in the real world. In this paper, a biharmonic radial basis potential function (BRBPF) representation is proposed to construct navigation fields in 2D maps with obstacles, and it therefore can guide and design a path joining given start and goal positions with obstacle avoidance. We construct BRBPF by solving a biharmonic equation associated with distance-related boundary conditions using radial basis functions (RBFs). In this way, invalid gradients calculated by finite difference methods in large size grids can be preventable. Furthermore, paths constructed by BRBPF are smoother than paths constructed by harmonic potential functions and other methods, and plenty of experimental results demonstrate that the proposed method is valid and effective.


Mathematics ◽  
2021 ◽  
Vol 9 (3) ◽  
pp. 206
Author(s):  
María Consuelo Casabán ◽  
Rafael Company ◽  
Lucas Jódar

This paper deals with the search for reliable efficient finite difference methods for the numerical solution of random heterogeneous diffusion reaction models with a finite degree of randomness. Efficiency appeals to the computational challenge in the random framework that requires not only the approximating stochastic process solution but also its expectation and variance. After studying positivity and conditional random mean square stability, the computation of the expectation and variance of the approximating stochastic process is not performed directly but through using a set of sampling finite difference schemes coming out by taking realizations of the random scheme and using Monte Carlo technique. Thus, the storage accumulation of symbolic expressions collapsing the approach is avoided keeping reliability. Results are simulated and a procedure for the numerical computation is given.


2020 ◽  
Vol 63 (1-2) ◽  
pp. 143-170 ◽  
Author(s):  
Amit K. Verma ◽  
Sheerin Kayenat ◽  
Gopal Jee Jha

Sign in / Sign up

Export Citation Format

Share Document