What is the fastest algorithm for calculating nth term of Fibonacci sequence? If we exclude methods that include precalculating of all Fibonacci numbers up to a sufficiently large number of n what would be the fastest  algorithm for calculating nth term of Fibonacci sequence ?

I guess that Iterative and Matrix algorithms should be faster than Analytic and Recursive algorithms , ( see this paper ) .

On this page I have found five different algorithms . According to author the fastest is a Matrix algorithm that uses  O(log n) arithmetic operations .
According to this Project Nayuki link, Fast doubling is even faster than Fast Matrix, because redundant calculations are removed.