نتایج جستجو برای: chebyshev acceleration technique
تعداد نتایج: 658725 فیلتر نتایج به سال:
In this paper, a spectral collocation approach based on the rational Chebyshev functions for solving the axisymmetric stagnation point flow on an infinite stationary circular cylinder is suggested. The Navier-Stokes equations which govern the flow, are changed to a boundary value problem with a semi-infinite domain and a third-order nonlinear ordinary differential equation by applying proper si...
In this paper, we focus on solving the decentralized optimization problem of minimizing sum n objective functions over a multi-agent network. The agents are embedded in an undirected graph where they can only send/receive information directly to/from their immediate neighbors. Assuming smooth and strongly convex functions, propose Optimal Gradient Tracking (OGT) method that achieves optimal gra...
A Chebyshev or Fourier series may be evaluated on the standard collocation grid by the Fast Fourier Transform (FFT). Unfortunately, the FFT does not apply when one needs to sum a spectral series at N points which are spaced irregularly. The cost becomes O(N2) operations instead of the FFT's O(N log N). This sort of "off-grid" interpolation is needed by codes which dynamically readjust the grid ...
BACKGROUND Size and shape of the treatment zone after Irreversible electroporation (IRE) can be difficult to depict due to the use of multiple applicators with complex spatial configuration. Exact geometrical definition of the treatment zone, however, is mandatory for acute treatment control since incomplete tumor coverage results in limited oncological outcome. In this study, the "Chebyshev Ce...
ITPACK 2C is a collection of seven FORTRAN subroutines for solving large sparse linear systems by adaptive accelerated iterative algorithms. Basic iterative procedures, such as the Jacobi method, the Successive Overrelaxation method, the Symmetric Successive Overrelaxation method, and the RS method for the reduced system are combined, where possible, with acceleration procedures such as Chebysh...
In this note, we provide simple convergence analysis for the algebraic multilevel iteration methods [37, 51]. We consider two examples of AMLI methods with different polynomial acceleration. The first one is based on shifted and scaled Chebyshev polynomial and the other on the polynomial of best approximation to x−1 on a finite interval [λmin , λmax ], 0 < λmin < λmax in the ‖ ·‖∞ norm. The con...
It is shown that the four vector extrapolation methods, minimal polynomial extrapolation, reduced rank extrapolation, modified minimal polynomial extrapolation, and topological epsilon algorithm, when applied to linearly generated vector sequences, are Krylov subspace methods, and are equivalent to some well known conjugate gradient type methods. A unified recursive method that includes the con...
In virtually all rendering systems, linear light sources are modeled with a series of point light sources that require considerable computing resources to produce realistic looking results. A general solution for shading surfaces illuminated by a linear light source is proposed. A formulation allowing for faster computation of the di use component of light re ection is derived. By assuming Phon...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید