Pages that link to "Item:Q4292692"
From MaRDI portal
The following pages link to Probabilistic Bounds on the Extremal Eigenvalues and Condition Number by the Lanczos Algorithm (Q4292692):
Displaying 11 items.
- On the randomized error of polynomial methods for eigenvector and eigenvalue estimates (Q1383440) (← links)
- Symbolic and numeric methods for exploiting structure in constructing resultant matrices (Q1600039) (← links)
- Randomization and the parallel solution of linear algebra problems (Q1905899) (← links)
- Randomized block Krylov methods for approximating extreme eigenvalues (Q2068363) (← links)
- Numerical accuracy of a certain class of iterative methods for solving linear system (Q2496008) (← links)
- The Lanczos Algorithm Under Few Iterations: Concentration and Location of the Output (Q5146700) (← links)
- Uniform Error Estimates for the Lanczos Method (Q5158757) (← links)
- Subspace Iteration Randomization and Singular Value Problems (Q5254699) (← links)
- Structural Convergence Results for Approximation of Dominant Subspaces from Block Krylov Spaces (Q5373926) (← links)
- Trust-Region Newton-CG with Strong Second-Order Complexity Guarantees for Nonconvex Optimization (Q5853562) (← links)
- Worst-Case Complexity of TRACE with Inexact Subproblem Solutions for Nonconvex Smooth Optimization (Q6046826) (← links)
