Abstract
Hausdorff continuous (H-continuous) functions appear naturally in many areas of mathematics such as Approximation Theory [11], Real Analysis [1], [8], Interval Analysis, [2], etc. From numerical point of view it is significant that the solutions of large classes of nonlinear partial differential equations can be assimilated through H-continuous functions [7]. In particular, discontinuous viscosity solutions are better represented through Hausdorff continuous functions [6]. Hence the need to develop numerical procedures for computations with H-continuous functions. It was shown recently, that the operations addition and multiplication by scalars of the usual continuous functions on \(\Omega\subseteq\mathbb{R}^n\) can be extended to H-continuous functions in such a way that the set ℍ(Ω) of all Hausdorff continuous functions is a linear space [4]. In fact ℍ(Ω) is the largest linear space involving interval functions. Furthermore, multiplication can also be extended [5], so that ℍ(Ω) is a commutative algebra. Approximation of ℍ(Ω) by a subspace were discussed in [3]. In the present paper we consider numerical computations with H-continuous functions using ultra-arithmetical approach [9], namely, by constructing a functoid of H-continuous functions. For simplicity we consider \(\Omega\subseteq\mathbb{R}\). In the next section we recall the definition of the algebraic operations on ℍ(Ω). The concept of functoid is defined in Section 3. In Section 4 we construct a functoid comprising a finite dimensional subspace of ℍ(Ω) with a Fourier base extended by a set of H-continuous functions. Application of the functoid to the numerical solution of the wave equation is discussed in Section 5.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Anguelov, R.: Dedekind order completion of C(X) by Hausdorff continuous functions. Quaestiones Mathematicae 27, 153–170 (2004)
Anguelov, R., Markov, S.: Extended Segment Analysis. Freiburger Intervall-Berichte 10, , 1–63. Inst. Angew. Math., Univ. Freiburg i. Br. (1981)
Anguelov, R., Markov, S., Sendov, B.: On the Normed Linear Space of Hausdorff Continuous Functions. In: Lirkov, I., Margenov, S., Waśniewski, J. (eds.) LSSC 2005. LNCS, vol. 3743, pp. 281–288. Springer, Heidelberg (2006)
Anguelov, R., Markov, S., Sendov, B.: The Set of Hausdorff Continuous Functions—the Largest Linear Space of Interval Functions. Reliable Computing 12, 337–363 (2006)
Anguelov, R., Markov, S., Sendov, B.: Algebraic Operations on the Space of Hausdorff Continuous Interval Functions. In: Bojanov, B.D. (ed.) Constructive Theory of Functions, Varna, 2005, pp. 35–44. Marin Drinov Acad. Publ. House, Sofia (2006)
Anguelov, R., Minani, F.: Interval Viscosity Solutions of Hamilton-Jacobi Equations. Technical Report UPWT 2005/3, University of Pretoria (2005)
Anguelov, R., Rosinger, E.E.: Hausdorff Continuous Solutions of Nonlinear PDEs through the Order Completion Method. Quaestiones Mathematicae 28(3), 271–285 (2005)
Anguelov, R., van der Walt, J.H.: Order Convergence Structure on C(X). Quaestiones Mathematicae 28(4), 425–457 (2005)
Epstein, C., Miranker, W.L., Rivlin, T.J.: Ultra Arithmetic, Part I: Function Data Types, Part 2: Intervals of Polynomials. Mathematics and Computers in Simulation 24, 1–18 (1982)
Kaucher, E., Miranker, W.: Self-Validating Numerics for Function Space Problems. Academic Press, New York (1984)
Sendov, B.: Hausdorff Approximations. Kluwer Academic Publishers, Dordrecht (1990)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Anguelov, R., Markov, S. (2007). Numerical Computations with Hausdorff Continuous Functions. In: Boyanov, T., Dimova, S., Georgiev, K., Nikolov, G. (eds) Numerical Methods and Applications. NMA 2006. Lecture Notes in Computer Science, vol 4310. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70942-8_33
Download citation
DOI: https://doi.org/10.1007/978-3-540-70942-8_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-70940-4
Online ISBN: 978-3-540-70942-8
eBook Packages: Computer ScienceComputer Science (R0)