2018 Taipei, Taiwan

SS59:  Efficient Algorithms for Flow and Transport in Porous Media

Organizer(s):
Name:
Affiliation:
Country:
King Abdullah University of Science & Technology
Saudi Arabia
South China Normal University
Peoples Rep of China
 
Abstract:
Flow and transport in porous media are common phenomena encountered in daily life and in engineering practice. Natural natural porous media, such as aquifers, petroleum reservoirs, or even biological tissues, provide energy and resource to human being. Man-made or engineered porous materials, including cements, ceramics, and many others, serve a key role in many engineered systems. Flow and transport phenomena within porous media are especially important in petroleum engineering, bio-remediation techniques, filtration, and hydrogeology. In this workshop, we invite speakers from diverse scientific groups of applied mathematicians, modelers, computational scientists, software engineers, chemists, physicists, and geoscientists who share an interest in developing mathematical formulation and efficient algorithms for better understanding the flow and transport in porous media. The topics of the workshop include, but are not limited to: 1) novel and advanced numerical methods for the simulation of subsurface flow and transport, and associated aspects such as discretization, gridding, up-scaling, multi-scale algorithms, optimization, data assimilation, uncertainty assessment, and high performance parallel and grid computing; 2) modeling and simulation of single-phase and multi-phase flow in porous media, and its applications to earth sciences and engineering; 3) computational thermodynamics of fluids, especially hydrocarbon and other oil reservoir fluids, and its interaction with flow and transport; 4) pore-network modeling of multi-phase flow in porous media and other pore-scale modeling of porous media flow, as well as related algorithms; 5) molecular dynamics simulation and Monte Carlo molecular simulation of fluid in a single pore or pore network, as well as related algorithms.