• Home
    Tables – Mathematics – Algebraic Algorithms

    1Euclidean AlgorithmUsed to find the greatest common divisor of two integers.
    2Extended Euclidean AlgorithmAn extension of Euclidean, computes the integers coefficients of Bézout’s identity
    3Quadratic FormulaUsed to solve any quadratic equation.
    4Newton’s MethodAn iterative method for finding successively better approximations to the roots.
    5Gauss-Jordan EliminationAlgorithm for solving systems of linear equations.
    6Gaussian EliminationUsed to solve systems of linear equations.
    7Fast Fourier Transform AlgorithmEfficient method to compute the discrete Fourier transform and its inverse.
    8Strassen’s AlgorithmAn algorithm for matrix multiplication which is faster than naive multiplication.
    9Polynomial Long DivisionProcedure for dividing a polynomial by another polynomial of the same or lower degree.
    10Newton-Raphson DivisionUtilized for finding the root of a real-valued function.
    11Horner’s SchemeEfficient algorithm for evaluating polynomial expressions.
    12Polynomial Interpolation AlgorithmTo construct new data points within the range of discrete set of known data points.
    13Fibonacci AlgorithmGenerates the n’th Fibonacci number.
    14Roots of UnitySolves problems related to nth roots of 1 in complex numbers.
    15Primality TestingTo check whether a given number is prime or not.
    16Sieve of EratosthenesAn ancient algorithm for finding all prime numbers up to a specified integer.
    17Chinese Remainder TheoremFinds the smallest positive integer which satisfies a series of remainder conditions.
    18Schoof’s AlgorithmComputes the number of points on an elliptic curve over a finite field.
    19Shor’s AlgorithmA quantum algorithm for integer factorization.
    20Berlekamp-Massey AlgorithmA linear-feedback shift register (LFSR) synthesis algorithm.