Precomputation
Jump to navigation
Jump to search
A Precomputation is an Algorithms that ...
- See: Materialized View, Algorithms, Computation, Run Time (Program Lifecycle Phase), Lookup Table, Hardcoded, Pi, E (Mathematical Constant), Database.
References
2017
- (Wikipedia, 2017) ⇒ https://en.wikipedia.org/wiki/precomputation Retrieved:2017-10-24.
- In algorithms, precomputation is the act of performing an initial computation before run time to generate a lookup table that can be used by an algorithm to avoid repeated computation each time it is executed. Precomputation is often used in algorithms that depend on the results of expensive computations that don't depend on the input of the algorithm. A trivial example of precomputation is the use of hardcoded mathematical constants, such as π and e, rather than computing their approximations to the necessary precision at run time.
In databases, the term materialization is used to refer to storing the results of a precomputation, e.g. in a materialized view. [1]
- In algorithms, precomputation is the act of performing an initial computation before run time to generate a lookup table that can be used by an algorithm to avoid repeated computation each time it is executed. Precomputation is often used in algorithms that depend on the results of expensive computations that don't depend on the input of the algorithm. A trivial example of precomputation is the use of hardcoded mathematical constants, such as π and e, rather than computing their approximations to the necessary precision at run time.
- ↑ Cite error: Invalid
<ref>tag; no text was provided for refs namedAufaureZimányi2012