scholarly journals Variational approach for recovering viscoelasticity from MRE data

2021 ◽  
Vol 2092 (1) ◽  
pp. 012001
Author(s):  
Yu Jiang ◽  
Gen Nakamura ◽  
Kenji Shirota

Abstract This paper deals with an inverse problem for recovering the viscoelasticity of a living body from MRE (Magnetic Resonance Elastography) data. Based on a viscoelastic partial differential equation whose solution can approximately simulate MRE data, the inverse problem is transformed to a least square variational problem. This is to search for viscoelastic coefficients of this equation such that the solution to a boundary value problem of this equation fits approximately to MRE data with respect to the least square cost function. By computing the Gateaux derivatives of the cost function, we minimize the cost function by the projected gradient method is proposed for recovering the unknown coefficients. The reconstruction results based on simulated data and real experimental data are presented and discussed.

2019 ◽  
Vol 28 (01) ◽  
pp. 1950010
Author(s):  
John S. Papadakis ◽  
Eftychia Karasmani

The acoustic propagation problem in the ocean is modeled via the wide angle parabolic equation with a Neumann to Dirichlet map bottom boundary condition. An environment consisting of the water column, a sediment layer and the semi-infinite sub-bottom region is considered. The derivatives of a new cost function with respect to the unknown environmental parameters are calculated analytically via the adjoint operator and incorporated numerically in an inversion scheme. Full geoacoustic inversion for eight bottom parameters is performed successfully, using experimental field data from the Yellow Shark experiment, for the first time according to the authors’ knowledge. Adjoint inversion for the water SSP, using the EOFs, is also presented and validated with simulated data.


2007 ◽  
Vol 18 (1) ◽  
pp. 21-55 ◽  
Author(s):  
ANTONIO MORASSI ◽  
GEN NAKAMURA ◽  
KENJI SHIROTA ◽  
MOURAD SINI

This paper deals with a problem of nondestructive testing for a composite system formed by the connection of a steel beam and a reinforced concrete beam. The small vibrations of the composite beam are described by a differential system where a coupling takes place between longitudinal and bending motions. The motion is governed in space by two second order and two fourth order differential operators, which are coupled in the lower order terms by the shearing,k, and axial, μ, stiffness coefficients of the connection. The coefficientskand μ define the mechanical model of the connection between the steel beam and the concrete beam and contain direct information on the integrity of the system. In this paper we study the inverse problem of determiningkand μ by mixed data. The inverse problem is transformed to a variational problem for a cost function which includes boundary measurements of Neumann data and also some interior measurements. By computing the Gateaux derivatives of the functional, an algorithm based on the projected gradient method is proposed for identifying the unknown coefficients. The results of some numerical simulations on real steel-concrete beams are presented and discussed.


2013 ◽  
Vol 2013 ◽  
pp. 1-7 ◽  
Author(s):  
Zhimin Chen ◽  
Lenan Wu

A rather intuitive technique known as pole-zero placement is introduced to illustrate the frequency response of the special impacting filters (SIFs) with a pair of conjugate zero-poles and deduce the equation of the pole radii. Based on that, the paper proposes an iterative scheme to derive the parameters of the cascade notch filter. The cost function is determined by the cascading notch filter’s influence on impacting filters, converting the cost function’s least square problem to a filter parameters’ standard quadratic programming problem. Finally, a cascading notch SIF (CNSIF) designed to demodulate the ABPSK signals is realized.


2014 ◽  
Vol 687-691 ◽  
pp. 5004-5007
Author(s):  
Wen Xi Duan ◽  
Mei Ling Liu

The price of the livestock meat is the function of its demand quantity and its supply quantity.The cost function can be obtained by using the least square method or the data analysis of Microsoft Office EXCE. By the function, we can forecast the meat prices in the future. The raising quantity can appropriately be controlled using the cost function.


Axioms ◽  
2021 ◽  
Vol 10 (2) ◽  
pp. 66
Author(s):  
Aviv Gibali ◽  
Oleg Kelis

In this paper we present an appropriate singular, zero-sum, linear-quadratic differential game. One of the main features of this game is that the weight matrix of the minimizer’s control cost in the cost functional is singular. Due to this singularity, the game cannot be solved either by applying the Isaacs MinMax principle, or the Bellman–Isaacs equation approach. As an application, we introduced an interception differential game with an appropriate regularized cost functional and developed an appropriate dual representation. By developing the variational derivatives of this regularized cost functional, we apply Popov’s approximation method and show how the numerical results coincide with the dual representation.


2021 ◽  
Vol 11 (2) ◽  
pp. 850
Author(s):  
Dokkyun Yi ◽  
Sangmin Ji ◽  
Jieun Park

Artificial intelligence (AI) is achieved by optimizing the cost function constructed from learning data. Changing the parameters in the cost function is an AI learning process (or AI learning for convenience). If AI learning is well performed, then the value of the cost function is the global minimum. In order to obtain the well-learned AI learning, the parameter should be no change in the value of the cost function at the global minimum. One useful optimization method is the momentum method; however, the momentum method has difficulty stopping the parameter when the value of the cost function satisfies the global minimum (non-stop problem). The proposed method is based on the momentum method. In order to solve the non-stop problem of the momentum method, we use the value of the cost function to our method. Therefore, as the learning method processes, the mechanism in our method reduces the amount of change in the parameter by the effect of the value of the cost function. We verified the method through proof of convergence and numerical experiments with existing methods to ensure that the learning works well.


2020 ◽  
Vol 18 (02) ◽  
pp. 2050006 ◽  
Author(s):  
Alexsandro Oliveira Alexandrino ◽  
Carla Negri Lintzmayer ◽  
Zanoni Dias

One of the main problems in Computational Biology is to find the evolutionary distance among species. In most approaches, such distance only involves rearrangements, which are mutations that alter large pieces of the species’ genome. When we represent genomes as permutations, the problem of transforming one genome into another is equivalent to the problem of Sorting Permutations by Rearrangement Operations. The traditional approach is to consider that any rearrangement has the same probability to happen, and so, the goal is to find a minimum sequence of operations which sorts the permutation. However, studies have shown that some rearrangements are more likely to happen than others, and so a weighted approach is more realistic. In a weighted approach, the goal is to find a sequence which sorts the permutations, such that the cost of that sequence is minimum. This work introduces a new type of cost function, which is related to the amount of fragmentation caused by a rearrangement. We present some results about the lower and upper bounds for the fragmentation-weighted problems and the relation between the unweighted and the fragmentation-weighted approach. Our main results are 2-approximation algorithms for five versions of this problem involving reversals and transpositions. We also give bounds for the diameters concerning these problems and provide an improved approximation factor for simple permutations considering transpositions.


2005 ◽  
Vol 133 (6) ◽  
pp. 1710-1726 ◽  
Author(s):  
Milija Zupanski

Abstract A new ensemble-based data assimilation method, named the maximum likelihood ensemble filter (MLEF), is presented. The analysis solution maximizes the likelihood of the posterior probability distribution, obtained by minimization of a cost function that depends on a general nonlinear observation operator. The MLEF belongs to the class of deterministic ensemble filters, since no perturbed observations are employed. As in variational and ensemble data assimilation methods, the cost function is derived using a Gaussian probability density function framework. Like other ensemble data assimilation algorithms, the MLEF produces an estimate of the analysis uncertainty (e.g., analysis error covariance). In addition to the common use of ensembles in calculation of the forecast error covariance, the ensembles in MLEF are exploited to efficiently calculate the Hessian preconditioning and the gradient of the cost function. A sufficient number of iterative minimization steps is 2–3, because of superior Hessian preconditioning. The MLEF method is well suited for use with highly nonlinear observation operators, for a small additional computational cost of minimization. The consistent treatment of nonlinear observation operators through optimization is an advantage of the MLEF over other ensemble data assimilation algorithms. The cost of MLEF is comparable to the cost of existing ensemble Kalman filter algorithms. The method is directly applicable to most complex forecast models and observation operators. In this paper, the MLEF method is applied to data assimilation with the one-dimensional Korteweg–de Vries–Burgers equation. The tested observation operator is quadratic, in order to make the assimilation problem more challenging. The results illustrate the stability of the MLEF performance, as well as the benefit of the cost function minimization. The improvement is noted in terms of the rms error, as well as the analysis error covariance. The statistics of innovation vectors (observation minus forecast) also indicate a stable performance of the MLEF algorithm. Additional experiments suggest the amplified benefit of targeted observations in ensemble data assimilation.


2000 ◽  
Vol 25 (2) ◽  
pp. 209-227 ◽  
Author(s):  
Keith R. McLaren ◽  
Peter D. Rossitter ◽  
Alan A. Powell

2021 ◽  
pp. 107754632110324
Author(s):  
Berk Altıner ◽  
Bilal Erol ◽  
Akın Delibaşı

Adaptive optics systems are powerful tools that are implemented to degrade the effects of wavefront aberrations. In this article, the optimal actuator placement problem is addressed for the improvement of disturbance attenuation capability of adaptive optics systems due to the fact that actuator placement is directly related to the enhancement of system performance. For this purpose, the linear-quadratic cost function is chosen, so that optimized actuator layouts can be specialized according to the type of wavefront aberrations. It is then considered as a convex optimization problem, and the cost function is formulated for the disturbance attenuation case. The success of the presented method is demonstrated by simulation results.


Sign in / Sign up

Export Citation Format

Share Document