A volume-preserving sharpening approach for the propagation of sharp phase boundaries in multiphase lattice Boltzmann simulations

Lattice Boltzmann models that recover a macroscopic description of multiphase flow of immiscible liquids typically represent the boundaries between phases using a scalar function, the phase field, that varies smoothly over several grid points. Attempts to tune the model parameters to minimise the thicknesses of these interfaces typically lead to the interfaces becoming fixed to the underlying grid instead of advecting with the fluid velocity. This phenomenon, known as lattice pinning, is strikingly similar to that associated with the numerical simulation of conservation laws coupled to stiff algebraic source terms. We present a lattice Boltzmann formulation of the model problem proposed by LeVeque and Yee [J. Comput. Phys. 86, 187] to study the latter phenomenon in the context of computational combustion, and offer a volume-conserving extension in multiple space dimensions. Inspired by the random projection method of Bao and Jin [J. Comput. Phys. 163, 216] we further generalise this formulation by introducing a uniformly distributed quasi-random variable into the term responsible for the sharpening of phase boundaries. This method is mass conserving and the statistical average of this method is shown to significantly delay the onset of pinning

A random projection method for sharp phase boundaries in lattice Boltzmann simulations

Existing lattice Boltzmann models that have been designed to recover a macroscopic description of immiscible liquids are only able to make predictions that are quantitatively correct when the interface that exists between the fluids is smeared over several nodal points. Attempts to minimise the thickness of this interface generally leads to a phenomenon known as lattice pinning, the precise cause of which is not well understood. This spurious behaviour is remarkably similar to that associated with the numerical simulation of hyperbolic partial differential equations coupled with a stiff source term. Inspired by the seminal work in this field, we derive a lattice Boltzmann implementation of a model equation used to investigate such peculiarities. This implementation is extended to different spacial discretisations in one and two dimensions. We shown that the inclusion of a quasi-random threshold dramatically delays the onset of pinning and facetting

Subsquares Approach - Simple Scheme for Solving Overdetermined Interval Linear Systems

In this work we present a new simple but efficient scheme - Subsquares approach - for development of algorithms for enclosing the solution set of overdetermined interval linear systems. We are going to show two algorithms based on this scheme and discuss their features. We start with a simple algorithm as a motivation, then we continue with a sequential algorithm. Both algorithms can be easily parallelized. The features of both algorithms will be discussed and numerically tested.Comment: submitted to PPAM 201

A Contrast- and Luminance-Driven Multiscale Netowrk Model of Brightness Perception

A neural network model of brightness perception is developed to account for a wide variety of data, including the classical phenomenon of Mach bands, low- and high-contrast missing fundamental, luminance staircases, and non-linear contrast effects associated with sinusoidal waveforms. The model builds upon previous work on filling-in models that produce brightness profiles through the interaction of boundary and feature signals. Boundary computations that are sensitive to luminance steps and to continuous lumi- nance gradients are presented. A new interpretation of feature signals through the explicit representation of contrast-driven and luminance-driven information is provided and directly addresses the issue of brightness "anchoring." Computer simulations illustrate the model's competencies.Air Force Office of Scientific Research (F49620-92-J-0334); Northeast Consortium for Engineering Education (NCEE-A303-21-93); Office of Naval Research (N00014-91-J-4100); German BMFT grant (413-5839-01 1N 101 C/1); CNPq and NUTES/UFRJ, Brazi

A still sharper region where π(x) - li(x) is positive

We consider the least number x for which a change of sign of π(x) - li(x) occurs. First, we consider modifications of Lehman's method that enable us to obtain better estimates of some error terms. Second, we establish a new lower bound for the first x for which the difference is positive. Third, we use numerical computations to improve the final result.The second author was supported in part by ARC Grant DE120100173

Certification of inequalities involving transcendental functions: combining SDP and max-plus approximation

We consider the problem of certifying an inequality of the form $f(x)\geq 0$, $\forall x\in K$, where $f$ is a multivariate transcendental function, and $K$ is a compact semialgebraic set. We introduce a certification method, combining semialgebraic optimization and max-plus approximation. We assume that $f$ is given by a syntaxic tree, the constituents of which involve semialgebraic operations as well as some transcendental functions like $\cos$, $\sin$, $\exp$, etc. We bound some of these constituents by suprema or infima of quadratic forms (max-plus approximation method, initially introduced in optimal control), leading to semialgebraic optimization problems which we solve by semidefinite relaxations. The max-plus approximation is iteratively refined and combined with branch and bound techniques to reduce the relaxation gap. Illustrative examples of application of this algorithm are provided, explaining how we solved tight inequalities issued from the Flyspeck project (one of the main purposes of which is to certify numerical inequalities used in the proof of the Kepler conjecture by Thomas Hales).Comment: 7 pages, 3 figures, 3 tables, Appears in the Proceedings of the European Control Conference ECC'13, July 17-19, 2013, Zurich, pp. 2244--2250, copyright EUCA 201

Computing the Greedy Spanner in Linear Space

The greedy spanner is a high-quality spanner: its total weight, edge count and maximal degree are asymptotically optimal and in practice significantly better than for any other spanner with reasonable construction time. Unfortunately, all known algorithms that compute the greedy spanner of n points use Omega(n^2) space, which is impractical on large instances. To the best of our knowledge, the largest instance for which the greedy spanner was computed so far has about 13,000 vertices. We present a O(n)-space algorithm that computes the same spanner for points in R^d running in O(n^2 log^2 n) time for any fixed stretch factor and dimension. We discuss and evaluate a number of optimizations to its running time, which allowed us to compute the greedy spanner on a graph with a million vertices. To our knowledge, this is also the first algorithm for the greedy spanner with a near-quadratic running time guarantee that has actually been implemented