scispace - formally typeset
Journal ArticleDOI

On computing the best least squares solutions in Hilbers space

S. Zlobec
- 01 Sep 1976 - 
- Vol. 25, Iss: 3, pp 256-270
Reads0
Chats0
TLDR
In this paper, an iterative method for computing the best least squares solution ofAx = b, for a bounded linear operator A with closed range, is formulated and studied in Hilbert space.
Abstract
An iterative method for computing the best least squares solution ofAx=b, for a bounded linear operatorA with closed range, is formulated and studied in Hilbert space. Convergence of the method is characterized in terms ofKU-positive definite operators. A discretization theory for the best least squares problems is presented.

read more

Citations
More filters
Journal ArticleDOI

Calculating the best approximate solution of an operator equation

TL;DR: In this paper, two classes of methods for calculating the best approximate solution of an operator equation in Banach spaces, where the operator is bounded, linear and has closed range, are presented.
References
More filters
Book

Matrix iterative analysis

TL;DR: In this article, the authors propose Matrix Methods for Parabolic Partial Differential Equations (PPDE) and estimate of Acceleration Parameters, and derive the solution of Elliptic Difference Equations.
Book

Introduction to functional analysis

TL;DR: The second edition of the paper this paper incorporates recent developments in functional analysis to make the selection of topics more appropriate for current courses in functional analytically oriented courses in this paper.
Journal ArticleDOI

Numerical methods for solving linear least squares problems

TL;DR: This paper considers stable numerical methods for handling linear least squares problems that frequently involve large quantities of data, and they are ill-conditioned by their very nature.
Related Papers (5)