A Finite Element Numerical Algorithm for Modelling and Data Fitting in Complex Systems

Numerical modelling methodologies are important by their application to engineering and scientific problems, because there are processes where analytical mathematical expressions cannot be obtained to model them. When the only available information is a set of experimental values for the variables that determine the state of the system, the modelling problem is equivalent to determining the hyper-surface that best fits the data. This paper presents a methodology based on the Galerkin formulation of the finite elements method to obtain representations of relationships that are defined a priori, between a set of variables: y = z(x1, x2,...., xd). These representations are generated from the values of the variables in the experimental data. The approximation, piecewise, is an element of a Sobolev space and has derivatives defined in a general sense into this space. The using of this approach results in the need of inverting a linear system with a structure that allows a fast solver algorithm. The algorithm can be used in a variety of fields, being a multidisciplinary tool. The validity of the methodology is studied considering two real applications: a problem in hydrodynamics and a problem of engineering related to fluids, heat and transport in an energy generation plant. Also a test of the predictive capacity of the methodology is performed using a cross-validation method.

Quantitative stability of linear infinite inequality systems under block perturbations with applications to convex systems

The original motivation for this paper was to provide an efficient quantitative analysis of convex infinite (or semi-infinite) inequality systems whose decision variables run over general infinite-dimensional (resp. finite-dimensional) Banach spaces and that are indexed by an arbitrary fixed set J. Parameter perturbations on the right-hand side of the inequalities are required to be merely bounded, and thus the natural parameter space is l ∞(J). Our basic strategy consists of linearizing the parameterized convex system via splitting convex inequalities into linear ones by using the Fenchel–Legendre conjugate. This approach yields that arbitrary bounded right-hand side perturbations of the convex system turn on constant-by-blocks perturbations in the linearized system. Based on advanced variational analysis, we derive a precise formula for computing the exact Lipschitzian bound of the feasible solution map of block-perturbed linear systems, which involves only the system’s data, and then show that this exact bound agrees with the coderivative norm of the aforementioned mapping. In this way we extend to the convex setting the results of Cánovas et al. (SIAM J. Optim. 20, 1504–1526, 2009) developed for arbitrary perturbations with no block structure in the linear framework under the boundedness assumption on the system’s coefficients. The latter boundedness assumption is removed in this paper when the decision space is reflexive. The last section provides the aimed application to the convex case.

Lower semicontinuity of the feasible set mapping of linear systems relative to their domains

This paper deals with stability properties of the feasible set of linear inequality systems having a finite number of variables and an arbitrary number of constraints. Several types of perturbations preserving consistency are considered, affecting respectively, all of the data, the left-hand side data, or the right-hand side coefficients.

Voronoi cells via linear inequality systems

The theory and methods of linear algebra are a useful alternative to those of convex geometry in the framework of Voronoi cells and diagrams, which constitute basic tools of computational geometry. As shown by Voigt and Weis in 2010, the Voronoi cells of a given set of sites T, which provide a tesselation of the space called Voronoi diagram when T is finite, are solution sets of linear inequality systems indexed by T. This paper exploits systematically this fact in order to obtain geometrical information on Voronoi cells from sets associated with T (convex and conical hulls, tangent cones and the characteristic cones of their linear representations). The particular cases of T being a curve, a closed convex set and a discrete set are analyzed in detail. We also include conclusions on Voronoi diagrams of arbitrary sets.

Generation of representation models for complex systems using Lagrangian functions

In this article, a new methodology is presented to obtain representation models for a priori relation z = u(x1, x2, . . . ,xn) (1), with a known an experimental dataset zi; x1i ; x2i ; x3i ; . . . ; xni i=1;2;...;p· In this methodology, a potential energy is initially defined over each possible model for the relationship (1), what allows the application of the Lagrangian mechanics to the derived system. The solution of the Euler–Lagrange in this system allows obtaining the optimal solution according to the minimal action principle. The defined Lagrangian, corresponds to a continuous medium, where a n-dimensional finite elements model has been applied, so it is possible to get a solution for the problem solving a compatible and determined linear symmetric equation system. The computational implementation of the methodology has resulted in an improvement in the process of get representation models obtained and published previously by the authors.

Acceleration and Deflection Analysis for Class C Edge Protection Systems in Construction Work

The requirements for edge protection systems on most sloped work surfaces (class C, according to EN 13374-2013 code) in construction works are studied in this paper. Maximum deceleration suffered by a falling body and maximum deflection of the protection system were analyzed through finite-element models and confirmed through full-scale experiments. The aim of this work is to determine which value for deflection system entails a safe deceleration for the human body. This value is compared with the requirements given by the current version of EN 13374-2013. An additional series of experiments were done to determine the acceleration linked to minimum deflection required by code (200 mm) during the retention process. According to the obtained results, a modification of this value is recommended. Additionally, a simple design formula for this falling protection system is proposed as a quick tool for the initial steps of design.

Logic-Based Outer Approximation for the Design of Discrete-Continuous Dynamic Systems with Implicit Discontinuities

We address the optimization of discrete-continuous dynamic optimization problems using a disjunctive multistage modeling framework, with implicit discontinuities, which increases the problem complexity since the number of continuous phases and discrete events is not known a-priori. After setting a fixed alternative sequence of modes, we convert the infinite-dimensional continuous mixed-logic dynamic (MLDO) problem into a finite dimensional discretized GDP problem by orthogonal collocation on finite elements. We use the Logic-based Outer Approximation algorithm to fully exploit the structure of the GDP representation of the problem. This modelling framework is illustrated with an optimization problem with implicit discontinuities (diver problem).

Calmness of the Feasible Set Mapping for Linear Inequality Systems

In this paper we deal with parameterized linear inequality systems in the n-dimensional Euclidean space, whose coefficients depend continuosly on an index ranging in a compact Hausdorff space. The paper is developed in two different parametric settings: the one of only right-hand-side perturbations of the linear system, and that in which both sides of the system can be perturbed. Appealing to the backgrounds on the calmness property, and exploiting the specifics of the current linear structure, we derive different characterizations of the calmness of the feasible set mapping, and provide an operative expresion for the calmness modulus when confined to finite systems. In the paper, the role played by the Abadie constraint qualification in relation to calmness is clarified, and illustrated by different examples. We point out that this approach has the virtue of tackling the calmness property exclusively in terms of the system’s data.

On the forbidden gap of finite graphene nanoribbons

The electronic structure of isolated finite graphene nanoribbons is investigated by solving, at the Hartree-Fock (HF) level, the Pariser, Parr and Pople (PPP) many-body Hamiltonian. The study is mainly focused on 7-AGNR and 13-AGNR (Armchair Graphene Nano-Ribbons), whose electronic structures have been recently experimentally investigated. Only paramagnetic solutions are considered. The characteristics of the forbidden gap are studied as a function of the ribbon length. For a 7-AGNR, the gap monotonically decreases from a maximum value of ~6.5 eV for short nanoribbons to a very small value of ~0.12 eV for the longer calculated systems. Gap edges are defined by molecular orbitals that are spatially localized near the nanoribbon extremes, that is, near both zig-zag edges. On the other hand, two delocalized orbitals define a much larger gap of about 5 eV. Conductance measurements report a somewhat smaller gap of ~3 eV. The small real gap lies in the middle of the one given by extended states and has been observed by STM and reproduced by DFT calculations. On the other hand, the length dependence of the gap is not monotonous for a 13-AGNR. It decreases initially but sharply increases for lengths beyond 30 Å remaining almost constant thereafter at a value of ~2.1 eV. Two additional states localized at the nanoribbon extremes show up at energies 0.31 eV below the HOMO (Highest Occupied Molecular Orbital) and above the LUMO (Lowest Unoccupied Molecular Orbital). These numbers compare favorably with those recently obtained by means of STS for a 13-AGNR sustained by a gold surface, namely 1.4 eV for the energy gap and 0.4 eV for the position of localized band edges. We show that the important differences between 7- and 13-AGNR should be ascribed to the charge rearrangement near the zig-zag edges obtained in our calculations for ribbons longer than 30 Å, a feature that does not show up for a 7-AGNR no matter its length.