Numerical Analysis in a Nutshell
Publisher Summary
The analysis of the computational complexity of an algorithm provides a measure of the efficiency of an algorithm and is used for comparison and evaluation of the performance of algorithms. The definition of the problem size is central as the computational effort of an algorithm should be a function of it. Generally, the size is expressed as roughly the number of elements the algorithm has to process. A detailed comparison is generally difficult to make and mostly not very useful. The most important criterion for comparison is the execution time of the algorithm. In order to be practical, the measure has to be computed easily and has to be independent of the computational platform. ...
Get Numerical Methods and Optimization in Finance now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
