Discrete Ill-posed Problems Research Articles

Information Technology of Jamming Cancellation

Introduction. Impact of the jamming leads to the high losses since it decreases effectiveness of radiolocation systems, anti-aircraft missile systems and communication systems. Strategies of forming and setting of the jamming are improving and the power of the jamming increases. In this regard, it is important to improve jamming cancellation systems. The task of the improvement for based on matrix calculations methods of the jamming cancellation is actual considering the breakthrough development of the computational methods which allows realization by digital circuit engineering. These include the most modern machine learning algorithms aimed at solving signal processing tasks. The requirement of the stable operation is important for the jamming cancellation systems under conditions of uncertainty. Other demand is an operation in the real time and a simple hardware implementation. The purpose of the paper is to increase the efficiency of the jamming cancellation in the antenna system (under conditions of uncertainty) based on the new randomized computation methods and their realization by the matrix-processor architecture. Results. The approach based on singular value decomposition and random projection is proposed. It provides effective jamming cancellation in the antenna systems under conditions of uncertainty that is, the sample has small length, there is an own noise of the measuring system, the input-output transformation matrix have undefined numerical rank and there is no prior information about useful signal. Communication. The increase of the efficiency of the jamming cancellation includes the increase of the stability and jamming cancellation coefficient, and the reduction of the computational complexity. The increase of the jamming cancellation coefficient is provided by use of stable discrete ill-posed inverse problems solution methods of the signal recovery based on random projection and singular value decomposition. The decrease of the computational complexity is achieved by the realization of random projection and singular value decomposition as the processor array which makes parallel computations. Keywords: information technology, jamming, machine learning, algorithms, singular value decomposition, random projection, conditions of uncertainty, signal recovery.

Low rank approximation in the computation of first kind integral equations with TauToolbox

Tau Toolbox is a mathematical library for the solution of integro-differential problems, based on the spectral Lanczos' Tau method. Over the past few years, a class within the library, called polynomial, has been developed for approximating functions by classical orthogonal polynomials and it is intended to be an easy-to-use yet efficient object-oriented framework.In this work we discuss how this class has been designed to solve linear ill-posed problems and we provide a description of the available methods, Tikhonov regularization and truncated singular value expansion. For the solution of the Fredholm integral equation of the first kind, which is built from a low-rank approximation of the kernel followed by a numerical truncated singular value expansion, an error estimate is given.Numerical experiments illustrate that this approach is capable of efficiently compute good approximations of linear discrete ill-posed problems, even facing perturbed available data function, with no programming effort. Several test problems are used to evaluate the performance and reliability of the solvers.The final product of this paper is the numerical solution of a first-kind integral equation, which is constructed using only two inputs from the user: the kernel and the right-hand side.

Tikhonov regularization with conjugate gradient least squares method for large-scale discrete ill-posed problem in image restoration

Image restoration is a large-scale discrete ill-posed problem, which can be transformed into a Tikhonov regularization problem that can approximate the original image. Kronecker product approximation is introduced into the Tikhonov regularization problem to produce an alternative problem of solving the generalized Sylvester matrix equation, reducing the scale of the image restoration problem. This paper considers solving this alternative problem by applying the conjugate gradient least squares (CGLS) method which has been demonstrated to be efficient and concise. The convergence of the CGLS method is analyzed, and it is demonstrated that the CGLS method converges to the least squares solution within the finite number of iteration steps. The effectiveness and superiority of the CGLS method are verified by numerical tests.

The Regularized Block GMERR Method and Its Simpler Version for Solving Large-Scale Linear Discrete Ill-Posed Problems

The Regularized Block GMERR Method and Its Simpler Version for Solving Large-Scale Linear Discrete Ill-Posed Problems

The Regularized Global GMERR Method for Solving Large-Scale Linear Discrete Ill-Posed Problems

The Regularized Global GMERR Method for Solving Large-Scale Linear Discrete Ill-Posed Problems

Augmented flexible Krylov subspace methods with applications to Bayesian inverse problems

This paper presents two new augmented flexible (AF)-Krylov subspace methods, AF-GMRES and AF-LSQR, to compute solutions of large-scale linear discrete ill-posed problems that can be modeled as the sum of two independent random variables, exhibiting smooth and sparse stochastic characteristics respectively. Following a Bayesian modeling approach, this corresponds to adding a covariance-weighted quadratic term and a sparsity enforcing ℓ1 term in the original least-squares minimization scheme. To handle the ℓ1 regularization term, the proposed approach constructs a sequence approximating quadratic problems that are partially solved using augmented flexible Krylov–Tikhonov methods.Compared to other traditional methods used to solve this minimization problem, such as those based on iteratively reweighted norm schemes, the new algorithms build a single (augmented, flexible) approximation (Krylov) subspace that encodes information about the different regularization terms through adaptable “preconditioning”. The solution space is then expanded as soon as a new problem within the sequence is defined. This also allows for the regularization parameters to be chosen on-the-fly at each iteration. Compared to most recent work on generalized flexible Krylov methods [6], our methods offer theoretical assurance of convergence and a more stable numerical performance. The efficiency of the new methods is shown through a variety of experiments, including a synthetic image deblurring problem, a synthetic atmospheric transport problem, and fluorescence molecular tomography reconstructions using both synthetic and real-world experimental data.

Double Precision is not Necessary for LSQR for Solving Discrete Linear Ill-Posed Problems

Double Precision is not Necessary for LSQR for Solving Discrete Linear Ill-Posed Problems

An inversion for asymmetric hydraulic fracture growth and fracture opening distribution from tilt measurements

The eigenstrain tensor is defined in terms of the unit vector normal to the fracture plane and the dislocation vector to characterize the fracture geometry and to determine the fracture induced deformation field. Compared to the conventional nonlinear fracture model, the forward fracture model provides a linear relationship between fracture geometry parameters (eigenstrain) and the induced deformation. Therefore, a linear inverse problem needs to be tackled in mapping the fracture geometry by inversion of tilt observations. The fracture orientation and opening distribution of a tensile-dominated hydraulic fracture can be mapped iteratively in a coupled way by using the forward model defined in terms of the dislocation vector. The proposed analysis method is applied to field tilt data collected for monitoring the growth of a hydraulic fracture placed in the preconditioning of a roof rock over a coal longwall panel at a test site. Inversion of the tilt data produces a low fracture dip angle of 6.8°, which agrees with a nearly horizontal fracture orientation confirmed by intersection data collected in offset monitoring boreholes. Tikhonov regularization technique is applied to stabilize the discrete ill-posed inverse problem. The regularized solution provides information on the fracture opening distribution and asymmetric fracture growth. The inversion shows that the fracture grows uniformly and roughly in a radial pattern at early injection times, but grows asymmetrically, preferentially, and consistently to the northwest during later times. The predicted fracture growth agrees with the temperature logging to measure fracture intersections with the offset monitoring boreholes.

Approximation of the Tikhonov regularization parameter through Aitken's extrapolation

In the present work, we study the determination of the regularization parameter and the computation of the regularized solution in Tikhonov regularization, by the Aitken's extrapolation method. In particular, this convergence acceleration method is adjusted for the approximation of quadratic forms that appear in regularization methods, such as the generalized cross-validation method, the quasi-optimality criterion, the Gfrerer/Raus method and the Morozov's discrepancy principle. We present several numerical examples to illustrate the effectiveness of the derived estimates for approximating the regularization parameter for several linear discrete ill-posed problems and we compare the described method with further existing methods, for the determination of the regularized solution.

Numerical considerations of block GMRES methods when applied to linear discrete ill-posed problems

Linear systems of equations with a matrix whose singular values decay to zero with increasing index number without a significant gap are commonly referred to as linear discrete ill-posed problems. We are interested in solving large systems of this kind when the right-hand side has k>1 column vectors. The systems may be regarded as one system of equations with a block vector (with k columns) as the right-hand side and then solved by a block iterative method, or as k linear systems of equations (one for each right-hand side vector) that can be solved independently. Thus, the solution is a block vector with k columns. In many applications, including the restoration of color images, the right-hand side represents measurements that are contaminated by errors. Block iterative methods compute all columns of the solution block vector simultaneously. We will illustrate the performance of standard block GMRES methods and global GMRES methods, which also are block methods, and show that they may determine computed solutions of lower quality than when each column of the solution block vector is computed independently by a “standard” iterative method. We introduce a new local block GMRES method that can overcome the problems associated with block GMRES methods applied to linear discrete ill-posed problems.

Limited memory restarted ℓp-ℓq minimization methods using generalized Krylov subspaces

Regularization of certain linear discrete ill-posed problems, as well as of certain regression problems, can be formulated as large-scale, possibly nonconvex, minimization problems, whose objective function is the sum of the p th power of the ℓp-norm of a fidelity term and the q th power of the ℓq-norm of a regularization term, with 0 < p,q ≤ 2. We describe new restarted iterative solution methods that require less computer storage and execution time than the methods described by Huang et al. (BIT Numer. Math. 57,351–378, 14). The reduction in computer storage and execution time is achieved by periodic restarts of the method. Computed examples illustrate that restarting does not reduce the quality of the computed solutions.

A Majorization-Minimization Golub-Kahan bidiagonalization method for &lt;inline-formula&gt;&lt;tex-math id="M1"&gt;$ \ell_{2}-\ell_{q} $&lt;/tex-math&gt;&lt;/inline-formula&gt; mimimization with applications in image restorization

An image restorization problem is often modelled as a discrete ill-posed problem. In general, its solution, even if it exists, is very sensitive to the perturbation in the data. Regularization methods reduces the sensitivity by replacing this problem with a minimization problem with a fidelity term and $ \ell_{q} $ regularization term. In order to improve the sparsity of the solution, we only consider the case of $ 0&lt;q\leq1 $ in this paper. This paper presents a majorization-minimization Golub-Kahan bidiagonalization algorithm to solve this kind of minimization problems. The solution subspace is extended by the Golub-Kahan bidiagonalization process. The restarted case is also considered. The regularization parameter is determined by using the discrepancy principle. Several examples in image restorization are shown for the proposed methods.

Range restricted iterative methods for linear discrete ill-posed problems

Range restricted iterative methods for linear discrete ill-posed problems

Tensor Conjugate-Gradient methods for tensor linear discrete ill-posed problems

&lt;abstract&gt;&lt;p&gt;This paper presents three types of tensor Conjugate-Gradient (tCG) methods for solving large-scale linear discrete ill-posed problems based on the t-product between third-order tensors. An automatic determination strategy of a suitable regularization parameter is proposed for the tCG method in the Fourier domain (A-tCG-FFT). An improved version and a preconditioned version of the tCG method are also presented. The discrepancy principle is employed to determine a suitable regularization parameter. Several numerical examples in image and video restoration are given to show the effectiveness of the proposed tCG methods.&lt;/p&gt;&lt;/abstract&gt;

Some numerical aspects of Arnoldi-Tikhonov regularization

Large linear discrete ill-posed problems are commonly solved by first reducing them to small size by application of a few steps of a Krylov subspace method, and then applying Tikhonov regularization to the reduced problem. A regularization parameter determines how much the given problem is regularized before solution. If the matrix of the linear discrete ill-posed problem is nonsymmetric, then the reduction often is carried out with the aid of the Arnoldi process, while when the matrix is symmetric, the Lanczos process is used. This paper discusses several numerical aspects of these solution methods. We illustrate that it may be beneficial to apply the Arnoldi process also when the matrix is symmetric and discuss how certain user-chosen basis vectors can be added to the solution subspace. Finally, we compare the application of the discrepancy principle for the determination of the regularization parameter to another approach that is based on the solution of a cubic equation and has been proposed in the literature.

The Technology of the Stable Solution for Discrete Ill-posed Problems by Modified Random Projection Method

The Technology of the Stable Solution for Discrete Ill-posed Problems by Modified Random Projection Method

Theoretical and numerical aspects of a non-stationary preconditioned iterative method for linear discrete ill-posed problems

This work considers some theoretical and computational aspects of the recent paper (Buccini et al., 2021), whose aim was to relax the convergence conditions in a previous work by Donatelli and Hanke, and thereby make the iterative method discussed in the latter work applicable to a larger class of problems. This aim was achieved in the sense that the iterative method presented convergences for a larger class of problems. However, while the analysis presented is correct, it does not establish the superior behavior of the iterative method described. The present note describes a slight modification of the analysis that establishes the superiority of the iterative method. The new analysis allows to discuss the behavior of the algorithm when varying the involved parameters, which is also useful for their empirical estimation.

An Arnoldi-based preconditioner for iterated Tikhonov regularization

Many problems in science and engineering give rise to linear systems of equations that are commonly referred to as large-scale linear discrete ill-posed problems. These problems arise, for instance, from the discretization of Fredholm integral equations of the first kind. The matrices that define these problems are typically severely ill-conditioned and may be rank-deficient. Because of this, the solution of linear discrete ill-posed problems may not exist or be very sensitive to perturbations caused by errors in the available data. These difficulties can be reduced by applying Tikhonov regularization. We describe a novel “approximate Tikhonov regularization method” based on constructing a low-rank approximation of the matrix in the linear discrete ill-posed problem by carrying out a few steps of the Arnoldi process. The iterative method so defined is transpose-free. Our work is inspired by a scheme by Donatelli and Hanke, whose approximate Tikhonov regularization method seeks to approximate a severely ill-conditioned block-Toeplitz matrix with Toeplitz-blocks by a block-circulant matrix with circulant-blocks. Computed examples illustrate the performance of our proposed iterative regularization method.

Updating the Landweber Iteration Method for Solving Inverse Problems

The Landweber iteration method is one of the most popular methods for the solution of linear discrete ill-posed problems. The diversity of physical problems and the diversity of operators that result from them leads us to think about updating the main methods and algorithms to achieve the best results. We considered in this work the linear operator equation and the use of a new version of the Landweber iterative method as an iterative solver. The main goal of updating the Landweber iteration method is to make the iteration process fast and more accurate. We used a polar decomposition to achieve a symmetric positive definite operator instead of an identity operator in the classical Landweber method. We carried out the convergence and other necessary analyses to prove the usability of the new iteration method. The residual method was used as an analysis method to rate the convergence of the iteration. The modified iterative method was compared to the classical Landweber method. A numerical experiment illustrates the effectiveness of this method by applying it to solve the inverse boundary value problem of the heat equation (IBVP).

Industry-oriented method for dynamic force identification in peripheral milling based on FSC-LSQR using acceleration signals

Online measurement of milling force is very important for machining process monitoring and control. In practice, it is difficult to measure the milling force directly during the milling process. This paper develops a method for milling force identification called least square QR-factorization with the fast stopping criterion (FSC-LSQR) method, and the queue buffer structure (QBS) is employed for the online identification of milling force using acceleration signals. The convolution integral of milling force and acceleration signals is discretized, which turns the problem of milling force identification into a linear discrete ill-posed problem. The FSC-LSQR algorithm is adopted for milling force identification because of its high efficiency and accuracy, which can effectively handle the linear discrete ill-posed problem. The online identification of milling force can be realized using the acceleration signal enqueue and the milling force dequeue operations of the QBS. Finally, the effectiveness of the method is verified by milling tests under different milling parameters.