{"id":"https://openalex.org/W2397893477","doi":"https://doi.org/10.1137/16m1079178","title":"Parallelization of the Rational Arnoldi Algorithm","display_name":"Parallelization of the Rational Arnoldi Algorithm","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2397893477","doi":"https://doi.org/10.1137/16m1079178","mag":"2397893477"},"language":"en","primary_location":{"id":"doi:10.1137/16m1079178","is_oa":true,"landing_page_url":"https://doi.org/10.1137/16m1079178","pdf_url":"https://epubs.siam.org/doi/pdf/10.1137/16M1079178","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","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":true,"oa_status":"hybrid","oa_url":"https://epubs.siam.org/doi/pdf/10.1137/16M1079178","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5057867887","display_name":"Mario Berljafa","orcid":null},"institutions":[{"id":"https://openalex.org/I28407311","display_name":"University of Manchester","ror":"https://ror.org/027m9bs27","country_code":"GB","type":"education","lineage":["https://openalex.org/I28407311"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Mario Berljafa","raw_affiliation_strings":["School of Mathematics, The University of Manchester, Alan Turing Building, Oxford Road, M13 9PL Manchester, UK"],"affiliations":[{"raw_affiliation_string":"School of Mathematics, The University of Manchester, Alan Turing Building, Oxford Road, M13 9PL Manchester, UK","institution_ids":["https://openalex.org/I28407311"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5082852246","display_name":"Stefan G\u00fcttel","orcid":"https://orcid.org/0000-0003-1494-4478"},"institutions":[{"id":"https://openalex.org/I28407311","display_name":"University of Manchester","ror":"https://ror.org/027m9bs27","country_code":"GB","type":"education","lineage":["https://openalex.org/I28407311"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Stefan G\u00fcttel","raw_affiliation_strings":["School of Mathematics, The University of Manchester, Alan Turing Building, Oxford Road, M13 9PL Manchester, UK"],"affiliations":[{"raw_affiliation_string":"School of Mathematics, The University of Manchester, Alan Turing Building, Oxford Road, M13 9PL Manchester, UK","institution_ids":["https://openalex.org/I28407311"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5057867887"],"corresponding_institution_ids":["https://openalex.org/I28407311"],"apc_list":null,"apc_paid":{"value":2852,"currency":"EUR","value_usd":3075},"fwci":0.711,"has_fulltext":true,"cited_by_count":12,"citation_normalized_percentile":{"value":0.70786341,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"39","issue":"5","first_page":"S197","last_page":"S221"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10792","display_name":"Matrix Theory and Algorithms","score":0.9991999864578247,"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":0.9991999864578247,"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/T11206","display_name":"Model Reduction and Neural Networks","score":0.9945999979972839,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"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/T13126","display_name":"Scientific Research and Discoveries","score":0.979200005531311,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/orthogonalization","display_name":"Orthogonalization","score":0.8653714060783386},{"id":"https://openalex.org/keywords/generalized-minimal-residual-method","display_name":"Generalized minimal residual method","score":0.7786386013031006},{"id":"https://openalex.org/keywords/krylov-subspace","display_name":"Krylov subspace","score":0.7113087177276611},{"id":"https://openalex.org/keywords/orthonormal-basis","display_name":"Orthonormal basis","score":0.6680454015731812},{"id":"https://openalex.org/keywords/arnoldi-iteration","display_name":"Arnoldi iteration","score":0.6407675743103027},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5704189538955688},{"id":"https://openalex.org/keywords/basis","display_name":"Basis (linear algebra)","score":0.5260082483291626},{"id":"https://openalex.org/keywords/linear-system","display_name":"Linear system","score":0.521612286567688},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.459235280752182},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.44239136576652527},{"id":"https://openalex.org/keywords/basis-function","display_name":"Basis function","score":0.43067222833633423},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.39302438497543335},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.38393181562423706},{"id":"https://openalex.org/keywords/iterative-method","display_name":"Iterative method","score":0.2534472346305847},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.07272061705589294}],"concepts":[{"id":"https://openalex.org/C47559304","wikidata":"https://www.wikidata.org/wiki/Q1702189","display_name":"Orthogonalization","level":2,"score":0.8653714060783386},{"id":"https://openalex.org/C155332342","wikidata":"https://www.wikidata.org/wiki/Q1432976","display_name":"Generalized minimal residual method","level":3,"score":0.7786386013031006},{"id":"https://openalex.org/C147060835","wikidata":"https://www.wikidata.org/wiki/Q1757151","display_name":"Krylov subspace","level":3,"score":0.7113087177276611},{"id":"https://openalex.org/C5806529","wikidata":"https://www.wikidata.org/wiki/Q2365325","display_name":"Orthonormal basis","level":2,"score":0.6680454015731812},{"id":"https://openalex.org/C43143463","wikidata":"https://www.wikidata.org/wiki/Q696822","display_name":"Arnoldi iteration","level":4,"score":0.6407675743103027},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5704189538955688},{"id":"https://openalex.org/C12426560","wikidata":"https://www.wikidata.org/wiki/Q189569","display_name":"Basis (linear algebra)","level":2,"score":0.5260082483291626},{"id":"https://openalex.org/C6802819","wikidata":"https://www.wikidata.org/wiki/Q1072174","display_name":"Linear system","level":2,"score":0.521612286567688},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.459235280752182},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44239136576652527},{"id":"https://openalex.org/C5917680","wikidata":"https://www.wikidata.org/wiki/Q2621825","display_name":"Basis function","level":2,"score":0.43067222833633423},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.39302438497543335},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.38393181562423706},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.2534472346305847},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.07272061705589294},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1137/16m1079178","is_oa":true,"landing_page_url":"https://doi.org/10.1137/16m1079178","pdf_url":"https://epubs.siam.org/doi/pdf/10.1137/16M1079178","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Scientific Computing","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:openaire/0ba5f9b9-7815-4584-bf9a-a57db4d86b1e","is_oa":true,"landing_page_url":"https://research.manchester.ac.uk/en/publications/0ba5f9b9-7815-4584-bf9a-a57db4d86b1e","pdf_url":null,"source":{"id":"https://openalex.org/S4306400662","display_name":"Research Explorer (The University of Manchester)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I28407311","host_organization_name":"University of Manchester","host_organization_lineage":["https://openalex.org/I28407311"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Berljafa, M & Guettel, S 2017, 'Parallelization of the rational Arnoldi algorithm', SIAM Journal on Scientific Computing. https://doi.org/10.1137/16M1079178","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:eprints.maths.manchester.ac.uk.MIMS.EPrints:2478","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306400452","display_name":"MIMS EPrints (University of Southampton)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I43439940","host_organization_name":"University of Southampton","host_organization_lineage":["https://openalex.org/I43439940"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"MIMS Preprint"},{"id":"pmh:oai:pure.atira.dk:publications/0ba5f9b9-7815-4584-bf9a-a57db4d86b1e","is_oa":true,"landing_page_url":"https://www.research.manchester.ac.uk/portal/en/publications/parallelization-of-the-rational-arnoldi-algorithm(0ba5f9b9-7815-4584-bf9a-a57db4d86b1e).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400662","display_name":"Research Explorer (The University of Manchester)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I28407311","host_organization_name":"University of Manchester","host_organization_lineage":["https://openalex.org/I28407311"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Berljafa, M & Guettel, S 2017, 'Parallelization of the rational Arnoldi algorithm', SIAM Journal on Scientific Computing. https://doi.org/10.1137/16M1079178","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"doi:10.1137/16m1079178","is_oa":true,"landing_page_url":"https://doi.org/10.1137/16m1079178","pdf_url":"https://epubs.siam.org/doi/pdf/10.1137/16M1079178","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Scientific Computing","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2397893477.pdf","grobid_xml":"https://content.openalex.org/works/W2397893477.grobid-xml"},"referenced_works_count":29,"referenced_works":["https://openalex.org/W110690611","https://openalex.org/W187950448","https://openalex.org/W1506342804","https://openalex.org/W1522512418","https://openalex.org/W1561849568","https://openalex.org/W1563813142","https://openalex.org/W1566392239","https://openalex.org/W1596181878","https://openalex.org/W1834868080","https://openalex.org/W1966343138","https://openalex.org/W1966992674","https://openalex.org/W1976429547","https://openalex.org/W1983231482","https://openalex.org/W1984720662","https://openalex.org/W1995944994","https://openalex.org/W2001773339","https://openalex.org/W2018687656","https://openalex.org/W2022693174","https://openalex.org/W2024384195","https://openalex.org/W2033307991","https://openalex.org/W2035080386","https://openalex.org/W2035969141","https://openalex.org/W2049289314","https://openalex.org/W2052604766","https://openalex.org/W2085881863","https://openalex.org/W2117799929","https://openalex.org/W2169328438","https://openalex.org/W2170486042","https://openalex.org/W4235086688"],"related_works":["https://openalex.org/W2002097440","https://openalex.org/W3152060313","https://openalex.org/W2015942935","https://openalex.org/W62853295","https://openalex.org/W53539087","https://openalex.org/W3134028852","https://openalex.org/W2037894849","https://openalex.org/W2804908571","https://openalex.org/W4287241618","https://openalex.org/W2279865562"],"abstract_inverted_index":{"Rational":[0],"Krylov":[1,31,69],"methods":[2],"are":[3,144],"applicable":[4],"to":[5,88,106,114],"a":[6,19,29,46,107,127,131],"wide":[7],"range":[8],"of":[9,28,39,45,50,59,100,118,122],"scientific":[10],"computing":[11,24],"problems,":[12],"and":[13,135],"the":[14,34,43,57,67,79,92,97,116,119],"rational":[15,30,68,138],"Arnoldi":[16,139],"algorithm":[17,41],"is":[18,42,75],"commonly":[20],"used":[21],"procedure":[22],"for":[23],"an":[25],"orthonormal":[26],"basis":[27,70,80],"space.":[32],"Typically,":[33],"computationally":[35],"most":[36],"expensive":[37],"component":[38],"this":[40,74,123],"solution":[44],"large":[47],"linear":[48,62],"system":[49],"equations":[51],"at":[52],"each":[53],"iteration.":[54],"We":[55,95],"explore":[56],"option":[58],"solving":[60],"several":[61,147],"systems":[63],"simultaneously,":[64],"thus":[65],"constructing":[66],"in":[71,91],"parallel.":[72],"If":[73],"not":[76],"done":[77],"carefully,":[78],"being":[81],"orthogonalized":[82],"may":[83],"become":[84],"badly":[85],"conditioned,":[86],"leading":[87],"numerical":[89,148],"instabilities":[90],"orthogonalization":[93],"process.":[94],"introduce":[96],"new":[98],"concept":[99],"continuation":[101],"pairs,":[102],"which":[103],"gives":[104],"rise":[105],"near-optimal":[108],"parallelization":[109],"strategy":[110],"that":[111],"allows":[112],"us":[113],"control":[115],"growth":[117],"condition":[120],"number":[121],"nonorthogonal":[124],"basis.":[125],"As":[126],"consequence":[128],"we":[129],"obtain":[130],"significantly":[132],"more":[133],"accurate":[134],"reliable":[136],"parallel":[137],"algorithm.":[140],"The":[141],"computational":[142],"benefits":[143],"illustrated":[145],"using":[146],"examples":[149],"from":[150],"different":[151],"application":[152],"areas.":[153]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-04-06T07:47:59.780226","created_date":"2025-10-10T00:00:00"}