Additional references
D. Calvetti, L. Reichel and F. Sgallari, Application of anti-Gauss quadrature rules in linear algebra, in: Applications and Computation of Orthogonal Polynomials, eds.W. Gautschi, G.H. Golub and W. Opfer (Birkhauser, Basel, 1999) pp. 41–56.
B. Fischer, Polynomial Based Iteration Methods for Symmetric Linear Systems (Wiley, New York, 1996).
G. Meurant, Computer Solution of Large Linear Systems (North-Holland, Amsterdam, 1999). P.E. Saylor, D.C. Smolarski / Addendum to: Why Gaussian quadrature in the complex plane? 217
G. Meurant, The computation of bounds for the norm of the error in the conjugate gradient algorithm, Numer. Algorithms 16 (1997) 77–87.
G. Meurant, Numerical experiments in computing bounds for the norm of the error in preconditioned conjugate gradient algorithm, Numer. Algorithms 22 (1999) 353–365.
E.L. Stiefel, Relaxationsmethoden bester Strategie zur Losung linearer Gleichungssyteme, Comment. Math. Helv. 29 (1955) 157–179.
W. Van Assche, Orthogonal polynomials in the complex plane and on the real line, in: Special Functions, q-Series and Related Topics, eds. M.E.H. Ismail et al., Fields Institute Communications, Vol. 14 (AMS, Providence, RI, 1997) pp. 211–245.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Saylor, P.E., Smolarski, D.C. Addendum to: Why Gaussian Quadrature in the Complex Plane?. Numerical Algorithms 27, 215–217 (2001). https://doi.org/10.1023/A:1011829601115
Issue Date:
DOI: https://doi.org/10.1023/A:1011829601115