BKM algorithm
The BKM algorithm is a shift-and-add algorithm for computing elementary functions, first published in 1994 by Jean-Claude Bajard, Sylvanus Kla, and Jean-Michel Muller. BKM is based on computing complex logarithms (L-mode) and exponentials (E-mode) using a method similar to the algorithm Henry Briggs used to compute logarithms. By using a precomputed table of logarithms of negative powers of two, the BKM algorithm computes elementary functions using only integer add, shift, and compare operations.
Wikipage disambiguates
Link from a Wikipage to another Wikipage
primaryTopic
BKM algorithm
The BKM algorithm is a shift-and-add algorithm for computing elementary functions, first published in 1994 by Jean-Claude Bajard, Sylvanus Kla, and Jean-Michel Muller. BKM is based on computing complex logarithms (L-mode) and exponentials (E-mode) using a method similar to the algorithm Henry Briggs used to compute logarithms. By using a precomputed table of logarithms of negative powers of two, the BKM algorithm computes elementary functions using only integer add, shift, and compare operations.
has abstract
L'algorisme BKM és un algorism ...... mb aritmètica de coma flotant.
@ca
The BKM algorithm is a shift-a ...... are floating point arithmetic.
@en
Link from a Wikipage to an external page
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
961,658,082
Link from a Wikipage to another Wikipage
cs1-dates
y
@en
date
May 2019
@en
wikiPageUsesTemplate
subject
hypernym
type
comment
L'algorisme BKM és un algorism ...... ma, desplaçament i comparació.
@ca
The BKM algorithm is a shift-a ...... shift, and compare operations.
@en
label
Algorisme BKM
@ca
BKM algorithm
@en
BKM-Algorithmus
@de