Results 1  10
of
19
Synchronization and linearity: an algebra for discrete event systems
, 2001
"... The first edition of this book was published in 1992 by Wiley (ISBN 0 471 93609 X). Since this book is now out of print, and to answer the request of several colleagues, the authors have decided to make it available freely on the Web, while retaining the copyright, for the benefit of the scientific ..."
Abstract

Cited by 372 (11 self)
 Add to MetaCart
The first edition of this book was published in 1992 by Wiley (ISBN 0 471 93609 X). Since this book is now out of print, and to answer the request of several colleagues, the authors have decided to make it available freely on the Web, while retaining the copyright, for the benefit of the scientific community. Copyright Statement This electronic document is in PDF format. One needs Acrobat Reader (available freely for most platforms from the Adobe web site) to benefit from the full interactive machinery: using the package hyperref by Sebastian Rahtz, the table of contents and all LATEX crossreferences are automatically converted into clickable hyperlinks, bookmarks are generated automatically, etc.. So, do not hesitate to click on references to equation or section numbers, on items of thetableofcontents and of the index, etc.. One may freely use and print this document for one’s own purpose or even distribute it freely, but not commercially, provided it is distributed in its entirety and without modifications, including this preface and copyright statement. Any use of thecontents should be acknowledged according to the standard scientific practice. The
Fast sweeping methods for static hamiltonjacobi equations
 Society for Industrial and Applied Mathematics
, 2005
"... Abstract. We propose a new sweeping algorithm which discretizes the Legendre transform of the numerical Hamiltonian using an explicit formula. This formula yields the numerical solution at a grid point using only its immediate neighboring grid values and is easy to implement numerically. The minimiz ..."
Abstract

Cited by 54 (5 self)
 Add to MetaCart
(Show Context)
Abstract. We propose a new sweeping algorithm which discretizes the Legendre transform of the numerical Hamiltonian using an explicit formula. This formula yields the numerical solution at a grid point using only its immediate neighboring grid values and is easy to implement numerically. The minimization that is related to the Legendre transform in our sweeping scheme can either be solved analytically or numerically. We illustrate the efficiency and accuracy approach with several numerical examples in two and three dimensions.
Discrete time highorder schemes for viscosity solutions of HamiltonJacobiBellman equations
, 1994
"... this paper is to derive highorder numerical schemes for the approximation of the value function, this being done using the Dynamic Programming approach. ..."
Abstract

Cited by 37 (7 self)
 Add to MetaCart
this paper is to derive highorder numerical schemes for the approximation of the value function, this being done using the Dynamic Programming approach.
Kicked Burgers turbulence
 J. Fluid Mech
"... J. Fluid Mech.; in press Burgers turbulence subject to a force f(x,t) = ∑ j fj(x)δ(t − tj), where the tj’s are “kicking times ” and the “impulses ” fj(x) have arbitrary space dependence, combines features of the purely decaying and the continuously forced cases. With largescale forcing this “kicke ..."
Abstract

Cited by 26 (6 self)
 Add to MetaCart
J. Fluid Mech.; in press Burgers turbulence subject to a force f(x,t) = ∑ j fj(x)δ(t − tj), where the tj’s are “kicking times ” and the “impulses ” fj(x) have arbitrary space dependence, combines features of the purely decaying and the continuously forced cases. With largescale forcing this “kicked ” Burgers turbulence presents many of the regimes proposed by E, Khanin, Mazel and Sinai (1997) for the case of random whiteintime forcing. It is also amenable to efficient numerical simulations in the inviscid limit, using a modification of the Fast Legendre Transform method developed for decaying Burgers turbulence by Noullez and Vergassola (1994). For the kicked case, concepts such as “minimizers ” and “main shock”, which play crucial roles in recent developments for forced Burgers turbulence, become elementary since everything can be constructed from simple twodimensional areapreserving Euler– Lagrange maps.
LaxHopf based incorporation of internal boundary conditions into HamiltonJacobi equation. Part I: Theory
 IEEE TRANS. AUTOM. CONTROL
, 2010
"... This article proposes a new approach for computing a semiexplicit form of the solution to a class of Hamilton–Jacobi (HJ) partial differential equations (PDEs), using control techniques based on viability theory. We characterize the epigraph of the value function solving the HJ PDE as a capture bas ..."
Abstract

Cited by 26 (4 self)
 Add to MetaCart
This article proposes a new approach for computing a semiexplicit form of the solution to a class of Hamilton–Jacobi (HJ) partial differential equations (PDEs), using control techniques based on viability theory. We characterize the epigraph of the value function solving the HJ PDE as a capture basin of a target through an auxiliary dynamical system, called “characteristic system”. The properties of capture basins enable us to define components as building blocks of the solution to the HJ PDE in the Barron/JensenFrankowska sense. These components can encode initial conditions, boundary conditions, and internal “boundary” conditions, which are the topic of this article. A generalized LaxHopf formula is derived, and enables us to formulate the necessary and sufficient conditions for a mixed initial and boundary conditions problem with multiple internal boundary conditions to be well posed. We illustrate the capabilities of the method with a data assimilation problem for reconstruction of highway traffic flow using Lagrangian measurements generated from Next Generation Simulation (NGSIM) traffic data.
Theoremes Asymptotiques En Programmation Dynamique
, 1990
"... . On montre l'analogie existant entre le calcul des probabilites et la programmation dynamique. Dans la premiere situation les convolutions iterees de lois de probabilite jouent un role central, dans la seconde les infconvolutions de fonctions couts ont un role similaire. L'outil d'a ..."
Abstract

Cited by 15 (7 self)
 Add to MetaCart
. On montre l'analogie existant entre le calcul des probabilites et la programmation dynamique. Dans la premiere situation les convolutions iterees de lois de probabilite jouent un role central, dans la seconde les infconvolutions de fonctions couts ont un role similaire. L'outil d'analyse privilegiedelapremiere situation est la transformee de Fourier, celui de la seconde devrait etre la transform ee de Fenchel. Aux lois gaussiennes  stables par convolution  correspondent les formes quadratiques  stables par infconvolution. A la loi des grands des nombres et au theoreme de la limite centrale correspondent des theoremes asymptotiques pour la programmation dynamique  convergence de la fonction valeur de l'etat moyenne vers la fonction caracteristique du minimum du cout instantane, convergencede la fonction valeur de l'ecart au minimun renormalise vers une forme quadratique. ABSTRACT. Asymptotic Theorems in Dynamic Programming We show the analogy between probability calculu...
The convex envelope is the solution of a nonlinear obstacle problem
 Proc. Amer. Math. Soc
"... Abstract. We derive a nonlinear partial differential equation for the convex envelope of a given function. The solution is interpreted as the value function of an optimal stochastic control problem. The equation is solved numerically using a convergent finite difference scheme. 1. ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
(Show Context)
Abstract. We derive a nonlinear partial differential equation for the convex envelope of a given function. The solution is interpreted as the value function of an optimal stochastic control problem. The equation is solved numerically using a convergent finite difference scheme. 1.
The piecewise linearquadratic model for computational convex analysis
 Comput. Optim. Appl
, 2006
"... Abstract. A new computational framework for computeraided convex analysis is proposed and investigated. Existing computational frameworks are reviewed and their limitations pointed out. The class of piecewise linearquadratic functions is introduced to improve convergence and stability. A stable co ..."
Abstract

Cited by 10 (7 self)
 Add to MetaCart
(Show Context)
Abstract. A new computational framework for computeraided convex analysis is proposed and investigated. Existing computational frameworks are reviewed and their limitations pointed out. The class of piecewise linearquadratic functions is introduced to improve convergence and stability. A stable convex calculus is achieved using symbolicnumeric algorithms to compute all fundamental transforms of convex analysis. Our main result states the existence of efficient (linear time) algorithms for the class of piecewise linearquadratic functions. We also recall that such class is closed under convex transforms. We illustrates the results with numerical examples, and validate numerically the resulting computational framework. 1.
A Method to Convexify Functions via Curve Evolution
 Commun. Partial Differential Equations
, 1999
"... This paper is devoted to a new method which allows to compute the convex envelope of a given function, by an evolution equation and techniques of curve evolution. We study the problem in the context of viscosity solutions and we propose numerical algorithms, to convexify a function, in one and two d ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
This paper is devoted to a new method which allows to compute the convex envelope of a given function, by an evolution equation and techniques of curve evolution. We study the problem in the context of viscosity solutions and we propose numerical algorithms, to convexify a function, in one and two dimensions. In the end, we validate the model by presenting various numerical results.
What shape is your conjugate? A survey of computational convex analysis and its applications
 SIAM Rev
, 2010
"... Abstract. Computational Convex Analysis algorithms have been rediscovered several times in the past by researchers from different fields. To further communications between practitioners, we review the field of Computational Convex Analysis, which focuses on the numerical computation of fundamental ..."
Abstract

Cited by 9 (3 self)
 Add to MetaCart
(Show Context)
Abstract. Computational Convex Analysis algorithms have been rediscovered several times in the past by researchers from different fields. To further communications between practitioners, we review the field of Computational Convex Analysis, which focuses on the numerical computation of fundamental transforms arising from convex analysis. Current models use symbolic, numeric, and hybrid symbolicnumeric algorithms. Our objective is to disseminate widely the most efficient numerical algorithms useful for applications in image processing (computing the distance transform, the generalized distance transform, and mathematical morphology operators), partial differential equations (solving HamiltonJacobi equations, and using differential equations numerical schemes to compute the convex envelope), maxplus algebra (computing the equivalent of the Fast Fourier Transform), multifractal analysis, etc. The fields of applications include, among others, computer vision, robot navigation, thermodynamics, electrical networks, medical imaging, and network communication.