Gradually Varied Functions for Advanced Computational Methods

  • Li M. Chen


Gradually varied functions or smooth gradually varied functions were developed for the data reconstruction of randomly arranged data points, usually referred to as scattered points or cloud points in modern information technology. Gradually varied functions have shown advantages when dealing with real world problems. However, the method is still new and not as sophisticated as more classic methods such as the B-spline and finite elements method. The digital-discrete method has another advantage that is to collaborate with these existing methods to make an even better combined approach in applications. We investigate how the gradually varied function can be applied to more advanced computational methods. We first discuss harmonic analysis, B-spline, and finite element methods. Then we give a new consideration for the smooth function definitions in real world problems. This chapter makes more connections to the mathematical aspects of digital functions.


Finite Element Method Harmonic Function Finite Difference Method Varied Function Real World Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Chen L (1985) Three-dimensional fuzzy digital topology and its applications(I). Geophys Prospect Pet 24(2):86–89Google Scholar
  2. 2.
    Chen L (1990) The necessary and sufficient condition and the efficient algorithms for gradually varied fill. Chin Sci Bull 35(10):870–873MATHGoogle Scholar
  3. 3.
    Chen L (1990) Gradually varied surfaces and gradually varied functions, in Chinese. In English 2005 CITR-TR 156, University of AucklandGoogle Scholar
  4. 4.
    Chen L (1991) The lambda-connected segmentation and the optimal algorithm for split-and-merge segmentation. Chin J Comput 14:321–331Google Scholar
  5. 5.
    Chen L (1992) Random gradually varied surface fitting. Chin Sci Bull 37(16):1325–1329MATHGoogle Scholar
  6. 6.
    Chen L (2004) Discrete surfaces and manifolds. Scientific and Practical Computing, RockvilleGoogle Scholar
  7. 7.
    DimmiCk AC (2007) Effects of sheet moisture and calendar pressure on PCC and GCC coated papers. Tappi J 6(11):16–22.Google Scholar
  8. 8.
    Fausett L (2003) Numerical methods: algorithms and applications. Prentice Hall, Upper Saddle RiverGoogle Scholar
  9. 9.
    Federer H (1969) Geometric measure theory. Springer, Berlin/Heidelberg/New York, p 202MATHGoogle Scholar
  10. 10.
    Fefferman C (2009) Whitney’s extension problems and interpolation of data. Bull Amer Math Soc 46:207–220MathSciNetMATHCrossRefGoogle Scholar
  11. 11.
    Gollub JP, Baker GL (1996) Chaotic dynamics. Cambridge University Press, Cambridge/ New YorkGoogle Scholar
  12. 12.
    Kirszbraun MD (1934) Über die zusammenziehende und lipschitzsche transformationen. Fund Math (22):77–108Google Scholar
  13. 13.
    Krantz SG (1983) Lipschitz spaces, smoothness of functions, and approximation theory. Expos Math 3:193–260MathSciNetGoogle Scholar
  14. 14.
    Kreyszig E (1991) Differential geometry. Dover Books on Mathematics, New YorkGoogle Scholar
  15. 15.
    Li TY, Yorke JA (1975) Period three implies chaos. Am Math Mon 82:985–92MathSciNetMATHCrossRefGoogle Scholar
  16. 16.
    Lovasz L (2004) Discrete analytic functions: a survey. Surveys in differential geometry IX. In: Grigor A, Yau S-T (ed) Eigenvalues of laplacians and other geometric operators. International Press, SomervilleGoogle Scholar
  17. 17.
    Luo F (2008) Variational principles on triangulated surfaces.
  18. 18.
    McShane EJ (1934) Extension of range of functions. Bull Am Math Soc 40:837–842MathSciNetCrossRefGoogle Scholar
  19. 19.
    Quarteroni A (2009) Numberical models for differential problems. Springer, Milan/New YorkCrossRefGoogle Scholar
  20. 20.
    Rosenfeld A (1979) Fuzzy digital topology. Inform Control 40:76–87MathSciNetMATHCrossRefGoogle Scholar
  21. 21.
    Rosenfeld A (1984) The fuzzy geometry of image subsets. Pattern Recognit Lett 2:311–317CrossRefGoogle Scholar
  22. 22.
    Rosenfeld A (1986) ‘Continuous’ functions on digital pictures. Pattern Recognit Lett 4:177–184MATHCrossRefGoogle Scholar
  23. 23.
    Schwartz JT (1969) Nonlinear functional analysis. Gordon and Breach Science Publishers, New YorkMATHGoogle Scholar
  24. 24.
    Sharkovskii AN (1964) Co − existence of cycles of a continuous mapping of the line into itself. Ukr Math J 16:61–71Google Scholar
  25. 25.
    Taylor CJ (2003) Advanced machine clothing to optimize board smoothness and machine efficiencies. In 57th Appita annual conference and exhibition, Melbourne, Australia 5–7 May 2003 Proceedings. Appita Inc., Carlton, pp 17–23Google Scholar
  26. 26.
    Valentine FA (1943) On the extension of a vector function so as to preserve a Lipschitz condition. Bull Am Math Soc 49:100–108MathSciNetMATHCrossRefGoogle Scholar
  27. 27.
    Valentine FA (1945) A Lipschitz condition preserving extension for a vector function. Am J Math 67(1):83–93MathSciNetMATHCrossRefGoogle Scholar
  28. 28.
    Whitney H (1934) Analytic extensions of functions defined in closed sets. Trans. Am Math Soc 36:63–89MathSciNetCrossRefGoogle Scholar
  29. 29.
    Zadeh LA (1965) Fuzzy sets. Inform Control 8:338–353MathSciNetMATHCrossRefGoogle Scholar
  30. 30.
    Zienkiewicz OC, Taylor RL (1989) The finite element method. McGraw-Hill, LondonGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2013

Authors and Affiliations

  • Li M. Chen
    • 1
  1. 1.University of the District of ColumbiaWashingtonUSA

Personalised recommendations