Fast and accurate randomized algorithms for linear systems and eigenvalue problems
This paper develops a class of algorithms for general linear systems and eigenvalue problems. These algorithms apply fast randomized dimension reduction (``sketching"") to accelerate standard subspace projection methods, such as GMRES and Rayleigh--Ritz. This modification makes it possible...
Autores principales: | Nakatsukasa, Y, Tropp, JA |
---|---|
Formato: | Journal article |
Lenguaje: | English |
Publicado: |
Society for Industrial and Applied Mathematics
2024
|
Ejemplares similares
-
Inertia laws and localization of real eigenvalues for generalized indefinite eigenvalue problems
por: Nakatsukasa, Y, et al.
Publicado: (2019) -
Rectangular eigenvalue problems
por: Hashemi, B, et al.
Publicado: (2022) -
Least-squares spectral methods for ODE eigenvalue problems
por: Hashemi, B, et al.
Publicado: (2022) -
Eigenvalue-based algorithm and analysis for nonconvex QCQP with one constraint
por: Adachi, S, et al.
Publicado: (2017) -
Solving two-parameter eigenvalue problems using an alternating method
por: Eisenmann, H, et al.
Publicado: (2022)