A generalization of the steepest descent method for matrix functions (Q836727): Difference between revisions
From MaRDI portal
Changed an Item |
Import IPFS CIDs |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
| Property / IPFS content identifier | |||
| Property / IPFS content identifier: bafkreiblnwu5udxsg2s5vvq44o4jzcoll4bwocn454e65p2sn6jsuavt44 / rank | |||
Normal rank | |||
Latest revision as of 10:30, 22 February 2025
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A generalization of the steepest descent method for matrix functions |
scientific article |
Statements
A generalization of the steepest descent method for matrix functions (English)
0 references
8 September 2009
0 references
matrix function
0 references
Krylov subspace approximation
0 references
restarted Krylov subspace method
0 references
restarted Arnoldi/Lanczos method
0 references
linear system of equations
0 references
steepest descent
0 references
polynomial interpolation
0 references
asymptotic convergence rate
0 references
