A Trace Finite Element Method for Vector-Laplacians on Surfaces

We consider a vector-Laplace problem posed on a 2D surface embedded in a 3D domain, which results from the modeling of surface fluids based on exterior Cartesian differential operators. The main topic of this paper is the development and analysis of a finite element method for the discretization of this surface partial differential equation. We apply the trace finite element technique, in which finite element spaces on a background shape-regular tetrahedral mesh that is surface-independent are used for discretization. In order to satisfy the constraint that the solution vector field is tangential to the surface we introduce a Lagrange multiplier. We show well-posedness of the resulting saddle point formulation. A discrete variant of this formulation is introduced which contains suitable stabilization terms and is based on trace finite element spaces. For this method we derive optimal discretization error bounds. Furthermore algebraic properties of the resulting discrete saddle point problem are studied. In particular an optimal Schur complement preconditioner is proposed. Results of a numerical experiment are included

The earlier the better: a theory of timed actor interfaces

Programming embedded and cyber-physical systems requires attention not only to functional behavior and correctness, but also to non-functional aspects and specifically timing and performance. A structured, compositional, model-based approach based on stepwise refinement and abstraction techniques can support the development process, increase its quality and reduce development time through automation of synthesis, analysis or verification. Toward this, we introduce a theory of timed actors whose notion of refinement is based on the principle of worst-case design that permeates the world of performance-critical systems. This is in contrast with the classical behavioral and functional refinements based on restricting sets of behaviors. Our refinement allows time-deterministic abstractions to be made of time-non-deterministic systems, improving efficiency and reducing complexity of formal analysis. We show how our theory relates to, and can be used to reconcile existing time and performance models and their established theories

Global analysis of piecewise linear systems using impact maps and surface Lyapunov functions

This paper presents an entirely new constructive global analysis methodology for a class of hybrid systems known as piecewise linear systems (PLS). This methodology infers global properties of PLS solely by studying the behavior at switching surfaces associated with PLS. The main idea is to analyze impact maps, i.e., maps from one switching surface to the next switching surface. Such maps are known to be "unfriendly" maps in the sense that they are highly nonlinear, multivalued, and not continuous. We found, however, that an impact map induced by an linear time-invariant flow between two switching surfaces can be represented as a linear transformation analytically parametrized by a scalar function of the state. This representation of impact maps allows the search for surface Lyapunov functions (SuLF) to be done by simply solving a semidefinite program, allowing global asymptotic stability, robustness, and performance of limit cycles and equilibrium points of PLS to be efficiently checked. This new analysis methodology has been applied to relay feedback, on/off and saturation systems, where it has shown to be very successful in globally analyzing a large number of examples. In fact, it is still an open problem whether there exists an example with a globally stable limit cycle or equilibrium point that cannot be successfully analyzed with this new methodology. Examples analyzed include systems of relative degree larger than one and of high dimension, for which no other analysis methodology could be applied. This success in globally analyzing certain classes of PLS has shown the power of this new methodology, and suggests its potential toward the analysis of larger and more complex PLS