130,195 research outputs found
An efficient parallel immersed boundary algorithm using a pseudo-compressible fluid solver
We propose an efficient algorithm for the immersed boundary method on
distributed-memory architectures, with the computational complexity of a
completely explicit method and excellent parallel scaling. The algorithm
utilizes the pseudo-compressibility method recently proposed by Guermond and
Minev [Comptes Rendus Mathematique, 348:581-585, 2010] that uses a directional
splitting strategy to discretize the incompressible Navier-Stokes equations,
thereby reducing the linear systems to a series of one-dimensional tridiagonal
systems. We perform numerical simulations of several fluid-structure
interaction problems in two and three dimensions and study the accuracy and
convergence rates of the proposed algorithm. For these problems, we compare the
proposed algorithm against other second-order projection-based fluid solvers.
Lastly, the strong and weak scaling properties of the proposed algorithm are
investigated
Generalisation : graphs and colourings
The interaction between practice and theory in mathematics is a central theme. Many mathematical structures and theories result from the formalisation of a real problem. Graph Theory is rich with such examples. The graph structure itself was formalised by Leonard Euler in the quest to solve the problem of the Bridges of Königsberg. Once a structure is formalised, and results are proven, the mathematician seeks to generalise. This can be considered as one of the main praxis in mathematics. The idea of generalisation will be illustrated through graph colouring. This idea also results from a classic problem, in which it was well known by topographers that four colours suffice to colour any map such that no countries sharing a border receive the same colour. The proof of this theorem eluded mathematicians for centuries and was proven in 1976. Generalisation of graphs to hypergraphs, and variations on the colouring theme will be discussed, as well as applications in other disciplines.peer-reviewe
Parallel numerical modeling of hybrid-dimensional compositional non-isothermal Darcy flows in fractured porous media
This paper introduces a new discrete fracture model accounting for
non-isothermal compositional multiphase Darcy flows and complex networks of
fractures with intersecting, immersed and non immersed fractures. The so called
hybrid-dimensional model using a 2D model in the fractures coupled with a 3D
model in the matrix is first derived rigorously starting from the
equi-dimensional matrix fracture model. Then, it is dis-cretized using a fully
implicit time integration combined with the Vertex Approximate Gradient (VAG)
finite volume scheme which is adapted to polyhedral meshes and anisotropic
heterogeneous media. The fully coupled systems are assembled and solved in
parallel using the Single Program Multiple Data (SPMD) paradigm with one layer
of ghost cells. This strategy allows for a local assembly of the discrete
systems. An efficient preconditioner is implemented to solve the linear systems
at each time step and each Newton type iteration of the simulation. The
numerical efficiency of our approach is assessed on different meshes, fracture
networks, and physical settings in terms of parallel scalability, nonlinear
convergence and linear convergence
Energy-stable linear schemes for polymer-solvent phase field models
We present new linear energy-stable numerical schemes for numerical
simulation of complex polymer-solvent mixtures. The mathematical model proposed
by Zhou, Zhang and E (Physical Review E 73, 2006) consists of the Cahn-Hilliard
equation which describes dynamics of the interface that separates polymer and
solvent and the Oldroyd-B equations for the hydrodynamics of polymeric
mixtures. The model is thermodynamically consistent and dissipates free energy.
Our main goal in this paper is to derive numerical schemes for the
polymer-solvent mixture model that are energy dissipative and efficient in
time. To this end we will propose several problem-suited time discretizations
yielding linear schemes and discuss their properties
- …