scholarly journals Software for Evaluating Pumping Tests on Real Wells

2021 ◽  
Vol 11 (7) ◽  
pp. 3182
Author(s):  
Václav Ficaj ◽  
Pavel Pech ◽  
Daniel Kahuda

As the climate is changing, greater exploitation of groundwater reserves is becoming evident; however, this would have been apparent even without climate change. Therefore, increasing emphasis is given to maintaining well functionality. Wells are susceptible to aging, which reduces their efficiency. Today, there exist several solutions for determining the size of additional resistance (the skin effect), which indicates a well’s current state and that of its close surroundings. The implementation of most of these solutions is often time-consuming. To improve our tools, a goal has been set to accelerate and facilitate the method of determining the size of additional resistance. In this study, we present new software that accelerates this process. It applies an innovative method based upon a partial differential equation describing the radially symmetric flow to a real well, which occurs under an unsteady regime, using the Laplace transform. Stehfest algorithm 368 is used to invert the Laplace transform. Such software can be used to evaluate an additional-resistance well, even when a straight section evaluated using the Cooper–Jacob method is not achieved in the semilogarithmic plot of drawdown vs. log time during the pumping test. This solution is demonstrated in the comprehensive evaluation of 10 wells and 3 synthetic pumping tests.

1986 ◽  
Vol 23 (04) ◽  
pp. 851-858 ◽  
Author(s):  
P. J. Brockwell

The Laplace transform of the extinction time is determined for a general birth and death process with arbitrary catastrophe rate and catastrophe size distribution. It is assumed only that the birth rates satisfyλ0= 0,λj> 0 for eachj> 0, and. Necessary and sufficient conditions for certain extinction of the population are derived. The results are applied to the linear birth and death process (λj=jλ, µj=jμ) with catastrophes of several different types.


Author(s):  
Charles L. Epstein ◽  
Rafe Mazzeo

This chapter describes the construction of a resolvent operator using the Laplace transform of a parametrix for the heat kernel and a perturbative argument. In the equation (μ‎-L) R(μ‎) f = f, R(μ‎) is a right inverse for (μ‎-L). In Hölder spaces, these are the natural elliptic estimates for generalized Kimura diffusions. The chapter first constructs the resolvent kernel using an induction over the maximal codimension of bP, and proves various estimates on it, along with corresponding estimates for the solution operator for the homogeneous Cauchy problem. It then considers holomorphic semi-groups and uses contour integration to construct the solution to the heat equation, concluding with a discussion of Kimura diffusions where all coefficients have the same leading homogeneity.


2005 ◽  
Vol 50 (1-2) ◽  
pp. 179-185 ◽  
Author(s):  
P.G. Massouros ◽  
G.M. Genin

2021 ◽  
Vol 2021 (1) ◽  
Author(s):  
Raheel Kamal ◽  
Kamran ◽  
Gul Rahmat ◽  
Ali Ahmadian ◽  
Noreen Izza Arshad ◽  
...  

AbstractIn this article we propose a hybrid method based on a local meshless method and the Laplace transform for approximating the solution of linear one dimensional partial differential equations in the sense of the Caputo–Fabrizio fractional derivative. In our numerical scheme the Laplace transform is used to avoid the time stepping procedure, and the local meshless method is used to produce sparse differentiation matrices and avoid the ill conditioning issues resulting in global meshless methods. Our numerical method comprises three steps. In the first step we transform the given equation to an equivalent time independent equation. Secondly the reduced equation is solved via a local meshless method. Finally, the solution of the original equation is obtained via the inverse Laplace transform by representing it as a contour integral in the complex left half plane. The contour integral is then approximated using the trapezoidal rule. The stability and convergence of the method are discussed. The efficiency, efficacy, and accuracy of the proposed method are assessed using four different problems. Numerical approximations of these problems are obtained and validated against exact solutions. The obtained results show that the proposed method can solve such types of problems efficiently.


2020 ◽  
Vol 57 (4) ◽  
pp. 1045-1069
Author(s):  
Matija Vidmar

AbstractFor a spectrally negative self-similar Markov process on $[0,\infty)$ with an a.s. finite overall supremum, we provide, in tractable detail, a kind of conditional Wiener–Hopf factorization at the maximum of the absorption time at zero, the conditioning being on the overall supremum and the jump at the overall supremum. In a companion result the Laplace transform of this absorption time (on the event that the process does not go above a given level) is identified under no other assumptions (such as the process admitting a recurrent extension and/or hitting zero continuously), generalizing some existing results in the literature.


2021 ◽  
Vol 15 ◽  
pp. 174830262199962
Author(s):  
Patrick O Kano ◽  
Moysey Brio ◽  
Jacob Bailey

The Weeks method for the numerical inversion of the Laplace transform utilizes a Möbius transformation which is parameterized by two real quantities, σ and b. Proper selection of these parameters depends highly on the Laplace space function F( s) and is generally a nontrivial task. In this paper, a convolutional neural network is trained to determine optimal values for these parameters for the specific case of the matrix exponential. The matrix exponential eA is estimated by numerically inverting the corresponding resolvent matrix [Formula: see text] via the Weeks method at [Formula: see text] pairs provided by the network. For illustration, classes of square real matrices of size three to six are studied. For these small matrices, the Cayley-Hamilton theorem and rational approximations can be utilized to obtain values to compare with the results from the network derived estimates. The network learned by minimizing the error of the matrix exponentials from the Weeks method over a large data set spanning [Formula: see text] pairs. Network training using the Jacobi identity as a metric was found to yield a self-contained approach that does not require a truth matrix exponential for comparison.


Sign in / Sign up

Export Citation Format

Share Document