{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T08:52:02Z","timestamp":1776761522778,"version":"3.51.2"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1991,2,1]],"date-time":"1991-02-01T00:00:00Z","timestamp":665366400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[1991,2]]},"DOI":"10.1007\/bf02145581","type":"journal-article","created":{"date-parts":[[2005,9,15]],"date-time":"2005-09-15T20:34:56Z","timestamp":1126816496000},"page":"21-43","source":"Crossref","is-referenced-by-count":27,"title":["Nonsymmetric Lanczos and finding orthogonal polynomials associated with indefinite weights"],"prefix":"10.1007","volume":"1","author":[{"given":"Daniel L.","family":"Boley","sequence":"first","affiliation":[]},{"given":"Sylvan","family":"Elhay","sequence":"additional","affiliation":[]},{"given":"Gene H.","family":"Golub","sequence":"additional","affiliation":[]},{"given":"Martin H.","family":"Gutknecht","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02145581_CR1","doi-asserted-by":"crossref","unstructured":"C.F. Anfinson, R.P. Brent and F.T. Luk, A theoretical foundation for the weighted checksum scheme in:Proc. SPIE vol 975 Advanced Algorithms and Architectures for Signal Processing III, paper 2, 1988.","DOI":"10.1117\/12.948486"},{"key":"BF02145581_CR2","series-title":"Inverse Problems","first-page":"595","volume-title":"A survey of matrix inverse eigenvalue problems","author":"D.L. Boley","year":"1987","unstructured":"D.L. Boley and G.H. Golub, A survey of matrix inverse eigenvalue problems, Inverse Problems, Vol. 3 (Physics Trust Publications, Bristol, England, 1987) pp 595\u2013622."},{"key":"BF02145581_CR3","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/0024-3795(78)90086-1","volume":"21","author":"C. Boor de","year":"1978","unstructured":"C. de Boor and G. Golub, The numerically stable reconstruction of a Jacobi matrix from spectral data, Lin. Alg and Appl. 21 (1978) 245\u2013260.","journal-title":"Lin. Alg and Appl."},{"key":"BF02145581_CR4","series-title":"ISNM","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-0348-6558-6","volume-title":"Pad\u00e9-Type Approximants and General Orthogonal Polynomials","author":"C. Brezinski","year":"1980","unstructured":"C. Brezinski,Pad\u00e9-Type Approximants and General Orthogonal Polynomials, ISNM, Vol. 50 (Birkh\u00e4user, Basel\/Stuttgart, 1980)."},{"key":"BF02145581_CR5","volume-title":"Lanczos Algorithms for Large Symmetric Eigenvalue Computations","author":"J. Cullum","year":"1985","unstructured":"J. Cullum and R. Willoughby,Lanczos Algorithms for Large Symmetric Eigenvalue Computations, Vol. I: Theory (Birkh\u00e4user, Boston, 1985)."},{"key":"BF02145581_CR6","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0024-3795(87)90105-4","volume":"88\/89","author":"G. Cybenko","year":"1987","unstructured":"G. Cybenko, An explicit formula for Lanczos polynomials, Lin. Alg. and Appl. 88\/89 (1987) 99\u2013115.","journal-title":"Lin. Alg. and Appl."},{"key":"BF02145581_CR7","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1137\/0903018","volume":"3","author":"W. Gautschi","year":"1982","unstructured":"W. Gautschi, On generating orthogonal polynomials, SIAM J. Sci. and Stat. Comput. 3 (1982) 289\u2013317.","journal-title":"SIAM J. Sci. and Stat. Comput."},{"key":"BF02145581_CR8","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1007\/BF01386431","volume":"57","author":"G. Golub","year":"1990","unstructured":"G. Golub and M. Gutknecht, Modified moments for indefinite weight functions, Numer. Math. 57 (1990) 607\u2013624.","journal-title":"Numer. Math."},{"key":"BF02145581_CR9","unstructured":"G. Golub and C. Van Loan,Matrix Computations 2\/e (Johns Hopkins, 1989)."},{"key":"BF02145581_CR10","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1090\/S0025-5718-69-99647-1","volume":"23","author":"G. Golub","year":"1969","unstructured":"G. Golub and J. Welsch, Calculation of Gauss quadrature rules, Math. Comp. 23 (1969) 221\u2013230.","journal-title":"Math. Comp."},{"key":"BF02145581_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/1014001","volume":"14","author":"W.B. Gragg","year":"1972","unstructured":"W.B. Gragg, The Pad\u00e9 table and its relation to certain algorithms of numerical analysis, SIAM Rev. 14 (1972) 1\u201362.","journal-title":"SIAM Rev."},{"key":"BF02145581_CR12","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1216\/RMJ-1974-4-2-213","volume":"4","author":"W.B. Gragg","year":"1974","unstructured":"W.B. Gragg, Matrix interpretations and applications of the continued fraction algorithm, Rocky Mountain J. Math. 4 (1974) 213\u2013225.","journal-title":"Rocky Mountain J. Math."},{"key":"BF02145581_CR13","unstructured":"M.H. Gutknecht, A completed theory for the unsymmetric Lanczos process and related algorithms, SIAM J. Matrix Anal., 1989, submitted."},{"key":"BF02145581_CR14","unstructured":"M.H. Gutknecht, The unsymmetric Lanczos algorithms and their relations to Pad\u00e9 approximation, continued fractions, the qd algorithm, biconjugate gradient squared algorithms, and fast Hankel solvers, preprint, 1990."},{"key":"BF02145581_CR15","doi-asserted-by":"crossref","unstructured":"K.H. Juang and J.A. Abraham, Algorithm-based fault tolerance for matrix operations, IEEE Trans. Comput. C-33 Nr. 6 (June 1984) 518\u2013528.","DOI":"10.1109\/TC.1984.1676475"},{"key":"BF02145581_CR16","doi-asserted-by":"crossref","unstructured":"J.Y. Jou and J.A. Abraham, Fault-tolerant matrix arithmetic and signal processing on highly concurrent computing structures; Proc. IEEE 74 Nr. 5, special issue on fault tolerance (May 1986) 732\u2013741.","DOI":"10.1109\/PROC.1986.13535"},{"key":"BF02145581_CR17","doi-asserted-by":"crossref","unstructured":"W. Joubert, Lanczos methods for the solution of nonsymmetric systems of linear equations in:Proc. Copper Mtn. Conf. on Iterative Methods, April 1\u20135, 1990; submitted to SIAM J. on Sci. and Stat. Comput.","DOI":"10.1137\/0613056"},{"key":"BF02145581_CR18","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1016\/0024-3795(83)80028-7","volume":"52\/53","author":"J. Kautsky","year":"1983","unstructured":"J. Kautsky and G.H. Golub, On calculation of Jacobi matrices, Lin. Alg. and Appl. 52\/53 (1983) 439\u2013455.","journal-title":"Lin. Alg. and Appl."},{"key":"BF02145581_CR19","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1090\/S0025-5718-1966-0234618-4","volume":"20","author":"S. Kaniel","year":"1966","unstructured":"S. Kaniel, Estimates for some computational techniques in linear algebra, Math. Comp. 20 (1966) 369\u2013378.","journal-title":"Math. Comp."},{"key":"BF02145581_CR20","unstructured":"M. Kent, Chebyshev, Krylov, Lanczos: Matrix Relationships and Computations, Ph.D. Thesis, Stanford Univ. Computer Sci. Report STAN-CS-89-1271, June 1989."},{"key":"BF02145581_CR21","doi-asserted-by":"crossref","first-page":"255","DOI":"10.6028\/jres.045.026","volume":"45","author":"C. Lanczos","year":"1950","unstructured":"C. Lanczos, An iteration method for the solution of the eigenvalue problem linear differential and integral operators, J. Res. Natl. Bur. Stand. 45 (1950) 255\u2013282.","journal-title":"J. Res. Natl. Bur. Stand."},{"key":"BF02145581_CR22","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1016\/0743-7315(88)90027-5","volume":"5","author":"F.T. Luk","year":"1988","unstructured":"F.T. Luk and H. Park, An analysis of algorithm-based fault tolerance, J. Parallel Distr. Comput. 5 (1988) 172\u2013184.","journal-title":"J. Parallel Distr. Comput."},{"key":"BF02145581_CR23","unstructured":"C.C. Paige, The computation of eigenvalues and eigenvectors of very large sparse matrices, Ph.D. Thesis, London Univ., 1971."},{"key":"BF02145581_CR24","unstructured":"B. Parlett,The Symmetric Eigenvalue Problem (Prentice Hall, 1980)."},{"key":"BF02145581_CR25","unstructured":"B.N. Parlett, Reduction to tridiagonal form and minimal realizations; preprint submitted to SIAM J. Matrix Anal., 1990."},{"key":"BF02145581_CR26","first-page":"105","volume":"44","author":"B.N. Parlett","year":"1985","unstructured":"B.N. Parlett, D.R. Taylor and Z.A. Liu, A look-ahead Lanczos algorithm for unsymmetric matrices, Math. Comp. 44 (1985) 105\u2013124.","journal-title":"Math. Comp."},{"key":"BF02145581_CR27","series-title":"Mitt. Inst. angew. Math. ETH","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-0348-7175-4","volume-title":"Der Quotienten-Differenzen-Algorithmus","author":"H. Rutishauser","year":"1957","unstructured":"H. Rutishauser, Der Quotienten-Differenzen-Algorithmus, Mitt. Inst. angew. Math. ETH, Nr. 7 (Birkh\u00e4user, Basel\/Stuttgart, 1957)."},{"key":"BF02145581_CR28","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1137\/0717059","volume":"17","author":"Y. Saad","year":"1980","unstructured":"Y. Saad, On the rates of convergence of the Lanczos and the block Lanczos methods, SIAM J. Num. Anal. 17 (1980) 687\u2013706.","journal-title":"SIAM J. Num. Anal."},{"key":"BF02145581_CR29","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1007\/BF01406683","volume":"18","author":"R. Sack","year":"1972","unstructured":"R. Sack and A. Donovan, An algorithm for Gaussian quadrature given modified moments, Numer. Math. 18 (1972) 465\u2013478.","journal-title":"Numer. Math."},{"key":"BF02145581_CR30","unstructured":"D. Scott, Analysis of the symmetric Lanczos process, Univ. of Calif., Berkeley, Electronic Res. Lab. Report UCB\/ERL M78\/40, 1978."},{"key":"BF02145581_CR31","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1216\/RMJ-1974-4-2-287","volume":"4","author":"J. Wheeler","year":"1974","unstructured":"J. Wheeler, Modified moments and Gaussian quadrature, Rocky Mtn. J. Math. 4 (1974) 287\u2013296.","journal-title":"Rocky Mtn. J. Math."},{"key":"BF02145581_CR32","volume-title":"The Algebraic Eigenvalue Problem","author":"J.H. Wilkinson","year":"1965","unstructured":"J.H. Wilkinson,The Algebraic Eigenvalue Problem (Clarendon Press, Oxford, 1965)."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02145581.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02145581\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02145581","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,9]],"date-time":"2020-04-09T14:22:46Z","timestamp":1586442166000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02145581"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,2]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,2]]}},"alternative-id":["BF02145581"],"URL":"https:\/\/doi.org\/10.1007\/bf02145581","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,2]]}}}