On the controllability for the Khokhlov–Zabolotskaya–Kuznetsov-like equation

Recalling the proprieties of the Khokhlov–Zabolotskaya–Kuznetsov (KZK) equation, we prove the controllability of moments result for the linear part of the KZK equation and its non-linear perturbation.     

On the constraints problem for the Einstein–Yang–Mills–Higgs system

We provide proofs of some key propositions that were used in previous work by Dossa and Tadmon dealing with the characteristic initial value problem for the Einstein–Yang–Mills–Higgs (EYMH) system. The aforesaid proofs were missing, making the considered work difficult to understand. This work is presented with a view to have an almost self-contained paper. With this respect we completely recall the process of constructing initial data for the EYMH system on two intersecting smooth null hypersurfaces as done in the work of Dossa and Tadmon mentioned above. This is achieved by successfully adapting the hierarchical method set up by Rendall to solve the same problem for the Einstein equations in vacuum and with perfect fluid source. Many delicate calculations and expressions are given in details so as to address, in a forthcoming work, the issue of global resolution of the characteristic initial value problem for the EYMH system. The method obviously applies to the Einstein–Maxwell and the Einstein-scalar field models as well.     

On the Aleksandrov–Bakelman–Pucci estimate for the infinity Laplacian

We prove L ^∞ bounds and estimates of the modulus of continuity of solutions to the Poisson problem for the normalized infinity and p-Laplacian, namely $$\begin{array}{ll} -\Delta_p^N u=f\quad{\rm for } \; n < p \leq\infty.\end{array}$$ We are able to provide a stable family of results depending continuously on the parameter p. We also prove the failure of the classical Alexandrov–Bakelman–Pucci estimate for the normalized infinity Laplacian and propose alternate estimates.     

Riemann–Hilbert approach for the Camassa–Holm equation on the line

We present a Riemann–Hilbert problem formalism for the initial value problem for the Camassa–Holm equation $u_t?u_{txx}+2\omega u_x+3u{u}_x=2u_x{u}_{xx}+u{u}_{xxx}$ on the line (CH). We show that: (i) for all $\omega >0$, the solution of this problem can be obtained in a parametric form via the solution of some associated Riemann–Hilbert problem; (ii) for large time, it develops into a train of smooth solitons; (iii) for small ω, this soliton train is close to a train of peakons, which are piecewise smooth solutions of the CH equation for $\omega =0$. To cite this article: A. Boutet de Monvel, D. Shepelsky, C. R. Acad. Sci. Paris, Ser. I 343 (2006).     

Dualities for the Domany–Kinzel Model

We study the Domany–Kinzel model, which is a class of discrete-time Markov processes in one-dimension with two parameters (p ₁,p ₂)[0,1]². When p ₁= and p ₂=(2– ²) with (,)[0,1]², the process can be identified with the mixed site-bond oriented percolation model on a square lattice with probabilities of a site being open and of a bond being open. This paper treats dualities for the Domany–Kinzel model _t ^A and the DKdual _t ^A starting from A. We prove that , as long as one of A,B is finite and p ₂p ₁.     

New upper bounds for the Davenport and for the Erdős–Ginzburg–Ziv constants

Let G be a finite abelian group (written additively) of rank r with invariants n ₁, n ₂, . . . , n _r , where n _r is the exponent of G. In this paper, we prove an upper bound for the Davenport constant D(G) of G as follows; D(G) ≤ n _r + n _r-1 + (c(3) − 1)n _r-2 + (c(4) − 1) n _r-3 + · · · + (c(r) − 1)n ₁ + 1, where c(i) is the Alon–Dubiner constant, which depends only on the rank of the group \mathbb Z_nrⁱ{{\mathbb Z}_{n_r}^i}. Also, we shall give an application of Davenport’s constant to smooth numbers related to the Quadratic sieve.     

Tower-of-sets analysis for the Kise–Ibaraki–Mine algorithm

Kise et al. (Oper. Res. 26:121–126, 1978) give an O(n ²) time algorithm to find an optimal schedule for the single-machine number of late jobs problem with agreeable job release dates and due dates. Li et al. (Oper. Res. 58:508–509, 2010a) point out that their proof of optimality for their algorithm is incorrect by giving a counter-example. In this paper, using the concept of “tower-of-sets” from Lawler (Math. Comput. Model. 20:91–106, 1994), we construct the tower-of-sets of the early job set generated by the algorithm. Then we give a correct proof of optimality for the algorithm and show a new result that the early job set by the algorithm obtains not only the maximum number of jobs but also the smallest total processing time among all optimal schedules. The result can be applied to study the problems of the hard real-time systems.     

Reorthogonalization for the Golub–Kahan–Lanczos bidiagonal reduction

The Golub–Kahan–Lanczos (GKL) bidiagonal reduction generates, by recurrence, the matrix factorization of $X \in \mathbb{R }^{m \times n}, m \ge n$ , given by $$\begin{aligned} X = UBV^T \end{aligned}$$ where $U \in \mathbb{R }^{m \times n}$ is left orthogonal, $V \in \mathbb{R }^{n \times n}$ is orthogonal, and $B \in \mathbb{R }^{n \times n}$ is bidiagonal. When the GKL recurrence is implemented in finite precision arithmetic, the columns of $U$ and $V$ tend to lose orthogonality, making a reorthogonalization strategy necessary to preserve convergence of the singular values. The use of an approach started by Simon and Zha (SIAM J Sci Stat Comput, 21:2257–2274, 2000) that reorthogonalizes only one of the two left orthogonal matrices $U$ and $V$ is shown to be very effective by the results presented here. Supposing that $V$ is the matrix reorthogonalized, the reorthogonalized GKL algorithm proposed here is modeled as the Householder Q–R factorization of $\left( \begin{array}{c} 0_{n \times k} \\ X V_k \end{array}\right) $ where $V_k = V(:,1:k)$ . That model is used to show that if $\varepsilon _M $ is the machine unit and $$\begin{aligned} \bar{\eta }= \Vert \mathbf{tril }(I-V^T\!~V)\Vert _F, \end{aligned}$$ where $\mathbf{tril }(\cdot )$ is the strictly lower triangular part of the contents, then: (1) the GKL recurrence produces Krylov spaces generated by a nearby matrix $X + \delta X$ , $\Vert \delta X\Vert _F = \mathcal O (\varepsilon _M + \bar{\eta }) \Vert X\Vert _F$ ; (2) singular values converge in the Lanczos process at the rate expected from the GKL algorithm in exact arithmetic on a nearby matrix; (3) a new proposed algorithm for recovering leading left singular vectors produces better bounds on loss of orthogonality and residual errors.     

Convergent discretizations for the Nernst–Planck–Poisson system

We propose and compare two classes of convergent finite element based approximations of the nonstationary Nernst–Planck–Poisson equations, whose constructions are motivated from energy versus entropy decay properties for the limiting system. Solutions of both schemes converge to weak solutions of the limiting problem for discretization parameters tending to zero. Our main focus is to study qualitative properties for the different approaches at finite discretization scales, like conservation of mass, non-negativity, discrete maximum principle, decay of discrete energies, and entropies to study long-time asymptotics.     

On the Wave Operators for the Friedrichs–Faddeev Model

We provide new formulae for the wave operators in the context of the Friedrichs–Faddeev model. Continuity with respect to the energy of the scattering matrix and a few results on eigenfunctions corresponding to embedded eigenvalues are also derived.     

A trace law for the Hardy–Morrey–Sobolev space

This article shows that if $H{L}^{p,\kappa }$ and $H{L}_{\mu }^{q,\lambda }$ are $(p,\kappa )$-Hardy–Morrey space based on the standard Lebesgue measure and $(q,\lambda )$-Hardy–Morrey space induced by the non-negative Radon measure μ respectively then one has the following trace law for the Hardy–Morrey–Sobolev space $I_{\alpha }(H{L}^{p,\kappa })$ of Riesz potentials of order α of $H{L}^{p,\kappa }$-functions:

$\begin{array}{cc}\hfill & \underset{0<{6f6}_{H{L}^{p,\kappa }}<\infty }{\sup }?{6I_{\alpha }f6}_{H{L}_{\mu }^{q,\lambda }}{6f6}_{H{L}^{p,\kappa }}^{?1}<\infty \hfill \\ \hfill & ?\underset{(x,r)\in {\mathbb{R}}^n\times (0,\infty )}{\sup }?r^{?\beta }\mu (B(x,r))<\infty \hfill \end{array}$

under

$\{\begin{array}{c}0<\lambda \le \kappa \le n;\hfill \\ 0<\alpha <n;\hfill \\ 0<p<\kappa /\alpha ;\hfill \\ n?\alpha p<\beta \le n;\hfill \\ 0<q=p(\beta +\lambda ?n)/(\kappa ?\alpha p).\hfill \end{array}$

     

Conservative difference methods for the Klein–Gordon–Zakharov equations

Firstly an implicit conservative finite difference scheme is presented for the initial-boundary problem of the one space dimensional Klein–Gordon–Zakharov (KGZ) equations. The existence of the difference solution is proved by Leray–Schauder fixed point theorem. It is proved by the discrete energy method that the scheme is uniquely solvable, unconditionally stable and second order convergent for U   in _l∞$l_{\infty }$ norm, and for N   in _l2$l_2$ norm on the basis of the priori estimates. Then an explicit difference scheme is proposed for the KGZ equations, on the basis of priori estimates and two important inequalities about norms, convergence of the difference solutions is proved. Because it is explicit and not coupled it can be computed by a parallel method. Numerical experiments with the two schemes are done for several test cases. Computational results demonstrate that the two schemes are accurate and efficient.     

Two identities for the Bernoulli–Euler numbers

Two identities for the Bernoulli and for the Euler numbers are derived. These identities involve two special cases of central combinatorial numbers. The approach is based on a set of differential identities for the powers of the secant. Generalizations of the Mittag–Leffler series for the secant are introduced and used to obtain closed-form expressions for the coefficients.     

Normal form for the KdV–Burgers equation

The local dynamics of the KdV–Burgers equation with periodic boundary conditions is studied. A special nonlinear partial differential equation is derived that plays the role of a normal form, i.e., in the first approximation, it determines the behavior of all solutions of the original boundary value problem with initial conditions from a sufficiently small neighborhood of equilibrium.     

On well-posedness for the Benjamin–Ono equation

We prove existence and uniqueness of solutions for the Benjamin–Ono equation with data in \(H^{s}({\mathbb{R}})\) , s > 1/4. Moreover, the flow is hölder continuous in weaker topologies.