We present a self-adaptive algorithm of inverse wavefield transform for the vertically magnetic components of the loop-source transient electromagnetic method (TEM) data to highlight the subsurface interfaces of elect...
详细信息
We present a self-adaptive algorithm of inverse wavefield transform for the vertically magnetic components of the loop-source transient electromagnetic method (TEM) data to highlight the subsurface interfaces of electric resistivity. Based on the theory of wavefield transform between the electromagnetic (EM) diffusion and the EM wave, the transform formula of the TEM field and its time derivative are presented. The velocity of the pseudo-wavefield is given. To numerically accomplish the inverse wavefield transform in a finite interval, the shortest time window for the pseudo-wavefield is determined by a newly proposed formula. Then the pseudo-time window can be directly figured out according to the time wind of TEM measuring time. To solve the inverse wavefield transform equation accurately, the precise integral method (PIM) is introduced with an automatic iteration control scheme. In the numerical results, the pseudo-wavefield traces transformed from the modeled TEM responses are physically rational as the pseudo-wavefield reflection arrives as expected. The data misfit between the fit and the modeled data is smaller than 10% and is smaller than 1% for the TEM responses earlier than 1 ms. The results illustrate that the transformed pseudo-wavefield can highlight the location and features of the electric interfaces through the reflection arrival and waveform.
The background numerical noise#0 is determined by the maximum of truncation error and round-off *** a chaotic system,the numerical error#(t)grows exponentially,say,#(t)=#0exp(kt),where k>0 is the so-called noise-gr...
详细信息
The background numerical noise#0 is determined by the maximum of truncation error and round-off *** a chaotic system,the numerical error#(t)grows exponentially,say,#(t)=#0exp(kt),where k>0 is the so-called noise-growing *** is the reason why one can not gain a convergent simulation of chaotic systems in a long enough interval of time by means of traditional algorithms in double precision,since the background numerical noise#0 might stop decreasing because of the use of double *** restriction can be overcome by means of the clean numerical simulation(CNS),which can decrease the background numerical noise#0 to any required tiny level.A lot of successful applications show the novelty and validity of the *** this paper,we further propose some strategies to greatly increase the computational efficiency of the CNS algorithms for chaotic dynamical *** is highly suggested to keep a balance between truncation error and round-off error and besides to progressively enlarge the background numerical noise#0,since the exponentially increasing numerical noise#(t)is much larger than *** examples are given to illustrate the validity of our strategies for the CNS.
In this work, we introduce a self-adaptive algorithm, based on viscosity approximation methods, to solve split common fixed point problems of demicontractive operators in real Hilbert spaces. Besides, the strong conve...
详细信息
In this work, we introduce a self-adaptive algorithm, based on viscosity approximation methods, to solve split common fixed point problems of demicontractive operators in real Hilbert spaces. Besides, the strong convergence theorem for the algorithm is established under some additional assumptions. On top of that, numerical results on image restoration problems are given. It shows that our proposed algorithm is efficient and outperforms the other algorithms for this experiment.
In this paper, we study the split common fixed-point problem of quasi-nonexpansive operators in Hilbert space. We establish a weak convergence theorem of the proposed iterative algorithm, which combines the primal-dua...
详细信息
In this paper, we study the split common fixed-point problem of quasi-nonexpansive operators in Hilbert space. We establish a weak convergence theorem of the proposed iterative algorithm, which combines the primal-dual method and the inertial method. In our algorithm, the step sizes are chosen self-adaptively so that the implementation of the algorithm does not need any prior information about bounded linear operator norms. Finally, numerical results are included to illustrate the efficiency of the proposed algorithm.
In the Philippines, creating ways to keep our public emergency responders safe is an everyday issue. With the help of fast-paced wireless technology, problems are now solvable such as monitoring, creating miniaturized...
详细信息
ISBN:
(纸本)9781665419710
In the Philippines, creating ways to keep our public emergency responders safe is an everyday issue. With the help of fast-paced wireless technology, problems are now solvable such as monitoring, creating miniaturized sensors or devices, etc. This study will focus on using a barometric altimeter sensor that has a system with a self-adaptive algorithm. Compared to other existing studies regarding indoor localization or identifying floor height which are time-consuming or labor-intensive, this will benefit our countries' finest specifically firefighters. Lessen their worries about accidents or death due to suffocation for losing their way inside the burning multi-floor building. Through our system, it will show the altitude measurement and estimated floor levels of the firefighter who is wearing the device. This study was conducted at Ayala Circuit Makati with 10 samples and gathered an accuracy of 93.820% with the system undergone self-adaptive algorithm over 86.263% of without undergone self-adaptive algorithm.
We introduce a new self-adaptive algorithm for applications to image restoration problems. In order to study an image restoration, we consider the algorithm that contains inertial effects and step sizes, which is inde...
详细信息
We introduce a new self-adaptive algorithm for applications to image restoration problems. In order to study an image restoration, we consider the algorithm that contains inertial effects and step sizes, which is independent from the norm of the bounded linear operator. With some control conditions, the strong convergence to the minimum norm solution of the algorithm is obtained. Convergence analysis of the proposed algorithm is also discussed. Moreover, numerical results of image restoration problems illustrate that the proposed algorithm is efficient and outperforms other ones.
A precise matching is required between the emitted laser beam and Field-of-View (FOV) of the received telescope to ensure useful observation of middle and upper atmospheric lidar. Nowadays, manual matching is commonly...
详细信息
A precise matching is required between the emitted laser beam and Field-of-View (FOV) of the received telescope to ensure useful observation of middle and upper atmospheric lidar. Nowadays, manual matching is commonly used, but it is time-consuming and has poor stability. Automatic matching is still hard to meet the actual application requirement because it is challenging to balance accuracy and efficiency. Thus, in this paper, a self-adaptive matching algorithm is proposed. In this process, the correlation coefficient between the echo signal and the standard pattern is considered as the matching criterion. It adaptively updates the adjustment step according to the current position?s matching state and uses the correlation coefficient?s increasing gradient as the adjustment direction. The above matching process is iteratively conducted until meeting the convergence condition. The matching process is within 3?5min. These results suggest that the proposed automated matching algorithm can play an important role in unattended atmospheric lidars.
In this paper, for two different forms of non-smooth convex optimization problems, we investigate the self-adaptive algorithms with inertia acceleration. Firstly, we propose a self-adaptive proximal gradient algorithm...
详细信息
In this paper, for two different forms of non-smooth convex optimization problems, we investigate the self-adaptive algorithms with inertia acceleration. Firstly, we propose a self-adaptive proximal gradient algorithm with an inertial step. Under reasonable parameters, the strong convergence theorem is established. Secondly, we propose a self-adaptive split proximal algorithm with inertial acceleration. We prove that our algorithm converges strongly under suitable conditions. Notably, both inertial algorithms are extended to multi-step inertial version to accelerate the convergence of the algorithms. Finally, numerical results illustrate the performances of our algorithms.
In the field of convex optimization, numerous problems can be modeled as the split variational inclusion problem. In this paper, we want to give self-adaptive algorithms and inertial self-adaptive algorithms to study ...
详细信息
In the field of convex optimization, numerous problems can be modeled as the split variational inclusion problem. In this paper, we want to give self-adaptive algorithms and inertial self-adaptive algorithms to study the split variational inclusion problems. Next, we propose related convergence theorems under suitable conditions.
In this paper, we present a self-adaptive algorithm and an inertial version for solving convex bilevel optimization problems. We establish the strong convergence of our proposed algorithms. The step-sizes in our algor...
详细信息
In this paper, we present a self-adaptive algorithm and an inertial version for solving convex bilevel optimization problems. We establish the strong convergence of our proposed algorithms. The step-sizes in our algorithms for the inner level optimization problem are selected without prior knowledge of operator norms. A numerical experiment is included to illustrate the performances of our algorithms and some comparisons are present with related algorithms.
暂无评论