Continuity of Lyapunov functions and of energy level for generalized gradient semigroup

The global attractor of a gradient-like semigroup has a Morse decomposition. Associated to this Morse decomposition there is a Lyapunov function (differentiable along solutions)-defined on the whole phase space- which proves relevant information on the structure of the attractor. In this paper we prove the continuity of these Lyapunov functions under perturbation. On the other hand, the attractor of a gradient-like semigroup also has an energy level decomposition which is again a Morse decomposition but with a total order between any two components. We claim that, from a dynamical point of view, this is the optimal decomposition of a global attractor; that is, if we start from the finest Morse decomposition, the energy level decomposition is the coarsest Morse decomposition that still produces a Lyapunov function which gives the same information about the structure of the attractor. We also establish sufficient conditions which ensure the stability of this kind of decomposition under perturbation. In particular, if connections between different isolated invariant sets inside the attractor remain under perturbation, we show the continuity of the energy level Morse decomposition. The class of Morse-Smale systems illustrates our results.

Flow Visualization with Quantified Spatial and Temporal Errors Using Edge Maps

Robust analysis of vector fields has been established as an important tool for deriving insights from the complex systems these fields model. Traditional analysis and visualization techniques rely primarily on computing streamlines through numerical integration. The inherent numerical errors of such approaches are usually ignored, leading to inconsistencies that cause unreliable visualizations and can ultimately prevent in-depth analysis. We propose a new representation for vector fields on surfaces that replaces numerical integration through triangles with maps from the triangle boundaries to themselves. This representation, called edge maps, permits a concise description of flow behaviors and is equivalent to computing all possible streamlines at a user defined error threshold. Independent of this error streamlines computed using edge maps are guaranteed to be consistent up to floating point precision, enabling the stable extraction of features such as the topological skeleton. Furthermore, our representation explicitly stores spatial and temporal errors which we use to produce more informative visualizations. This work describes the construction of edge maps, the error quantification, and a refinement procedure to adhere to a user defined error bound. Finally, we introduce new visualizations using the additional information provided by edge maps to indicate the uncertainty involved in computing streamlines and topological structures.