A TFETI Domain Decomposition Solver for Elastoplastic Problems

We propose an algorithm for the efficient parallel implementation of elastoplastic problems with hardening based on the so-called TFETI (Total Finite Element Tearing and Interconnecting) domain decomposition method. We consider an associated elastoplastic model with the von Mises plastic criterion and the linear isotropic hardening law. Such a model is discretized by the implicit Euler method in time and the consequent one time step elastoplastic problem by the finite element method in space. The latter results in a system of nonlinear equations with a strongly semismooth and strongly monotone operator. The semismooth Newton method is applied to solve this nonlinear system. Corresponding linearized problems arising in the Newton iterations are solved in parallel by the above mentioned TFETI domain decomposition method. The proposed TFETI based algorithm was implemented in Matlab parallel environment and its performance was illustrated on a 3D elastoplastic benchmark. Numerical results for different time discretizations and mesh levels are presented and discussed and a local quadratic convergence of the semismooth Newton method is observed

Magnetic and structural transitions in La0.4_{0.4}Na0.6_{0.6}Fe2_2As2_2 single crystals

La$_{0.4}$Na$_{0.6}$Fe$_2$As$_2$ single crystals have been grown out of an NaAs flux in an alumina crucible and characterized by measuring magnetic susceptibility, electrical resistivity, specific heat, as well as single crystal x-ray and neutron diffraction. La$_{0.4}$Na$_{0.6}$Fe$_2$As$_2$ single crystals show a structural phase transition from a high temperature tetragonal phase to a low-temperature orthorhombic phase at T$_s$\,=\,125\,K. This structural transition is accompanied by an anomaly in the temperature dependence of electrical resistivity, anisotropic magnetic susceptibility, and specific heat. Concomitant with the structural phase transition, the Fe moments order along the \emph{a} direction with an ordered moment of 0.7(1)\,$\mu_{\textup{B}}$ at \emph{T}\,=\,5 K. The low temperature stripe antiferromagnetic structure is the same as that in other \emph{A}Fe$_{2}$As$_{2}$ (\emph{A}\,=\,Ca, Sr, Ba) compounds. La$_{0.5-x}$Na$_{0.5+x}$Fe$_2$As$_2$ provides a new material platform for the study of iron-based superconductors where the electron-hole asymmetry could be studied by simply varying La/Na ratio.Comment: 9 pages, 7 figures, to appear in Physical Review

Synthesis, structure, and opto-electronic properties of organic-based nanoscale heterojunctions

Enormous research effort has been put into optimizing organic-based opto-electronic systems for efficient generation of free charge carriers. This optimization is mainly due to typically high dissociation energy (0.1-1 eV) and short diffusion length (10 nm) of excitons in organic materials. Inherently, interplay of microscopic structural, chemical, and opto-electronic properties plays crucial role. We show that employing and combining advanced scanning probe techniques can provide us significant insight into the correlation of these properties. By adjusting parameters of contact- and tapping-mode atomic force microscopy (AFM), we perform morphologic and mechanical characterizations (nanoshaving) of organic layers, measure their electrical conductivity by current-sensing AFM, and deduce work functions and surface photovoltage (SPV) effects by Kelvin force microscopy using high spatial resolution. These data are further correlated with local material composition detected using micro-Raman spectroscopy and with other electronic transport data. We demonstrate benefits of this multi-dimensional characterizations on (i) bulk heterojunction of fully organic composite films, indicating differences in blend quality and component segregation leading to local shunts of photovoltaic cell, and (ii) thin-film heterojunction of polypyrrole (PPy) electropolymerized on hydrogen-terminated diamond, indicating covalent bonding and transfer of charge carriers from PPy to diamond

Equilibria-based Probabilistic Model Checking for Concurrent Stochastic Games

Probabilistic model checking for stochastic games enables formal verification of systems that comprise competing or collaborating entities operating in a stochastic environment. Despite good progress in the area, existing approaches focus on zero-sum goals and cannot reason about scenarios where entities are endowed with different objectives. In this paper, we propose probabilistic model checking techniques for concurrent stochastic games based on Nash equilibria. We extend the temporal logic rPATL (probabilistic alternating-time temporal logic with rewards) to allow reasoning about players with distinct quantitative goals, which capture either the probability of an event occurring or a reward measure. We present algorithms to synthesise strategies that are subgame perfect social welfare optimal Nash equilibria, i.e., where there is no incentive for any players to unilaterally change their strategy in any state of the game, whilst the combined probabilities or rewards are maximised. We implement our techniques in the PRISM-games tool and apply them to several case studies, including network protocols and robot navigation, showing the benefits compared to existing approaches

Equilibria-based probabilistic model checking for concurrent stochastic games

Probabilistic model checking for stochastic games enables formal verification of systems that comprise competing or collaborating entities operating in a stochastic environment. Despite good progress in the area, existing approaches focus on zero-sum goals and cannot reason about scenarios where entities are endowed with different objectives. In this paper, we propose probabilistic model checking techniques for concurrent stochastic games based on Nash equilibria. We extend the temporal logic rPATL (probabilistic alternating-time temporal logic with rewards) to allow reasoning about players with distinct quantitative goals, which capture either the probability of an event occurring or a reward measure. We present algorithms to synthesise strategies that are subgame perfect social welfare optimal Nash equilibria, i.e., where there is no incentive for any players to unilaterally change their strategy in any state of the game, whilst the combined probabilities or rewards are maximised. We implement our techniques in the PRISM-games tool and apply them to several case studies, including network protocols and robot navigation, showing the benefits compared to existing approaches

Універсітэт. - № 11 (2114)

PERMON makes use of theoretical results in quadratic programming algorithms and domain decomposition methods. It is built on top of the PETSc framework for numerical computations. This paper describes its fundamental packages and shows their applications. We focus here on contact problems of mechanics decomposed by means of a FETI-type non-overlapping domain decomposition method. These problems lead to inequality constrained quadratic programming problems that can be solved by our PermonQP package.11510