In this paper we present a generalization of Strand’s iterative method for numerical approximation of the weighted minimal norm solution of a linear least squares problem. We prove convergence of the extended algorithm, and show that previous iterative algorithms proposed by L. Landweber, J. D. Riley and G. H. Golub are particular cases of it.
On weighted Strand’s iteration
Carp, D., Popa, C., Preclik, T. and Rüde, U.
Abstract
carpathian_2018_34_2_183_190_abstractFull PDF
carpathian_2018_34_2_183_190Additional Information
| Author(s) | Carp, D., Popa, C., Preclik, T., Rüde, U. |
|---|---|
| DOI | https://doi.org/10.37193/CJM.2018.02.06 |
Recently posted
-
Weak and Strong Convergence of Split Douglas-Rachford Algorithms for Monotone Inclusions
-
Fixed point theorems for basic θ-contraction and applications
-
A Fast Forward-Backward Algorithm Using Linesearch and Inertial Techniques for Convex Bi-level Optimization Problems with Applications
-
Convergence of self-adaptive Tseng-type algorithms for split variational inequalities and fixed point problems
-
A fast contraction algorithm using two inertial extrapolations for variational inclusion problem and data classification
-
Periodic cycles for an extension of generalized 3x + 1 functions
-
Some remarks on expansive mappings in metric spaces
-
Asymptotically α hemicontractive mappings in Hilbert spaces and a new algorithm for solving associated split common fixed point problem
-
Extreme solution for fractional differential equation with nonlinear boundary condition
-
Generalized Split Feasibility Problem: Solution by Iteration