Students’ Development of a Logarithm Function in Python Using Taylor Expansions: A Teaching Design Case Study

We present here the lessons learned by iteratively designing a tutorial for first-year university students using computer programming to work with mathematical models. Alternating between design and implementation, we used video-taped task interviews and classroom observations to ensure that the design promoted student understanding. The final version of the tutorial we present here has students make their own logarithm function from scratch, using Taylor polynomials. To ensure that the resulting function is accurate and reasonably fast, the students have to understand and apply concepts from both computing and mathematics. We identify four categories of such concepts and identify three design features that students attended to when demonstrating such understandings. Additionally, we describe seven important take-aways from a teaching design point of view that resulted from this iterative design process.

Norm approximation by Taylor polynomials in Hardy and Bergman spaces

For positive [Formula: see text] and real [Formula: see text] let [Formula: see text] denote the weighted Bergman spaces of the unit ball [Formula: see text] introduced in [R. Zhao and K. Zhu, Theory of Bergman Spaces on the Unit Ball in [Formula: see text], Mémoires de la Société Mathématique de France, Vol. 115 (2008)]. It is well known that, at least in the case [Formula: see text], all functions in [Formula: see text] can be approximated in norm by their Taylor polynomials if and only if [Formula: see text]. In this paper we show that, for [Formula: see text] with [Formula: see text], we always have [Formula: see text] as [Formula: see text], where [Formula: see text] and [Formula: see text] is the [Formula: see text]th Taylor polynomial of [Formula: see text]. We also show that for every [Formula: see text] in the Hardy space [Formula: see text], [Formula: see text], we always have [Formula: see text] as [Formula: see text], where [Formula: see text]. This generalizes and improves a result in [J. McNeal and J. Xiong, Norm convergence of partial sums of [Formula: see text] functions, Internat. J. Math. 29 (2018) 1850065, 10 pp.].

Classes of Entire Analytic Functions of Unbounded Type on Banach Spaces

In this paper we investigate analytic functions of unbounded type on a complex infinite dimensional Banach space X. The main question is: under which conditions is there an analytic function of unbounded type on X such that its Taylor polynomials are in prescribed subspaces of polynomials? We obtain some sufficient conditions for a function f to be of unbounded type and show that there are various subalgebras of polynomials that support analytic functions of unbounded type. In particular, some examples of symmetric analytic functions of unbounded type are constructed.

Taylor collocation method for a system of nonlinear Volterra delay integro-differential equations with application to COVID-19 epidemic

The present paper deals with the numerical solution for a general form of a system of nonlinear Volterra delay integro-differential equations (VDIDEs). The main purpose of this work is to provide a current numerical method based on the use of continuous collocation Taylor polynomials for the numerical solution of nonlinear VDIDEs systems. It is shown that this method is convergent. Numerical results will be presented to prove the validity and effectiveness of this convergent algorithm. We apply two models to the COVID-19 epidemic in China and one for the Predator-Prey model in mathematical ecology.

Treatment a New Approximation Method and Its Justification for Sturm–Liouville Problems

In this paper, we propose a new approximation method (we shall call this method as α-parameterized differential transform method), which differs from the traditional differential transform method in calculating the coefficients of Taylor polynomials. Numerical examples are presented to illustrate the efficiency and reliability of our own method. Namely, two Sturm–Liouville problems are solved by the present α-parameterized differential transform method, and the obtained results are compared with those obtained by the classical DTM and by the analytical method. The result reveals that α-parameterized differential transform method is a simple and effective numerical algorithm.