Analysis of some Krylov subspace methods for normal matrices via approximation theory and convex optimization (Q836832)
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: Analysis of some Krylov subspace methods for normal matrices via approximation theory and convex optimization |
scientific article; zbMATH DE number 5602133
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Analysis of some Krylov subspace methods for normal matrices via approximation theory and convex optimization |
scientific article; zbMATH DE number 5602133 |
Statements
Analysis of some Krylov subspace methods for normal matrices via approximation theory and convex optimization (English)
0 references
8 September 2009
0 references
polynomials of best approximation
0 references
min-Max problem
0 references
interpolation
0 references
convex optimization
0 references
KKT optimality conditions
0 references
Krylov subspace methods
0 references
convergence
0 references
GMRES method
0 references
Arnoldi iteration
0 references
normal matrices
0 references
Karush-Kuhn-Tucker (KKT) optimality
0 references
0.7841858863830566
0 references
0.7723802328109741
0 references
0.7593379616737366
0 references
0.7510576248168945
0 references
0.743244469165802
0 references
