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
-
Stability of new functional equations and partial multipliers in Banach *-algebras
-
Characterizations of amenable gyrogroups related to Tarski's Theorem
-
Two new extragradient methods for solving pseudomonotone the equilibrium problem in Hilbert spaces
-
On the error estimates for the sequence of successive approximations for cyclic \varphi–contractions in metric spaces
-
Hybrid CG-Like Algorithm for Nonlinear Equations and Image Restoration
-
New class of n-order fractional differential equations and solvability in the double sequence space m^2(\Delta_{v}^{u}, \phi,p)
-
Constructing DNA Codes using Double Cyclic Codes of Odd and Even Lengths over F2 + u F2
-
Consequences of the product rule in Stieltjes differentiability
-
On the existence and uniqueness of fixed points in Banach spaces using the Krasnoselskij iterative method
-
A quaternionic product of simple ratios