Numerical Algorithms for Number Theory : Using Pari/GP (Mathematical Surveys and Monographs)

Numerical Algorithms for Number Theory : Using Pari/GP (Mathematical Surveys and Monographs)

  • ただいまウェブストアではご注文を受け付けておりません。 ⇒古書を探す
  • 製本 Paperback:紙装版/ペーパーバック版/ページ数 430 p.
  • 言語 ENG
  • 商品コード 9781470463519
  • DDC分類 518.47

Full Description

This book presents multiprecision algorithms used in number theory and elsewhere, such as extrapolation, numerical integration, numerical summation (including multiple zeta values and the Riemann-Siegel formula), evaluation and speed of convergence of continued fractions, Euler products and Euler sums, inverse Mellin transforms, and complex $L$-functions. For each task, many algorithms are presented, such as Gaussian and doubly-exponential integration, Euler-MacLaurin, Abel-Plana, Lagrange, and Monien summation. Each algorithm is given in detail, together with a complete implementation in the free Pari/GP system. These implementations serve both to make even more precise the inner workings of the algorithms, and to gently introduce advanced features of the Pari/GP language. This book will be appreciated by anyone interested in number theory, specifically in practical implementations, computer experiments and numerical algorithms that can be scaled to produce thousands of digits of accuracy.

Contents

Introduction
Numerical extrapolation
Numerical integration
Numerical summation
Euler products and Euler sums
Gauss and Jacobi sums
Numerical computation of continued fractions
Computation of inverse Mellin transforms
Computation of $L$-functions
List of relevant GP programs
Bibliography
Index of programs
General index.

最近チェックした商品