نتایج جستجو برای: successive approximation method
تعداد نتایج: 1791317 فیلتر نتایج به سال:
The system of gas-dynamic equations, corresponding to the first order of approximation in the successive approximations method of solution of kinetic Boltzmann equation for multi-component mixture of gases, is derived. Interpretation of turbulent flows of gases is proposed within frames of multi-component gas dynamics, as stratified on components flows of gases. PACS numbers: 02.30.Mv, 05.20.Dd...
Calculation of the turbulent boundary layer momentum thickness around a NACA 4416 airfoil section has been made by a successive approximation method developed by one of the authors for two-dimensional I and axisymmetric flows. These results are compared with experimental results obtained from flight tests with a sailplane--Schweizer TG-3— | with reasonable results. I
The solvability of forward-backward stochastic differential equations with absorption coefficients is studied by the successive approximation method. The existence and uniqueness of an adapted solution are established for the equations which allow the diffusion in the forward stochastic differential equations to be degenerate. The authors also study their connection with partial differential eq...
This article presents the results on existence, uniqueness and stability of mild solution for impulsive stochastic semilinear functional differential equations with non-Lipschitz condition and Lipschitz condition. The results are obtained by using the method of successive approximation and Bihari’s inequality.
In this paper, we study the convergence of the generalized accelerated overrelaxation (GAOR) iterative method. That is an extension of the classical convergence result of the generalized successive overrelaxation (GSOR) iterative method. We proposed some theorems, which they obtain better results than similar works. By some numerical examples we show the goodness of our results. 2006 Elsevier I...
In VLSI technology, power consumption and delay becomes a major problem in multipliers. To reduce these issues we propose a new multiplier algorithm that combines numerical transformation and shift and add technique. In this design N X N bitmultiplication is done by using successive approximation of (N-1) X (N-1) bit multiplier. The strength of the multiplication is reduced by weight reduction ...
We show how the event-based notation offered by Event-B may be augmented by algorithmic modelling constructs without disrupting the refinement-based development process.
We present an SOR-type algorithm and a Jacobi-type algorithm that can effectively be applied to the `1-`2 problem by exploiting its special structure. The algorithms are globally convergent and can be implemented in a particularly simple manner. Relations with coordinate minimization methods are discussed.
We present an SOR-type algorithm and a Jacobi-type algorithm that can effectively be applied to the `1-`2 problem by exploiting its special structure. The algorithms are globally convergent and can be implemented in a particularly simple manner. Relations with coordinate minimization methods are discussed.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید