Displaying 281 – 300 of 313

Showing per page

On zeros of regular orthogonal polynomials on the unit circle

P. García Lázaro, F. Marcellán (1993)

Annales Polonici Mathematici

A new approach to the study of zeros of orthogonal polynomials with respect to an Hermitian and regular linear functional is presented. Some results concerning zeros of kernels are given.

Operators preserving orthogonality of polynomials

Francisco Marcellán, Franciszek Szafraniec (1996)

Studia Mathematica

Let S be a degree preserving linear operator of ℝ[X] into itself. The question is if, preserving orthogonality of some orthogonal polynomial sequences, S must necessarily be an operator of composition with some affine function of ℝ. In [2] this problem was considered for S mapping sequences of Laguerre polynomials onto sequences of orthogonal polynomials. Here we improve substantially the theorems of [2] as well as disprove the conjecture proposed there. We also consider the same questions for polynomials...

Optimization of parameters in the Menzerath–Altmann law

Ján Andres, Lubomír Kubáček, Jitka Machalová, Michaela Tučková (2012)

Acta Universitatis Palackianae Olomucensis. Facultas Rerum Naturalium. Mathematica

Four formulas of the Menzerath–Altmann law are tested from the point of view of their applicability and suitability. The accuracy of related approximations of measured data is examined by the least square method at first. Then the accuracy of calculated parameters in the formulas under consideration is compared statistically. The influence of neglecting parameter c is investigated as well. Finally, the obtained results are discussed by means of an illustrative example from quantitative linguistics....

Optimization of Rational Approximations by Continued Fractions

Blomquist, Frithjof (2007)

Serdica Journal of Computing

The paper has been presented at the 12th International Conference on Applications of Computer Algebra, Varna, Bulgaria, June, 2006.To get guaranteed machine enclosures of a special function f(x), an upper bound ε(f) of the relative error is needed, where ε(f) itself depends on the error bounds ε(app); ε(eval) of the approximation and evaluation error respectively. The approximation function g(x) ≈ f(x) is a rational function (Remez algorithm), and with sufficiently high polynomial degrees ε(app) becomes...

Orbit functions.

Klimyk, Anatoliy, Patera, Jiri (2006)

SIGMA. Symmetry, Integrability and Geometry: Methods and Applications [electronic only]

Orthoexponential polynomials and the Legendre polynomials

Otakar Jaroch (1978)

Aplikace matematiky

Orthoexponential polynomials can be expressed in terms of the Legendre polynomials. The formulae proved in this paper are useful for the computation of the values of orthoexponential polynomials. It is also possible to re-state, for orthoexponential polynomials, some theorems from the theory of classical orthogonal polynomials.

Currently displaying 281 – 300 of 313