A note on the complexity of Bürgi's algorithm for the computation of sines

Denis Roegel 1
1 MOSEL - Proof-oriented development of computer-based systems
LORIA - FM - Department of Formal Methods
Abstract : This note studies the accuracy and complexity of Bürgi's novel algorithm for the computation of sines.
Document type :
Reports
Complete list of metadatas

Cited literature [7 references]  Display  Hide  Download

https://hal.inria.fr/hal-01284671
Contributor : Denis Roegel <>
Submitted on : Monday, March 7, 2016 - 8:39:24 PM
Last modification on : Tuesday, December 18, 2018 - 4:38:25 PM
Long-term archiving on : Sunday, November 13, 2016 - 9:53:19 AM

File

roegel2016buergi-complexity.pd...
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01284671, version 1

Collections

Citation

Denis Roegel. A note on the complexity of Bürgi's algorithm for the computation of sines. [Research Report] LORIA. 2016. ⟨hal-01284671⟩

Share

Metrics

Record views

261

Files downloads

135