{"id":"https://openalex.org/W2099505907","doi":"https://doi.org/10.1007/s006070050017","title":"A Modification of Newton's Method for Analytic Mappings Having Multiple Zeros","display_name":"A Modification of Newton's Method for Analytic Mappings Having Multiple Zeros","publication_year":1999,"publication_date":"1999-04-01","ids":{"openalex":"https://openalex.org/W2099505907","doi":"https://doi.org/10.1007/s006070050017","mag":"2099505907"},"language":"en","primary_location":{"id":"doi:10.1007/s006070050017","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s006070050017","pdf_url":null,"source":{"id":"https://openalex.org/S35593046","display_name":"Computing","issn_l":"0010-485X","issn":["0010-485X","1436-5057"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"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/A5113785844","display_name":"Peter Kravanja","orcid":null},"institutions":[{"id":"https://openalex.org/I99464096","display_name":"KU Leuven","ror":"https://ror.org/05f950310","country_code":"BE","type":"education","lineage":["https://openalex.org/I99464096"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"P. Kravanja","raw_affiliation_strings":["Department of Computer Science, Katholieke Universiteit Leuven, Celestijnenlaan 200 A, B-3001 Heverlee, Belgium, e-mail: Peter.Kravanja@na-net.ornl.gov, Ann.Haegemans@cs.kuleuven.ac.be\n, , , , , , BE","Katholieke Univ., Leuven, Heverlee, , Belgium"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Katholieke Universiteit Leuven, Celestijnenlaan 200 A, B-3001 Heverlee, Belgium, e-mail: Peter.Kravanja@na-net.ornl.gov, Ann.Haegemans@cs.kuleuven.ac.be\n, , , , , , BE","institution_ids":["https://openalex.org/I99464096"]},{"raw_affiliation_string":"Katholieke Univ., Leuven, Heverlee, , Belgium","institution_ids":["https://openalex.org/I99464096"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5114255276","display_name":"Anny Haegemans","orcid":null},"institutions":[{"id":"https://openalex.org/I99464096","display_name":"KU Leuven","ror":"https://ror.org/05f950310","country_code":"BE","type":"education","lineage":["https://openalex.org/I99464096"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"A. Haegemans","raw_affiliation_strings":["Department of Computer Science, Katholieke Universiteit Leuven, Celestijnenlaan 200 A, B-3001 Heverlee, Belgium, e-mail: Peter.Kravanja@na-net.ornl.gov, Ann.Haegemans@cs.kuleuven.ac.be\n, , , , , , BE","Katholieke Univ., Leuven, Heverlee, , Belgium"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Katholieke Universiteit Leuven, Celestijnenlaan 200 A, B-3001 Heverlee, Belgium, e-mail: Peter.Kravanja@na-net.ornl.gov, Ann.Haegemans@cs.kuleuven.ac.be\n, , , , , , BE","institution_ids":["https://openalex.org/I99464096"]},{"raw_affiliation_string":"Katholieke Univ., Leuven, Heverlee, , Belgium","institution_ids":["https://openalex.org/I99464096"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I99464096"],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.24708423,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"62","issue":"2","first_page":"129","last_page":"145"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12661","display_name":"Iterative Methods for Nonlinear Equations","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T12661","display_name":"Iterative Methods for Nonlinear Equations","score":1.0,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9933000206947327,"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/T10792","display_name":"Matrix Theory and Algorithms","score":0.9900000095367432,"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/quadratic-growth","display_name":"Quadratic growth","score":0.8001401424407959},{"id":"https://openalex.org/keywords/newtons-method","display_name":"Newton's method","score":0.7898175120353699},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7321864366531372},{"id":"https://openalex.org/keywords/multiplicity","display_name":"Multiplicity (mathematics)","score":0.7231661081314087},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.5454020500183105},{"id":"https://openalex.org/keywords/root","display_name":"Root (linguistics)","score":0.5439437031745911},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5051193833351135},{"id":"https://openalex.org/keywords/product","display_name":"Product (mathematics)","score":0.47628679871559143},{"id":"https://openalex.org/keywords/iterative-method","display_name":"Iterative method","score":0.431260883808136},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.43098515272140503},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.4104560315608978},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.30702638626098633},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.29585179686546326},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.29110682010650635},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1807648241519928},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.07814091444015503}],"concepts":[{"id":"https://openalex.org/C195956108","wikidata":"https://www.wikidata.org/wiki/Q7268362","display_name":"Quadratic growth","level":2,"score":0.8001401424407959},{"id":"https://openalex.org/C85189116","wikidata":"https://www.wikidata.org/wiki/Q374195","display_name":"Newton's method","level":3,"score":0.7898175120353699},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7321864366531372},{"id":"https://openalex.org/C156004811","wikidata":"https://www.wikidata.org/wiki/Q2228257","display_name":"Multiplicity (mathematics)","level":2,"score":0.7231661081314087},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.5454020500183105},{"id":"https://openalex.org/C171078966","wikidata":"https://www.wikidata.org/wiki/Q111029","display_name":"Root (linguistics)","level":2,"score":0.5439437031745911},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5051193833351135},{"id":"https://openalex.org/C90673727","wikidata":"https://www.wikidata.org/wiki/Q901718","display_name":"Product (mathematics)","level":2,"score":0.47628679871559143},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.431260883808136},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.43098515272140503},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.4104560315608978},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.30702638626098633},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.29585179686546326},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.29110682010650635},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1807648241519928},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.07814091444015503},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"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/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s006070050017","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s006070050017","pdf_url":null,"source":{"id":"https://openalex.org/S35593046","display_name":"Computing","issn_l":"0010-485X","issn":["0010-485X","1436-5057"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computing","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":40,"referenced_works":["https://openalex.org/W31244878","https://openalex.org/W62686475","https://openalex.org/W74726671","https://openalex.org/W333623113","https://openalex.org/W354044861","https://openalex.org/W376038736","https://openalex.org/W390417105","https://openalex.org/W1534005552","https://openalex.org/W1549995565","https://openalex.org/W1970774881","https://openalex.org/W1973600359","https://openalex.org/W1975927407","https://openalex.org/W1977307928","https://openalex.org/W1984396462","https://openalex.org/W1985456081","https://openalex.org/W1985790586","https://openalex.org/W1987284538","https://openalex.org/W1990749444","https://openalex.org/W2017478419","https://openalex.org/W2026697747","https://openalex.org/W2033936708","https://openalex.org/W2034222178","https://openalex.org/W2036702455","https://openalex.org/W2038168000","https://openalex.org/W2043938310","https://openalex.org/W2048632019","https://openalex.org/W2053738112","https://openalex.org/W2054204520","https://openalex.org/W2055048992","https://openalex.org/W2062985118","https://openalex.org/W2073664445","https://openalex.org/W2075521265","https://openalex.org/W2075776392","https://openalex.org/W2080853424","https://openalex.org/W2093101196","https://openalex.org/W2094997497","https://openalex.org/W2125721812","https://openalex.org/W2159522827","https://openalex.org/W2166430540","https://openalex.org/W3102739121"],"related_works":["https://openalex.org/W2044296933","https://openalex.org/W4233380117","https://openalex.org/W2366409812","https://openalex.org/W2377857862","https://openalex.org/W2375228751","https://openalex.org/W2756387619","https://openalex.org/W1990542580","https://openalex.org/W2358591430","https://openalex.org/W2350788688","https://openalex.org/W4323569401"],"abstract_inverted_index":null,"counts_by_year":[{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}