نتایج جستجو برای: taylor algorithm
تعداد نتایج: 771812 فیلتر نتایج به سال:
the effect of weak shear thickening and shear thinning on the stability of the taylor-couette flow is explored for a carreau-bird fluid in the narrow-gap limit. the galerkin projection method is used to derive a low-order dynamical system from the conservation of mass and momentum equations. in comparison with the newtonian system, the present equations include additional nonlinear coupling in ...
A recursive approach for the compensation of the ionospheric phase contamination is proposed based on multistage Taylor expansion and the extended Kalman filter. The proposed algorithm can dynamically compensate the ionospheric phase contamination. We show by numerical examples that the proposed algorithm outperformances the conventional methods such as the polynomial phase signal (PPS) and the...
Axisymmetric steady solutions of Taylor–Couette flow at high Taylor numbers are studied numerically and theoretically. As the axial period solution shortens from approximately one gap length, Nusselt number goes through two peaks before returning to laminar flow. In this process, asymptotic nature changes in four stages, as revealed by analysis. When aspect ratio roll cell is unity, has proport...
We present an algorithm producing all rational functions f with prescribed n+ 1 Taylor coefficients at the origin and such that ‖f‖∞ ≤ 1 and deg f ≤ k for every fixed k ≥ n. The case where k < n is also discussed.
In this paper, we investigate the convergence speed of Arimoto-Blahut algorithm. For many channel matrices, is exponential, but for some matrices it slower than exponential. By analyzing Taylor expansion defining function algorithm, will make conditions clear exponential or convergence. The analysis slow in paper new. Based on analysis, compare speeds algorithm numerically with values obtained ...
This paper describes a fast search algorithm f o r warping motion compensation schemes which is bused on a first order approximation of a Taylor series. In comparison to a full search algorithm the technique significantly reduces the required computational load (by a factor of approximately f i f ty) whilst maintaining the performance in terms of prediction error. Further gains in prediction er...
The Taylor series method is one of the earliest analytic-numeric algorithms for approximate solution of initial value problems for ordinary differential equations. The main idea of the rehabilitation of this algorithms is based on the approximate calculation of higher derivatives using well-known finite-difference technique for the partial differential equations. The approximate solution is giv...
A particle method is presented for computing vortex sheet motion in three-dimensional flow. The particles representing the sheet are advected by a regularized Biot– Savart integral in which the exact singular kernel is replaced by the Rosenhead– Moore kernel. New particles are inserted to maintain resolution as the sheet rolls up. The particle velocities are evaluated by an adaptive treecode al...
In recent years, microcontrollers have been used in many areas. Implementation of a circuit by using several discrete analog and digital devices can be done using only one microcontroller. However, industrial microcontrollers have limited resources to implement complex mathematical functions, such as Taylor series. In this work, implementation of Taylor series on a PIC microcontroller is given....
Improving the order of accuracy for any numerical method remains a continuing quest. For a large class of computational uid dynamics (CFD) problems, the discrete approximate solution error is viewed as truncation of a Taylor series expansion. In this paper, a weak statement Galerkin matrix perturbation (GMP) method is utilized yielding simple tridiagonal forms that reduce, or annihilate in spec...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید