{"id":"https://openalex.org/W2102791647","doi":"https://doi.org/10.1080/00207169808804625","title":"A modification of krawczyk's algorithm","display_name":"A modification of krawczyk's algorithm","publication_year":1998,"publication_date":"1998-01-01","ids":{"openalex":"https://openalex.org/W2102791647","doi":"https://doi.org/10.1080/00207169808804625","mag":"2102791647"},"language":"en","primary_location":{"id":"doi:10.1080/00207169808804625","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207169808804625","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","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/A5101608029","display_name":"D. K. Gupta","orcid":"https://orcid.org/0009-0005-9776-7404"},"institutions":[{"id":"https://openalex.org/I145894827","display_name":"Indian Institute of Technology Kharagpur","ror":"https://ror.org/03w5sq511","country_code":"IN","type":"education","lineage":["https://openalex.org/I145894827"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"D. K. Gupta","raw_affiliation_strings":["Department of Mathematics , Indian Institute of Technology , Kharagpur, 721302, India"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics , Indian Institute of Technology , Kharagpur, 721302, India","institution_ids":["https://openalex.org/I145894827"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5076295200","display_name":"Chaitanya Kaul","orcid":"https://orcid.org/0000-0003-4893-6222"},"institutions":[{"id":"https://openalex.org/I145894827","display_name":"Indian Institute of Technology Kharagpur","ror":"https://ror.org/03w5sq511","country_code":"IN","type":"education","lineage":["https://openalex.org/I145894827"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"C. N. Kaul","raw_affiliation_strings":["Department of Mathematics , Indian Institute of Technology , Kharagpur, 721302, India"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics , Indian Institute of Technology , Kharagpur, 721302, India","institution_ids":["https://openalex.org/I145894827"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5101608029"],"corresponding_institution_ids":["https://openalex.org/I145894827"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.2623695,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"66","issue":"1-2","first_page":"67","last_page":"77"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12661","display_name":"Iterative Methods for Nonlinear Equations","score":0.9988999962806702,"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":0.9988999962806702,"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/T11697","display_name":"Numerical Methods and Algorithms","score":0.9987999796867371,"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/T10792","display_name":"Matrix Theory and Algorithms","score":0.9969000220298767,"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/mathematics","display_name":"Mathematics","score":0.8848215341567993},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6868919134140015},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5457339882850647},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.48063793778419495},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.433594286441803},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.10047858953475952},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.06198716163635254},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.06157642602920532}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8848215341567993},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6868919134140015},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5457339882850647},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.48063793778419495},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.433594286441803},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.10047858953475952},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.06198716163635254},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.06157642602920532},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/00207169808804625","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207169808804625","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W126544226","https://openalex.org/W159007188","https://openalex.org/W371260589","https://openalex.org/W436146918","https://openalex.org/W1482694871","https://openalex.org/W1532036648","https://openalex.org/W1568947387","https://openalex.org/W1582982178","https://openalex.org/W1970950594","https://openalex.org/W1979743279","https://openalex.org/W1989836539","https://openalex.org/W2000571720","https://openalex.org/W2038920498","https://openalex.org/W2054436082","https://openalex.org/W2056784223","https://openalex.org/W2063023004","https://openalex.org/W2068167196","https://openalex.org/W2070381457","https://openalex.org/W2106719661","https://openalex.org/W2124456854","https://openalex.org/W2398865198"],"related_works":["https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W4245490552","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W1587224694","https://openalex.org/W2042127053","https://openalex.org/W2142036596","https://openalex.org/W4287117439"],"abstract_inverted_index":{"A":[0],"modification":[1],"of":[2,34,61,82,84,103],"Krawczyk's":[3,35,56,67,123],"algorithm":[4,36,53,68],"is":[5,15,23,44,63,98],"proposed":[6],"both":[7],"in":[8],"one":[9],"and":[10,27,106],"n-dimensional":[11],"real":[12],"spaces.":[13],"This":[14,48],"done":[16],"by":[17],"introducing":[18],"a":[19,101],"control-factor":[20],"\u03b3":[21,43],"which":[22],"to":[24,64,77,93],"be":[25],"determined":[26],"used":[28],"only":[29],"when":[30],"the":[31,51,66,80,85,115,121],"convergence":[32,73,83],"conditions":[33],"are":[37,75,109],"violated.":[38],"In":[39,111],"all":[40,113],"other":[41],"cases":[42],"chosen":[45],"as":[46,69],"one.":[47],"means":[49],"that":[50,79],"modified":[52,86,96,116],"works":[54,118],"like":[55],"algorithm.":[57],"The":[58,72,95],"main":[59],"purpose":[60],"this":[62],"make":[65],"unfailingly":[70],"convergent.":[71],"theorems":[74],"established":[76],"show":[78],"rate":[81],"method":[87,97,117],"has":[88],"been":[89],"enhanced":[90],"from":[91],"linear":[92],"quadratic.":[94],"tested":[99],"on":[100],"number":[102],"numerical":[104],"examples":[105],"their":[107],"results":[108],"enclosed.":[110],"almost":[112],"cases,":[114],"faster":[119],"than":[120],"usual":[122],"method.":[124]},"counts_by_year":[{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}