An efficient method for the incompressible Navier-Stokes equations on irregular domains with no-slip boundary conditions, high order up to the boundary

Common efficient schemes for the incompressible Navier-Stokes equations, such as projection or fractional step methods, have limited temporal accuracy as a result of matrix splitting errors, or introduce errors near the domain boundaries (which destroy uniform convergence to the solution). In this paper we recast the incompressible (constant density) Navier-Stokes equations (with the velocity prescribed at the boundary) as an equivalent system, for the primary variables velocity and pressure. We do this in the usual way away from the boundaries, by replacing the incompressibility condition on the velocity by a Poisson equation for the pressure. The key difference from the usual approaches occurs at the boundaries, where we use boundary conditions that unequivocally allow the pressure to be recovered from knowledge of the velocity at any fixed time. This avoids the common difficulty of an, apparently, over-determined Poisson problem. Since in this alternative formulation the pressure can be accurately and efficiently recovered from the velocity, the recast equations are ideal for numerical marching methods. The new system can be discretized using a variety of methods, in principle to any desired order of accuracy. In this work we illustrate the approach with a 2-D second order finite difference scheme on a Cartesian grid, and devise an algorithm to solve the equations on domains with curved (non-conforming) boundaries, including a case with a non-trivial topology (a circular obstruction inside the domain). This algorithm achieves second order accuracy (in L-infinity), for both the velocity and the pressure. The scheme has a natural extension to 3-D.Comment: 50 pages, 14 figure

Asymptotic Lower Bounds for a class of Schroedinger Equations

We shall study the following initial value problem: \begin{equation}{\bf i}\partial_t u - \Delta u + V(x) u=0, \hbox{} (t, x) \in {\mathbf R} \times {\mathbf R}^n, \end{equation} $$u(0)=f,$$ where $V(x)$ is a real short--range potential, whose radial derivative satisfies some supplementary assumptions. More precisely we shall present a family of identities satisfied by the solutions to the previous Cauchy problem. As a by--product of these identities we deduce some uniqueness results and a lower bound for the so called local smoothing which becomes an identity in a precise asymptotic sense.Comment: 24 pages. to appear on Comm. Math. Phy

Cortical Reorganization following Injury Early in Life

The brain has a remarkable capacity for reorganization following injury, especially during the first years of life. Knowledge of structural reorganization and its consequences following perinatal injury is sparse. Here we studied changes in brain tissue volume, morphology, perfusion, and integrity in children with hemiplegia compared to typically developing children, using MRI. Children with hemiplegia demonstrated reduced total cerebral volume, with increased cerebrospinal fluid (CSF) and reduced total white matter volumes, with no differences in total gray matter volume, compared to typically developing children. An increase in cortical thickness at the hemisphere contralateral to the lesion (CLH) was detected in motor and language areas, which may reflect compensation for the gray matter loss in the lesion area or retention of ipsilateral pathways. In addition, reduced cortical thickness, perfusion, and surface area were detected in limbic areas. Increased CSF volume and precentral cortical thickness and reduced white matter volume were correlated with worse motor performance. Brain reorganization of the gray matter within the CLH, while not necessarily indicating better outcome, is suggested as a response to neuronal deficits following injury early in life.Guy’s and St Thomas’ Charity and the Marnie Kimelman Trus

Self-similar extinction for a diffusive Hamilton-Jacobi equation with critical absorption

International audienceThe behavior near the extinction time is identified for non-negative solutions to the diffusive Hamilton-Jacobi equation with critical gradient absorption ∂_t u − ∆_p u + |∇u|^{p−1} = 0 in (0, ∞) × R^N , and fast diffusion 2N/(N + 1) < p < 2. Given a non-negative and radially symmetric initial condition with a non-increasing profile which decays sufficiently fast as |x| → ∞, it is shown that the corresponding solution u to the above equation approaches a uniquely determined separate variable solution of the form U (t, x) = (T_e − t)^{1/(2−p)} f_* (|x|), (t, x) ∈ (0, T_e) × R^N , as t → T_e , where T_e denotes the finite extinction time of u. A cornerstone of the convergence proof is an underlying variational structure of the equation. Also, the selected profile f_* is the unique non-negative solution to a second order ordinary differential equation which decays exponentially at infinity. A complete classification of solutions to this equation is provided, thereby describing all separate variable solutions of the original equation. One important difficulty in the uniqueness proof is that no monotonicity argument seems to be available and it is overcome by the construction of an appropriate Pohozaev functional

Quantum Tomography under Prior Information

We provide a detailed analysis of the question: how many measurement settings or outcomes are needed in order to identify a quantum system which is constrained by prior information? We show that if the prior information restricts the system to a set of lower dimensionality, then topological obstructions can increase the required number of outcomes by a factor of two over the number of real parameters needed to characterize the system. Conversely, we show that almost every measurement becomes informationally complete with respect to the constrained set if the number of outcomes exceeds twice the Minkowski dimension of the set. We apply the obtained results to determine the minimal number of outcomes of measurements which are informationally complete with respect to states with rank constraints. In particular, we show that 4d-4 measurement outcomes (POVM elements) is enough in order to identify all pure states in a d-dimensional Hilbert space, and that the minimal number is at most 2 log_2(d) smaller than this upper bound.Comment: v3: There was a mistake in the derived finer upper bound in Theorem 3. The corrected upper bound is +1 to the earlier versio

Encoding order and developmental dyslexia:a family of skills predicting different orthographic components

We investigated order encoding in developmental dyslexia using a task that presented nonalphanumeric visual characters either simultaneously or sequentially—to tap spatial and temporal order encoding, respectively—and asked participants to reproduce their order. Dyslexic participants performed poorly in the sequential condition, but normally in the simultaneous condition, except for positions most susceptible to interference. These results are novel in demonstrating a selective difficulty with temporal order encoding in a dyslexic group. We also tested the associations between our order reconstruction tasks and: (a) lexical learning and phonological tasks; and (b) different reading and spelling tasks. Correlations were extensive when the whole group of participants was considered together. When dyslexics and controls were considered separately, different patterns of association emerged between orthographic tasks on the one side and tasks tapping order encoding, phonological processing, and written learning on the other. These results indicate that different skills support different aspects of orthographic processing and are impaired to different degrees in individuals with dyslexia. Therefore, developmental dyslexia is not caused by a single impairment, but by a family of deficits loosely related to difficulties with order. Understanding the contribution of these different deficits will be crucial to deepen our understanding of this disorder