Numerical Algorithms for Number Theory

DOI10.1090/SURV/254MaRDI QIDQ4989766zbMATH OpenOpenAlexFDO

Authors Karim Belabas, Henri Cohen

Publication date 26 May 2021

Published in Mathematical Surveys and Monographs (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1090/surv/254

zbMATH Keywords

fast algorithmsmultiprecision arithmeticsnumerical methods in number theory

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to number theory (11-01) Computational number theory (11Yxx) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to numerical analysis (65-01)

Recommendations

• Experimental number theory
• scientific article; zbMATH DE number 1440131
• scientific article; zbMATH DE number 435565
• Topics in computational algebraic number theory
• Modular forms in Pari/GP
• \texttt{SAGE} for number theorists
• scientific article; zbMATH DE number 5862969
• Computational Number Theory, Past, Present, and Future

Cited in

(11)

• A new interpretor for PARI/GP
• PARI/GP
• Sequence transformations in proofs of irrationality of some fundamental constants
• Experimental number theory
• scientific article; zbMATH DE number 802334 (Why is no real title available?)
• Fast Library for Number Theory: An Introduction
• NZMATH 1.0
• Limits of Mahler measures in multiple variables
• Euler constants from primes in arithmetic progression
• Rational coefficients of orthogonal expansions of some functions
• Repulsion of zeros close to s = 1/2 for modular form L-functions

This page was built for publication: Numerical Algorithms for Number Theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4989766)