Global ETD Search

1	Über das Summierungsverfahren von Le Roy Tietz, Hubert, January 1966 (has links) Thesis--Technischen Hochschule, Stuttgart. / Vita. Includes bibliographical references (p. 87-90). Divergent series.
2	Some theorems on the summation of divergent series James, Glenn, January 1917 (has links) Thesis (Ph. D.)--Columbia University, 1918. / Vita. Includes bibliographical references (p. 27). Divergent series.
3	Sommeeren van divergeerende reeksen Deinema, Gerrit. January 1918 (has links) Proefschrift--Groningen. / "Stellingen": 3 p. at end. Bibliographical foot-notes. Divergent series.
4	Summation Methods for Divergent Series O'Neill, James M. 08 1900 (has links) Some of the properties of the specific summation methods will be investigated, such as what type of divergent series a method can or cannot sum, if the insertion of zeros into a series does change the sum, and when different methods give the same sum for a series. summation methods divergent series
5	Error analysis, convergence, divergence, and the acceleration of convergence / Tucker, Richard Ray. January 1963 (has links) Thesis (Ph. D.)--Oregon State University, 1963. / Typescript. Includes bibliographical references (leaves 180-182). Also available on the World Wide Web. Convergence. Divergent series.
6	Eine neue Verallgemeinerung der Borelschen Summabilitätstheorie der divergenten Reihen Doetsch, Gustav, January 1920 (has links) Thesis (doctoral)--Georg-August-Universität zu Göttingen, 1920. / Vita. Includes bibliographical references (p. [53]-54). Divergent series. Summability theory.
7	The summability of infinite series Unknown Date (has links) "The purpose of this paper is to study methods by which a value can be assigned to an infinite series. The reason for studying about these methods lies in the fact that infinite series often appear as the end result of a calculation or computation. A desire to obtain a usable end result leads us to the investigation of methods for evaluating infinite series"--Introduction. / "August, 1955." / Typescript. / Advisor: Howard E. Taylor, Professor Directing Paper. / "Submitted to the Graduate Council of Florida State University in partial fulfillment of the requirements for the degree of Master of Science." / Includes bibliographical references (leaf 40). Divergent series Series, Infinite Summability theory
8	Tomorrow’s Heroines Fighting Today’s Demons: Dystopia in The Hunger Games and Divergent Series Unknown Date (has links) Through a close analysis of Suzanne Collins’ Hunger Games series and Veronica Roth’s Divergent series, it will be shown that these two-current young adult dystopian book-film crossovers pose several relevant parallels to contemporary real-world problems. By deciphering a pattern on what garners their popularity, and most importantly analyzing the aspect of why they reached such levels of recognition, we can then begin to close in on just how important these two series are in representing the 21st century young American mindset. Taking into the equation also, how the overall-arching genre of dystopia has evolved with the times and has now adapted to reflect contemporary anxieties and fears. Looking into several elements such as a newfound desire for strong female roles, persuasive antagonists that are inspired by realistic historical precedents, and an unsettling desensitization towards violence and gore, we can then see that the successful equation of The Hunger Games and Divergent series reflects mainstream interests evocatively and effectively. It is not just an intervention into the encompassing utopian/dystopian tradition, but into today’s sociology. / Includes bibliography. / Dissertation (Ph.D.)--Florida Atlantic University, 2018. / FAU Electronic Theses and Dissertations Collection Collins, Suzanne Hunger Games (Series) Roth, Veronica Divergent series Dystopias
9	The use of divergent series in history Birca, Alina 01 January 2004 (has links) In this thesis the author presents a history of non-convergent series which, in the past, played an important role in mathematics. Euler's formula, Stirling's series and Poincare's theory are examined to show the development of asymptotic series, a subdivision of divergent series. Leonhard Euler James Stirling Henri Poincaré Asymptotic expansion Divergent series Linear Differential equations Infinite Series Mathematics
10	Counting prime polynomials and measuring complexity and similarity of information Rebenich, Niko 02 May 2016 (has links) This dissertation explores an analogue of the prime number theorem for polynomials over finite fields as well as its connection to the necklace factorization algorithm T-transform and the string complexity measure T-complexity. Specifically, a precise asymptotic expansion for the prime polynomial counting function is derived. The approximation given is more accurate than previous results in the literature while requiring very little computational effort. In this context asymptotic series expansions for Lerch transcendent, Eulerian polynomials, truncated polylogarithm, and polylogarithms of negative integer order are also provided. The expansion formulas developed are general and have applications in numerous areas other than the enumeration of prime polynomials. A bijection between the equivalence classes of aperiodic necklaces and monic prime polynomials is utilized to derive an asymptotic bound on the maximal T-complexity value of a string. Furthermore, the statistical behaviour of uniform random sequences that are factored via the T-transform are investigated, and an accurate probabilistic model for short necklace factors is presented. Finally, a T-complexity based conditional string complexity measure is proposed and used to define the normalized T-complexity distance that measures similarity between strings. The T-complexity distance is proven to not be a metric. However, the measure can be computed in linear time and space making it a suitable choice for large data sets. / Graduate / 0544 0984 0405 / nrebenich@gmail.com prime numbers prime polynomials finite fields irreducible polynomials polylogarithm Lerch transcendent Eulerian polynomials T-codes NCD necklaces string complexity information distance divergent series asymptotic approximation randomess test conditional complexity necklace factorization prime number theorem combinatorics T-complexity data mining optimal truncation function fields lyndon words lyndon factorization similarity measure asymptotic enumeration

Search results