TITLE

Tracer Advection Using Dynamic Grid Adaptation and MM5

AUTHOR(S)
Iselin, John P.; Gutowski, William J.; Prusa, Joseph M.
PUB. DATE
January 2005
SOURCE
Monthly Weather Review;Jan2005, Vol. 133 Issue 1, p175
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
A dynamic grid adaptation (DGA) technique is used to numerically simulate tracer transport at meso- and regional scales. A gridpoint redistribution scheme is designed to maximize heuristic characteristics of a “good” grid. The advective solver used in conjunction with the DGA is the multidimensional positive definite advection transport algorithm (MPDATA). The DGA results for regional tracer transport are compared against results generated using the leapfrog as well as MPDATA advection schemes with uniformly spaced, static grids. Wind fields for all tracer transport algorithms are provided by the fifth-generation Pennsylvania State University–NCAR Mesoscale Model (MM5). A mesoscale-sized test case with idealized initial condition and wind field clearly shows qualitatively and quantitatively the advantage of using the dynamic adaptive grid, which is a marked reduction in numerical error. These results are further corroborated by more realistic test cases that used NCEP–NCAR reanalysis data from 6–11 March 1992 to set initial and boundary conditions for (i) a mesoscale-sized, 24-h simulation with an idealized initial tracer field, and (ii) a regional, 5-day simulation with water vapor field initialized from the reanalysis data but then treated as a passive tracer. A result of interest is that MPDATA substantially outperforms the leapfrog method with fourth-order artificial dissipation (central to MM5) in all of our test cases. We conclude that with dynamic grid adaptation, results with approximately the same accuracy as a uniform grid may be obtained using only a quarter of the grid points of the uniform grid MPDATA simulations. Compared to results generated using the leapfrog method on a uniform grid, the DGA does even better.
ACCESSION #
16311676

 

Related Articles

  • ICT Capstone projects: 'the edge of chaos'. Chard, Sue; Lloyd, Brenda; Tongariro, George // New Zealand Journal of Applied Computing & Information Technolog;2010, Vol. 14 Issue 1, p2 

    Capstone project processes and assessment methodologies continue to be problematic. Experience has led us to review our assessment rubrics and methods with every iteration in an attempt to refine and improve the practice and outcomes. This review has surveyed a broad range of capstone projects...

  • STATISTICAL DISTRIBUTION OF SOME ASTEROID PARAMETERS. POP, Mihail-Ioan // Bulletin of the Transilvania University of Brasov, Series III: M;2011 Part 1, Vol. 4 Issue 53, p139 

    Probability distributions of several asteroid parameters were obtained by using a Maximum Entropy Method combined with a form of the Simulated Annealing heuristic search algorithm. The parameters of interest were asteroid effective diameter, mass, density, albedo, magnitude and colour indices....

  • Arbitrary-norm hyperplane separation by variable neighbourhood search. Karam, Alejandro; Capoross, Gilles; Hansen, Pierre // IMA Journal of Management Mathematics;Apr2007, Vol. 18 Issue 2, p173 

    We consider the problem of separating two sets of points in a Euclidean space with a hyperplane that minimizes the sum of p-norm distances to the plane of points lying on the 'wrong' side of the plane. A variable neighbourhood search heuristic is used to determine the plane coefficients. For a...

  • OPTIMAL WEIGHTED ANCESTRY RELATIONSHIPS. Glover, Fred; Klastorin, T.; Klingman, D. // Management Science;Apr1974, Vol. 20 Issue 8, p1190 

    A solution method is given for a class of practical optimization problems requiring the determination of a consistent partial ordering for sets of objects, events, preferences, and the like. These problems are characterized by the existence of "noisy" (or contradictory) links of varying...

  • THE JOINT REPLENISHMENT PROBLEM: NEW HEURISTICS AND WORST CASE PERFORMANCE BOUNDS. Joneja, Dev // Operations Research;Jul/Aug90, Vol. 38 Issue 4, p711 

    The joint replenishment problem involves the lot sizing of several items with nonstationary demand in discrete time. The items have individual ordering costs and linear inventory holding costs. In addition, a joint ordering cost is incurred whenever one or more items is ordered together. This...

  • JACKSON'S RULE FOR SINGLE-MACHINE SCHEDULING: MAKING A GOOD HEURISTIC BETTER. Hall, Leslie A.; Shmoys, David B. // Mathematics of Operations Research;Feb92, Vol. 17 Issue 1, p22 

    We consider the scheduling problem in which jobs with release dates and delivery times are to be scheduled on one machine We present a &frac43;-approximation algorithm for the problem with precedence constraints among the jobs, and two polynomial approximation schemes for the problem without...

  • An Improved Heuristic Algorithm of Attribute Reduction in Rough Set. Shunxiang Wu; Maoqing Li; Wenting Huang; Sifeng Liu // Journal of Systems Science & Information;Sep2004, Vol. 2 Issue 3, p557 

    This paper introduces background of rough set theory, then proposes a new algorithm for finding optimal reduction and make comparison between the original algorithm and the improved one by the experiment about the nine standard data set in UL datable to explain the validity of the improved...

  • A Randomized Approach in Identifying High Quality Force Closure Grasp from Contact Points in Real Time. Watcharapol Watcharawisetkul; Mana Borwornpadungkitti; Nattee Niparnan; Attawith Sudsang // Applied Mechanics & Materials;2015, Vol. 781, p483 

    We propose a randomized algorithm that can effectively identify a large number of high quality force closure grasps in short time. This task is very important when we consider grasping in real time where a large number of force closure grasps are needed as candidates for planning in higher...

  • The Multiple Terminal Delivery Problem with Probabilistic Demands. Tillman, Frank A. // Transportation Science;Aug69, Vol. 3 Issue 3, p192 

    A heuristic approach is presented for solving the multiterminal delivery problem with constraints on the system and probabilistic demands. The algorithm is basically the same whether a commodity is being collected or delivered. This is a practical method that results in 'near optimal' solutions...

Share

Read the Article

Courtesy of NEW JERSEY STATE LIBRARY

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

Try another library?
Sign out of this library

Other Topics