如何加速此程序以查找斐波那契数列

def fibonacci(n, memo={}):
    if n in memo:
        return memo[n]
    if n <= 1:
        return n
    memo[n] = fibonacci(n-1, memo) + fibonacci(n-2, memo)
    return memo[n]

def fibonacci_dp(n):
    if n <= 1:
        return n
    fib = [0] * (n+1)
    fib[1] = 1
    for i in range(2, n+1):
        fib[i] = fib[i-1] + fib[i-2]
    return fib[n]

import numpy as np

def matrix_power(matrix, n):
    result = np.identity(len(matrix), dtype=int)
    while n > 0:
        if n % 2 == 1:
            result = np.dot(result, matrix)
        matrix = np.dot(matrix, matrix)
        n //= 2
    return result

def fibonacci_matrix(n):
    if n <= 1:
        return n
    base_matrix = np.array([[1, 1], [1, 0]], dtype=int)
    result_matrix = matrix_power(base_matrix, n-1)
    return result_matrix[0][0]