477 research outputs found

    Explicit representations of biorthogonal polynomials

    Full text link
    Given a parametrised weight function ω(x,μ)\omega(x,\mu) such that the quotients of its consecutive moments are M\"obius maps, it is possible to express the underlying biorthogonal polynomials in a closed form \cite{IN2}. In the present paper we address ourselves to two related issues. Firstly, we demonstrate that, subject to additional assumptions, every such ω\omega obeys (in xx) a linear differential equation whose solution is a generalized hypergeometric function. Secondly, using a generalization of standard divided differences, we present a new explicit representation of the underlying orthogonal polynomials

    An efficient algorithm for accelerating the convergence of oscillatory series, useful for computing the polylogarithm and Hurwitz zeta functions

    Full text link
    This paper sketches a technique for improving the rate of convergence of a general oscillatory sequence, and then applies this series acceleration algorithm to the polylogarithm and the Hurwitz zeta function. As such, it may be taken as an extension of the techniques given by Borwein's "An efficient algorithm for computing the Riemann zeta function", to more general series. The algorithm provides a rapid means of evaluating Li_s(z) for general values of complex s and the region of complex z values given by |z^2/(z-1)|<4. Alternatively, the Hurwitz zeta can be very rapidly evaluated by means of an Euler-Maclaurin series. The polylogarithm and the Hurwitz zeta are related, in that two evaluations of the one can be used to obtain a value of the other; thus, either algorithm can be used to evaluate either function. The Euler-Maclaurin series is a clear performance winner for the Hurwitz zeta, while the Borwein algorithm is superior for evaluating the polylogarithm in the kidney-shaped region. Both algorithms are superior to the simple Taylor's series or direct summation. The primary, concrete result of this paper is an algorithm allows the exploration of the Hurwitz zeta in the critical strip, where fast algorithms are otherwise unavailable. A discussion of the monodromy group of the polylogarithm is included.Comment: 37 pages, 6 graphs, 14 full-color phase plots. v3: Added discussion of a fast Hurwitz algorithm; expanded development of the monodromy v4:Correction and clarifiction of monodrom

    Higher analogues of the discrete-time Toda equation and the quotient-difference algorithm

    Full text link
    The discrete-time Toda equation arises as a universal equation for the relevant Hankel determinants associated with one-variable orthogonal polynomials through the mechanism of adjacency, which amounts to the inclusion of shifted weight functions in the orthogonality condition. In this paper we extend this mechanism to a new class of two-variable orthogonal polynomials where the variables are related via an elliptic curve. This leads to a `Higher order Analogue of the Discrete-time Toda' (HADT) equation for the associated Hankel determinants, together with its Lax pair, which is derived from the relevant recurrence relations for the orthogonal polynomials. In a similar way as the quotient-difference (QD) algorithm is related to the discrete-time Toda equation, a novel quotient-quotient-difference (QQD) scheme is presented for the HADT equation. We show that for both the HADT equation and the QQD scheme, there exists well-posed ss-periodic initial value problems, for almost all \s\in\Z^2. From the Lax-pairs we furthermore derive invariants for corresponding reductions to dynamical mappings for some explicit examples.Comment: 38 page

    Acceleration of generalized hypergeometric functions through precise remainder asymptotics

    Full text link
    We express the asymptotics of the remainders of the partial sums {s_n} of the generalized hypergeometric function q+1_F_q through an inverse power series z^n n^l \sum_k c_k/n^k, where the exponent l and the asymptotic coefficients {c_k} may be recursively computed to any desired order from the hypergeometric parameters and argument. From this we derive a new series acceleration technique that can be applied to any such function, even with complex parameters and at the branch point z=1. For moderate parameters (up to approximately ten) a C implementation at fixed precision is very effective at computing these functions; for larger parameters an implementation in higher than machine precision would be needed. Even for larger parameters, however, our C implementation is able to correctly determine whether or not it has converged; and when it converges, its estimate of its error is accurate.Comment: 36 pages, 6 figures, LaTeX2e. Fixed sign error in Eq. (2.28), added several references, added comparison to other methods, and added discussion of recursion stabilit

    Deformed Chern-Simons Theories

    Get PDF
    We construct a Chern-Simons action for q-deformed gauge theory which is a simple and straightforward generalization of the usual one. Space-time continues to be an ordinary (commuting) manifold, while the gauge potentials and the field strengths become q-commuting fields. Our approach, which is explicitly carried out for the case of `minimal' deformations, has the advantage of leading naturally to a consistent Hamiltonian structure that has essentially all of the features of the undeformed case. For example, using the new Poisson brackets, the constraints form a closed algebra and generate q-deformed gauge transformations.Comment: 14 pages, latex, no figures. Two references added. In press on Phys. Lett.

    Vector Meson Dominance as a first step in a systematic approximation: the pion vector form factor

    Full text link
    Pade Approximants can be used to go beyond Vector Meson Dominance in a systematic approximation. We illustrate this fact with the case of the pion vector form factor and extract values for the first two coefficients of its Taylor expansion. Pade Approximants are shown to be a useful and simple tool for incorporating high-energy information, allowing an improved determination of these Taylor coefficients.Comment: 13 pages, 7 figure

    Mathematical Properties of a New Levin-Type Sequence Transformation Introduced by \v{C}\'{\i}\v{z}ek, Zamastil, and Sk\'{a}la. I. Algebraic Theory

    Full text link
    \v{C}\'{\i}\v{z}ek, Zamastil, and Sk\'{a}la [J. Math. Phys. \textbf{44}, 962 - 968 (2003)] introduced in connection with the summation of the divergent perturbation expansion of the hydrogen atom in an external magnetic field a new sequence transformation which uses as input data not only the elements of a sequence {sn}n=0\{s_n \}_{n=0}^{\infty} of partial sums, but also explicit estimates {ωn}n=0\{\omega_n \}_{n=0}^{\infty} for the truncation errors. The explicit incorporation of the information contained in the truncation error estimates makes this and related transformations potentially much more powerful than for instance Pad\'{e} approximants. Special cases of the new transformation are sequence transformations introduced by Levin [Int. J. Comput. Math. B \textbf{3}, 371 - 388 (1973)] and Weniger [Comput. Phys. Rep. \textbf{10}, 189 - 371 (1989), Sections 7 -9; Numer. Algor. \textbf{3}, 477 - 486 (1992)] and also a variant of Richardson extrapolation [Phil. Trans. Roy. Soc. London A \textbf{226}, 299 - 349 (1927)]. The algebraic theory of these transformations - explicit expressions, recurrence formulas, explicit expressions in the case of special remainder estimates, and asymptotic order estimates satisfied by rational approximants to power series - is formulated in terms of hitherto unknown mathematical properties of the new transformation introduced by \v{C}\'{\i}\v{z}ek, Zamastil, and Sk\'{a}la. This leads to a considerable formal simplification and unification.Comment: 41 + ii pages, LaTeX2e, 0 figures. Submitted to Journal of Mathematical Physic

    Explicit solutions for second order operator differential equations with two boundary value conditions

    Get PDF
    AbstractBoundary value problems for second order operator differential equations with two boundary value conditions are studied. Explicit expressions of the solutions in terms of data problems are given. By means of the application of algebraic techniques, analogous expressions to the ones known for the scalar case are obtained

    Biorthogonal Quantum Systems

    Full text link
    Models of PT symmetric quantum mechanics provide examples of biorthogonal quantum systems. The latter incorporporate all the structure of PT symmetric models, and allow for generalizations, especially in situations where the PT construction of the dual space fails. The formalism is illustrated by a few exact results for models of the form H=(p+\nu)^2+\sum_{k>0}\mu_{k}exp(ikx). In some non-trivial cases, equivalent hermitian theories are obtained and shown to be very simple: They are just free (chiral) particles. Field theory extensions are briefly considered.Comment: 34 pages, 5 eps figures; references added and other changes made to conform to journal versio

    The structure of iterative methods for symmetric linear discrete ill-posed problems

    Get PDF
    The iterative solution of large linear discrete ill-posed problems with an error contaminated data vector requires the use of specially designed methods in order to avoid severe error propagation. Range restricted minimal residual methods have been found to be well suited for the solution of many such problems. This paper discusses the structure of matrices that arise in a range restricted minimal residual method for the solution of large linear discrete ill-posed problems with a symmetric matrix. The exploitation of the structure results in a method that is competitive with respect to computer storage, number of iterations, and accuracy.Acknowledgments We would like to thank the referees for comments. The work of F. M. was supported by Dirección General de Investigación Científica y Técnica, Ministerio de Economía y Competitividad of Spain under grant MTM2012-36732-C03-01. Work of L. R. was supported by Universidad Carlos III de Madrid in the Department of Mathematics during the academic year 2010-2011 within the framework of the Chair of Excellence Program and by NSF grant DMS-1115385
    corecore