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