A fast Kaczmarz-Kovarik algorithm for consistent least-squares problems (Q2704388)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A fast Kaczmarz-Kovarik algorithm for consistent least-squares problems |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fast Kaczmarz-Kovarik algorithm for consistent least-squares problems |
scientific article |
Statements
21 October 2001
0 references
least-squares problems
0 references
convergence
0 references
Kovarik algorithms
0 references
orthogonalization
0 references
Hilbert spaces
0 references
Kaczmarz iteration
0 references
numerical examples
0 references
0.90374625
0 references
0.9006201
0 references
0.8993535
0 references
0.89902645
0 references
0.89170283
0 references
0.89072824
0 references
0.88896406
0 references
A fast Kaczmarz-Kovarik algorithm for consistent least-squares problems (English)
0 references
Generalizations of the Kovarik algorithms for approximate orthogonalization in Hilbert spaces are examined and their combination with the Kaczmarz iteration is considered. Convergence results are proved and numerical examples are presented to show the effectiveness of the algorithm.
0 references
