{"id":"https://openalex.org/W2469708138","doi":"https://doi.org/10.1080/10556788.2016.1184663","title":"An interval-matrix branch-and-bound algorithm for bounding eigenvalues","display_name":"An interval-matrix branch-and-bound algorithm for bounding eigenvalues","publication_year":2016,"publication_date":"2016-07-05","ids":{"openalex":"https://openalex.org/W2469708138","doi":"https://doi.org/10.1080/10556788.2016.1184663","mag":"2469708138"},"language":"en","primary_location":{"id":"doi:10.1080/10556788.2016.1184663","is_oa":true,"landing_page_url":"https://doi.org/10.1080/10556788.2016.1184663","pdf_url":"https://www.tandfonline.com/doi/pdf/10.1080/10556788.2016.1184663?needAccess=true&role=button","source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://www.tandfonline.com/doi/pdf/10.1080/10556788.2016.1184663?needAccess=true&role=button","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5075406295","display_name":"Dimitrios Nerantzis","orcid":"https://orcid.org/0000-0002-8178-3339"},"institutions":[{"id":"https://openalex.org/I47508984","display_name":"Imperial College London","ror":"https://ror.org/041kmwe10","country_code":"GB","type":"education","lineage":["https://openalex.org/I47508984"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Dimitrios Nerantzis","raw_affiliation_strings":["Department of Chemical Engineering, Centre for Process Systems Engineering, Imperial College London, South Kensington Campus, London SW7 2AZ, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Chemical Engineering, Centre for Process Systems Engineering, Imperial College London, South Kensington Campus, London SW7 2AZ, UK","institution_ids":["https://openalex.org/I47508984"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5034484420","display_name":"Claire S. Adjiman","orcid":"https://orcid.org/0000-0002-4573-7722"},"institutions":[{"id":"https://openalex.org/I47508984","display_name":"Imperial College London","ror":"https://ror.org/041kmwe10","country_code":"GB","type":"education","lineage":["https://openalex.org/I47508984"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Claire S. Adjiman","raw_affiliation_strings":["Department of Chemical Engineering, Centre for Process Systems Engineering, Imperial College London, South Kensington Campus, London SW7 2AZ, UK"],"raw_orcid":"https://orcid.org/0000-0002-4573-7722","affiliations":[{"raw_affiliation_string":"Department of Chemical Engineering, Centre for Process Systems Engineering, Imperial College London, South Kensington Campus, London SW7 2AZ, UK","institution_ids":["https://openalex.org/I47508984"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5034484420"],"corresponding_institution_ids":["https://openalex.org/I47508984"],"apc_list":null,"apc_paid":{"value":696,"currency":"EUR","value_usd":750},"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.0719397,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"32","issue":"4","first_page":"872","last_page":"891"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11697","display_name":"Numerical Methods 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/T11697","display_name":"Numerical Methods 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/T11206","display_name":"Model Reduction and Neural Networks","score":0.9988999962806702,"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/T10792","display_name":"Matrix Theory and Algorithms","score":0.9987000226974487,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/eigenvalues-and-eigenvectors","display_name":"Eigenvalues and eigenvectors","score":0.8020191192626953},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7430795431137085},{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.630300760269165},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5680550336837769},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.5205200910568237},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.480620801448822},{"id":"https://openalex.org/keywords/divide-and-conquer-eigenvalue-algorithm","display_name":"Divide-and-conquer eigenvalue algorithm","score":0.4603872299194336},{"id":"https://openalex.org/keywords/interval-arithmetic","display_name":"Interval arithmetic","score":0.44703590869903564},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.44215118885040283},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.4357207417488098},{"id":"https://openalex.org/keywords/eigenvalue-algorithm","display_name":"Eigenvalue algorithm","score":0.4278411567211151},{"id":"https://openalex.org/keywords/inverse-iteration","display_name":"Inverse iteration","score":0.4123706817626953},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.34512898325920105},{"id":"https://openalex.org/keywords/symmetric-matrix","display_name":"Symmetric matrix","score":0.19053038954734802},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.15681061148643494},{"id":"https://openalex.org/keywords/square-matrix","display_name":"Square matrix","score":0.14399975538253784},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.12473791837692261},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.10387939214706421}],"concepts":[{"id":"https://openalex.org/C158693339","wikidata":"https://www.wikidata.org/wiki/Q190524","display_name":"Eigenvalues and eigenvectors","level":2,"score":0.8020191192626953},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7430795431137085},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.630300760269165},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5680550336837769},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.5205200910568237},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.480620801448822},{"id":"https://openalex.org/C192702615","wikidata":"https://www.wikidata.org/wiki/Q5283998","display_name":"Divide-and-conquer eigenvalue algorithm","level":3,"score":0.4603872299194336},{"id":"https://openalex.org/C191252586","wikidata":"https://www.wikidata.org/wiki/Q1671453","display_name":"Interval arithmetic","level":3,"score":0.44703590869903564},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.44215118885040283},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.4357207417488098},{"id":"https://openalex.org/C109565186","wikidata":"https://www.wikidata.org/wiki/Q6766437","display_name":"Eigenvalue algorithm","level":5,"score":0.4278411567211151},{"id":"https://openalex.org/C2505209","wikidata":"https://www.wikidata.org/wiki/Q1671724","display_name":"Inverse iteration","level":3,"score":0.4123706817626953},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.34512898325920105},{"id":"https://openalex.org/C54848796","wikidata":"https://www.wikidata.org/wiki/Q339011","display_name":"Symmetric matrix","level":3,"score":0.19053038954734802},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.15681061148643494},{"id":"https://openalex.org/C69044650","wikidata":"https://www.wikidata.org/wiki/Q2739329","display_name":"Square matrix","level":4,"score":0.14399975538253784},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.12473791837692261},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.10387939214706421},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1080/10556788.2016.1184663","is_oa":true,"landing_page_url":"https://doi.org/10.1080/10556788.2016.1184663","pdf_url":"https://www.tandfonline.com/doi/pdf/10.1080/10556788.2016.1184663?needAccess=true&role=button","source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","raw_type":"journal-article"},{"id":"pmh:oai:spiral.imperial.ac.uk:10044/1/32159","is_oa":true,"landing_page_url":"http://hdl.handle.net/10044/1/32159","pdf_url":null,"source":{"id":"https://openalex.org/S4306401396","display_name":"Spiral (Imperial College London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I47508984","host_organization_name":"Imperial College London","host_organization_lineage":["https://openalex.org/I47508984"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"891","raw_type":"Journal Article"}],"best_oa_location":{"id":"doi:10.1080/10556788.2016.1184663","is_oa":true,"landing_page_url":"https://doi.org/10.1080/10556788.2016.1184663","pdf_url":"https://www.tandfonline.com/doi/pdf/10.1080/10556788.2016.1184663?needAccess=true&role=button","source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6671337746","display_name":"The molecular frontier: extending the boundaries of process design","funder_award_id":"EP/J003840/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G8745199722","display_name":null,"funder_award_id":"EP/J003840/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2469708138.pdf","grobid_xml":"https://content.openalex.org/works/W2469708138.grobid-xml"},"referenced_works_count":26,"referenced_works":["https://openalex.org/W1182892309","https://openalex.org/W1543489800","https://openalex.org/W1965293593","https://openalex.org/W1973582968","https://openalex.org/W1979800710","https://openalex.org/W1982847377","https://openalex.org/W1984425167","https://openalex.org/W2009341803","https://openalex.org/W2022602688","https://openalex.org/W2027462310","https://openalex.org/W2027760800","https://openalex.org/W2029699845","https://openalex.org/W2031419437","https://openalex.org/W2048801726","https://openalex.org/W2055325291","https://openalex.org/W2072355784","https://openalex.org/W2073681598","https://openalex.org/W2079553699","https://openalex.org/W2095132231","https://openalex.org/W2099685349","https://openalex.org/W2107543637","https://openalex.org/W2112289054","https://openalex.org/W2138446884","https://openalex.org/W2144180603","https://openalex.org/W2160060073","https://openalex.org/W2301746362"],"related_works":["https://openalex.org/W2885654125","https://openalex.org/W2130474842","https://openalex.org/W2802907435","https://openalex.org/W1601452860","https://openalex.org/W2389501085","https://openalex.org/W4388185085","https://openalex.org/W2262471294","https://openalex.org/W2358975571","https://openalex.org/W1827065324","https://openalex.org/W2616149071"],"abstract_inverted_index":{"We":[0],"present":[1],"and":[2,162],"explore":[3],"the":[4,15,26,30,37,56,63,73,110,124,130,133,177,183,188,202,206,209],"behaviour":[5],"of":[6,19,29,39,45,65,112,129,132,172,176,187,208,220],"a":[7,20,127,169],"branch-and-bound":[8],"algorithm":[9,71,148,189,210],"for":[10,97,211],"calculating":[11],"valid":[12,52],"bounds":[13,54,59,79,96,164],"on":[14,25,55],"kth":[16],"largest":[17],"eigenvalue":[18,100,146,159],"symmetric":[21],"interval":[22,27,43],"matrix.":[23],"Branching":[24],"elements":[28],"matrix":[31],"takes":[32,180],"place":[33,181],"in":[34,48,182,201,213],"conjunction":[35],"with":[36,62,93,109,157],"application":[38],"Rohn's":[40],"method":[41],"(an":[42],"extension":[44],"Weyl's":[46],"theorem)":[47],"order":[49],"to":[50,80,152,215],"obtain":[51],"outer":[53],"eigenvalues.":[57,114],"Inner":[58],"are":[60,165],"obtained":[61,103],"use":[64,212],"two":[66,134],"local":[67,135],"search":[68,136],"methods.":[69],"The":[70,145],"has":[72],"theoretical":[74],"property":[75],"that":[76,191],"it":[77],"provides":[78],"any":[81],"arbitrary":[82],"precision":[83,86],"(assuming":[84],"infinite":[85],"arithmetic)":[87],"within":[88],"finite":[89],"time.":[90],"In":[91,123],"contrast":[92],"existing":[94],"methods,":[95],"each":[98],"individual":[99],"can":[101,194],"be":[102,195],"even":[104],"if":[105],"its":[106],"range":[107,178],"overlaps":[108],"ranges":[111],"other":[113],"Performance":[115],"analysis":[116],"is":[117,138,149,223],"carried":[118],"out":[119],"through":[120],"nine":[121],"examples.":[122],"first":[125,184],"example,":[126],"comparison":[128],"efficiency":[131],"methods":[137],"reported":[139],"using":[140],"4000":[141],"randomly":[142,154],"generated":[143,155],"matrices.":[144],"bounding":[147],"then":[150],"applied":[151],"five":[153],"matrices":[156],"overlapping":[158],"ranges.":[160],"Valid":[161],"sharp":[163],"indeed":[166],"identified":[167],"given":[168],"sufficient":[170],"number":[171],"iterations.":[173],"Furthermore,":[174],"most":[175],"reduction":[179],"few":[185],"steps":[186],"so":[190],"significant":[192],"benefits":[193],"derived":[196],"without":[197],"full":[198],"convergence.":[199],"Finally,":[200],"last":[203],"three":[204],"examples,":[205],"potential":[207],"algorithms":[214],"identify":[216],"index-1":[217],"saddle":[218],"points":[219],"nonlinear":[221],"functions":[222],"demonstrated.":[224]},"counts_by_year":[{"year":2022,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}