{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T01:59:58Z","timestamp":1760061598803},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1992,3,1]],"date-time":"1992-03-01T00:00:00Z","timestamp":699408000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[1992,3]]},"DOI":"10.1007\/bf02241709","type":"journal-article","created":{"date-parts":[[2005,11,14]],"date-time":"2005-11-14T16:25:50Z","timestamp":1131985550000},"page":"109-123","source":"Crossref","is-referenced-by-count":16,"title":["Practical improvement of the divide-and-conquer eigenvalue algorithms"],"prefix":"10.1007","volume":"48","author":[{"given":"D.","family":"Bini","sequence":"first","affiliation":[]},{"given":"V.","family":"Pan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"BF02241709_CR1","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1016\/0885-064X(90)90032-9","volume":"6","author":"M. Ben-Or","year":"1990","unstructured":"Ben-Or, M., Tiwari, P.: Simple algorithm for approximating all roots of a polynomial with real roots. J. Complexity6(4), 417\u2013442 (1990).","journal-title":"J. Complexity"},{"key":"BF02241709_CR2","volume-title":"An iteration scheme for the divide-and-conquer eigenvalue solvers","author":"D. Bini","year":"1991","unstructured":"Bini, D., Gemignani, L.: An iteration scheme for the divide-and-conquer eigenvalue solvers. Manuscript, Dipartimento di Matematica, Universit\u00e0 di Pisa, Pisa, 1991."},{"key":"BF02241709_CR3","unstructured":"Bini, D., Pan, V.: Parallel complexity of tridiagonal symmetric eigenvalue problem. Proc. 2nd Annual ACM-SIAM Symp. on Discrete Algorithms, pp. 384\u2013393, 1991."},{"key":"BF02241709_CR4","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/BF01396012","volume":"31","author":"J. R. Bunch","year":"1978","unstructured":"Bunch, J. R., Nielsen C. P., Sorensen, D. C.: Rank-one modificationof the symmetric eigenproblem. Numer. Math.31, 31\u201348 (1978).","journal-title":"Numer. Math."},{"key":"BF02241709_CR5","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/BF01396757","volume":"36","author":"J. J. M. Cuppen","year":"1981","unstructured":"Cuppen, J. J. M.: A divide and conquer method for the symmetric tridiagonal eigenproblem. Numer. Math.36, 177\u2013195 (1981).","journal-title":"Numer. Math."},{"issue":"2","key":"BF02241709_CR6","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1137\/0908018","volume":"8","author":"J. J. Dongarra","year":"1987","unstructured":"Dongarra, J. J., Sorensen, D. C.: A fully parallel algorithm for the symmetric eigenvalue problem. SIAM J. on Sci. and Stat. Computing8 (2), 139\u2013154 (1987).","journal-title":"SIAM J. on Sci. and Stat. Computing"},{"issue":"1","key":"BF02241709_CR7","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1137\/0911010","volume":"11","author":"D. Gill","year":"1990","unstructured":"Gill, D., Tadmor, E., AnO(n2) method for computing the eigensystem ofn\u00d7n symmetric tridiagonal matrices by the divide and conquer approach. SIAM J. Sci. Stat. Comput.11, 1, 161\u2013173 (1990).","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"BF02241709_CR8","volume-title":"Matrix computations","author":"G. H. Golub","year":"1989","unstructured":"Golub, G. H., Van Loan, C. F.: Matrix computations. Baltimore, MD: Johns Hopkins Univ. Press, 1989."},{"key":"BF02241709_CR9","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/BF01389480","volume":"48","author":"A. S. Krishnakumar","year":"1986","unstructured":"Krishnakumar, A. S., Morf, M.: Eigenvalues of a symmetric tridiagonal matrix: a divide-and-conquer approach. Numer. Math.48, 349\u2013368 (1986).","journal-title":"Numer. Math."},{"key":"BF02241709_CR10","volume-title":"The symmetric eigenvalue problem","author":"B. N. Parlett","year":"1980","unstructured":"Parlett, B. N.: The symmetric eigenvalue problem. Englewood Cliffs, NJ: Prentice-Hall, 1980."},{"key":"BF02241709_CR11","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1093\/imamat\/12.2.209","volume":"12","author":"V. Pereyra","year":"1973","unstructured":"Pereyra, V., Scherer, G.: Eigenvalues of symmetric tridiagonal matrices: a fast, accurate and reliable algorithm. J. Inst. Maths Applics.12, 209\u2013222 (1973).","journal-title":"J. Inst. Maths Applics."},{"key":"BF02241709_CR12","volume-title":"Numerical recipes","author":"W. H. Press","year":"1986","unstructured":"Press, W. H., Flannery, B. P., Tenkolsky, S. A., Vetterling W. T.: Numerical recipes. Cambridge: Cambridge University Press, 1986."},{"issue":"2","key":"BF02241709_CR13","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1016\/0885-064X(87)90022-7","volume":"3","author":"J. Renegar","year":"1987","unstructured":"Renegar, J.: On the worst-case arithmetic complexity of approximating zeros of polynomials. J. Complexity3 (2), 90\u2013113 (1987).","journal-title":"J. Complexity"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02241709.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02241709\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02241709","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T19:15:45Z","timestamp":1557861345000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02241709"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,3]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,3]]}},"alternative-id":["BF02241709"],"URL":"https:\/\/doi.org\/10.1007\/bf02241709","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,3]]}}}