In this paper, we study strong convergence of the algorithm for solving classical variational inequalities problem with Lipschitz-continuous and monotone mapping in real Hilbert space. The algorithm ...is inspired by Tseng’s extragradient method and the viscosity method with a simple step size. A strong convergence theorem for our algorithm is proved without any requirement of additional projections and the knowledge of the Lipschitz constant of the mapping. Finally, we provide some numerical experiments to show the efficiency and advantage of the proposed algorithm.
This paper describes a new MATLAB software package of iterative regularization methods and test problems for large-scale linear inverse problems. The software package, called IR TOOLS, serves two ...related purposes: we provide implementations of a range of iterative solvers, including several recently proposed methods that are not available elsewhere, and we provide a set of large-scale test problems in the form of discretizations of 2D linear inverse problems. The solvers include iterative regularization methods where the regularization is due to the semi-convergence of the iterations, Tikhonov-type formulations where the regularization is explicitly formulated in the form of a regularization term, and methods that can impose bound constraints on the computed solutions. All the iterative methods are implemented in a very flexible fashion that allows the problem’s coefficient matrix to be available as a (sparse) matrix, a function handle, or an object. The most basic call to all of the various iterative methods requires only this matrix and the right hand side vector; if the method uses any special stopping criteria, regularization parameters, etc., then default values are set automatically by the code. Moreover, through the use of an optional input structure, the user can also have full control of any of the algorithm parameters. The test problems represent realistic large-scale problems found in image reconstruction and several other applications. Numerical examples illustrate the various algorithms and test problems available in this package.
In this article, some second-order time discrete schemes covering parameter
𝜃
combined with Galerkin finite element (FE) method are proposed and analyzed for looking for the numerical solution of ...nonlinear cable equation with time fractional derivative. At time
t
k
−
𝜃
, some second-order
𝜃
schemes combined with weighted and shifted Grünwald difference (WSGD) approximation of fractional derivative are considered to approximate the time direction, and the Galerkin FE method is used to discretize the space direction. The stability of second-order
𝜃
schemes is derived and the second-order time convergence rate in
L
2
-norm is proved. Finally, some numerical calculations are implemented to indicate the feasibility and effectiveness for our schemes.
In this paper, we introduce an algorithm as combination between the subgradient extragradient method and inertial method for solving variational inequality problems in Hilbert spaces. The weak ...convergence of the algorithm is established under standard assumptions imposed on cost operators. The proposed algorithm can be considered as an improvement of the previously known inertial extragradient method over each computational step. The performance of the proposed algorithm is also illustrated by several preliminary numerical experiments.
We present a MATLAB software package with efficient, robust, and flexible implementations of algebraic iterative reconstruction (AIR) methods for computing regularized solutions to discretizations of ...inverse problems. These methods are of particular interest in computed tomography and similar problems where they easily adapt to the particular geometry of the problem. All our methods are equipped with stopping rules as well as heuristics for computing a good relaxation parameter, and we also provide several test problems from tomography. The package is intended for users who want to experiment with algebraic iterative methods and their convergence properties. The present software is a much expanded and improved version of the package
AIR Tools
from 2012, based on a new modular design. In addition to improved performance and memory use, we provide more flexible iterative methods, a column-action method, new test problems, new demo functions, and—perhaps most important—the ability to use function handles instead of (sparse) matrices, allowing larger problems to be handled.
In this paper, we study the split common fixed point and monotone variational inclusion problem in uniformly convex and 2-uniformly smooth Banach spaces. We propose a Halpern-type algorithm with two ...self-adaptive stepsizes for obtaining solution of the problem and prove strong convergence theorem for the algorithm. Many existing results in literature are derived as corollary to our main result. In addition, we apply our main result to split common minimization problem and fixed point problem and illustrate the efficiency and performance of our algorithm with a numerical example. The main result in this paper extends and generalizes many recent related results in the literature in this direction.
The objective of this work is to develop a conforming virtual element method for viscoelastic wave equations with variable coefficients on polygonal meshes. For problems where the coefficients are ...variable, the standard virtual element discrete forms do not work efficiently and require modification. For the optimal convergence estimate of the semi-discrete approximation in the
L
2
norm, a special projection operator is used. In the fully discrete scheme, the implicit second-order Newmark method is employed to approximate the temporal derivatives. Numerical experiments are presented to support the theoretical results. The proposed numerical algorithm can be applied to various problems arising in the engineering and medical fields.
In this research, a Bernoulli wavelet operational matrix of fractional integration is presented. Bernoulli wavelets and their properties are employed for deriving a general procedure for forming this ...matrix. The application of the proposed operational matrix for solving the fractional delay differential equations is explained. Also, upper bound for the error of operational matrix of the fractional integration is given. This operational matrix is utilized to transform the problem to a set of algebraic equations with unknown Bernoulli wavelet coefficients. Several numerical examples are solved to demonstrate the validity and applicability of the presented technique.