Computer Discovery and Analysis of Large Poisson Polynomials
From MaRDI portal
Recommendations
- Parallel computer algebra on Poisson series
- Computing zeta functions of large polynomial systems over finite fields
- Computation of generalized Chebyshev polynomials by computer
- Computational aspects of irreducible polynomials
- Computer evaluation of generalized Chebyshev polynomials
- Computers and the Multiplicity of Polynomial Roots
- Large integer polynomials in several variables
- scientific article; zbMATH DE number 2190177
Cites work
- Compressed lattice sums arising from the Poisson equation
- Harmonic sums and polylogarithms generated by cyclotomic polynomials
- scientific article; zbMATH DE number 5995471 (Why is no real title available?)
- scientific article; zbMATH DE number 706265 (Why is no real title available?)
- Lattice sums arising from the Poisson equation
- Parallel integer relation detection: techniques and applications
- Performance Tuning of Scientific Applications
Cited in
(7)- Compressed lattice sums arising from the Poisson equation
- Pentagon functions for one-mass planar scattering amplitudes
- The PSLQ algorithm for empirical data
- Lattice sums arising from the Poisson equation
- Jonathan Borwein: Renaissance Mathematician
- Jonathan Borwein: Experimental Mathematician
- Newton’s Method Without Division
This page was built for publication: Computer Discovery and Analysis of Large Poisson Polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4976190)
