The computation of guaranteed state enclosures has a large variety of applications in engineering if initial value problems for sets of ordinary differential equations are concerned. One possible scenario is the use of such state enclosures in the design and verification of linear and nonlinear feedback controllers as well as in predictive control procedures. In many of these applications, system models are characterized by a dominant linear part (commonly after a suitable coordinate transformation) and by a not fully negligible nonlinear part. To compute guaranteed state enclosures for such systems, general purpose approaches relying on a Taylor series expansion of the solution can be employed. However, they do not exploit knowledge about the specific system structure. The exponential state enclosure technique makes use of this structure, allowing users to compute tight enclosures that contract over time for asymptotically stable dynamics. This paper firstly gives an overview of exponential enclosure techniques, implemented in ValEncIA-IVP, and secondly focuses on extensions to dynamic systems with single and multiple conjugate complex eigenvalues.
Many dynamic system models in population dynamics, physics and control involve temporally delayed state information in such a way that the evolution of future state trajectories depends not only on the current state as the initial condition but also on some previous state. In technical systems, such phenomena result, for example, from mass transport of incompressible fluids through finitely long pipelines, the transport of combustible material such as coal in power plants via conveyor belts, or information processing delays. Under the assumption of continuous dynamics, the corresponding delays can be treated either as constant and fixed, as uncertain but bounded and fixed, or even as state-dependent. In this paper, we restrict the discussion to the first two classes and provide suggestions on how interval-based verified approaches to solving ordinary differential equations can be extended to encompass such delay differential equations. Three close-to-life examples illustrate the theory.
In various research projects, it has been demonstrated that feedforward neural network models (possibly extended toward dynamic representations) are efficient means for identifying numerous dependencies of the electrochemical behavior of high-temperature fuel cells. These dependencies include external inputs such as gas mass flows, gas inlet temperatures, and the electric current as well as internal fuel cell states such as the temperature. Typically, the research on using neural networks in this context is focused only on point-valued training data. As a result, the neural network provides solely point-valued estimates for such quantities as the stack voltage and instantaneous fuel cell power. Although advantageous, for example, for robust control synthesis, quantifying the reliability of neural network models in terms of interval bounds for the network’s output has not yet received wide attention. In practice, however, such information is essential for optimizing the utilization of the supplied fuel. An additional goal is to make sure that the maximum power point is not exceeded since that would lead to accelerated stack degradation. To solve the data-driven modeling task with the focus on reliability assessment, a novel offline and online parameterization strategy for interval extensions of neural network models is presented in this paper. Its functionality is demonstrated using real-life measured data for a solid oxide fuel cell stack that is operated with temporally varying electric currents and fuel gas mass flows.
In this paper, we take a look at the analysis and parameter identification for control-oriented, dynamic models for the thermal subsystem of solid oxide fuel cells (SOFC) from the systematized point of view of verification and validation (V&V). First, we give a possible classification of models according to their verification degree which depends, for example, on the kind of arithmetic used for both formulation and simulation. Typical SOFC models, consisting of several coupled differential equations for gas preheaters and the temperature distribution in the stack module, do not have analytical solutions because of spatial nonlinearity. Therefore, in the next part of the paper, we describe in detail two possible ways to simplify such models so that the underlying differential equations can be solved analytically while still being sufficiently accurate to serve as the basis for control synthesis. The simplifying assumption is to approximate the heat capacities of the gases by zero-order polynomials (or first-oder polynomials, respectively) in the temperature. In the last, application-oriented part of the paper, we identify the parameters of these models as well as compare their performance and their ability to reflect the reality with the corresponding characteristics of models in which the heat capacities are represented by quadratic polynomials (the usual case). For this purpose, the framework UniVerMeC (Unified Framework for Verified GeoMetric Computations) is used, which allows us to employ different kinds of arithmetics including the interval one. This latter possibility ensures a high level of reliability of simulations and of the subsequent validation. Besides, it helps to take into account bounded uncertainty in measurements.
Interval methods are helpful in the context of scientific computing for reliable treatment of problems with bounded uncertainty. Most traditional interval algorithms, however, were designed for sequential execution while internally depending on processor-specific instructions for directed rounding. Nowadays, many-core processors and dedicated hardware for massively parallel data processing have become the de facto standard for high-performance computers. Interval libraries have yet to adapt to this heterogeneous computing paradigm. In this article, we investigate the parallelization of interval methods with an emphasis on modern graphics processors. Using a parameter identification scenario in combination with newly developed or enhanced GPU-based interval software, we evaluate different methods for reducing the size of large interval search domains. For the first time, algorithmic differentiation can be used with intervals on the GPU. Different versions of interval optimization algorithms are compared wrt. their functionality, run times, and energy consumption.
28 November 2023 in JUCS - Journal of Universal Computer Science
In this paper, we describe the requirements for traceable open-source data retrieval in the context of computation of BRCA1/2 mutation probabilities (mutations in two tumor-suppressor genes responsible for hereditary BReast or/and ovarian CAncer). We show how such data can be used to develop a Dempster-Shafer model for computing the probability of BRCA1/2 mutations enhanced by taking into account the actual age of a patient or a family member in an appropriate way even if it is not known exactly. The model is compared with PENN II and BOADICEA (based on undisclosed data), two established platforms for this purpose accessible online, as well as with our own previous models. A proof-of-concept implementation shows that set-based techniques are able to provide better information about mutation probabilities, simultaneously highlighting the necessity for ground truth data of high quality.