A Problem with the Robert–Asselin Time Filter for Three-Time-Level Semi-Implicit Semi-Lagrangian Discretizations
نویسندگان
چکیده
منابع مشابه
Semi-Implicit Time Differencing
The basic ideas of semi-implicit time differencing are reviewed, including analytical results not widely referenced in the meteorological literature. It is shown that solving the resulting implicit equations by simple fixed-point iteration requires a relatively small time step to guarantee convergence, thus defeating the purpose of the semiimplicit method. In contrast, classical iteration metho...
متن کاملParallel Semi-Implicit Time Integrators
In this paper, we further develop a family of parallel time integrators known as Revisionist Integral Deferred Correction methods (RIDC) to allow for the semiimplicit solution of time dependent PDEs. Additionally, we show that our semi-implicit RIDC algorithm can harness the computational potential of multiple general purpose graphical processing units (GPUs) in a single node by utilizing exist...
متن کاملAsynchronous Evolution for Fully-Implicit and Semi-Implicit Time Integration
We propose a series of techniques for hybridizing implicit and semi-implicit time integration methods in a manner that retains much of the speed of the implicit method without sacrificing all of the higher quality vibrations one obtains with methods that handle elastic forces explicitly. We propose our scheme in the context of asynchronous methods, where different parts of the mesh are evolved ...
متن کاملA semi-Lagrangian scheme for L-penalized minimum time problems
In this paper we consider a semi-Lagrangian scheme for minimum time problems with L-penalization. The minimum time function of the penalized control problem can be characterized as the solution of a Hamilton-Jacobi Bellman (HJB) equation. Furthermore, the minimum time converges with respect to the penalization parameter to the minimum time of the non-penalized problem. To solve the control prob...
متن کاملAcceleration of Lagrangian Method for the Vehicle Routing Problem with Time Windows
The analytic center cutting plane method (ACCPM) is one of successful methods to solve nondifferentiable optimization problems. In this paper ACCPM is used for the first time in the vehicle routing problem with time windows (VRPTW) to accelerate lagrangian relaxation procedure for the problem. At first the basic cutting plane algorithm and its relationship with column generation method is clari...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Monthly Weather Review
سال: 2004
ISSN: 0027-0644,1520-0493
DOI: 10.1175/1520-0493(2004)132<0600:apwtrt>2.0.co;2