{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T07:40:01Z","timestamp":1751874001133,"version":"3.41.0"},"reference-count":7,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2001,6,1]],"date-time":"2001-06-01T00:00:00Z","timestamp":991353600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2001,6,1]],"date-time":"2001-06-01T00:00:00Z","timestamp":991353600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Numerical Algorithms"],"published-print":{"date-parts":[[2001,6]]},"DOI":"10.1023\/a:1011829601115","type":"journal-article","created":{"date-parts":[[2002,12,29]],"date-time":"2002-12-29T18:14:30Z","timestamp":1041185670000},"page":"215-217","source":"Crossref","is-referenced-by-count":2,"title":["Addendum to: Why Gaussian Quadrature in the Complex Plane?"],"prefix":"10.1007","volume":"27","author":[{"given":"Paul E.","family":"Saylor","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dennis C.","family":"Smolarski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"354329_CR1","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/978-3-0348-8685-7_3","volume-title":"Applications and Computation of Orthogonal Polynomials","author":"D. Calvetti","year":"1999","unstructured":"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\u201356."},{"key":"354329_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-663-11108-5","volume-title":"Polynomial Based Iteration Methods for Symmetric Linear Systems","author":"B. Fischer","year":"1996","unstructured":"B. Fischer, Polynomial Based Iteration Methods for Symmetric Linear Systems (Wiley, New York, 1996)."},{"key":"354329_CR3","first-page":"217","volume-title":"P.E. Saylor, D.C. Smolarski \/ Addendum to: Why Gaussian quadrature in the complex plane?","author":"G. Meurant","year":"1999","unstructured":"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"},{"key":"354329_CR4","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1023\/A:1019178811767","volume":"16","author":"G. Meurant","year":"1997","unstructured":"G. Meurant, The computation of bounds for the norm of the error in the conjugate gradient algorithm, Numer. Algorithms 16 (1997) 77\u201387.","journal-title":"Numer. Algorithms"},{"key":"354329_CR5","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1023\/A:1019179412560","volume":"22","author":"G. Meurant","year":"1999","unstructured":"G. Meurant, Numerical experiments in computing bounds for the norm of the error in preconditioned conjugate gradient algorithm, Numer. Algorithms 22 (1999) 353\u2013365.","journal-title":"Numer. Algorithms"},{"key":"354329_CR6","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF02564277","volume":"29","author":"E.L. Stiefel","year":"1955","unstructured":"E.L. Stiefel, Relaxationsmethoden bester Strategie zur Losung linearer Gleichungssyteme, Comment. Math. Helv. 29 (1955) 157\u2013179.","journal-title":"Comment. Math. Helv."},{"key":"354329_CR7","series-title":"Fields Institute Communications","first-page":"211","volume-title":"Special Functions, q-Series and Related Topics","author":"W. Van Assche","year":"1997","unstructured":"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\u2013245."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1011829601115.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1011829601115\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1011829601115.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T07:19:26Z","timestamp":1751872766000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1011829601115"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,6]]},"references-count":7,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2001,6]]}},"alternative-id":["354329"],"URL":"https:\/\/doi.org\/10.1023\/a:1011829601115","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"type":"print","value":"1017-1398"},{"type":"electronic","value":"1572-9265"}],"subject":[],"published":{"date-parts":[[2001,6]]}}}