{"id":"https://openalex.org/W770402708","doi":null,"title":"A Polynomial Time, Numerically Stable Integer Relation Algorithm","display_name":"A Polynomial Time, Numerically Stable Integer Relation Algorithm","publication_year":1998,"publication_date":"1998-01-01","ids":{"openalex":"https://openalex.org/W770402708","mag":"770402708"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.117.9821","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.117.9821","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://crd.lbl.gov/~dhbailey/dhbpapers/pslq.pdf","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5110278018","display_name":"Helaman Rolfe Pratt Ferguson","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Helaman Ferguson","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5034744726","display_name":"Daivd H. Bailey","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I4210124779","display_name":"National Aeronautics and Space Administration","ror":"https://ror.org/027ka1x80","country_code":"US","type":"government","lineage":["https://openalex.org/I4210124779"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Daivd H. Bailey","raw_affiliation_strings":["NASA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"NASA","institution_ids":["https://openalex.org/I4210124779"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5062878558","display_name":"Paul Kutler","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Paul Kutler","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.4094,"has_fulltext":false,"cited_by_count":113,"citation_normalized_percentile":{"value":0.9283237,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":95,"max":99},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T13806","display_name":"Mathematical and Computational Methods","score":0.35989999771118164,"subfield":{"id":"https://openalex.org/subfields/2611","display_name":"Modeling and Simulation"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T13806","display_name":"Mathematical and Computational Methods","score":0.35989999771118164,"subfield":{"id":"https://openalex.org/subfields/2611","display_name":"Modeling and Simulation"},"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/T11435","display_name":"Polynomial and algebraic computation","score":0.24889999628067017,"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/T11191","display_name":"Mathematical functions and polynomials","score":0.13670000433921814,"subfield":{"id":"https://openalex.org/subfields/2604","display_name":"Applied Mathematics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/pslq-algorithm","display_name":"PSLQ algorithm","score":0.9860000014305115},{"id":"https://openalex.org/keywords/numerical-stability","display_name":"numerical stability","score":0.9039999842643738},{"id":"https://openalex.org/keywords/polynomial-time-complexity","display_name":"polynomial complexity","score":0.6990000009536743},{"id":"https://openalex.org/keywords/matrix-reduction","display_name":"matrix reduction","score":0.8809999823570251},{"id":"https://openalex.org/keywords/numerical-precision","display_name":"numerical precision","score":0.4440000057220459}],"concepts":[{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.7414992451667786},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.694831132888794},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6278272867202759},{"id":"https://openalex.org/C25343380","wikidata":"https://www.wikidata.org/wiki/Q277521","display_name":"Relation (database)","level":2,"score":0.6180111765861511},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5338946580886841},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.46851846575737},{"id":"https://openalex.org/C112972136","wikidata":"https://www.wikidata.org/wiki/Q7595718","display_name":"Stability (learning theory)","level":2,"score":0.4570174515247345},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.44690603017807007},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.41474539041519165},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3876167833805084},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.21578246355056763},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"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/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.117.9821","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.117.9821","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://crd.lbl.gov/~dhbailey/dhbpapers/pslq.pdf","raw_type":"text"},{"id":"mag:770402708","doi":null,"is_oa":false,"landing_page_url":"http://crd.lbl.gov/~dhbailey/dhbpapers/pslq.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1480928214","https://openalex.org/W1990716382","https://openalex.org/W2027157239","https://openalex.org/W2040569180","https://openalex.org/W2069842959","https://openalex.org/W2141040012","https://openalex.org/W2150780437","https://openalex.org/W2798909945"],"related_works":["https://openalex.org/W1543212221","https://openalex.org/W7101151995","https://openalex.org/W2103236565","https://openalex.org/W2426210453","https://openalex.org/W7099753346","https://openalex.org/W7099577007","https://openalex.org/W1980758215","https://openalex.org/W1566281515","https://openalex.org/W7096670794","https://openalex.org/W2599577807"],"abstract_inverted_index":{"Let":[0],"x":[1,10],"=(x1,x2,":[2],"\u00b7\u00b7\u00b7,xn)":[3],"be":[4,193],"a":[5,85,105,132,135,143,151],"vector":[6],"of":[7,56,64,71,77,92,137],"real":[8],"numbers.":[9],"is":[11,121,140,158],"said":[12],"to":[13,47,94,195],"possess":[14],"an":[15,174],"integer":[16,59,110,167],"relation":[17,60,133,168,198],"if":[18],"there":[19],"exist":[20],"integers":[21],"ai":[22,50],"not":[23],"all":[24],"zero":[25],"such":[26],"that":[27,126,139,164,197],"a1x1":[28],"+":[29,31,34],"a2x2":[30],"\u00b7\u00b7":[32],"\u00b7":[33],"anxn":[35],"=0.":[36],"Beginning":[37],"in":[38,89,98,123,134,145,187],"1977":[39],"several":[40],"algorithms":[41,61,185],"(with":[42],"proofs)":[43],"have":[44,114],"been":[45],"discovered":[46],"recover":[48,96],"the":[49,68,72,75,90,116,127,161],"given":[51],"x.":[52],"The":[53],"most":[54],"efficient":[55,175],"these":[57],"existing":[58],"(in":[62],"terms":[63],"run":[65,179],"time":[66],"and":[67],"precision":[69,87],"required":[70],"input)":[73],"has":[74],"drawback":[76],"being":[78],"very":[79],"unstable":[80],"numerically.":[81],"It":[82,120],"often":[83],"requires":[84],"numeric":[86],"level":[88],"thousands":[91],"digits":[93],"reliably":[95],"relations":[97],"modest-sized":[99],"test":[100],"problems.":[101],"We":[102],"present":[103],"here":[104],"new":[106],"algorithm":[107,129,149,206],"for":[108],"finding":[109],"relations,":[111],"which":[112],"we":[113],"named":[115],"\u201cPSLQ":[117],"\u201d":[118],"algorithm.":[119],"proved":[122],"this":[124,148,190,205],"paper":[125],"PSLQ":[128],"terminates":[130],"with":[131,177],"number":[136],"iterations":[138],"bounded":[141],"by":[142],"polynomial":[144],"n.":[146],"Because":[147],"employs":[150],"numerically":[152,208],"stable":[153],"matrix":[154],"reduction":[155],"procedure,":[156],"it":[157],"free":[159],"from":[160,201],"numerical":[162],"difficulties":[163],"plague":[165],"other":[166,184],"algorithms.":[169],"Furthermore,":[170],"its":[171],"stability":[172,191],"admits":[173],"implementation":[176],"lower":[178],"times":[180],"on":[181],"average":[182],"than":[183],"currently":[186],"use.":[188],"Finally,":[189],"can":[192],"used":[194],"prove":[196],"bounds":[199],"obtained":[200],"computer":[202],"runs":[203],"using":[204],"are":[207],"accurate.":[209]},"counts_by_year":[{"year":2024,"cited_by_count":8},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":9},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":12},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":4}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2016-06-24T00:00:00"}