Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

Fast Computation of Bernoulli, Tangent and Secant Numbers

Date

Authors

Brent, Richard

Harvey, David

Publisher

Springer

Abstract

We consider the computation of Bernoulli, Tangent (zag), and Secant (zig or Euler) numbers. In particular, we give asymptotically fast algorithms for computing the first n such numbers O(n2(logn)2+o(1)). We also give very short in-place algorithms for com

Keywords

Keywords: Bernoulli numbers; Fast algorithms; In-place algorithms; Secant number; Tangent number; Algorithms Asymptotically fast algorithm; Bernoulli number; In-place algorithm; Secant number; Tangent number

URI

http://hdl.handle.net/1885/52297

Collections

ANU Research Publications

Source

Proceedings of a Workshop on Computational and Analytical Mathematics in honour of Jonathan Borwein's 60th birthday

Type

Conference paper

DOI

10.1007/978-1-4614-7621-4_8

Restricted until

2037-12-31

Downloads

File

Description

01_Brent_Fast_Computation_of_Bernoulli,_2011.pdf (138.21 KB)