% IMPORTANT: The following is UTF-8 encoded. This means that in the presence
% of non-ASCII characters, it will not work with BibTeX 0.99 or older.
% Instead, you should use an up-to-date BibTeX implementation like “bibtex8” or
% “biber”.
@INPROCEEDINGS{Bcker:155249,
author = {Bücker, H. Martin},
title = {{T}he {R}elation between {G}alerkin-{T}ype and 1-{N}orm
{Q}uasi-{M}inimal {R}esidual {I}terative {M}ethods},
volume = {2},
reportid = {FZJ-2014-04423},
pages = {10 p.},
year = {1998},
comment = {Proceedings of the 5th Copper Mountain Conference on
Iterative Methods},
booktitle = {Proceedings of the 5th Copper Mountain
Conference on Iterative Methods},
abstract = {The main ingredients of any Krylov subspace method for the
solution of systems of linear equations with nonsingular, in
general non-Hermitian coefficient matrix are the generation
of a suitable basis and the definition of the actual
iterates. Two different strategies for defining the iterates
are the Galerkin-type approach and the 1-norm quasi-minimal
residual approach. Given any process to form a basis, it is
shown that applying the 1-norm quasi-minimal residual
approach corresponds to trivial residual smoothing of
Galerkin-type iterative methods. An example involving the
non-Hermitian Lanczos algorithm without look-ahead as the
underlying technique for the generation of a basis is used
to illustrate this relationship.},
month = {Mar},
date = {1998-03-30},
organization = {5th Copper Mountain Conference on
Iterative Methods, Copper Mountain
(USA), 30 Mar 1998 - 3 Apr 1998},
cin = {ZAM / JSC},
cid = {I:(DE-Juel1)VDB62 / I:(DE-Juel1)JSC-20090406},
pnm = {899 - ohne Topic (POF2-899)},
pid = {G:(DE-HGF)POF2-899},
typ = {PUB:(DE-HGF)8 / PUB:(DE-HGF)7},
url = {https://juser.fz-juelich.de/record/155249},
}