scholarly journals Structured condition numbers of structured Tikhonov regularization problem and their estimations

2016 ◽  
Vol 308 ◽  
pp. 276-300 ◽  
Author(s):  
Huai-An Diao ◽  
Yimin Wei ◽  
Sanzheng Qiao
Author(s):  
Patricia K. Lamm

Abstract We consider a local regularization method for the solution of first-kind Volterra integral equations with convolution kernel. The local regularization is based on a splitting of the original Volterra operator into “local” and “global” parts, and a use of Tikhonov regularization to stabilize the inversion of the local operator only. The regularization parameters for the local procedure include the standard Tikhonov parameter, as well as a parameter that represents the length of the local regularization interval. We present a convergence theory for the infinite-dimensional regularization problem and show that the regularized solutions converge to the true solution as the regularization parameters go to zero (in a prescribed way). In addition, we show how numerical implementation of the ideas of local regularization can lead to the notion of “sequential Tikhonov regularization” for Volterra problems; this approach has been shown in (Lamm and Eldén, 1995) to be just as effective as Tikhonov regularization, but to be much more efficient computationally.


2019 ◽  
Vol 2019 ◽  
pp. 1-11
Author(s):  
Guanqun Su ◽  
Xiaolong Zhou ◽  
Lijia Wang ◽  
Xin Wang ◽  
Peiqiang Yang ◽  
...  

Two-dimensional (2D) NMR relaxometry has been widely used as a powerful new tool for identifying and characterizing molecular dynamics. Various inversion algorithms have been introduced to obtain the versatile relaxation information conveyed by spectra. The inversion procedure is especially challenging because the relevant data are huge in 2D cases and the inversion problem is ill-posed. Here, we propose a new method to process the 2D NMR relaxometry data. Our approach varies from Tikhonov regularization, known previously in CONTIN and Maximum Entropy (MaxEnt) methods, which need additional efforts to compute an appropriate regularization factor. This variety improves Butler–Reeds–Dawson algorithm to optimize the Tikhonov regularization problem and the regularization factor is calculated alongside. The calculation is considerably faster than the mentioned algorithms. The proposed method is compared with some widely used methods on simulated datasets, regarding algorithm efficiency and noise vulnerability. Also, the result of the experimental data is presented to test the practical utility of the proposed algorithm. The results suggest that our approach is efficient and robust. It can meet different application requirements.


2015 ◽  
Vol 18 (5) ◽  
pp. 1313-1335 ◽  
Author(s):  
Xiaoqiang Yue ◽  
Shi Shu ◽  
Xiao wen Xu ◽  
Zhiyang Zhou

AbstractThe paper aims to develop an effective preconditioner and conduct the convergence analysis of the corresponding preconditioned GMRES for the solution of discrete problems originating from multi-group radiation diffusion equations. We firstly investigate the performances of the most widely used preconditioners (ILU(k) and AMG) and their combinations (Bco and Bco), and provide drawbacks on their feasibilities. Secondly, we reveal the underlying complementarity of ILU(k) and AMG by analyzing the features suitable for AMG using more detailed measurements on multiscale nature of matrices and the effect of ILU(k) on multiscale nature. Moreover, we present an adaptive combined preconditioner Bcoα involving an improved ILU(0) along with its convergence constraints. Numerical results demonstrate that Bcoα-GMRES holds the best robustness and efficiency. At last, we analyze the convergence of GMRES with combined preconditioning which not only provides a persuasive support for our proposed algorithms, but also updates the existing estimation theory on condition numbers of combined preconditioned systems.


2020 ◽  
Vol 18 (1) ◽  
pp. 1685-1697
Author(s):  
Zhenyu Zhao ◽  
Lei You ◽  
Zehong Meng

Abstract In this paper, a Cauchy problem for the Laplace equation is considered. We develop a modified Tikhonov regularization method based on Hermite expansion to deal with the ill posed-ness of the problem. The regularization parameter is determined by a discrepancy principle. For various smoothness conditions, the solution process of the method is uniform and the convergence rate can be obtained self-adaptively. Numerical tests are also carried out to verify the effectiveness of the method.


Robotica ◽  
2021 ◽  
pp. 1-22
Author(s):  
Zhouxiang Jiang ◽  
Min Huang

SUMMARY In typical calibration methods (kinematic or non-kinematic) for serial industrial robot, though measurement instruments with high resolutions are adopted, measurement configurations are optimized, and redundant parameters are eliminated from identification model, calibration accuracy is still limited under measurement noise. This might be because huge gaps still exist among the singular values of typical identification Jacobians, thereby causing the identification models ill conditioned. This paper addresses such problem by using new identification models established in two steps. First, the typical models are divided into the submodels with truncated singular values. In this way, the unknown parameters corresponding to the abnormal singular values are removed, thereby reducing the condition numbers of the new submodels. However, these models might still be ill conditioned. Therefore, the second step is to further centralize the singular values of each submodel by using a matrix balance method. Afterward, all submodels are well conditioned and obtain much higher observability indices compared with those of typical models. Simulation results indicate that significant improvements in the stability of identification results and the identifiability of unknown parameters are acquired by using the new identification submodels. Experimental results indicate that the proposed calibration method increases the identification accuracy without incurring additional hardware setup costs to the typical calibration method.


Sign in / Sign up

Export Citation Format

Share Document