Analysis of PSLQ, an integer relation finding algorithm
From MaRDI portal
Publication:4221985
DOI10.1090/S0025-5718-99-00995-3zbMath0927.11055MaRDI QIDQ4221985
Steve Arno, David H. Bailey, Helaman R. P. Ferguson
Publication date: 3 December 1998
Published in: Mathematics of Computation (Search for Journal in Brave)
Euclidean algorithmpolynomial timeGaussian integerHamiltonian integerinteger relation finding algorithm
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05)
Related Items
Special values of multiple polylogarithms, Jonathan Borwein: Experimental Mathematician, The leading-order dressing phase in ABJM theory, Analytic results for planar three-loop four-point integrals from a Knizhnik-Zamolodchikov equation, Three-point functions in \(\mathcal{N}=4\) SYM: the hexagon proposal at three loops, Towards the five-loop beta function for a general gauge group, Position-space cuts for Wilson line correlators, Binomiality testing and computing sparse polynomials via witness sets, Constructing exact symmetric informationally complete measurements from numerical solutions, Certifying solutions to overdetermined and singular polynomial systems over \(\mathbb{Q}\), On the use of Montgomery multiplication in the computation of binary BBP-type formulas for mathematical constants, Analytic results for massless three-loop form factors, Massive Feynman diagrams and inverse binomial sums, Experimental Math for Math Monthly Problems, Five-particle phase-space integrals in QCD, Five-loop quark mass and field anomalous dimensions for a general gauge group, Evaluating `elliptic' master integrals at special kinematic values: using differential equations and their solutions via expansions near singular points, Two-loop corrections to Lamb shift and hyperfine splitting in hydrogen via multi-loop methods, MB tools reloaded, On the Landau-Khalatnikov-Fradkin transformation in quenched \(\text{QED}_3\), Six-loop anomalous dimension of twist-three operators in \(\mathcal{N} = 4\) SYM, Analytic epsilon expansion of three-loop on-shell master integrals up to four-loop transcendentality weight, An off-shell Wilson loop, Analytic computation of three-point energy correlator in QCD, Complete renormalization of QCD at five loops, Off-shell form factor in \(\mathcal{N} =4\) sYM at three loops, Inversion of Band-Limited Discrete Fourier Transforms of Binary Images: Uniqueness and Algorithms, Trilateration using unlabeled path or loop lengths, New series for powers of \(\pi\) and related congruences, \(\mathcal{O}(m \alpha^2(Z\alpha)^6)\) contribution to Lamb shift from radiative corrections to the Wichmann-Kroll potential, Formal proofs of degree 5 binary BBP-type formulas, The PSLQ algorithm for empirical data, Introduction, The structure of the spectra of Pisot numbers., The two-loop hexagon Wilson loop in \(\mathcal{N}=4\) SYM, Calculation of the quark and gluon form factors to three loops in QCD, Parallel integer relation detection: Techniques and applications, Extending the PSLQ Algorithm to Algebraic Integer Relations, Irreducible constituents of monomial representations., A complete algorithm to find exact minimal polynomial by approximations, Four-loop collinear anomalous dimensions in QCD and \(\mathcal{N} = 4\) super Yang-Mills, The Sudakov form factor at four loops in maximal super Yang-Mills theory, Harmonic-binomial Euler-like sums via expansions of \((\arcsin x)^p\), Jonathan Borwein: Renaissance Mathematician, The constructive membership problem for discrete two-generator subgroups of \(\operatorname{SL}_2(\mathbb{R})\), Special values of generalized polylogarithms, Evaluating multiple polylogarithm values at sixth roots of unity up to weight six, New formulae of BBP-type with different moduli, On the Euler scale and theμEuclidean integer relation algorithm, Factoring polynomials and the knapsack problem, Advances in the theory of box integrals, Calculation of massless Feynman integrals using harmonic sums, LLL: A Tool for Effective Diophantine Approximation, Selected Applications of LLL in Number Theory, A Numerical Transcendental Method in Algebraic Geometry: Computation of Picard Groups and Related Invariants, Recognition of Computationally Constructed Loci, Exact asymptotics of the characteristic polynomial of the symmetric Pascal matrix, Hexagon functions and the three-loop remainder function, On the computation and verification of \(\pi\) using BBP-type formulas, Random Generators and Normal Numbers, The hyperelliptic integrals and \(\pi \), Expected distances on manifolds of partially oriented flags, On the Random Character of Fundamental Constant Expansions, Several BBP-type formulas for π, Charge asymmetry in electron/positron energy loss in nuclear bremsstrahlung, The four-loop \(\mathcal{N} = 4\) SYM Sudakov form factor, On the rapid computation of various polylogarithmic constants, Calculating Four-Loop Corrections in QCD, BBP-type formulas -- an elementary approach, High-precision arithmetic in mathematical physics
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice
- Factoring polynomials with rational coefficients
- Improved low-density subset sum algorithms
- Diophantine approximation of complex numbers
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- Polynomial Time Algorithms for Finding Integer Relations among Real Numbers
- On the rapid computation of various polylogarithmic constants
- Vanishing sums in function fields
- Numerical results on the transcendence of constants involving 𝜋,𝑒, and Euler’s constant
- A noninductive GL(n, Z) algorithm that constructs integral linear relations for n Z-linearly dependent real numbers
- Generalization of the Euclidean algorithm for real numbers to all dimensions higher than two
- Ratio in early Greek mathematics
- The Generalized Basis Reduction Algorithm
- Experimental Evaluation of Euler Sums
- Fractional and Trigonometric Expressions for Matrices
- Algorithm 719: Multiprecision translation and execution of FORTRAN programs
- A Fortran 90-based multiprecision system
- A more efficient algorithm for lattice basis reduction
