[permalink] [id link]
Bruun's algorithm is a fast Fourier transform ( FFT ) algorithm based on an unusual recursive polynomial-factorization approach, proposed for powers of two by G. Bruun in 1978 and generalized to arbitrary even composite sizes by H. Murakami in 1996.
from
Wikipedia
Some Related Sentences
Bruun's and algorithm
Bruun's algorithm applies to arbitrary even composite sizes.
) Bruun's algorithm, in particular, is based on interpreting the FFT as a recursive factorization of the polynomial, here into real-coefficient polynomials of the form and
Bruun's algorithm ( above ) is another method that was initially proposed to take advantage of real inputs, but it has not proved popular.
Nearly every FFT algorithm, from Cooley-Tukey to Prime-Factor to Winograd ( Sorensen et al., 1985 ) to Bruun's ( Bini & Bozzo, 1993 ), has a direct analogue for the discrete Hartley transform.
Bruun's algorithm has not seen widespread use, however, as approaches based on the ordinary Cooley – Tukey FFT algorithm have been successfully adapted to real data with at least as much efficiency.
Furthermore, there is evidence that Bruun's algorithm may be intrinsically less accurate than Cooley – Tukey in the face of finite numerical precision ( Storn, 1993 ).
Nevertheless, Bruun's algorithm illustrates an alternative algorithmic framework that can express both itself and the Cooley – Tukey algorithm, and thus provides an interesting perspective on FFTs that permits mixtures of the two algorithms and other generalizations.
Bruun's and is
That is, Cooley – Tukey ensures that all subproblems are also DFTs, whereas this is not generally true for an arbitrary recursive factorization ( such as Bruun's, below ).
Bruun's and fast
The key to fast algorithms like Bruun's or Cooley – Tukey comes from the fact that one can perform this set of N remainder operations in recursive stages.
Bruun's and for
Christer Bruun's " Water for Roman Brothels: Cicero Cael.
Bruun's and two
There are two large department stores, and the shopping centre, Bruun's Galleri with 93 stores located within Aarhus midtby.
Bruun's and .
The work was first edited at Augsburg, about 1460 ; four other editions appeared in the 15th century, and six in the 16th ; in the 19th the best were K. F. Neumann's ( Munich, 1859 ), P. Bruun's ( Odessa, 1866, with Russian commentary, in the Records of the Imperial University of New Russia, vol.
Bruun's works are diverse and numerous.
algorithm and is
The algorithm proceeds by successive subtractions in two loops: IF the test B ≥ A yields " yes " ( or true ) ( more accurately the number b in location B is greater than or equal to the number a in location A ) THEN the algorithm specifies B ← B − A ( meaning the number b − a replaces the old b ).
In mathematics and computer science, an algorithm ( originating from al-Khwārizmī, the famous Persian mathematician Muḥammad ibn Mūsā al-Khwārizmī ) is a step-by-step procedure for calculations.
More precisely, an algorithm is an effective method expressed as a finite list of well-defined instructions for calculating a function.
While there is no generally accepted formal definition of " algorithm ," an informal definition could be " a set of rules that precisely defines a sequence of operations.
" For some people, a program is only an algorithm if it stops eventually ; for others, a program is only an algorithm if it stops before a given number of calculation steps.
A prototypical example of an algorithm is Euclid's algorithm to determine the maximum common divisor of two integers ; an example ( there are others ) is described by the flow chart above and as an example in a later section.
The concept of algorithm is also used to define the notion of decidability.
In logic, the time that an algorithm requires to complete cannot be measured, as it is not apparently related with our customary physical dimension.
Gurevich: "... Turing's informal argument in favor of his thesis justifies a stronger thesis: every algorithm can be simulated by a Turing machine ... according to Savage, an algorithm is a computational process defined by a Turing machine ".
Typically, when an algorithm is associated with processing information, data is read from an input source, written to an output device, and / or stored for further processing.
Stored data is regarded as part of the internal state of the entity performing the algorithm.
Because an algorithm is a precise list of precise steps, the order of computation will always be critical to the functioning of the algorithm.
In computer systems, an algorithm is basically an instance of logic written in software by software developers to be effective for the intended " target " computer ( s ), in order for the target machines to produce output from given input ( perhaps null ).
is the length of time taken to perform the algorithm.
Simulation of an algorithm: computer ( computor ) language: Knuth advises the reader that " the best way to learn an algorithm is to try it.
algorithm and fast
For example, if for a given problem size a parallelized implementation of an algorithm can run 12 % of the algorithm's operations arbitrarily quickly ( while the remaining 88 % of the operations are not parallelizable ), Amdahl's law states that the maximum speedup of the parallelized version is times as fast as the non-parallelized implementation.
** Atkinson independently discovered the Midpoint circle algorithm for fast drawing of circles by using the sum of consecutive odd numbers.
* UCData: " Pretty Good Bidi Algorithm Library " A small and fast bidirectional reordering algorithm that works pretty good, but not necessarily compliant to the Unicode algorithm
A fast way to determine whether two numbers are coprime is given by the Euclidean algorithm.
A key enabling factor for these applications is the fact that the DFT can be computed efficiently in practice using a fast Fourier transform ( FFT ) algorithm.
A divide and conquer paradigm to performing a triangulation in d dimensions is presented in " DeWall: A fast divide and conquer Delaunay triangulation algorithm in E < sup > d </ sup >" by P. Cignoni, C. Montani, R. Scopigno .< ref >
A fast Fourier transform ( FFT ) is an efficient algorithm to compute the discrete Fourier transform ( DFT ) and its inverse.
The DFT can be computed using a fast Fourier transform ( FFT ) algorithm, which makes it a practical and important transformation on computers.
The Rabin – Karp algorithm is a relatively fast string searching algorithm that works in O ( n ) time on average.
and allow for very fast execution of the hashing algorithm.
This algorithm has proven to be very fast and of high quality for hashing purposes ( especially hashing of integer number keys ).
) is NP-complete, thus it is expected that no algorithm can be both correct and fast ( polynomial-time ) on all cases.
There are fast algorithms for computing the GCD that do not require the numbers to be factored, such as the Euclidean algorithm.
This algorithm performs well when combined with a fast sequential merge as a base case for merging of small arrays.
* William Pugh, 1991, " The Omega test: a fast and practical integer programming algorithm for dependence analysis ,".
As describes, the time for finding the fundamental solution using the continued fraction method, with the aid of the Schönhage – Strassen algorithm for fast integer multiplication, is within a logarithmic factor of the solution size, the number of digits in the pair ( x < sub > 1 </ sub >, y < sub > 1 </ sub >).
No mathematical proof has been found that shows that an equally fast classical algorithm cannot be discovered, although this is considered unlikely.
A least significant digit ( LSD ) radix sort is a fast stable sorting algorithm which can be used to sort keys in integer representation order.
This popular sorting algorithm has an average-case performance of O ( n log n ), which contributes to making it a very fast algorithm in practice.
The ziggurat algorithm is a fast method for generating exponential variates.
: A fast quantum mechanical algorithm for database search, Proceedings, 28th Annual ACM Symposium on the Theory of Computing, ( May 1996 ) p. 212
* Xiaolin Wu's line algorithm, a similarly fast method of drawing lines with antialiasing
0.282 seconds.