Changes between Version 2 and Version 3 of Ticket #9706, comment 57


Ignore:
Timestamp:
12/04/13 10:23:44 (8 years ago)
Author:
maldun
Comment:

Legend:

Unmodified
Added
Removed
Modified
  • Ticket #9706, comment 57

    v2 v3  
    1313
    1414Thanks for the hint. I have also an own idea to implement this. My implementation   should be optimal with respect to the flop count, but yours could be faster since matrix multiplication and powers are well optimized. I will compare both methods and use the faster one.
     15
     16For reference: The method which I mean is based on the generalized recursion formula (originating from the cosine addition theorem):
     17T_{n+m} + T{n-m} = 2 T_n T_m
     18
     19For T_N one can now use the binary representation of N to recursively build T_N in O(log N) time