FLQ, the Fastest Quadratic Complexity Bound on the Values of Positive Roots of Polynomials

In this paper we present F LQ, a quadratic complexity bound on the values of the positive roots of polynomials. This bound is an extension of FirstLambda, the corresponding linear complexity bound and, consequently, it is derived from Theorem 3 below. We have implemented FLQ in the Vincent-Akritas-Strzeboński Continued Fractions method (VAS-CF) for the isolation of real roots of polynomials and compared its behavior with that of the theoretically proven best bound, LM Q. Experimental results indicate that whereas F LQ runs on average faster (or quite faster) than LM Q, nonetheless the quality of the bounds computed by both is about the same; moreover, it was revealed that when VAS-CF is run on our benchmark polynomials using F LQ, LM Q and min(F LQ, LM Q) all three versions run equally well and, hence, it is inconclusive which one should be used in the VAS-CF method.

Analog of Favard's Theorem for Polynomials Connected with Difference Equation of 4-th Order

Orthonormal polynomials on the real line {pn (λ)} n=0 ... ∞ satisfy the recurrent relation of the form: λn−1 pn−1 (λ) + αn pn (λ) + λn pn+1 (λ) = λpn (λ), n = 0, 1, 2, . . . , where λn > 0, αn ∈ R, n = 0, 1, . . . ; λ−1 = p−1 = 0, λ ∈ C. In this paper we study systems of polynomials {pn (λ)} n=0 ... ∞ which satisfy the equation: αn−2 pn−2 (λ) + βn−1 pn−1 (λ) + γn pn (λ) + βn pn+1 (λ) + αn pn+2 (λ) = λ2 pn (λ), n = 0, 1, 2, . . . , where αn > 0, βn ∈ C, γn ∈ R, n = 0, 1, 2, . . ., α−1 = α−2 = β−1 = 0, p−1 = p−2 = 0, p0 (λ) = 1, p1 (λ) = cλ + b, c > 0, b ∈ C, λ ∈ C. It is shown that they are orthonormal on the real and the imaginary axes in the complex plane ...

Polynomials of Pellian Type and Continued Fractions

We investigate infinite families of integral quadratic polynomials {fk (X)} k∈N and show that, for a fixed k ∈ N and arbitrary X ∈ N, the period length of the simple continued fraction expansion of √fk (X) is constant. Furthermore, we show that the period lengths of √fk (X) go to infinity with k. For each member of the families involved, we show how to determine, in an easy fashion, the fundamental unit of the underlying quadratic field. We also demonstrate how the simple continued fraction ex- pansion of √fk (X) is related to that of √C, where √fk (X) = ak*X^2 +bk*X + C. This continues work in [1]–[4].

Quadratic Mean Radius of a Polynomial in C(Z)

* Dedicated to the memory of Prof. N. Obreshkoff

Rolle's Theorem for Complex Polynomials with Real Coefficients

Let p(z) be an algebraic polynomial of degree n ¸ 2 with real coefficients and p(i) = p(¡i). According to Grace-Heawood Theorem, at least one zero of the derivative p0(z) is on the disk with center in the origin and radius cot(¼=n). In this paper is found the smallest domain containing at leas one zero of the derivative p0(z).

On a Stratification Defined by Real Roots of Polynomials

2000 Mathematics Subject Classification: 12D10

Overdetermined Strata in General Families of Polynomials

2000 Mathematics Subject Classification: 12D10.

On the Convergence of (0,1,2) Interpolation

2000 Mathematics Subject Classification: 41A05.

Approximation Properties of Schurer-Stancu Type Polynomials

MSC 2010: 41A25, 41A35

Predegree Polynomials of Plane Configurations in Projective Space

2000 Mathematics Subject Classification: 14N10, 14C17.

Integral Representations of Functional Series with Members Containing Jacobi Polynomials

MSC 2010: Primary 33C45, 40A30; Secondary 26D07, 40C10

Density of Polynomials in the L^2 Space on the Real and the Imaginary Axes and in a Sobolev Space

2000 Mathematics Subject Classification: 41A10, 30E10, 41A65.

Spatial modeling of data with excessive zeros applied to reindeer pellet-group counts

We analyze a real data set pertaining to reindeer fecal pellet-group counts obtained from a survey conducted in a forest area in northern Sweden. In the data set, over 70% of counts are zeros, and there is high spatial correlation. We use conditionally autoregressive random effects for modeling of spatial correlation in a Poisson generalized linear mixed model (GLMM), quasi-Poisson hierarchical generalized linear model (HGLM), zero-inflated Poisson (ZIP), and hurdle models. The quasi-Poisson HGLM allows for both under- and overdispersion with excessive zeros, while the ZIP and hurdle models allow only for overdispersion. In analyzing the real data set, we see that the quasi-Poisson HGLMs can perform better than the other commonly used models, for example, ordinary Poisson HGLMs, spatial ZIP, and spatial hurdle models, and that the underdispersed Poisson HGLMs with spatial correlation fit the reindeer data best. We develop R codes for fitting these models using a unified algorithm for the HGLMs. Spatial count response with an extremely high proportion of zeros, and underdispersion can be successfully modeled using the quasi-Poisson HGLM with spatial random effects.

Transmission Of Intra-cellular Genetic Information: A System Proposal.

One of the great challenges of the scientific community on theories of genetic information, genetic communication and genetic coding is to determine a mathematical structure related to DNA sequences. In this paper we propose a model of an intra-cellular transmission system of genetic information similar to a model of a power and bandwidth efficient digital communication system in order to identify a mathematical structure in DNA sequences where such sequences are biologically relevant. The model of a transmission system of genetic information is concerned with the identification, reproduction and mathematical classification of the nucleotide sequence of single stranded DNA by the genetic encoder. Hence, a genetic encoder is devised where labelings and cyclic codes are established. The establishment of the algebraic structure of the corresponding codes alphabets, mappings, labelings, primitive polynomials (p(x)) and code generator polynomials (g(x)) are quite important in characterizing error-correcting codes subclasses of G-linear codes. These latter codes are useful for the identification, reproduction and mathematical classification of DNA sequences. The characterization of this model may contribute to the development of a methodology that can be applied in mutational analysis and polymorphisms, production of new drugs and genetic improvement, among other things, resulting in the reduction of time and laboratory costs.

Neural networks and statistical analysis for classification of corneal videokeratography maps based on Zernike coefficients: a quantitative comparison

PURPOSE: The main goal of this study was to develop and compare two different techniques for classification of specific types of corneal shapes when Zernike coefficients are used as inputs. A feed-forward artificial Neural Network (NN) and discriminant analysis (DA) techniques were used. METHODS: The inputs both for the NN and DA were the first 15 standard Zernike coefficients for 80 previously classified corneal elevation data files from an Eyesys System 2000 Videokeratograph (VK), installed at the Departamento de Oftalmologia of the Escola Paulista de Medicina, São Paulo. The NN had 5 output neurons which were associated with 5 typical corneal shapes: keratoconus, with-the-rule astigmatism, against-the-rule astigmatism, "regular" or "normal" shape and post-PRK. RESULTS: The NN and DA responses were statistically analyzed in terms of precision ([true positive+true negative]/total number of cases). Mean overall results for all cases for the NN and DA techniques were, respectively, 94% and 84.8%. CONCLUSION: Although we used a relatively small database, results obtained in the present study indicate that Zernike polynomials as descriptors of corneal shape may be a reliable parameter as input data for diagnostic automation of VK maps, using either NN or DA.