{"id":"https://openalex.org/W2019715448","doi":"https://doi.org/10.1137/0914037","title":"Preconditioning the Lanczos Algorithm for Sparse Symmetric Eigenvalue Problems","display_name":"Preconditioning the Lanczos Algorithm for Sparse Symmetric Eigenvalue Problems","publication_year":1993,"publication_date":"1993-05-01","ids":{"openalex":"https://openalex.org/W2019715448","doi":"https://doi.org/10.1137/0914037","mag":"2019715448"},"language":"en","primary_location":{"id":"doi:10.1137/0914037","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0914037","pdf_url":null,"source":{"id":"https://openalex.org/S165512578","display_name":"SIAM Journal on Scientific Computing","issn_l":"1064-8275","issn":["1064-8275","1095-7197"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Scientific Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5085879019","display_name":"Ronald B. Morgan","orcid":"https://orcid.org/0000-0002-0623-3740"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ronald B. Morgan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5102814346","display_name":"David Scott","orcid":"https://orcid.org/0000-0002-0934-8615"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"David S. Scott","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.2162,"has_fulltext":false,"cited_by_count":74,"citation_normalized_percentile":{"value":0.95652662,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"14","issue":"3","first_page":"585","last_page":"593"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10792","display_name":"Matrix Theory and Algorithms","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10792","display_name":"Matrix Theory and Algorithms","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10739","display_name":"Electromagnetic Scattering and Analysis","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/3107","display_name":"Atomic and Molecular Physics, and Optics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10339","display_name":"Advanced Numerical Methods in Computational Mathematics","score":0.9871000051498413,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/lanczos-algorithm","display_name":"Lanczos algorithm","score":0.8220048546791077},{"id":"https://openalex.org/keywords/power-iteration","display_name":"Power iteration","score":0.8017607927322388},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7792824506759644},{"id":"https://openalex.org/keywords/lanczos-resampling","display_name":"Lanczos resampling","score":0.7410452961921692},{"id":"https://openalex.org/keywords/eigenvalues-and-eigenvectors","display_name":"Eigenvalues and eigenvectors","score":0.7010586857795715},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.583490788936615},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.526406466960907},{"id":"https://openalex.org/keywords/sparse-matrix","display_name":"Sparse matrix","score":0.5046020746231079},{"id":"https://openalex.org/keywords/iterative-method","display_name":"Iterative method","score":0.49319905042648315},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.48843589425086975},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.4856199324131012},{"id":"https://openalex.org/keywords/preconditioner","display_name":"Preconditioner","score":0.48237720131874084},{"id":"https://openalex.org/keywords/inverse-iteration","display_name":"Inverse iteration","score":0.44742658734321594},{"id":"https://openalex.org/keywords/positive-definite-matrix","display_name":"Positive-definite matrix","score":0.43607833981513977},{"id":"https://openalex.org/keywords/symmetric-matrix","display_name":"Symmetric matrix","score":0.416850209236145},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.329668790102005},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.06702181696891785}],"concepts":[{"id":"https://openalex.org/C20501136","wikidata":"https://www.wikidata.org/wiki/Q366640","display_name":"Lanczos algorithm","level":4,"score":0.8220048546791077},{"id":"https://openalex.org/C162443888","wikidata":"https://www.wikidata.org/wiki/Q1426504","display_name":"Power iteration","level":3,"score":0.8017607927322388},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7792824506759644},{"id":"https://openalex.org/C119256216","wikidata":"https://www.wikidata.org/wiki/Q913012","display_name":"Lanczos resampling","level":3,"score":0.7410452961921692},{"id":"https://openalex.org/C158693339","wikidata":"https://www.wikidata.org/wiki/Q190524","display_name":"Eigenvalues and eigenvectors","level":2,"score":0.7010586857795715},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.583490788936615},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.526406466960907},{"id":"https://openalex.org/C56372850","wikidata":"https://www.wikidata.org/wiki/Q1050404","display_name":"Sparse matrix","level":3,"score":0.5046020746231079},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.49319905042648315},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.48843589425086975},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.4856199324131012},{"id":"https://openalex.org/C167431342","wikidata":"https://www.wikidata.org/wiki/Q1754327","display_name":"Preconditioner","level":3,"score":0.48237720131874084},{"id":"https://openalex.org/C2505209","wikidata":"https://www.wikidata.org/wiki/Q1671724","display_name":"Inverse iteration","level":3,"score":0.44742658734321594},{"id":"https://openalex.org/C49712288","wikidata":"https://www.wikidata.org/wiki/Q77601250","display_name":"Positive-definite matrix","level":3,"score":0.43607833981513977},{"id":"https://openalex.org/C54848796","wikidata":"https://www.wikidata.org/wiki/Q339011","display_name":"Symmetric matrix","level":3,"score":0.416850209236145},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.329668790102005},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.06702181696891785},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/0914037","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0914037","pdf_url":null,"source":{"id":"https://openalex.org/S165512578","display_name":"SIAM Journal on Scientific Computing","issn_l":"1064-8275","issn":["1064-8275","1095-7197"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Scientific Computing","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.385.6739","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.385.6739","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://bearspace.baylor.edu/Ronald_Morgan/www/papers/PL.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8","score":0.46000000834465027}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W81195244","https://openalex.org/W1963495087","https://openalex.org/W1976066180","https://openalex.org/W1992208469","https://openalex.org/W1993598022","https://openalex.org/W2005040897","https://openalex.org/W2009596258","https://openalex.org/W2018850201","https://openalex.org/W2027764906","https://openalex.org/W2051537564","https://openalex.org/W2059586807","https://openalex.org/W2081696668","https://openalex.org/W2087817735","https://openalex.org/W2088847993","https://openalex.org/W2117686912","https://openalex.org/W2147542748","https://openalex.org/W2316564661","https://openalex.org/W4251656402","https://openalex.org/W4300938688"],"related_works":["https://openalex.org/W2086204683","https://openalex.org/W3176451595","https://openalex.org/W1927056483","https://openalex.org/W2117588047","https://openalex.org/W2490271825","https://openalex.org/W2083054813","https://openalex.org/W1982695316","https://openalex.org/W1976798627","https://openalex.org/W2329076530","https://openalex.org/W2385065544"],"abstract_inverted_index":{"A":[0,50],"method":[1,30,35],"for":[2,44,61],"computing":[3],"a":[4],"few":[5],"eigenpairs":[6],"of":[7,19,25],"sparse":[8],"symmetric":[9],"matrices":[10,45],"is":[11,31,53,59,73],"presented":[12],"and":[13,36],"analyzed":[14],"that":[15,46],"combines":[16],"the":[17,23,26,62,70],"power":[18],"preconditioning":[20],"techniques":[21],"with":[22,67],"efficiency":[24],"Lanczos":[27],"algorithm.":[28],"The":[29],"related":[32],"to":[33,69],"Davidson\u2019s":[34],"its":[37],"generalizations,":[38],"but":[39],"can":[40],"be":[41],"less":[42],"expensive":[43],"are":[47],"fairly":[48],"sparse.":[49],"double":[51],"iteration":[52],"used.":[54],"An":[55],"effective":[56],"termination":[57],"criterion":[58],"given":[60],"inner":[63],"iteration.":[64],"Quadratic":[65],"convergence":[66],"respect":[68],"outer":[71],"loop":[72],"shown.":[74]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}