Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 7

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
Wyszukiwano:
w słowach kluczowych:  analiza zbieżności
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
EN
This study intends to investigate the impacts of scheme type, time step, and error threshold on the stability of numerical simulation in the groundwater modeling. Hence, a two-dimensional finite element (FE) was implemented to simulate groundwater flow in a synthetic test case and a real-world study (Birjand aquifer). To verify the proposed model in both cases, the obtained results were compared with analytical solutions and observed values. The stability of numerical results was analyzed through different schemes and time-step sizes. Besides, the effect of the error threshold was examined by considering different threshold values. The results confirmed that the FE model has a good capacity to simulate groundwater fluctuations even for the real problem with more complexities. Examination of implicit outputs indicated that groundwater simulations based on this scheme have good accuracy, stability, and proper convergence in all time intervals. However, in the explicit and Crank–Nicolson schemes the time interval should be less than or equal to 0.001 and 0.1 day, respectively. Also, results reveal that for making stability in all schemes the value of the error threshold should not be more than 0.0001 m. Moreover, it derived that the boundary conditions of the aquifer influence the stability of numerical outputs. Finally, it was comprehended that as time interval and error threshold increases, the oscillation rate propagated.
EN
In this paper, we introduce and study a new system of variational inclusions which is called a system of nonlinear implicit variational inclusion problems with A-monotone and H-monotone operators in semi-inner product spaces. We define the resolvent operator associated with A-monotone and H-monotone operators and prove its Lipschitz continuity. Using resolvent operator technique, we prove the existence and uniqueness of solution for this new system of variational inclusions. Moreover, we suggest an iterative algorithm for approximating the solution of this system and discuss the convergence analysis of the sequences generated by the iterative algorithm under some suitable conditions.
EN
This paper describes a numerical scheme for a class of fractional diffusion equations with fixed time delay. The study focuses on the uniqueness, convergence and stability of the resulting numerical solution by means of the discrete energy method. The derivation of a linearized difference scheme with convergence order O(τ 2−α + h4) in L ∞-norm is the main purpose of this study. Numerical experiments are carried out to support the obtained theoretical results.
EN
In this paper we present the extraproximal method for computing the Stackelberg/Nash equilibria in a class of ergodic controlled finite Markov chains games. We exemplify the original game formulation in terms of coupled nonlinear programming problems implementing the Lagrange principle. In addition, Tikhonov's regularization method is employed to ensure the convergence of the cost-functions to a Stackelberg/Nash equilibrium point. Then, we transform the problem into a system of equations in the proximal format. We present a two-step iterated procedure for solving the extraproximal method: (a) the first step (the extra-proximal step) consists of a “prediction” which calculates the preliminary position approximation to the equilibrium point, and (b) the second step is designed to find a “basic adjustment” of the previous prediction. The procedure is called the “extraproximal method” because of the use of an extrapolation. Each equation in this system is an optimization problem for which the necessary and efficient condition for a minimum is solved using a quadratic programming method. This solution approach provides a drastically quicker rate of convergence to the equilibrium point. We present the analysis of the convergence as well the rate of convergence of the method, which is one of the main results of this paper. Additionally, the extraproximal method is developed in terms of Markov chains for Stackelberg games. Our goal is to analyze completely a three-player Stackelberg game consisting of a leader and two followers. We provide all the details needed to implement the extraproximal method in an efficient and numerically stable way. For instance, a numerical technique is presented for computing the first step parameter (λ) of the extraproximal method. The usefulness of the approach is successfully demonstrated by a numerical example related to a pricing oligopoly model for airlines companies.
EN
A simple semi-recursive routine for nonlinearity recovery in Hammerstein systems is proposed. The identification scheme is based on the Haar wavelet kernel and possesses a simple and compact form. The convergence of the algorithm is established and the asymptotic rate of convergence (independent of the input density smoothness) is shown for piecewise-Lipschitz nonlinearities. The numerical stability of the algorithm is verified. Simulation experiments for a small and moderate number of input-output data are presented and discussed to illustrate the applicability of the routine.
6
Content available remote On-line wavelet estimation of Hammerstein system nonlinearity
EN
A new algorithm for nonparametric wavelet estimation of Hammerstein system nonlinearity is proposed. The algorithm works in the on-line regime (viz., past measurements are not available) and offers a convenient uniform routine for nonlinearity estimation at an arbitrary point and at any moment of the identification process. The pointwise convergence of the estimate to locally bounded nonlinearities and the rate of this convergence are both established.
EN
We study convergence properties of a new nonlinear Lagrangian method for nonconvex semidefinite programming. The convergence analysis shows that this method converges locally when the penalty parameter is less than a threshold and the error bound of solution is proportional to the penalty parameter under the constraint nondegeneracy condition, the strict complementarity condition and the strong" second order sufficient conditions. The major tools used in the analysis include the second implicit function theorem and differentials of Lowner operators.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.