A local convergence proof for the minvar algorithm for computing continuous piecewise linear approximations

SIAM Journal on Numerical Analysis

Volumn 41, Issue 3, 2003, Pages 983-1007

  Groff, Richard E ^a   Khargonekar, Pramod P ^a,b   Koditschek, Daniel E ^a  

^a The Department of Civil and Environmental Engineering   (United States)

^b UNIVERSITY OF FLORIDA   (United States)

Author keywords

Invertible approximation; Moving mesh; Piecewise linear; Triangulation

Indexed keywords

INEVITABLE APPROXIMATIONS; MOVING MESH; PIECEWISE LINEAR; TRIANGULATIONS;

ALGORITHMS; APPROXIMATION THEORY; CONTROL SYSTEMS; CONVERGENCE OF NUMERICAL METHODS; DATA REDUCTION; FUNCTIONS; MATHEMATICAL MODELS; PARAMETER ESTIMATION; POLYNOMIALS; PROBLEM SOLVING; ROBOTICS; TENSORS;

PIECEWISE LINEAR TECHNIQUES;

EID: 3142721126     PISSN: 00361429     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0036142902402213     Document Type: Article

References (42)

1. C. G. ATKESON, A. W. MOORE, AND S. SCHAAL, Locally weighted learning, Artificial Intelligence Rev., 11 (1997), pp. 11-73.
2. 2 fits to continuous functions with adjustable nodes in one and two dimensions, Math. Comp., 62 (1994), pp. 645-669.
3. A. R. BARRON, Universal approximation bounds for superpositions of a sigmoidal function, IEEE Trans. Inform. Theory, 39 (1993), pp. 930-945.
4. D. L. BARROW, C. K. CHUI, P. W. SMITH, AND J. D. WARD, Unicity of best mean approximation by second order splines with variable knots, Math. Comp., 32 (1978), pp. 1131-1143.
5. K. Q. BROWN, Voronoi diagrams from convex hulls, Inform. Process. Lett., 9 (1979), pp. 223-228.
6. E. W. CHENEY, Introduction to Approximation Theory, McGraw-Hill, New York, 1966.
7. C. K. CHUI, Multivariate Splines, CBMS-NSF Regional Conf. Ser. in Appl. Math 54, SIAM, Philadelphia, 1988.
8. N. J. COWAN, J. D. WEINGARTEN, AND D. E. KODITSCHEK, Visual servoing via navigation functions, IEEE Trans. Rob. Autom., 18 (2002), pp. 521-533.
9. P. J. DAVIS, Interpolation and Approximation, Dover, New York, 1975.
10. C. DE BOOR, K. HÖLLIG, AND S. RIEMENSCHNEIDER, Box Splines, Springer-Verlag, New York, 1993.
11. N. DYN, D. LEVIN, AND S. RIPPA, Algorithms for the construction of data dependent triangulations, in Algorithms for Approximation, II, Chapman and Hall, London, 1990, pp. 185-192.
12. N. DYN, D. LEVIN, AND S. RIPPA, Data dependent triangulations for piecewise linear interpolation, IMA J. Numer. Anal., 10 (1990), pp. 137-154.
13. H. EDELSBRUNNER, Geometry and Topology for Mesh Generation, Cambridge University Press, Cambridge, UK, 2001.
14. H. EDELSBRUNNER AND N. SHAH, Incremental topological flipping works for regular triangulations, Algorithmica, 15 (1996), pp. 223-241.
15. S. FIORI, Probability density function learning by unsupervised neurons, Internat. J. Neural Systems, (2001), pp. 399-417.
16. J. H. FRIEDMAN, Multivariate adaptive regression splines, Ann. Statist., 19 (1991), pp. 1-141.
17. S. FURRY AND J. KAINZ, Rapid algorithm development applied to engine management systems, in Proceedings of the 1998 SAE International Congress & Exposition, Detroit, MI, 1998.
18. 1-approximation via an algorithm, Math. Comp., 65 (1996), pp. 647-660.
19. G. E. GOLUB AND C. F. VAN LOAN, Matrix Computations, The Johns Hopkins University Press, Baltimore, MD, 1996.
20. R. E. GROFF, P. P. KHARGONEKAR, AND D. E. KODITSCHEK, A Local Convergence Proof for the Minvar Algorithm for Computing Continuous Piecewise Linear Approximations, Technical report CSE-TR-464-02, University of Michigan, Ann Arbor, MI, 2002.
21. R. E. GROFF, P. P. KHARGONEKAR, D. E. KODITSCHEK, T. T. THIERET, AND L. MESTHA, Modeling and control of color xerographic processes, in Proceedings of the 38th IEEE Conference on Decision and Control, Vol. 2, Phoenix, AZ, 1999, pp. 1697-1702.
22. R. E. GROFF, D. E. KODITSCHEK, AND P. P. KHARGONEKAR, Piecewise linear homeomorphisms: The scalar case, in Proceedings of the International Joint Conference on Neural Networks, Como, Italy, 2000.
23. R. E. GROFF, D. E. KODITSCHEK, P. P. KHARGONEKAR, AND T. T. THIERET, Representation of color space transformations for effective calibration and control, in IS&T's NIP16: International Conference on Digital Printing Technology, Society for Imaging Science and Technology, Vancouver, BC, Canada, 2000, pp. 255-260.
24. N. HAI, J. NI, AND J. YUAN, Generalized model formulation technique for error synthesis and error compensation on machine tools, in Proceedings of the NAMRX XXVI Conference, Society of Manufacturing Engineers, Atlanta, GA, 1998.
25. J. B. KIOUSTELIDIS, Optimal segmented approximations, Computing, 24 (1980), pp. 1-8.
26. s- approximations, Computing, 26 (1981), pp. 239-246.
27. D. E. KODITSCHEK AND E. RIMON, Robot navigation functions on manifolds with boundary, Adv. in Appl. Math., 11 (1990), pp. 412-442.
28. C. L. LAWSON, Properties of n-dimensional triangulations, Comput. Aided Geom. Design, 3 (1986), pp. 231-246.
29. G. G. LORENTZ, Approximation of Functions, Holt, Rhinehart and Winston, New York, 1966.
30. F. P. PREPARATA AND M. I. SHAMOS, Computational Geometry: An Introduction, Springer-Verlag, New York, 1985.
31. M. H. RAIBERT, Legged Robots That Balance, MIT Press, Cambridge, MA, 1986.
32. E. RIMON AND D. E. KODITSCHEK, The construction of analytic diffeomorphisms for exact robot navigation on star worlds, Trans. Amer. Math. Soc., 327 (1991), pp. 71-115.
33. E. RIMON AND D. E. KODITSCHEK, Exact robot navigation using artificial potential fields, IEEE Trans. Rob. Autom., 8 (1992), pp. 501-518.
34. W. J. SCHWIND AND D. E. KODITSCHEK, Approximating the stance map of a 2 dof monoped runner, J. Nonlinear Sci., 10 (2000), pp. 533-568.
35. E. V. SHIKIN AND A. I. PLIS, Handbook on Splines for the User, CRC Press, Boca Raton, FL, 1995.
36. E. H. SPANIER, Algebraic Topology, McGraw-Hill, New York, 1966.
37. M. SPIVAK, Calculus on Manifolds, Westview Press, Boulder, CO, 1965.
38. C. J. STONE, M. H. HANSEN, C. KOOPERBERG, AND Y. K. TRUONG, Polynomial splines and their tensor products in extended linear modeling, Ann. Statist., 25 (1997), pp. 1371-1470.
39. 2 approximation by discontinuous piecewise polynomials, Math. Comp., 66 (1997), pp. 623-650.
40. Y. TOURIGNY AND F. HÜLSEMANN, A new moving mesh algorithm for the finite element solution of variational problems, SIAM J. Numer. Anal., 35 (1998), pp. 1416-1438.
41. R. WEBSTER, Convexity, Oxford University Press, New York, 1994.
42. J. C. ZIEGERT AND P. DATSERIS, Basic considerations for robot calibration, International Journal of Robotics and Automation, 4 (1989), pp. 158-166.