Grid Coupling in TIMCOM 鄭偉明 TAY Wee-Beng Department of Atmospheric Sciences National Taiwan University.

Slides:



Advertisements
Similar presentations
Theory of Computer Science - Algorithms
Advertisements

4 th order Embedded Boundary FDTD algorithm for Maxwell Equations Lingling Wu, Stony Brook University Roman Samulyak, BNL Tianshi Lu, BNL Application collaborators:
Joint Mathematics Meetings Hynes Convention Center, Boston, MA
2ª aula Evolution Equation. The Finite Volume Method.
RAMS/BRAMS Basic equations and some numerical issues.
Image Enhancement in the Frequency Domain Part III
Numerical Simulation of Wave-Seawall Interaction Clive Mingham, Derek Causon, David Ingram and Stephen Richardson Centre for Mathematical Modelling and.
3D spherical gridding based on equidistant, constant volume cells for FV/FD methods A new method using natural neighbor Voronoi cells distributed by spiral.
ME 595M J.Murthy1 ME 595M: Computational Methods for Nanoscale Thermal Transport Lecture 9: Introduction to the Finite Volume Method for the Gray BTE J.
Coupling Continuum Model and Smoothed Particle Hydrodynamics Methods for Reactive Transport Yilin Fang, Timothy D Scheibe and Alexandre M Tartakovsky Pacific.
Morphing Rational B-spline Curves and Surfaces Using Mass Distributions Tao Ju, Ron Goldman Department of Computer Science Rice University.
For the Lesson: Eta Characteristics, Biases, and Usage December 1998 ETA-32 MODEL CHARACTERISTICS.
A Bezier Based Approach to Unstructured Moving Meshes ALADDIN and Sangria Gary Miller David Cardoze Todd Phillips Noel Walkington Mark Olah Miklos Bergou.
Combating Dissipation. Numerical Dissipation  There are several sources of numerical dissipation in these simulation methods  Error in advection step.
Isoparametric Elements
Robust Real-time Object Detection by Paul Viola and Michael Jones ICCV 2001 Workshop on Statistical and Computation Theories of Vision Presentation by.
Two Approaches to Multiphysics Modeling Sun, Yongqi FAU Erlangen-Nürnberg.
Mesh refinement methods in ROMS Laurent Debreu INRIA, Grenoble, France In collaboration with Patrick Marchesiello and Pierrick Penven (IRD, Brest, France)
Parallel Mesh Refinement with Optimal Load Balancing Jean-Francois Remacle, Joseph E. Flaherty and Mark. S. Shephard Scientific Computation Research Center.
Use of satellite altimeter data for validating large scale hydraulic models Matt Wilson, University of Exeter Doug Alsdorf, Ohio State University Paul.
Basic Math Vectors and Scalars Addition/Subtraction of Vectors Unit Vectors Dot Product.
Efficient Parallelization for AMR MHD Multiphysics Calculations Implementation in AstroBEAR.
Detecting the Domain Structure of Proteins from Sequence Information Niranjan Nagarajan and Golan Yona Department of Computer Science Cornell University.
Numerical Schemes for Advection Reaction Equation Ramaz Botchorishvili Faculty of Exact and Natural Sciences Tbilisi State University GGSWBS,Tbilisi, July.
Tal Mor  Create an automatic system that given an image of a room and a color, will color the room walls  Maintaining the original texture.
By Yevgeny Yusepovsky & Diana Tsamalashvili the supervisor: Arie Nakhmani 08/07/2010 1Control and Robotics Labaratory.
Hybrid WENO-FD and RKDG Method for Hyperbolic Conservation Laws
Multiscale Modelling Mateusz Sitko
Radiative transfers in complex geometry for CFD modelling the urban canopy Maya Milliez.
A COMPARISON OF SOME SHALLOW WATER TEST CASES IN HOMME USING NUMERICALLY AND ANALYTICALLY COMPUTED TRANSFORMATIONS Numerical Approximations of Coordinate.
Kevin Trott, x266 PAR Government Systems Corporation Geocomp4 Conference 27 July D Topology for Terrain Reasoning.
Initial Results from the Integration of Earth and Space Frameworks Cecelia DeLuca/NCAR, Alan Sussman/University of Maryland, Gabor Toth/University of Michigan.
Effective Computation of Linear Filters The following properties are used to shorten the computation time f  g = g  f, f  (g  h) = (f  g)  h, f 
A study of relations between activity centers of the climatic system and high-risk regions Vladimir Penenko & Elena Tsvetova.
3.3.3: Semi-Lagrangian schemes AOSC614 class Hong Li.
Stable, Circulation- Preserving, Simplicial Fluids Sharif Elcott, Yiying Tong, Eva Kanso, Peter Schröder, and Mathieu Desbrun.
David Medvigy (Duke University) Amazon in Perspective: Integrated Science for a Sustainable Future Manaus, Brazil 20 November 2008 Hydroclimatic consequences.
1 Complex Images k’k’ k”k” k0k0 -k0-k0 branch cut   k 0 pole C1C1 C0C0 from the Sommerfeld identity, the complex exponentials must be a function.
Goal and Motivation To study our (in)ability to detect inconsistencies in the illumination of objects in images Invited Talk! – Hany Farid: Photo Forensincs:
1 Computational Vision CSCI 363, Fall 2012 Lecture 24 Computing Motion.
Introduction to Scientific Computing II Multigrid Dr. Miriam Mehl.
1 IV European Conference of Computational Mechanics Hrvoje Gotovac, Veljko Srzić, Tonći Radelja, Vedrana Kozulić Hrvoje Gotovac, Veljko Srzić, Tonći Radelja,
1 EEE 431 Computational Methods in Electrodynamics Lecture 7 By Dr. Rasime Uyguroglu
1 Data Structures for Scientific Computing Orion Sky Lawlor /04/14.
1 Application of Weighted Essentially Non-Oscillatory Limiting to Compact Interpolation Schemes Debojyoti Ghosh Graduate Research Assistant Alfred Gessow.
Numerical Algorithm Development and Testing in HYCOM.
Lecture Objectives: Define 1) Reynolds stresses and
Machine Vision Edge Detection Techniques ENT 273 Lecture 6 Hema C.R.
An Exact Algorithm for Difficult Detailed Routing Problems Kolja Sulimma Wolfgang Kunz J. W.-Goethe Universität Frankfurt.
Digital Image Processing CSC331
Efficient Simulation of Large Bodies of Water by Coupling Two and Three Dimensional Techniques SIGGRAPH 2006 Geoffrey Irving Eran Guendelman Frank Losasso.
Representing Effects of Complex Terrain on Mountain Meteorology and Hydrology Steve Ghan, Ruby Leung, Teklu Tesfa, PNNL Steve Goldhaber, NCAR.
Lecture Objectives: - Numerics. Finite Volume Method - Conservation of  for the finite volume w e w e l h n s P E W xx xx xx - Finite volume.
Summary of “Efficient Deep Learning for Stereo Matching”
Range Image Segmentation for Modeling and Object Detection in Urban Scenes Cecilia Chen & Ioannis Stamos Computer Science Department Graduate Center, Hunter.
Fitting: The Hough transform
Convergence in Computational Science
Objective Review Reynolds Navier Stokes Equations (RANS)
Finite Volume Method for Unsteady Flows
Patric Perez, Michel Gangnet, and Andrew Black
Binocular Stereo Vision
Introduction to Scientific Computing II
Minimum Spanning Trees
A parameterization for sub-grid emission variability
Ernest Valveny Computer Vision Center
Spatial Interpolation (Discrete Point Data)
High Accuracy Schemes for Inviscid Traffic Models
A Lagrangian Dynamic Model of Sea Ice for Data Assimilation
Low Order Methods for Simulation of Turbulence in Complex Geometries
Altai flood’s 2014 and model precipitationg forecasts
Presentation transcript:

Grid Coupling in TIMCOM 鄭偉明 TAY Wee-Beng Department of Atmospheric Sciences National Taiwan University

Motivation Multi-domain problems Multi-domain problems Problems which require 2 or more domains (grids) to solve efficiently. Problems which require 2 or more domains (grids) to solve efficiently. Arises due to difference in topography or restriction in computation resources. Arises due to difference in topography or restriction in computation resources.

Objective To transfer values from grid A to B and vice versa efficiently and conservatively To transfer values from grid A to B and vice versa efficiently and conservatively Efficiently Efficiently Algorithm must not take up too much computational resources. Algorithm must not take up too much computational resources. Relatively simple to program. Relatively simple to program. Conservatively Conservatively Flux must be conserved, minimal dissipation. Flux must be conserved, minimal dissipation. No appearance of unrealistic value. No appearance of unrealistic value. To ensure stability To ensure stability

Multi-domain examples From simple to complex From simple to complex

Multi-domain in TIMCOM Features Features Both Cartesian grids (TAI and NPB) Both Cartesian grids (TAI and NPB) Same orientation, fixed in space Same orientation, fixed in space NPB is twice the size of TAI NPB is twice the size of TAI Boundary faces of TAI positioned exactly at center of NPB cells Boundary faces of TAI positioned exactly at center of NPB cells

Algorithm: TAI to NPB grid UWNPB(JJ,K)= U(I3,J,K) +U(I3,J+1,K) UWNPB(JJ,K)= U(I3,J,K) +U(I3,J+1,K) UWNPB is west face value UWNPB is west face value U(I,J,K) from TAI U(I,J,K) from TAI I3 = I0-3 I3 = I0-3

Algorithm: TAI to NPB grid U2NPB(JJ,K)=0.25*[U2(I2,J,K)+ U2(I1,J,K)+ U2NPB(JJ,K)=0.25*[U2(I2,J,K)+ U2(I1,J,K)+ U2(I2,J+1,K)+ U2(I1,J+1,K)] U2(I2,J+1,K)+ U2(I1,J+1,K)] U2NPB is center value U2NPB is center value U2NPB = U2NPB = U2(I,J,K) from TAI U2(I,J,K) from TAI I2 = I0-2 I2 = I0-2 Average of 4 values Average of 4 values Same for V, S and T Same for V, S and T Same for U1NPB, Same for U1NPB, except different cell except different cell

Using interpolated values in NPB U(1,127,K)=IN(2,127,K)*(FLT1*UWNPB(J, K)+ FLT2*U(1,127,K)) U(1,127,K)=IN(2,127,K)*(FLT1*UWNPB(J, K)+ FLT2*U(1,127,K)) U(1,127,K) is face value U(1,127,K) is face value IN - Mask array for scalar quantities IN(I,J,K)=1,0 for water, land respectively IN - Mask array for scalar quantities IN(I,J,K)=1,0 for water, land respectively UWNPB - Interpolated face value from TAI UWNPB - Interpolated face value from TAI FLT1/2 – time filter to improve stability since TAI has finer grid, smaller time step. Use part of old value to improve stability FLT1/2 – time filter to improve stability since TAI has finer grid, smaller time step. Use part of old value to improve stability

Using interpolated values in NPB TMP=U2NPB(J,K)-U1(2,N,K) TMP=U2NPB(J,K)-U1(2,N,K) TMP represents a small incremental difference TMP represents a small incremental difference Same effect as previous case to improve stability Same effect as previous case to improve stability U2(2,N,K)=U2(2,N,K)+TMP U2(2,N,K)=U2(2,N,K)+TMP U2(2,N,K) is center value U2(2,N,K) is center value To give a smaller and smoother increment To give a smaller and smoother increment Improves stability Improves stability Same for V, S and T Same for V, S and T

Using interpolated values in NPB U2(1,N,K)=U1NPB(J,K) U2(1,N,K)=U1NPB(J,K) U2(1,N,K) is center value U2(1,N,K) is center value U1NPB - Interpolated center value from TAI U1NPB - Interpolated center value from TAI U1NPB = U1NPB = Same for V, S and T Same for V, S and T No time filter due to spatial averaging No time filter due to spatial averaging

Algorithm: NPB to TAI grid UETAI(J,K)=U(2,(J-2)/2+127,K) UETAI(J,K)=U(2,(J-2)/2+127,K) UETAI is east face value UETAI is east face value U(I,J,K) from NPB U(I,J,K) from NPB

Algorithm: NPB to TAI grid UI0TAI(J,K)=U2(3,(J-2)/2+127,K) UI0TAI(J,K)=U2(3,(J-2)/2+127,K) UI0TAI is center value UI0TAI is center value U2(I,J,K) from NPB U2(I,J,K) from NPB Same for V, S and T Same for V, S and T

Using interpolated values in TAI U(I1,J,K)=IN(I1,J,K)*UETAI(J,K) U(I1,J,K)=IN(I1,J,K)*UETAI(J,K) U(I1,J,K) is face value U(I1,J,K) is face value IN - Mask array for scalar quantities IN(I1,J,K)=1,0 for water, land respectively IN - Mask array for scalar quantities IN(I1,J,K)=1,0 for water, land respectively No time filter No time filter U2(I0,J,K)=UI0TAI(J,K) U2(I0,J,K)=UI0TAI(J,K) U2(I0,J,K) is center value U2(I0,J,K) is center value No time filter and IN multiplication required No time filter and IN multiplication required

Conclusion Multi-domain problems requires the use of grid coupling Multi-domain problems requires the use of grid coupling Objective to transfer values from one grid to another Objective to transfer values from one grid to another Efficient and conservative algorithm Efficient and conservative algorithm Use of filter to ensure smooth transition and stability Use of filter to ensure smooth transition and stability