Search

In this paper, we introduce the kinetic description of the first-order Cucker-Smale (CS) flocking model on the real line. We reveal the equivalent relation between the measure-valued solution to the first- and second-order kinetic CS equations. The emergent behavior of the first-order kinetic CS equation and the characterization of the asymptotic solution are studied. We also provide the equivalent relation between classical/measure-valued solutions to the first-order kinetic CS equation and a classical solution to the second-order hydrodynamic CS equations, and present the corresponding analysis on the large-time behavior. The numerical experiments support our analysis and provide an efficient algorithm to obtain the asymptotic solution without simulating the model for a long time. [ABSTRACT FROM AUTHOR]

In planar analytic vector fields, a monodromic singularity can be distinguished between a focus or a center by means of the Lyapunov coefficients, which are given in terms of the power series coefficients of the first-return map defined around the singularity. In this paper, we are interested in an analogous problem for monodromic tangential singularities of piecewise analytic vector fields Z = (Z + , Z −). First, we prove that the first-return map, defined in a neighborhood of a monodromic tangential singularity, is analytic, which allows the definition of the Lyapunov coefficients. Then, as a consequence of a general property for pair of involutions, we obtain that the index of the first non-vanishing Lyapunov coefficient is always even. In addition, a general recursive formula together with a Mathematica algorithm for computing the Lyapunov coefficients is obtained. We also provide results regarding limit cycles bifurcating from monodromic tangential singularities. Several examples are analyzed. [ABSTRACT FROM AUTHOR]

In this paper we propose a primal-dual dynamical approach to the minimization of a structured convex function consisting of a smooth term, a nonsmooth term, and the composition of another nonsmooth term with a linear continuous operator. In this scope we introduce a dynamical system for which we prove that its trajectories asymptotically converge to a saddle point of the Lagrangian of the underlying convex minimization problem as time tends to infinity. In addition, we provide rates for both the violation of the feasibility condition by the ergodic trajectories and the convergence of the objective function along these ergodic trajectories to its minimal value. Explicit time discretization of the dynamical system results in a numerical algorithm which is a combination of the linearized proximal method of multipliers and the proximal ADMM algorithm. [ABSTRACT FROM AUTHOR]

In this paper, we explain in more details the modern treatment of the problem of group classification of (systems of) partial differential equations (PDEs) from the algorithmic point of view. More precisely, we revise the classical Lie algorithm of construction of symmetries of differential equations, describe the group classification algorithm and discuss the process of reduction of (systems of) PDEs to (systems of) equations with smaller number of independent variables in order to construct invariant solutions. The group classification algorithm and reduction process are illustrated by the example of the generalized Zakharov–Kuznetsov (GZK) equations of form u t + ( F ( u ) ) x x x + ( G ( u ) ) x y y + ( H ( u ) ) x = 0 . As a result, a complete group classification of the GZK equations is performed and a number of new interesting nonlinear invariant models which have non-trivial invariance algebras are obtained. Lie symmetry reductions and exact solutions for two important invariant models, i.e., the classical and modified Zakharov–Kuznetsov equations, are constructed. The algorithmic framework for group analysis of differential equations presented in this paper can also be applied to other nonlinear PDEs. [ABSTRACT FROM AUTHOR]

Abstract: In this paper, we present an iterative steering algorithm for nonholonomic systems (also called driftless control-affine systems) and we prove its global convergence under the sole assumption that the Lie Algebraic Rank Condition (LARC) holds true everywhere. That algorithm is an extension of the one introduced in Jean et al. (2005) [21] for regular systems. The first novelty here consists in the explicit algebraic construction, starting from the original control system, of a lifted control system which is regular. The second contribution of the paper is an exact motion planning method for nilpotent systems, which makes use of sinusoidal control laws and which is a generalization of the algorithm described in Murray and Sastry (1993) [29] for chained-form systems. [Copyright &y& Elsevier]

In this paper, we investigate the inverse problem on determining the spatial component of the source term in the hyperbolic equation with a time-dependent principal part. Based on a Carleman estimate for general hyperbolic operators, we prove a local stability result of Hölder type in both cases of partial boundary and interior observation data. Numerically, we adopt the classical Tikhonov regularization to reformulate the inverse problem into a related optimization problem, for which we develop an iterative thresholding algorithm by using the corresponding adjoint system. Numerical examples up to three spatial dimensions are presented to demonstrate the accuracy and efficiency of the proposed algorithm. [ABSTRACT FROM AUTHOR]

In this paper we consider a class of fully nonlinear forced and reversible Schrödinger equations and prove existence and stability of quasi-periodic solutions. We use a Nash–Moser algorithm together with a reducibility theorem on the linearized operator in a neighborhood of zero. Due to the presence of the highest order derivatives in the non-linearity the classic KAM-reducibility argument fails and one needs to use a wider class of changes of variables such as diffeomorphisms of the torus and pseudo-differential operators. This procedure automatically produces a change of variables, well defined on the phase space of the equation, which diagonalizes the operator linearized at the solution. This gives the linear stability. [ABSTRACT FROM AUTHOR]

Abstract: In this paper we study the quasi-homogeneous polynomial differential systems and provide an algorithm for obtaining all these systems with a given degree. Using this algorithm we obtain all quasi-homogeneous vector fields of degree 2 and 3. The quasi-homogeneous polynomial differential systems are Liouvillian integrable. In particular, we characterize all the quasi-homogeneous vector fields of degree 2 and 3 having a polynomial, rational or global analytical first integral. [Copyright &y& Elsevier]

Abstract: We develop and present a computational method for producing forcing theorems for stationary and periodic solutions and connecting orbits in scalar parabolic equations with periodic boundary conditions. This method is based on prior work by van den Berg, Ghrist, and Vandervorst on a Conley index theory for solutions braided through a collection of known stationary solutions. Essentially, the topological structure of the stationary solutions forces the existence of additional solutions with a specified topological type. In particular, this paper studies connecting orbits and develops and implements the algorithms required to compute the index, providing sample results as illustrations. [Copyright &y& Elsevier]

Abstract: We present a KAM theory for some dissipative systems (geometrically, these are conformally symplectic systems, i.e. systems that transform a symplectic form into a multiple of itself). For systems with n degrees of freedom depending on n parameters we show that it is possible to find solutions with a fixed n-dimensional (Diophantine) frequency by adjusting the parameters. We do not assume that the system is close to integrable, but we present the results in an a-posteriori format. Our unknowns are a parameterization of the quasi-periodic solution and some parameters in the system. We formulate an invariance equation that expresses that the system with the parameters leaves invariant the solution given by the embedding. We show that if there is a sufficiently approximate solution of the invariance equation, which also satisfies some non-degeneracy conditions, then there is a true solution nearby. The smallness assumptions above can be understood either in Sobolev or in analytic norms. The a-posteriori format has several consequences: A) smooth dependence on the parameters, including the singular limit of zero dissipation; B) estimates on the measure of parameters covered by quasi-periodic solutions; C) convergence of perturbative expansions in dissipative analytic systems; D) bootstrap of regularity (i.e. that all tori which are smooth enough are analytic if the map is analytic); E) a numerically efficient criterion for the breakdown of the quasi-periodic solutions. The proof is based on an iterative quadratically convergent method. The iterative step takes advantage of some geometric identities; these identities also lead to an efficient algorithm. If we discretize the parameterization with N terms, a modified Newton step requires storage and operations. The a-posteriori theorems allow one to be confident on the numerical results even very close to breakdown. The algorithm does not require that the system is close to integrable, so that a continuation algorithm is guaranteed to continue the tori till the breakdown (in practice, only limitation being the total memory and the precision). The algorithms have been implemented and run in other papers. [Copyright &y& Elsevier]

Abstract: This work is concerned with several properties of solutions of stochastic differential equations arising from hybrid switching diffusions. The word “hybrid” highlights the coexistence of continuous dynamics and discrete events. The underlying process has two components. One component describes the continuous dynamics, whereas the other is a switching process representing discrete events. One of the main features is the switching component depending on the continuous dynamics. In this paper, weak continuity is proved first. Then continuous and smooth dependence on initial data are demonstrated. In addition, it is shown that certain functions of the solutions verify a system of Kolmogorov''s backward differential equations. Moreover, rates of convergence of numerical approximation algorithms are dealt with. [Copyright &y& Elsevier]

Abstract: In this paper we present an alternative algorithm for computing Poincaré–Lyapunov constants of simple monodromic singularities of planar analytic vector fields based on the concept of inverse integrating factor. Simple monodromic singular points are those for which after performing the first (generalized) polar blow-up, there appear no singular points. In other words, the associated Poincaré return map is analytic. An improvement of the method determines a priori the minimum number of Poincaré–Lyapunov constants which must cancel to ensure that the monodromic singularity is in fact a center when the explicit Laurent series of an inverse integrating factor is known in (generalized) polar coordinates. Several examples show the usefulness of the method. [Copyright &y& Elsevier]

Abstract: In this paper we prove rigorous results on persistence of invariant tori and their whiskers. The proofs are based on the parameterization method of [X. Cabré, E. Fontich, R. de la Llave, The parameterization method for invariant manifolds. I. Manifolds associated to non-resonant subspaces, Indiana Univ. Math. J. 52 (2) (2003) 283–328; X. Cabré, E. Fontich, R. de la Llave, The parameterization method for invariant manifolds. II. Regularity with respect to parameters, Indiana Univ. Math. J. 52 (2) (2003) 329–360]. The invariant manifolds results proved here include as particular cases of the usual (strong) stable and (strong) unstable manifolds, but also include other non-resonant manifolds. The method lends itself to numerical implementations whose analysis and implementation is studied in [A. Haro, R. de la Llave, A parameterization method for the computation of invariant tori and their whiskers in quasi-periodic maps: Numerical algorithms, preprint, 2005; A. Haro, R. de la Llave, A parameterization method for the computation of invariant tori and their whiskers in quasi-periodic maps: Numerical implementation and examples, preprint, 2005]. The results are stated as a posteriori results. Namely, that if one has an approximate solution which is not degenerate, then, one has a true solution not too far from the approximate one. This can be used to validate the results of numerical computations. [Copyright &y& Elsevier]