skip to main content

Title: A NONLINEAR ELIMINATION PRECONDITIONED INEXACT NEWTON METHOD FOR HETEROGENEOUS HYPERELASTICITY
We propose and study a nonlinear elimination preconditioned inexact Newton method for the numerical simulation of diseased human arteries with a heterogeneous hyperelastic model. We assume the artery is made of layers of distinct tissues and also contains plaque. Traditional Newton methods often work well for smooth and homogeneous arteries but suffer from slow or no convergence due to the heterogeneousness of diseased soft tissues when the material is quasi-incompressible. The proposed nonlinear elimination method adaptively finds a small number of equations causing the nonlinear stagnation and then eliminates them from the global nonlinear system. By using the theory of affine invariance of Newton method, we provide insight into why the nonlinear elimination method can improve the convergence of Newton iterations. Our numerical results show that the combination of nonlinear elimination with an initial guess interpolated from a coarse level solution can lead to the uniform convergence of Newton method for this class of very difficult nonlinear problems.
Authors:
;
Award ID(s):
1720366
Publication Date:
NSF-PAR ID:
10155912
Journal Name:
SIAM journal on scientific computing
ISSN:
1064-8275
Sponsoring Org:
National Science Foundation
More Like this
  1. Abstract This paper presents a method to derive the virtual fields for identifying constitutive model parameters using the Virtual Fields Method (VFM). The VFM is an approach to identify unknown constitutive parameters using deformation fields measured across a given volume of interest. The general principle for solving identification problems with the VFM is first to derive parametric stress field, where the stress components at any point depend on the unknown constitutive parameters, across the volume of interest from the measured deformation fields. Applying the principle of virtual work to the parametric stress fields, one can write scalar equations of themore »unknown parameters and solve the obtained system of equations to deduce the values of unknown parameters. However, no rules have been proposed to select the virtual fields in identification problems related to nonlinear elasticity and there are multiple strategies possible that can yield different results. In this work, we propose a systematic, robust and automatic approach to reconstruct the systems of scalar equations with the VFM. This approach is well suited to finite-element implementation and can be applied to any problem provided that full-field deformation data are available across a volume of interest. We also successfully demonstrate the feasibility of the novel approach by multiple numerical examples. Potential applications of the proposed approach are numerous in biomedical engineering where imaging techniques are commonly used to observe soft tissues and where alterations of material properties are markers of diseased states.« less
  2. This work concerns the local convergence theory of Newton and quasi-Newton methods for convex-composite optimization: where one minimizes an objective that can be written as the composition of a convex function with one that is continuiously differentiable. We focus on the case in which the convex function is a potentially infinite-valued piecewise linear-quadratic function. Such problems include nonlinear programming, mini-max optimization, and estimation of nonlinear dynamics with non-Gaussian noise as well as many modern approaches to large-scale data analysis and machine learning. Our approach embeds the optimality conditions for convex-composite optimization problems into a generalized equation. We establish conditions formore »strong metric subregularity and strong metric regularity of the corresponding set-valued mappings. This allows us to extend classical convergence of Newton and quasi-Newton methods to the broader class of nonfinite valued piecewise linear-quadratic convex-composite optimization problems. In particular, we establish local quadratic convergence of the Newton method under conditions that parallel those in nonlinear programming.« less
  3. Electrical Impedance Tomography (EIT) is a well-known imaging technique for detecting the electrical properties of an object in order to detect anomalies, such as conductive or resistive targets. More specifically, EIT has many applications in medical imaging for the detection and location of bodily tumors since it is an affordable and non-invasive method, which aims to recover the internal conductivity of a body using voltage measurements resulting from applying low frequency current at electrodes placed at its surface. Mathematically, the reconstruction of the internal conductivity is a severely ill-posed inverse problem and yields a poor quality image reconstruction. To remedymore »this difficulty, at least in part, we regularize and solve the nonlinear minimization problem by the aid of a Krylov subspace-type method for the linear sub problem during each iteration. In EIT, a tumor or general anomaly can be modeled as a piecewise constant perturbation of a smooth background, hence, we solve the regularized problem on a subspace of relatively small dimension by the Flexible Golub-Kahan process that provides solutions that have sparse representation. For comparison, we use a well-known modified Gauss–Newton algorithm as a benchmark. Using simulations, we demonstrate the effectiveness of the proposed method. The obtained reconstructions indicate that the Krylov subspace method is better adapted to solve the ill-posed EIT problem and results in higher resolution images and faster convergence compared to reconstructions using the modified Gauss–Newton algorithm.« less
  4. Abstract

    This paper considers an inverse problem for a reaction diffusion equation from overposed final time data. Specifically, we assume that the reaction termis known but modified by a space-dependent coefficientto obtain. Thus the strength of the reaction can vary with location. The inverse problem is to recover this coefficient. Our technique is to use iterative Newton-type methods although we also use and analyse higher order schemes of Halley type. We show that such schemes are well defined and prove convergence results. Our assumption about the diffusion process is also more general in thatmore »we will extend the traditional parabolic equation paradigm to include the subdiffusion case based on non-local fractional order operators in time. The final section of the paper shows numerical reconstructions based on the above methods and compares our methodology to previous work based on the linear model withas well as to the nonlinear case. We also show the interdependence between effective reconstruction ofqand the coupling between the value of the final time of measurement and the subdiffusion parameter.

    « less
  5. Beattie, C.A. ; Benner, P. ; Embree, M. ; Gugercin, S. ; Lefteriu, S. (Ed.)
    This paper introduces reduced order model (ROM) based Hessian approximations for use in inexact Newton methods for the solution of optimization problems implicitly constrained by a large-scale system, typically a discretization of a partial differential equation (PDE). The direct application of an inexact Newton method to this problem requires the solution of many PDEs per optimization iteration. To reduce the computational complexity, a ROM Hessian approximation is proposed. Since only the Hessian is approximated, but the original objective function and its gradient is used, the resulting inexact Newton method maintains the first-order global convergence property, under suitable assumptions. Thus evenmore »computationally inexpensive lower fidelity ROMs can be used, which is different from ROM approaches that replace the original optimization problem by a sequence of ROM optimization problem and typically need to accurately approximate function and gradient information of the original problem. In the proposed approach, the quality of the ROM Hessian approximation determines the rate of convergence, but not whether the method converges. The projection based ROM is constructed from state and adjoint snapshots, and is relatively inexpensive to compute. Numerical examples on semilinear parabolic optimal control problems demonstrate that the proposed approach can lead to substantial savings in terms of overall PDE solves required.« less