The following pages link to (Q4888905):
Displayed 11 items.
- The quantum query complexity of elliptic PDE (Q855898) (← links)
- On preconditioned eigensolvers and invert-Lanczos processes (Q999788) (← links)
- Kron's method for symmetric eigenvalue problems (Q1298806) (← links)
- A geometric theory for preconditioned inverse iteration. III: A short and sharp convergence estimate for generalized eigenvalue problems (Q1855433) (← links)
- Complexity of linear problems with a fixed output basis (Q1977152) (← links)
- A geometric theory for preconditioned inverse iteration IV: On the fastest convergence cases (Q2368743) (← links)
- Cluster robustness of preconditioned gradient subspace iteration eigensolvers (Q2368744) (← links)
- The randomized information complexity of elliptic PDE (Q2489143) (← links)
- Optimal approximation of elliptic problems by linear and nonlinear mappings. I (Q2489148) (← links)
- Improved well-posedness of problems of mathematical physics related to linear constraints (Q5930620) (← links)
- The limit subdomain decomposition of some spectral problems in strengthened Sobolev spaces (Q5935947) (← links)