#### Filter Results:

#### Publication Year

2002

2005

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Spencer D. Shellman, Christopher A. Sikorski
- J. Complexity
- 2003

We present the PFix algorithm for the fixed point problem f ðxÞ ¼ x on a nonempty domain

- Spencer D. Shellman, Kris Sikorski
- J. Complexity
- 2002

In this paper we present a new algorithm for the two-dimensional fixed point problem f(x)=x on the domain [0, 1] × [0, 1], where f is a Lipschitz continuous function with respect to the infinity norm, with constant 1. The computed approximation x ˜ satisfies ||f(x ˜) − x ˜||. [ e for a specified tolerance e < 0.5. The upper bound on the number of required… (More)

- Spencer D. Shellman, Kris Sikorski
- ACM Trans. Math. Softw.
- 2003

We present the BEDFix (Bisection Envelope Deep-cut Fixed point) algorithm for the problem of approximating a fixed point of a function of two variables. The function must be Lipschitz continuous with constant 1 with respect to the infinity norm; such functions are commonly found in economics and game theory. The computed approximation satisfies a residual… (More)

- Spencer D. Shellman, Kris Sikorski
- ACM Trans. Math. Softw.
- 2005

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… (More)

- ‹
- 1
- ›