scholarly journals Singularities of Solutions of Hamilton–Jacobi Equations

Author(s):  
Piermarco Cannarsa ◽  
Wei Cheng

AbstractThis is a survey paper on the quantitative analysis of the propagation of singularities for the viscosity solutions to Hamilton–Jacobi equations in the past decades. We also review further applications of the theory to various fields such as Riemannian geometry, Hamiltonian dynamical systems and partial differential equations.

1985 ◽  
Vol 5 (3) ◽  
pp. 437-443 ◽  
Author(s):  
R. Rudnicki

AbstractWe prove that the dynamical systems generated by first order partial differential equations are K-flows and chaotic in the sense of Auslander & Yorke.


2004 ◽  
Vol 04 (03) ◽  
pp. 385-404 ◽  
Author(s):  
J. A. LANGA ◽  
B. SCHMALFUSS

In the last decade, the concept of pullback attractor has become one of the usual tools to describe some qualitative properties of non-autonomous partial differential equations. A pullback attractor is a family of compact sets, invariant for the corresponding process related to the equation, and attracting from the past, and it assumes a natural generalization of the now classical concept of global attractor for autonomous partial differential equations. In this work we give sufficient conditions in order to prove the finite Hausdorff and fractal dimensionality of pullback attractors for non-autonomous infinite dimensional dynamical systems, and we apply our results to a generalized non-autonomous partial differential equation of Navier–Stokes type.


Author(s):  
Jesus D. Terrazas Gonzalez ◽  
Witold Kinsner

This paper presents a new cryptosystem based on chaotic continuous-interval cellular automata (CCA) to increase data protection as demonstrated by their flexibility to encrypt and decrypt information from distinct sources. Enhancements to cryptosystems are also presented including (i) a model based on a new chaotic CCA attractor, (ii) the dynamical integration of modules containing dynamical systems to generate complex sequences, and (iii) an enhancement for symmetric cryptosystems by allowing them to generate an unlimited number of keys. This paper also presents a process of mixing chaotic sequences obtained from cellular automata, instead of using differential equations, as a basis to achieve higher security and higher speed for the encryption and decryption processes, as compared to other recent approaches. The complexity of the mixed sequences is measured using the variance fractal dimension trajectory to compare them to the unmixed chaotic sequences to verify that the former are more complex. This type of polyscale measure and evaluation has never been done in the past outside this research group.


1989 ◽  
Author(s):  
Jack Hale ◽  
Constantine M. Dafermos ◽  
John Mallet-Paret ◽  
Panagiotis E. Souganidis ◽  
Walter Strauss

1993 ◽  
Author(s):  
Constantine M. Dafermos ◽  
John Mallet-Paret ◽  
Panagiotis E. Souganidis ◽  
Walter Strauss

Sign in / Sign up

Export Citation Format

Share Document