Approximating matrix functions by block Krylov methods with randomized vectors (Q7284889)
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:
No description defined
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating matrix functions by block Krylov methods with randomized vectors |
No description defined |
Statements
Approximating matrix functions by block Krylov methods with randomized vectors (English)
0 references
13 August 2026
0 references
math.NA
0 references
Josh Kane
0 references
Lucas Onisk
0 references
Lothar Reichel
0 references
Giuseppe Rodriguez
0 references
This paper explores randomized block Krylov methods to approximate $f(A)\mathbf{b}$ where $A$ is large, by evaluating $f$ at a small matrix. Computed examples suggest that adding $\mathbf{b}$ and random vectors to the initial block vector can reduce computing time and number of steps compared with standard Krylov methods.
0 references
Matrix Functions
0 references
Krylov Methods
0 references
Randomized Approximations
0 references
Linear Algebra
0 references
1 reference
1 reference
1 reference
1 reference
1 reference
1 reference
1 reference
1 reference
1 reference
1 reference
1 reference
1 reference
1 reference
1 reference
1 reference
1 reference
1 reference
1 reference
1 reference
1 reference
1 reference
1 reference
1 reference
1 reference
1 reference
1 reference
1 reference
1 reference