On convergence of the maximum block improvement method

Abstract. The MBI (maximum block improvement) method is a greedy approach to solving optimization problems where the decision variables can be grouped into a finite number of blocks. Assuming that optimizing over one block of variables while fixing all others is relatively easy, the MBI method updates the block of variables corresponding to the maximally improving block at each iteration, which is arguably a most natural and simple process to tackle block-structured problems with great potentials for engineering applications. In this paper we establish global and local linear convergence results for this method. The global convergence is established under the Lojasiewicz inequality assumption, while the local analysis invokes second-order assumptions. We study in particular the tensor optimization model with spherical constraints. Conditions for linear convergence of the famous power method for computing the maximum eigenvalue of a matrix follow in this framework as a special case. The condition is interpreted in various other forms for the rank-one tensor optimization model under spherical constraints. Numerical experiments are shown to support the convergence property of the MBI method

Closed form solution of the return mapping algorithm in elastoplasticity

In the present work a return mapping algorithm is discussed for small strain elastoplasticity boundary value problems with an exact closed form solution of the local constitutive equations. Nonlinear kinematic hardening rules are adopted in modelling kinematic hardening behavior of ductile materials. The local solution of the constitutive equations is expressed by only one nonlinear scalar equation which is subsequently reduced to a single variable algebraic equation. Due to the straightforward form of the nonlinear scalar equation the analytical solution of the algebraic equation is found in exact closed form. A remarkable advantage of the present approach is that no iterative solution method is used to solve the local constitutive equations in three-dimensional elastoplasticity. Numerical applications and computational results are reported in order to illustrate the robustness and effectiveness of the proposed algorithmic procedure

Classical and all-floating FETI methods for the simulation of arterial tissues

High-resolution and anatomically realistic computer models of biological soft tissues play a significant role in the understanding of the function of cardiovascular components in health and disease. However, the computational effort to handle fine grids to resolve the geometries as well as sophisticated tissue models is very challenging. One possibility to derive a strongly scalable parallel solution algorithm is to consider finite element tearing and interconnecting (FETI) methods. In this study we propose and investigate the application of FETI methods to simulate the elastic behavior of biological soft tissues. As one particular example we choose the artery which is - as most other biological tissues - characterized by anisotropic and nonlinear material properties. We compare two specific approaches of FETI methods, classical and all-floating, and investigate the numerical behavior of different preconditioning techniques. In comparison to classical FETI, the all-floating approach has not only advantages concerning the implementation but in many cases also concerning the convergence of the global iterative solution method. This behavior is illustrated with numerical examples. We present results of linear elastic simulations to show convergence rates, as expected from the theory, and results from the more sophisticated nonlinear case where we apply a well-known anisotropic model to the realistic geometry of an artery. Although the FETI methods have a great applicability on artery simulations we will also discuss some limitations concerning the dependence on material parameters.Comment: 29 page