Inheritance of the discrete Picard condition in Krylov subspace methods (Q329014)
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: Inheritance of the discrete Picard condition in Krylov subspace methods |
scientific article; zbMATH DE number 6641934
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Inheritance of the discrete Picard condition in Krylov subspace methods |
scientific article; zbMATH DE number 6641934 |
Statements
Inheritance of the discrete Picard condition in Krylov subspace methods (English)
0 references
21 October 2016
0 references
The authors study the inheritance of the discrete Picard condition when employing Arnoldi based methods and Lanczos bidiagonalization based methods. They also analyze the behavior of the residuals for both the uncorrupted and the corrupted projected problems.
0 references
discrete Picard condition
0 references
iterative regularization
0 references
Arnoldi algorithm
0 references
GMRES residual
0 references
Lanczos bidiagonalization algorithm
0 references
0 references
0 references
0.747631311416626
0 references
0.7437067627906799
0 references
0.7428889274597168
0 references
0.7421919107437134
0 references
0.7307745814323425
0 references
