{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T06:50:46Z","timestamp":1776840646622,"version":"3.51.2"},"reference-count":12,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T00:00:00Z","timestamp":1133395200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Math. Softw."],"published-print":{"date-parts":[[2005,12]]},"abstract":"<jats:p>\n            We present the PFix algorithm for approximating a fixed point of a function f that has arbitrary dimensionality, is defined on a rectangular domain, and is Lipschitz continuous with respect to the infinity norm with constant 1. PFix has applications in economics, game theory, and the solution of partial differential equations. PFix computes an approximation that satisfies the residual error criterion, and can also compute an approximation satisfying the absolute error criterion when the Lipschitz constant is less than 1. For functions defined on all rectangular domains, the worst-case complexity of PFix has order equal to the logarithm of the reciprocal of the tolerance, raised to the power of the dimension. Dividing this order expression by the factorial of the dimension yields the order of the worst-case bound for the case of the unit hypercube. PFix is a recursive algorithm, in that it uses solutions to a\n            <jats:italic>d<\/jats:italic>\n            -dimensional problem to compute a solution to a (\n            <jats:italic>d<\/jats:italic>\n            + 1)-dimensional problem. A full analysis of PFix may be found in Shellman and Sikorski [2003b], and a C implementation is available through ACM ToMS.\n          <\/jats:p>","DOI":"10.1145\/1114268.1114276","type":"journal-article","created":{"date-parts":[[2006,5,8]],"date-time":"2006-05-08T16:09:20Z","timestamp":1147104560000},"page":"580-586","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Algorithm 848"],"prefix":"10.1145","volume":"31","author":[{"given":"Spencer","family":"Shellman","sequence":"first","affiliation":[{"name":"University of Utah, Salt Lake City, UT"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Sikorski","sequence":"additional","affiliation":[{"name":"University of Utah, Salt Lake City, UT"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2005,12]]},"reference":[{"key":"e_1_2_2_1_1","doi-asserted-by":"crossref","unstructured":"Allgower G. and Georg K. 1990. Numerical Continuation Methods. Springer-Verlag New York NY and Berlin Germany.   Allgower G. and Georg K. 1990. Numerical Continuation Methods. Springer-Verlag New York NY and Berlin Germany.","DOI":"10.1007\/978-3-642-61257-2"},{"key":"e_1_2_2_2_1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01584975","article-title":"Homotopies for computation of fixed points","volume":"3","author":"Eaves B.","year":"1972","journal-title":"Math. Programm."},{"key":"e_1_2_2_3_1","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/BF01584991","article-title":"Homotopies for computation of fixed points on unbounded regions","volume":"3","author":"Eaves B.","year":"1972","journal-title":"Math. Programm."},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/0885-064X(89)90017-4"},{"key":"e_1_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcom.1999.0504"},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/0885-064X(91)90001-E"},{"key":"e_1_2_2_7_1","unstructured":"Nemirovsky A. 2000. Private communication.  Nemirovsky A. 2000. Private communication."},{"key":"e_1_2_2_8_1","doi-asserted-by":"crossref","first-page":"1328","DOI":"10.1137\/0115116","article-title":"The approximation of fixed points of a continuous mapping","volume":"15","author":"Scarf M.","year":"1967","journal-title":"SIAM J. Appl. Math."},{"key":"e_1_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcom.2001.0606"},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/838250.838255"},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jco.2003.06.001"},{"key":"e_1_2_2_12_1","doi-asserted-by":"crossref","volume-title":"Optimal Solution of Nonlinear Equations","author":"Sikorski K.","DOI":"10.1093\/oso\/9780195106909.001.0001"}],"container-title":["ACM Transactions on Mathematical Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1114268.1114276","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1114268.1114276","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:08:38Z","timestamp":1750262918000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1114268.1114276"}},"subtitle":["A recursive fixed-point algorithm for the infinity-norm case"],"short-title":[],"issued":{"date-parts":[[2005,12]]},"references-count":12,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2005,12]]}},"alternative-id":["10.1145\/1114268.1114276"],"URL":"https:\/\/doi.org\/10.1145\/1114268.1114276","relation":{},"ISSN":["0098-3500","1557-7295"],"issn-type":[{"value":"0098-3500","type":"print"},{"value":"1557-7295","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,12]]},"assertion":[{"value":"2005-12-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}