TITLE

Stability of Semi-Implicit and Iterative Centered-Implicit Time Discretizations for Various Equation Systems Used in NWP

AUTHOR(S)
Bénard, P.
PUB. DATE
October 2003
SOURCE
Monthly Weather Review;Oct2003, Vol. 131 Issue 10, p2479
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
The stability of the classical semi-implicit scheme and some more advanced iterative schemes recently proposed for NWP purposes is examined. In all of these schemes, the solution of the centered-implicit nonlinear equation is approached by an iterative fixed-point algorithm, preconditioned by a simple, constant in time, linear operator. A general methodology for assessing analytically the stability of these schemes on canonical problems for a vertically unbounded atmosphere is presented. The proposed method is valid for all the equation systems usually employed in NWP. However, as in earlier studies, the method can be applied only in simplified meteorological contexts, thus overestimating the actual stability that would occur in more realistic meteorological contexts. The analysis is performed in the spatially continuous framework, hence allowing the elimination of the spatial discretization or the boundary conditions as possible causes of the fundamental instabilities linked to the time scheme itself. The general method is then shown concretely to apply to various time-discretization schemes and equation systems (namely, shallow-water and fully compressible Euler equations). Analytical results found in the literature are obtained from the proposed method, and some original results are presented.
ACCESSION #
10840842

 

Related Articles

  • ROBUST SIMULTANEOUS STABILIZATION OF UNCERTAIN DISCRETE-TIME SYSTEMS. PAKSHIN, PAVEL; SOLOVIEV, SERGEY // Systems Science;2008, Vol. 34 Issue 1, p39 

    The paper considers a set of linear discrete-time systems with uncertain parameters. A method of synthesis of robust control which simultaneously stabilizes all the systems from this set is proposed. This method consists of two steps. First, a set of stochastic comparison systems with...

  • Stable iterative adaptive dynamic programming algorithm with approximation errors for discrete-time nonlinear systems. Wei, Qinglai; Liu, Derong // Neural Computing & Applications;May2014, Vol. 24 Issue 6, p1355 

    In this paper, a novel iterative adaptive dynamic programming (ADP) algorithm is developed to solve infinite horizon optimal control problems for discrete-time nonlinear systems. When the iterative control law and iterative performance index function in each iteration cannot be accurately...

  • New iterative algorithms for coupled matrix equations. Lingling Lv; Lei Zhang // Journal of Computational Analysis & Applications;Dec2015, Vol. 19 Issue 6, p947 

    Iterative algorithms are presented for solving coupled matrix equations including the well-known coupled Sylvester matrix equations and the discrete-time coupled Markovian jump Lyapunov matrix equations as special cases. The proposed methods remove the restriction that the considered matrix...

  • A Finite Iterative Method for Solving the General Coupled Discrete-Time Periodic Matrix Equations. Hajarian, Masoud // Circuits, Systems & Signal Processing;Jan2015, Vol. 34 Issue 1, p105 

    Analysis and design of linear periodic control systems are closely related to the discrete-time periodic matrix equations. In this paper, we propose an iterative algorithm based on the conjugate gradient method on the normal equations (CGNE) for finding the solution group of the general coupled...

  • Iterative System Identification and Controller Design with an LMI-Based Framework: Windsurfer-Like Approach. Hiramoto, Kazuhiko // Journal of Applied Mathematics;2012, p1 

    An LMI-based method for the integrated system identification and controller design is proposed in the paper. We use the fact that a class of a system identification problem results in an LMI optimization problem. By combining LMIs for the system identification and those to obtain a discrete time...

  • Guest Editorial. Murli, Almerico; Toraldo, Gerardo // Computational Optimization & Applications;Sep2007, Vol. 38 Issue 1, p1 

    The article discusses various reports published within the issue including one on a novel algorithm for unconstrained minimization and another one which describes the use of an iterative method.

  • An Improved Algorithm for the Constrained Bottleneck Spanning Tree Problem. Punnen, Abraham P.; Nair, K.P.K. // INFORMS Journal on Computing;Winter96, Vol. 8 Issue 1, p41 

    We propose an algorithm to solve the bottleneck spanning tree problem with an additional linear constraint. Our algorithm has an improved worst case performance over the best known algorithm for this problem, In a graph with n nodes and m edges such that m ≥ O(n log n log log*n), where...

  • Stopping Criteria for Finite Length Genetic Algorithms. Aytug, Haldun; Koehler, Gary J. // INFORMS Journal on Computing;Spring96, Vol. 8 Issue 2, p183 

    Presents a study that developed bounds on the number of iterations required to achieve a level of confidence that guarantees that a genetic algorithm (GA) has found an optimal solution. Definition of GA; Review of related GA research; Stopping criteria for GA.

  • Asymptotic Behavior of the Lipschitz-1/2 Modulus of the PL-process for Truncated and Censored Data. Yong Zhou; Guo Fu Wu, E.M.E.; Xue Lei Jiang, E.M.E. // Acta Mathematica Sinica;2003, Vol. 19 Issue 4, p729 

    In this paper, we give a detailed description of the local behavior of the Lipschitz-½ modulus for cumulative hazard process and PL-process when the data are subject to left truncation and right censored observations. We establish laws of the iterated logarithm of the Lipschitz-½ modulus...

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics