Have a personal or library account? Click to login
The Non–Symmetric s–Step Lanczos Algorithm: Derivation of Efficient Recurrences and Synchronization–Reducing Variants of BiCG and QMR Cover

The Non–Symmetric s–Step Lanczos Algorithm: Derivation of Efficient Recurrences and Synchronization–Reducing Variants of BiCG and QMR

International Journal of Applied Mathematics and Computer Science
Volume 25 (2015): Issue 4 (December 2015)
By: Stefan Feuerriegel and  H. Martin Bücker  
Open Access
|Dec 2015

Authors

DOI: https://doi.org/10.1515/amcs-2015-0055 | Journal eISSN: 2083-8492 | Journal ISSN: 1641-876X
Journal RSS Feed
Language: English
Page range: 769 - 785
Submitted on: Apr 15, 2014
Published on: Dec 30, 2015
Published by: University of Zielona Góra
In partnership with: Paradigm Publishing Services
Publication frequency: 4 issues per year
Keywords:
synchronization-reducing,
s-step Lanczos,
s-step BiCG,
s-step QMR,
efficient recurrences
Related subjects:
Mathematics,
Applied mathematics

© 2015 Stefan Feuerriegel, H. Martin Bücker, published by University of Zielona Góra
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

Previous articleVolume 25 (2015): Issue 4 (December 2015)Next article