Related papers: Series Crimes
It is well known that the Taylor series expansion of $(1+ z)^{A}$ does not converge for $|z|>1$ where A is a real number which is not equal to zero or a positive integer. A limited series expansion of this expression is obtained in this…
By using computers to do experimental manipulations on Fourier series, we construct additional series with interesting properties. We construct several series whose sums remain unchanged when the $n^{th}$ term is multiplied by $\sin(n)/n$.…
This paper focuses on the study of the order of power series that are linear combinations of a given finite set of power series. The order of a formal power series, known as $\textrm{ord}(f)$, is defined as the minimum exponent of $x$ that…
The convergence of DP Fourier series which are neither strongly convergent nor strongly divergent is discussed in terms of the Taylor series of the corresponding inner analytic functions. These are the cases in which the maximum disk of…
Linear second order differential equations of the form $d^{2}w/dz^{2}-\left \{ {u^{2}f\left( u,z\right) +g\left( z\right) }\right\} w=0$ are studied, where $\left| u\right| \rightarrow \infty $ and $z$ lies in a complex bounded or unbounded…
Computers calculate transcendental functions by approximating them through the composition of a few limited-precision instructions. For example, an exponential can be calculated with a Taylor series. These approximation methods were…
Marginalization -- summing a function over all assignments to a subset of its inputs -- is a fundamental computational problem with applications from probabilistic inference to formal verification. Despite its computational hardness in…
Fuzzy logic programming is a growing declarative paradigm aiming to integrate fuzzy logic into logic programming. One of the most difficult tasks when specifying a fuzzy logic program is determining the right weights for each rule, as well…
The problem considered is the computation of an infinite product (composition) of Lie transformations generated by homogeneous polynomials of increasing order from a given convergent power series. Bounds are computed for the infinitesimal…
A numerical scheme is developed for the evaluation of Abramowitz functions $J_n$ in the right half of the complex plane. For $n=-1,\, \ldots,\, 2$, the scheme utilizes series expansions for $|z|<1$ and asymptotic expansions for $|z|>R$ with…
Fourier series approximations of continuous but nonperiodic functions on an interval suffer the Gibbs phenomenon, which means there is a permanent oscillatory overshoot in the neighbourhoods of the endpoints. Fourier extensions circumvent…
The objective of this paper is to show (a)=(b)=(c) as rational functions of $T$, $U$ for (a), (b), (c) given by (a) continued fractions of length $2^{n+1}-1$ with explicit partial denominators in $\left\{-T,U^{-1}T\right\}$, (b) truncated…
We introduce the error-sum function of Pierce expansions. Some basic properties of the error-sum function are analyzed. We also examine the fractal property of the graph of it by calculating the Hausdorff dimension, the box-counting…
In practice , quite often there is a need to describe the values set by means of a table in the form of some functional dependence . The observed values , due to certain circumstances , have an error . For approximation, it is advisable to…
The classical Castelnuovo numbers count linear series of minimal degree and fixed dimension on a general curve, in the case when this number is finite. For pencils, that is, linear series of dimension one, the Castelnuovo numbers specialize…
The lattice point problems of the $p$-circle (for example, the astroid), which a generalized circle for positive real numbers $p$, have been solved for approximately $p$ more than 3, based on the series representation of the error term…
For lambda phi^4 problems, convergent perturbative series can be obtained by cutting off the large field configurations. The modified series converge to values exponentially close to the exact ones. For lambda larger than some critical…
Fully automatic worst-case complexity analysis has a number of applications in computer-assisted program manipulation. A classical and powerful approach to complexity analysis consists in formally deriving, from the program syntax, a set of…
Floating-point addition on a finite-precision machine is not associative, so not all mathematically equivalent summations are computationally equivalent. Making this assumption can lead to numerical error in computations. Proper ordering…
Time series analysis is widely used in many fields such as power energy, economics, and transportation, including different tasks such as forecasting, anomaly detection, classification, etc. Missing values are widely observed in these…