No label defined (Q3977936)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 13351
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 13351 |
Statements
25 June 1992
0 references
improvements of iteration methods
0 references
linear operator equation
0 references
Hilbert space
0 references
compact linear operator
0 references
Galerkin methods
0 references
least squares methods
0 references
quadratic equation
0 references
bilinear operator
0 references
0.8275793790817261
0 references
0.8237541317939758
0 references
0.8075469136238098
0 references
The problem of improvements of iteration methods for the approximation of a solution \(x^*\) of the linear operator equation \(x=y+L(x)\) on a separable Hilbert space \(H\), where \(y\in H\) is a given element and \(L\) is a compact linear operator on \(H\) is considered. The two methods of iteration are compared. 1. Considering a suitable complete basis \(\{z_ j\}\), \(j=1,2,\dots,n\), of elements in \(H\) and choosing constants \(\{c_{j,k}\}\) such that \(\bar x_ i=\sum^ i_{j=1}c_{i,j}z_ j\) is an approximate solution of the given equation, for the approximation of this solution for example Galerkin methods or least squares methods may be used. 2. Considering iterated approximation of the form \(\bar x_ i=y+\sum^ i_{j=1}d_{i,j}L(z_ j)\). The main result of the paper is the answer ``yes'' for the Galerkin method for the question: Is it true that \(\bar x_ i\) is improved by an iteration if \(i\) is chosen sufficiently large? Some results are also extended to include the approximate solution of the quadratic equation \(w=y+B(w,w)\), where \(B\) is a bilinear operator in \(H\), \(y\in H\) is the fixed and \(w\in H\) is the unknown element.
0 references