default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMartin H. Gutknecht
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[j16]Martin H. Gutknecht:
Revisiting (k, ℓ)-step methods. Numer. Algorithms 69(2): 455-469 (2015)- 2014
- [j15]Martin H. Gutknecht:
Deflated and Augmented Krylov Subspace Methods: A Framework for Deflated BiCG and Related Solvers. SIAM J. Matrix Anal. Appl. 35(4): 1444-1466 (2014) - 2013
- [j14]Martin H. Gutknecht, Jens-Peter M. Zemke
:
Eigenvalue Computations Based on IDR. SIAM J. Matrix Anal. Appl. 34(2): 283-311 (2013) - [j13]André Gaul, Martin H. Gutknecht, Jörg Liesen, Reinhard Nabben:
A Framework for Deflated and Augmented Krylov Subspace Methods. SIAM J. Matrix Anal. Appl. 34(2): 495-518 (2013)
2000 – 2009
- 2008
- [j12]Pavel Jiránek, Miroslav Rozlozník, Martin H. Gutknecht:
How to Make Simpler GMRES and GCR More Stable. SIAM J. Matrix Anal. Appl. 30(4): 1483-1499 (2008) - 2002
- [j11]Martin H. Gutknecht, Stefan Röllin:
The Chebyshev iteration revisited. Parallel Comput. 28(2): 263-283 (2002) - 2001
- [j10]Martin H. Gutknecht, Miroslav Rozlozník:
By How Much Can Residual Minimization Accelerate the Convergence of Orthogonal Residual Methods? Numer. Algorithms 27(2): 189-213 (2001) - 2000
- [j9]Martin H. Gutknecht, Klaus J. Ressel:
Look-Ahead Procedures for Lanczos-Type Product Methods Based on Three-Term Lanczos Recurrences. SIAM J. Matrix Anal. Appl. 21(4): 1051-1078 (2000) - [j8]Martin H. Gutknecht, Zdenek Strakos:
Accuracy of Two Three-term and Three Two-term Recurrences for Krylov Space Solvers. SIAM J. Matrix Anal. Appl. 22(1): 213-229 (2000)
1990 – 1999
- 1998
- [j7]Klaus J. Ressel, Martin H. Gutknecht:
QMR Smoothing for Lanczos-Type Product Methods Based on Three-Term Rrecurrences. SIAM J. Sci. Comput. 19(1): 55-73 (1998) - 1994
- [j6]Martin H. Gutknecht:
A Completed Theory of the Unsymmetric Lanczos Process and Related Algorithms. Part II. SIAM J. Matrix Anal. Appl. 15(1): 15-58 (1994) - 1993
- [j5]Roland W. Freund, Martin H. Gutknecht, Noël M. Nachtigal:
An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian Matrices. SIAM J. Sci. Comput. 14(1): 137-158 (1993) - [j4]Martin H. Gutknecht:
Variants of BICGSTAB for Matrices with Complex Spectrum. SIAM J. Sci. Comput. 14(5): 1020-1033 (1993) - 1992
- [j3]Martin H. Gutknecht:
A Completed Theory of the Unsymmetric Lanczos Process and Related Algorithms, Part I. SIAM J. Matrix Anal. Appl. 13(2): 594-639 (1992) - 1991
- [j2]Daniel Boley, Sylvan Elhay, Gene H. Golub, Martin H. Gutknecht:
Nonsymmetric Lanczos and finding orthogonal polynomials associated with indefinite weights. Numer. Algorithms 1(1): 21-43 (1991)
1980 – 1989
- 1987
- [c1]Martin H. Gutknecht:
The pioneer days of scientific computing in Switzerland. HSNC 1987: 63-69
1970 – 1979
- 1979
- [j1]Martin H. Gutknecht:
Fast algorithms for the conjugate periodic function. Computing 22(1): 79-91 (1979)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
