A quantization procedure based on completely positive maps and Markov operators

We describe $\omega$-limit sets of completely positive (CP) maps over finite-dimensional spaces. In such sets and in its corresponding convex hulls, CP maps present isometric behavior and the states contained in it commute with each other. Motivated by these facts, we describe a quantization procedure based on CP maps which are induced by Markov (transfer) operators. Classical dynamics are described by an action over essentially bounded functions. A non-expansive linear map, which depends on a choice of a probability measure, is the centerpiece connecting phenomena over function and matrix spaces

Galerkin and Runge–Kutta methods: unified formulation, a posteriori error estimates and nodal superconvergence

Abstract. We unify the formulation and analysis of Galerkin and Runge–Kutta methods for the time discretization of parabolic equations. This, together with the concept of reconstruction of the approximate solutions, allows us to establish a posteriori superconvergence estimates for the error at the nodes for all methods. 1

On discretization in time in simulations of particulate flows

We propose a time discretization scheme for a class of ordinary differential equations arising in simulations of fluid/particle flows. The scheme is intended to work robustly in the lubrication regime when the distance between two particles immersed in the fluid or between a particle and the wall tends to zero. The idea consists in introducing a small threshold for the particle-wall distance below which the real trajectory of the particle is replaced by an approximated one where the distance is kept equal to the threshold value. The error of this approximation is estimated both theoretically and by numerical experiments. Our time marching scheme can be easily incorporated into a full simulation method where the velocity of the fluid is obtained by a numerical solution to Stokes or Navier-Stokes equations. We also provide a derivation of the asymptotic expansion for the lubrication force (used in our numerical experiments) acting on a disk immersed in a Newtonian fluid and approaching the wall. The method of this derivation is new and can be easily adapted to other cases

hp-adaptive Galerkin Time Stepping Methods for Nonlinear Initial Value Problems

This work is concerned with the derivation of an a posteriori error estimator for Galerkin approximations to nonlinear initial value problems with an emphasis on finite-time existence in the context of blow-up. The structure of the derived estimator leads naturally to the development of both h and hp versions of an adaptive algorithm designed to approximate the blow-up time. The adaptive algorithms are then applied in a series of numerical experiments, and the rate of convergence to the blow-up time is investigated

QUENCHING OF REVERSE SMOLDER

A simple model of reverse smolder in a porous medium is analyzed using asymptotic methods. When the only chemical reaction is exothermic oxidation, the burning rate is a single-valued function of the blowing rate, increasing from zero to a maximum, and then returning to zero. When endothermic pyrolysis is added to the description, the burning rate is double-valued for blowing rates less than some maximum. Beyond this maximum there are no solutions. The upper branch of the double-valued solution is the physically relevant one. On it, for certain choices of parameters, the burning rate increases from zero to a maximum, and then decreases until quenching occurs at the maximum blowing rate. This behavior mimics experimental observations by Torero, Fernandez-Pello, and Kitano [15]

Recirculating Flows Involving Short Fiber Suspensions: Numerical Difficulties and Efficient Advanced Micro-Macro Solvers

Numerical modelling of non-Newtonian flows usually involves the coupling between equations of motion characterized by an elliptic character, and the fluid constitutive equation, which defines an advection problem linked to the fluid history. There are different numerical techniques to treat the hyperbolic advection equations. In non-recirculating flows, Eulerian discretizations can give a convergent solution within a short computing time. However, the existence of steady recirculating flow areas induces additional difficulties. Actually, in these flows neither boundary conditions nor initial conditions are known. In this paper we compares different advanced strategies (some of them recently proposed and extended here for addressing complex flows) when they are applied to the solution of the kinetic theory description of a short fiber suspension fluid flows