Title :
Inverse and implicit functions in domain theory
Author :
Edalat, Abbas ; Pattinson, Dirk
Author_Institution :
Dept. of Comput., Imperial Coll., London, UK
Abstract :
We construct a domain-theoretic calculus for Lipschitz and differentiate functions, which includes addition, subtraction and composition. We then develop a domain-theoretic version of the inverse function theorem for a Lipschitz function, in which the inverse function is obtained as a fixed point of a Scott continuous functional and is approximated by step functions. In the case of a C1 function, the inverse and its derivative are obtained as the least fixed point of a single Scott continuous functional on the domain of differentiable functions and are approximated by two sequences of step functions, which are effectively computed from two increasing sequences of step functions respectively converging to the original function and its derivative. In this case, we also effectively obtain an increasing sequence of polynomial step functions whose lower and upper bounds converge in the C1 norm to the inverse function. A similar result holds for implicit functions, which combined with the domain-theoretic model for computational geometry, provides a robust technique for construction of curves and surfaces.
Keywords :
approximation theory; computational geometry; convergence of numerical methods; curve fitting; formal logic; polynomials; sequences; surface fitting; Lipschitz function; Scott continuous functional; computational geometry; curve construction; differentiable function; domain-theoretic calculus; implicit function; inverse fuction; surface construction; Application software; Calculus; Computational geometry; Computational modeling; Educational institutions; Piecewise linear approximation; Polynomials; Robustness; Solid modeling; Upper bound;
Conference_Titel :
Logic in Computer Science, 2005. LICS 2005. Proceedings. 20th Annual IEEE Symposium on
Print_ISBN :
0-7695-2266-1
DOI :
10.1109/LICS.2005.22