Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2203.15857

Acquiring elastic properties of thin composite structure from vibrational testing data

Vitalii Aksenov·Aleksey Vasyukov·Katerina Beklemysheva
View original source ↗Read source document ↗Export metadata ↓

Abstract

The problem of acquiring elastic properties of a composite material from the data of the vibrational testing is considered. The specimen is considered to abide by the linear elasticity laws and subject to viscoelastic damping. The BVP for transverse movement of such a specimen under harmonic load is formulated and solved with finite-element method. The problem of acquiring the elastic parameters is then formulated as a nonlinear least square optimization problem. The usage of the automatic differentiation technique for stable and efficient computation of the gradient and hessian allows to use well-studied first and second order optimization methods, namely Newton and BFGS. The results of the numerical experiments on simulated data are analyzed in order to provide insights for the experiment planning.

Explore related subjects

math.NAcs.NA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Vitalii Aksenov, Aleksey Vasyukov, Katerina Beklemysheva. 2022-03-29. Acquiring elastic properties of thin composite structure from vibrational testing data. https://doi.org/10.1515/jiip-2022-0081

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Optimization of gridding algorithms for FFT by vector optimization

The Fast Fourier Transform (FFT) is widely used in applications such as MRI, CT, and interferometry; however, because of its dependence on uniformly sampled data, it requires the use of gridding techniques for practical implementation. The performance of these algorithms strongly depends on the choice of the gridding kernel, with the first prolate spheroidal wave function (PSWF) regarded as optimal. This work redefines kernel optimality through the lens of vector optimization (VO), introducing a rigorous framework that characterizes optimal kernels as Pareto-efficient solutions of an error shape operator. We establish the continuity of such operator, study the existence of solutions, and propose a novel methodology to construct kernels tailored to a desired target error function. The approach is implemented numerically via interior-point optimization. Comparative experiments demonstrate that the proposed kernels outperform both the PSWF and the state-of-the-art methods (MIRT-NUFFT) in specific regions of interest, achieving orders-of-magnitude improvements in mean absolute errors. These results confirm the potential of VO-based kernel design to provide customized accuracy profiles aligned with application-specific requirements. Future research will extend this framework to multidimensional cases and relative error minimization, with potential integration of machine learning for adaptive target error selection.

math.NA↗
arXiv2026

On the convergence rates of generalized conditional gradient method for fully discretized Mean Field Games

We study convergence rates of the generalized conditional gradient (GCG) method applied to fully discretized Mean Field Games (MFG) systems. While explicit convergence rates of the GCG method have been established at the continuous PDE level, a rigorous analysis that simultaneously accounts for time-space discretization and iteration errors has been missing. In this work, we consider an MFG system with a quadratic Hamiltonian including an advection term. We employ the GCG method to construct an iterative algorithm in which the HJB and FP equations are solved separately. At each iteration, we apply the Cole--Hopf transformation to linearize these equations and discretize the resulting linear PDEs using a finite difference method. We then analyze the resulting fully discrete GCG scheme. Under suitable structural assumptions on coupling terms, we establish discrete maximum principles and derive explicit error estimates that quantify both discretization errors and iteration errors within a unified framework. Our estimates show how the convergence rates depend on the mesh sizes and the iteration number, and they reveal a non-uniform behavior with respect to the iteration. Moreover, we prove that higher convergence rates can be achieved under additional regularity assumptions on the solution. Numerical experiments are presented to illustrate the theoretical results and to confirm the predicted convergence behavior.

math.NA↗
arXiv2026

Dynamic inverse problems: Online regularisation theory

We develop regularisation theory for dynamic inverse problems, solved using online methods with an infinite time horizon. Using concepts of subregularity to treat nonsmooth regularisers, we prove that time-averaged reconstruction errors converge to zero as noise, algorithmic errors, and regularisation vanish as the horizon grows. We illustrate the theory numerically with a dynamic electrical impedance tomography example.

math.NA↗