197 research outputs found

    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

    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

    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

    Asymptotic Improvement of Resummation and Perturbative Predictions in Quantum Field Theory

    Full text link
    The improvement of resummation algorithms for divergent perturbative expansions in quantum field theory by asymptotic information about perturbative coefficients is investigated. Various asymptotically optimized resummation prescriptions are considered. The improvement of perturbative predictions beyond the reexpansion of rational approximants is discussed.Comment: 21 pages, LaTeX, 3 tables; title shortened; typographical errors corrected; minor changes of style; 2 references adde

    An Improved Upper Bound for the Ground State Energy of Fermion Lattice Models

    Get PDF
    We present an improved upper bound for the ground state energy of lattice fermion models with sign problem. The bound can be computed by numerical simulation of a recently proposed family of deformed Hamiltonians with no sign problem. For one dimensional models, we expect the bound to be particularly effective and practical extrapolation procedures are discussed. In particular, in a model of spinless interacting fermions and in the Hubbard model at various filling and Coulomb repulsion we show how such techniques can estimate ground state energies and correlation function with great accuracy.Comment: 5 pages, 5 figures; to appear in Physical Review

    The staircase method: integrals for periodic reductions of integrable lattice equations

    Full text link
    We show, in full generality, that the staircase method provides integrals for mappings, and correspondences, obtained as traveling wave reductions of (systems of) integrable partial difference equations. We apply the staircase method to a variety of equations, including the Korteweg-De Vries equation, the five-point Bruschi-Calogero-Droghei equation, the QD-algorithm, and the Boussinesq system. We show that, in all these cases, if the staircase method provides r integrals for an n-dimensional mapping, with 2r<n, then one can introduce q<= 2r variables, which reduce the dimension of the mapping from n to q. These dimension-reducing variables are obtained as joint invariants of k-symmetries of the mappings. Our results support the idea that often the staircase method provides sufficiently many integrals for the periodic reductions of integrable lattice equations to be completely integrable. We also study reductions on other quad-graphs than the regular 2D lattice, and we prove linear growth of the multi-valuedness of iterates of high-dimensional correspondences obtained as reductions of the QD-algorithm.Comment: 40 pages, 23 Figure

    Mathematical Modelling of Optical Coherence Tomography

    Full text link
    In this chapter a general mathematical model of Optical Coherence Tomography (OCT) is presented on the basis of the electromagnetic theory. OCT produces high resolution images of the inner structure of biological tissues. Images are obtained by measuring the time delay and the intensity of the backscattered light from the sample considering also the coherence properties of light. The scattering problem is considered for a weakly scattering medium located far enough from the detector. The inverse problem is to reconstruct the susceptibility of the medium given the measurements for different positions of the mirror. Different approaches are addressed depending on the different assumptions made about the optical properties of the sample. This procedure is applied to a full field OCT system and an extension to standard (time and frequency domain) OCT is briefly presented.Comment: 28 pages, 5 figures, book chapte

    Regional Trajectories of Entrepreneurship and Growth

    Get PDF
    The development of regions is considerably shaped by their history. We review research that finds significant persistence of regional levels of entrepreneurship over longer periods of time. It is argued that the long term persistence of regional entrepreneurship indicates the presence and effect of a culture of entrepreneurship that is conducive to new business formation and regional growth. Hence, regional development is characterized by long term trajectories of entrepreneurship. We derive a number of policy implications and propose avenues for further research.</p

    Multidirectional Subspace Expansion for One-Parameter and Multiparameter Tikhonov Regularization

    Get PDF
    Tikhonov regularization is a popular method to approximate solutions of linear discrete ill-posed problems when the observed or measured data is contaminated by noise. Multiparameter Tikhonov regularization may improve the quality of the computed approximate solutions. We propose a new iterative method for large-scale multiparameter Tikhonov regularization with general regularization operators based on a multidirectional subspace expansion. The multidirectional subspace expansion may be combined with subspace truncation to avoid excessive growth of the search space. Furthermore, we introduce a simple and effective parameter selection strategy based on the discrepancy principle and related to perturbation results
    corecore