In this paper, an accurate algorithm for the method of successive approximations for near-parabolic orbits is established symbolically. Numerical applications are given for motion predictions at fifteen epochs
2. 迭代加权法 docin.com|基于2个网页 例句 释义: 全部,逐次平均法,迭代加权法 更多例句筛选 1. It isbased onK-shortest-pathsalgorithmcoupled withthemethodofsuccessiveaverages. 基于K最短路算法和连续平均法,设计了求解模型算法。 www.dictall.com
Bar-Gera H, Boyce D (2006) Solving a non-convex combined travel forecasting model by the method of successive averages with constant step sizes. Transp Res Part B 40(5):351–367 Article Google Scholar Bell MGH (1995) Alternative to Dial’s logit assignment algorithm. Transp Res Part B...
The variational iteration method of the local fractional operator was employed to solve the local fractional partial differential equations [75, 104, 118–125]. As a starting point, we consider the local fractional variational iteration algorithm, namely, (5.2)Φn+1τ=Φnτ+1Γ1+ε∫0τλL...
In numerical analysis, a numerical method is a mathematical tool designed to solve numerical problems. The implementation of a numerical method with an appropriate convergence check in a programming language is called a numerical algorithm cppheat-equationnumerical-methodsgauss-eliminationwave-equationnumeric...
Again, we assume the image intensity functions of two successive frames, in a uniform moving area, differ only due to a positional shift (dl, d2): (5.29)fn1n2t=fn1−d1,n2−d2,t−1. Taking the 2-D discrete-time Fourier transform (DTFT) on the spatial variables (n1,n2), we...
of a walking pedestrian in real time. The active shape model used was generated automatically from real image data and incorporates variability in shape due to orientation as well as object flexibility. A Kalman filter is used to control spatial scale for feature search over successive frames. ...
Jacobi: The Jacobi preconditioner is the diagonal of the matrix A, with an assumption that all diagonal elements are non-zero. SSOR: The symmetric successive over-relaxation preconditioner, implemented as M = (D+L) D^{-1} (D+L)^T. ...
The proposed algorithm based on iterative method applied to solve 2DLFFIE (3.1) is said to be numerically stable with respect to the choice of the first iteration if there exist four independent constants \(k_{1},k_{2},k_{3},k_{4}>0\) such that $$\begin{aligned} D^{*}(u_{m...
Due to the local (cellular automata like) structure of the lattice Boltzmann algorithm, the vectorisation and parallelisation is easily possible with a very good performance on modern high performance computers [5]. Another special feature of the lattice Boltzmann method is the efficient and cheap...