{"id":"https://openalex.org/W2903253245","doi":"https://doi.org/10.1137/18m1175070","title":"Tree Approximation for hp-Adaptivity","display_name":"Tree Approximation for hp-Adaptivity","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2903253245","doi":"https://doi.org/10.1137/18m1175070","mag":"2903253245"},"language":"en","primary_location":{"id":"doi:10.1137/18m1175070","is_oa":false,"landing_page_url":"https://doi.org/10.1137/18m1175070","pdf_url":null,"source":{"id":"https://openalex.org/S203348814","display_name":"SIAM Journal on Numerical Analysis","issn_l":"0036-1429","issn":["0036-1429","1095-7170"],"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 Numerical Analysis","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/A5048690078","display_name":"Peter Binev","orcid":"https://orcid.org/0009-0006-8822-8705"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Peter Binev","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5048690078"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.7069,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.86699303,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"56","issue":"6","first_page":"3346","last_page":"3357"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9993000030517578,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9993000030517578,"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/T12404","display_name":"Mathematical Approximation and Integration","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.9983999729156494,"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/mathematics","display_name":"Mathematics","score":0.7823487520217896},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.682214081287384},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6534720659255981},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.5943576693534851},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5830568075180054},{"id":"https://openalex.org/keywords/approximation-error","display_name":"Approximation error","score":0.5726415514945984},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5686032176017761},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.5326699018478394},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5224860310554504},{"id":"https://openalex.org/keywords/sigma","display_name":"Sigma","score":0.5172691941261292},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.5113674998283386},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.4751734137535095},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4417823851108551},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.43938177824020386},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.20327427983283997},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.17345017194747925},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.1190502941608429},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.06975075602531433},{"id":"https://openalex.org/keywords/quantum-mechanics","display_name":"Quantum mechanics","score":0.06723341345787048}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7823487520217896},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.682214081287384},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6534720659255981},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.5943576693534851},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5830568075180054},{"id":"https://openalex.org/C122383733","wikidata":"https://www.wikidata.org/wiki/Q865920","display_name":"Approximation error","level":2,"score":0.5726415514945984},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5686032176017761},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.5326699018478394},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5224860310554504},{"id":"https://openalex.org/C2778049214","wikidata":"https://www.wikidata.org/wiki/Q7512234","display_name":"Sigma","level":2,"score":0.5172691941261292},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.5113674998283386},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.4751734137535095},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4417823851108551},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.43938177824020386},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.20327427983283997},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.17345017194747925},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.1190502941608429},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.06975075602531433},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.06723341345787048},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/18m1175070","is_oa":false,"landing_page_url":"https://doi.org/10.1137/18m1175070","pdf_url":null,"source":{"id":"https://openalex.org/S203348814","display_name":"SIAM Journal on Numerical Analysis","issn_l":"0036-1429","issn":["0036-1429","1095-7170"],"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 Numerical Analysis","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W2082131680","https://openalex.org/W2084743165","https://openalex.org/W2561464542","https://openalex.org/W2780989679","https://openalex.org/W2782548004"],"related_works":["https://openalex.org/W2110817230","https://openalex.org/W3091355678","https://openalex.org/W1606488336","https://openalex.org/W1988569331","https://openalex.org/W4255193494","https://openalex.org/W189995875","https://openalex.org/W2284958355","https://openalex.org/W2962894463","https://openalex.org/W2950077880","https://openalex.org/W4301487118"],"abstract_inverted_index":{"The":[0,50,118],"hp-adaptive":[1,140],"approximation":[2,7,73,83,157,176],"is":[3,25,43,62,161,169],"formulated":[4],"as":[5,133],"an":[6,22,77],"problem":[8,86],"on":[9,74],"a":[10,29,100,104,134],"full":[11,120],"binary":[12,121],"tree":[13,92,106,122],"$T$,":[14],"where":[15,165],"for":[16,70,80,84,138],"each":[17,111],"of":[18,34,47,57,65,87,114,136,155,158,172,177],"the":[19,32,45,48,55,58,63,66,71,85,89,143,147,153,170,173],"leaves":[20,51,109,128],"$\\Delta$":[21,52,113],"order":[23],"$p(\\Delta)\\ge1$":[24],"assigned":[26],"in":[27],"such":[28],"way":[30],"that":[31,102,152],"sum":[33],"all":[35],"orders":[36],"$p(\\Delta)$":[37,61,96,108],"does":[38],"not":[39],"exceed":[40],"$N$,":[41],"which":[42],"called":[44],"complexity":[46,159,178],"approximation.":[49],"correspond":[53],"to":[54,98,110],"cells":[56],"partition,":[59],"while":[60],"dimension":[64],"polynomial":[67],"space":[68],"used":[69,132],"local":[72,148],"$\\Delta$.":[75],"Devising":[76],"incremental":[78],"algorithm":[79],"near-best":[81],"adaptive":[82],"finding":[88],"best":[90,174],"possible":[91,175],"$T$":[93,115,137],"and":[94,129],"assignments":[95],"leads":[97],"building":[99],"construction":[101],"attaches":[103],"ghost":[105],"with":[107,116],"leaf":[112],"$p(\\Delta)>1$.":[117],"resulting":[119],"$\\mathcal{T}$":[123],"has":[124],"at":[125],"most":[126],"$N$":[127,160],"can":[130],"be":[131],"proxy":[135],"assembling":[139],"procedures.":[141],"Under":[142],"standard":[144],"assumptions":[145],"about":[146],"errors,":[149],"we":[150],"prove":[151],"error":[154,171],"our":[156],"bounded":[162],"by":[163],"$\\frac{2N-1}{N-n+1}\\sigma_n$,":[164],"$\\sigma_n$,":[166],"$n\\le":[167],"N$,":[168],"$n$.":[179]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1}],"updated_date":"2026-03-15T09:29:46.208133","created_date":"2025-10-10T00:00:00"}