{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,22]],"date-time":"2026-08-22T07:26:13Z","timestamp":1787383573415,"version":"build-2736575974"},"reference-count":13,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Sci. Comput."],"published-print":{"date-parts":[[2000,1]]},"abstract":"<jats:p>A Laguerre iteration procedure is described for finding the eigenvalues of unsymmetric matrices with improved efficiency. Compared to the QR method, the processing time for dense matrices is reduced by roughly a factor of 1.6 and for sparse matrices by a factor of up to 2.8 without sacrificing accuracy. This is achieved primarily by means of a new procedure for reducing the original matrix to sparse Hessenberg form. Alternatively, the Laguerre procedure will typically provide one additional significant digit, compared to the QR method, when allowed to run for as long as the QR method.<\/jats:p>","DOI":"10.1137\/s106482759834963x","type":"journal-article","created":{"date-parts":[[2003,6,11]],"date-time":"2003-06-11T11:12:06Z","timestamp":1055329926000},"page":"822-834","source":"Crossref","is-referenced-by-count":4,"title":["An Improved Laguerre Eigensolver for Unsymmetric Matrices"],"prefix":"10.1137","volume":"22","author":[{"given":"Jorgen L.","family":"Nikolajsen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,25]]},"reference":[{"key":"R1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/4.4.332"},{"key":"R2","doi-asserted-by":"publisher","DOI":"10.1137\/0718038"},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.1137\/0612026"},{"key":"R4","doi-asserted-by":"publisher","DOI":"10.1145\/138351.138352"},{"key":"R5","doi-asserted-by":"publisher","DOI":"10.1016\/0096-3003(94)90155-4"},{"key":"R6","doi-asserted-by":"publisher","DOI":"10.1007\/BF02165404"},{"key":"R7","doi-asserted-by":"publisher","DOI":"10.1007\/BF02161358"},{"key":"R8","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1964-0165668-2"},{"key":"R9","first-page":"132","volume":"30","author":"Ward Robert","year":"1976","journal-title":"Math. Comp."},{"key":"R10","doi-asserted-by":"publisher","DOI":"10.1137\/0718069"},{"key":"R11","unstructured":"J. H. Wilkinson,\n                      The Algebraic Eigenvalue Problem\n                      , Oxford University Press, Oxford, UK, 1965."},{"key":"R12","volume-title":"A collection of matrices for testing computational algorithms","author":"Gregory Robert","year":"1978"},{"key":"R13","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1967-0228165-4"}],"container-title":["SIAM Journal on Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/S106482759834963X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T17:50:43Z","timestamp":1787334643000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/S106482759834963X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,1]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2000,1]]}},"alternative-id":["10.1137\/S106482759834963X"],"URL":"https:\/\/doi.org\/10.1137\/s106482759834963x","relation":{},"ISSN":["1064-8275","1095-7197"],"issn-type":[{"value":"1064-8275","type":"print"},{"value":"1095-7197","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000,1]]}}}