Zobrazeno 1 - 3
of 3
pro vyhledávání: '"s-step bicg"'
Autor:
Feuerriegel Stefan, Bücker H. Martin
Publikováno v:
International Journal of Applied Mathematics and Computer Science, Vol 25, Iss 4, Pp 769-785 (2015)
The Lanczos algorithm is among the most frequently used iterative techniques for computing a few dominant eigenvalues of a large sparse non-symmetric matrix. At the same time, it serves as a building block within biconjugate gradient (BiCG) and quasi
Externí odkaz:
https://doaj.org/article/4bb2af957f604e3fba66473f017aa78e
Autor:
H. Martin Bücker, Stefan Feuerriegel
Publikováno v:
International Journal of Applied Mathematics and Computer Science, Vol 25, Iss 4, Pp 769-785 (2015)
The Lanczos algorithm is among the most frequently used iterative techniques for computing a few dominant eigenvalues of a large sparse non-symmetric matrix. At the same time, it serves as a building block within biconjugate gradient (BiCG) and quasi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0c3e6b1887371037d30b341fcc362ca4
https://doi.org/10.1515/amcs-2015-0055
https://doi.org/10.1515/amcs-2015-0055
Synchronization-reducing variants of the Biconjugate Gradient and the quasi-Minimal Residual Methods
Autor:
Feuerriegel, Stefan, Bücker, H. Martin
Publikováno v:
Lecture Notes in Computer Science, 8285
Algorithms and Architectures for Parallel Processing
Algorithms and Architectures for Parallel Processing
The Biconjugate Gradient (BiCG) and the Quasi-Minimal Residual (QMR) method are among the popular iterative methods for the solution of large, sparse, non-symmetric systems of linear equations. When these methods are implemented on large-scale parall
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::081c2d72ad3fa6d50a1229ea8be5a58d
https://hdl.handle.net/20.500.11850/182414
https://hdl.handle.net/20.500.11850/182414
