Computer Discovery and Analysis of Large Poisson Polynomials

DOI10.1080/10586458.2016.1180565zbMath1426.11134OpenAlexW2517935111MaRDI QIDQ4976190

David H. Bailey, Watson Ladd, Jonathan M. Borwein, Jason S. Kimberley

Publication date: 27 July 2017

Published in: Experimental Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10586458.2016.1180565

zbMATH Keywords

parallel computingPoisson equationexperimental mathematicsmultiprecision computationPSLQ algorithm

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Polynomials in number theory (11C08)

Related Items (5)

Jonathan Borwein: Experimental Mathematician ⋮ Newton’s Method Without Division ⋮ The PSLQ algorithm for empirical data ⋮ Jonathan Borwein: Renaissance Mathematician ⋮ Pentagon functions for one-mass planar scattering amplitudes

Cites Work

• Unnamed Item
• Unnamed Item
• Compressed lattice sums arising from the Poisson equation
• Parallel integer relation detection: Techniques and applications
• Harmonic sums and polylogarithms generated by cyclotomic polynomials
• Performance Tuning of Scientific Applications
• Lattice sums arising from the Poisson equation

This page was built for publication: Computer Discovery and Analysis of Large Poisson Polynomials