Landscape Erosion Kirsten Meeker

Slides:

Advertisements

Similar presentations

Approximate Analytical/Numerical Solutions to the Groundwater Transport Problem CWR 6536 Stochastic Subsurface Hydrology.

Advertisements

Parallel Jacobi Algorithm Steven Dong Applied Mathematics.

A Discrete Adjoint-Based Approach for Optimization Problems on 3D Unstructured Meshes Dimitri J. Mavriplis Department of Mechanical Engineering University.

Finite Volume II Philip Mocz. Goals Construct a robust, 2nd order FV method for the Euler equation (Navier-Stokes without the viscous term, compressible)

Chapter 8 Elliptic Equation.

Simulations of the core/SOL transition of a tokamak plasma Frederic Schwander,Ph. Ghendrih, Y. Sarazin IRFM/CEA Cadarache G. Ciraolo, E. Serre, L. Isoardi,

Fluidyn FLOWCOAST FLOOIL 3D Fluid Dynamics Model to Simulate Oil slick movement in coastal waters or rivers FLOOIL.

Günther Zängl, DWD1 Improvements for idealized simulations with the COSMO model Günther Zängl Deutscher Wetterdienst, Offenbach, Germany.

Numerical Algorithms Matrix multiplication

Numerical Integration of Partial Differential Equations (PDEs)

Total Recall Math, Part 2 Ordinary diff. equations First order ODE, one boundary/initial condition: Second order ODE.

ECE669 L4: Parallel Applications February 10, 2004 ECE 669 Parallel Computer Architecture Lecture 4 Parallel Applications.

Fluvial Landscape Erosion Kirsten Meeker, Bjorn Birnir, Terence Smith, George Merchant

Parabolic PDEs Generally involve change of quantity in space and time Equivalent to our previous example - heat conduction.

Landscape Erosion Kirsten Meeker

Partial differential equations Function depends on two or more independent variables This is a very simple one - there are many more complicated ones.

Chapter 13 Finite Difference Methods: Outline Solving ordinary and partial differential equations Finite difference methods (FDM) vs Finite Element Methods.

PETE 603 Lecture Session #29 Thursday, 7/29/ Iterative Solution Methods Older methods, such as PSOR, and LSOR require user supplied iteration.

A TWO-FLUID NUMERICAL MODEL OF THE LIMPET OWC CG Mingham, L Qian, DM Causon and DM Ingram Centre for Mathematical Modelling and Flow Analysis Manchester.

Direct and iterative sparse linear solvers applied to groundwater flow simulations Matrix Analysis and Applications October 2007.

1 CFD Analysis Process. 2 1.Formulate the Flow Problem 2.Model the Geometry 3.Model the Flow (Computational) Domain 4.Generate the Grid 5.Specify the.

1 Web Based Interface for Numerical Simulations of Nonlinear Evolution Equations Ryan N. Foster & Thiab Taha Department of Computer Science The University.

Tutorial 5: Numerical methods - buildings Q1. Identify three principal differences between a response function method and a numerical method when both.

Massively Parallel Magnetohydrodynamics on the Cray XT3 Joshua Breslau and Jin Chen Princeton Plasma Physics Laboratory Cray XT3 Technical Workshop Nashville,

University of Veszprém Department of Image Processing and Neurocomputing Emulated Digital CNN-UM Implementation of a 3-dimensional Ocean Model on FPGAs.

Fritz R. Fiedler University of Idaho Department of Civil Engineering Simulation of Shallow Discontinuous Flow over Complex Infiltrating Terrain.

RFP Workshop Oct 2008 – J Scheffel 1 A generalized weighted residual method for RFP plasma simulation Jan Scheffel Fusion Plasma Physics Alfvén Laboratory,

Chapter 3 Parallel Algorithm Design. Outline Task/channel model Task/channel model Algorithm design methodology Algorithm design methodology Case studies.

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Parallel Programming in C with MPI and OpenMP Michael J. Quinn.

ParCFD Parallel computation of pollutant dispersion in industrial sites Julien Montagnier Marc Buffat David Guibert.

Discontinuous Galerkin Methods and Strand Mesh Generation

CFD Lab - Department of Engineering - University of Liverpool Ken Badcock & Mark Woodgate Department of Engineering University of Liverpool Liverpool L69.

1 Computational Methods Dr. Farzad Ismail School of Aerospace and Mechanical Engineering Universiti Sains Malaysia Nibong Tebal Pulau Pinang Week.

Efficient Integration of Large Stiff Systems of ODEs Using Exponential Integrators M. Tokman, M. Tokman, University of California, Merced 2 hrs 1.5 hrs.

Issues in (Financial) High Performance Computing John Darlington Director Imperial College Internet Centre Fast Financial Algorithms and Computing 4th.

7. Introduction to the numerical integration of PDE. As an example, we consider the following PDE with one variable; Finite difference method is one of.

Akram Bitar and Larry Manevitz Department of Computer Science

Engineering Analysis – Computational Fluid Dynamics –

CFX-10 Introduction Lecture 1.

1 Flux Numerical Methods. 2 Flux Basics The finite-volume formulation of the conservation equations resulted in the equation where was the flux of the.

Domain Decomposition in High-Level Parallelizaton of PDE codes Xing Cai University of Oslo.

Connections to Other Packages The Cactus Team Albert Einstein Institute

COMPUTATIONAL FLUID DYNAMICS (AE 2402) Presented by IRISH ANGELIN S AP/AERO.

AMS 691 Special Topics in Applied Mathematics Lecture 8

Discretization Methods Chapter 2. Training Manual May 15, 2001 Inventory # Discretization Methods Topics Equations and The Goal Brief overview.

Partial Derivatives Example: Find If solution: Partial Derivatives Example: Find If solution: gradient grad(u) = gradient.

Formulation of 2D‐FDTD without a PML.

On the Performance of PC Clusters in Solving Partial Differential Equations Xing Cai Åsmund Ødegård Department of Informatics University of Oslo Norway.

1 LECTURE 6 Stability of Parabolic PDEs. 2 Aim of Lecture Last week we discussed Parabolic PDEs –Looked at Explicit and Implicit Methods –Advantages and.

Programming assignment # 3 Numerical Methods for PDEs Spring 2007 Jim E. Jones.

Parallel Computing Activities at the Group of Scientific Software Xing Cai Department of Informatics University of Oslo.

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.

Higher Order Runge-Kutta Methods for Fluid Mechanics Problems Abhishek Mishra Graduate Student, Aerospace Engineering Course Presentation MATH 6646.

Example application – Finite Volume Discretization Numerical Methods for PDEs Spring 2007 Jim E. Jones.

High Performance Computing Seminar II Parallel mesh partitioning with ParMETIS Parallel iterative solvers with Hypre M.Sc. Caroline Mendonça Costa.

Xing Cai University of Oslo

A TWO-FLUID NUMERICAL MODEL OF THE LIMPET OWC

Sahar Sargheini, Alberto Paganini, Ralf Hiptmair, Christian Hafner

Convergence in Computational Science

Deflated Conjugate Gradient Method

Objective Numerical methods.

Discontinuous Shallow Flow

GENERAL VIEW OF KRATOS MULTIPHYSICS

Objective Numerical methods Finite volume.

CS6068 Applications: Numerical Methods

Parallelizing Unstructured FEM Computation

Ph.D. Thesis Numerical Solution of PDEs and Their Object-oriented Parallel Implementations Xing Cai October 26, 1998.

Parallel Programming in C with MPI and OpenMP

Presentation transcript:

Landscape Erosion Kirsten Meeker

Outline System of equations Numerical methods Project to produce parallel version

Conservation Equations

Flow Equations

Initial Conditions Small random perturbations

Boundary Conditions upper boundary (ridge) h = 0 q w = q s = 0 lower boundary (absorbing body of water) H = h 0 = h Lateral boundaries (infinite extent) periodic

System Properties Ill-posed problem Shocks develop in water flow Results vary widely with initial conditions Large Fourier components (smallest spatial scale) grow fastest, all modes grow exponentially Nonlinearities saturate, producing colored noise Statistical measures are invariant width function

Variation with Random Seed

Numerical Method for Water Equation Nonlinear hyperbolic PDE, wave equation Forward-time center space scheme with upwind differencing, explicit O(  x,  t)

Numerical Method for Sediment Equation Nonlinear parabolic PDE, heat equation

Numerical Method for Sediment Equation Crank-Nicholson scheme, implicit O(  x 2,  t 2 )

Numerical Method for Sediment Equation Sediment conservation equation with Crank-Nicholson scheme applied can be expressed in matrix form as Ax=b Solved using preconditioned biconjugate gradient method diag(A) used as preconditioner

Project to Produce Parallel Version Analyze sequential code Select parallel tools and partitioning Convert in stages, preserving functioning of whole simulation Stochastic PDE’s, individual results are a function of random parameters including numerical noise Success of results are measured by statistical parameters “Clean” maintainable, portable code Improve performance, currently hours to days

Sequential Code: Main program Prompt user for input Initialize grid water depth and elevation Loop: alternating between finding water depth and eroded surface Periodically (as a function of percent eroded) write result to file

Sequential Code: Find Water Depth Update water surface = elevation + depth (pass 1) Find upwind direction and x and y fluxes (pass 2) Find optimal time step, limit flux per step (pass 3) Update water depths (pass 4) Test for convergence

Sequential Code: Find Eroded Surface Allocate biconjugate gradient variables (first pass only) Update water surface = elevation + depth (pass 1) Find finite difference coefficients (pass 2) Find erosion time step, limit elevation change per step (pass 3) Convert grid to vector form, solve for water surface by biconjugate gradient method, convert back to array (pass 4) Update elevation (pass 5)

Issues from Analysis of Sequential Code System to be solved is not separated from solver FindWaterDepth makes 4 passes over grid FindErodedSurface makes 5 passes over grid FindErodedSurface is copying grid to vectors, then back to array each iteration Large Params structure is used as a global data structure poor data encapsulation poor function documentation

Decisions Maintainability: Use MPI for portability on clusters Investigate solver libraries: PETSc Modify functions to use only needed input parameters, to try to eliminate use of global Params struct Performance: Use column-wise partitioning Consider writing data to disk from each processor then reassembling result off-line Try to eliminate multiple passes over grid