Jump to content

Search results

View (previous 20 | ) (20 | 50 | 100 | 250 | 500)
  • In single-variable calculus, the difference quotient is usually the name for the expression f ( x + h ) − f ( x ) h {\displaystyle {\frac {f(x+h)-f(x)}{h}}}...
    21 KB (4,699 words) - 16:46, 28 May 2024
  • division algorithm is an algorithm which, given two integers N and D (respectively the numerator and the denominator), computes their quotient and/or remainder...
    42 KB (5,900 words) - 19:09, 10 May 2025
  • Thumbnail for Euclidean algorithm
    ensures that such a quotient and remainder always exist and are unique. In Euclid's original version of the algorithm, the quotient and remainder are found...
    126 KB (15,349 words) - 16:35, 30 April 2025
  • Rutishauser took an algorithm of Alexander Aitken for this task and developed it into the quotientdifference algorithm or qd algorithm. After arranging...
    27 KB (4,226 words) - 04:59, 24 April 2025
  • extra cost, the quotients of a and b by their greatest common divisor. Extended Euclidean algorithm also refers to a very similar algorithm for computing...
    28 KB (4,467 words) - 20:39, 9 June 2025
  • Thumbnail for Bernoulli's method
    Bernoulli's method (category Polynomial factorization algorithms)
    Computational Complex Analysis: II. New Developments Concerning the Quotient-Difference Algorithm". Computational Aspects of Complex Analysis. pp. 149–168. doi:10...
    30 KB (3,557 words) - 13:43, 6 June 2025
  • A finite difference is a mathematical expression of the form f(x + b) − f(x + a). Finite differences (or the associated difference quotients) are often...
    38 KB (5,863 words) - 17:31, 5 June 2025
  • In imaging science, difference of Gaussians (DoG) is a feature enhancement algorithm that involves the subtraction of one Gaussian blurred version of an...
    9 KB (1,312 words) - 16:35, 16 June 2025
  • Thumbnail for Euclidean division
    without explicitly computing the quotient and the remainder. The methods of computation are called integer division algorithms, the best known of which being...
    16 KB (2,261 words) - 19:20, 5 March 2025
  • calculating the digits of π Gauss–Legendre algorithm: computes the digits of pi Division algorithms: for computing quotient and/or remainder of two numbers Goldschmidt...
    72 KB (7,951 words) - 17:13, 5 June 2025
  • A randomized algorithm is an algorithm that employs a degree of randomness as part of its logic or procedure. The algorithm typically uses uniformly random...
    33 KB (4,218 words) - 18:46, 19 February 2025
  • The Lanczos algorithm is an iterative method devised by Cornelius Lanczos that is an adaptation of power methods to find the m {\displaystyle m} "most...
    43 KB (8,283 words) - 10:58, 23 May 2025
  • Thumbnail for Doomsday rule
    The Doomsday rule, Doomsday algorithm or Doomsday method is an algorithm of determination of the day of the week for a given date. It provides a perpetual...
    42 KB (4,037 words) - 11:40, 11 April 2025
  • (I:J)} . The ideal quotient is useful for calculating primary decompositions. It also arises in the description of the set difference in algebraic geometry...
    7 KB (1,213 words) - 19:02, 30 January 2025
  • Montgomery modular multiplication (category Cryptographic algorithms)
    relies on a special representation of numbers called Montgomery form. The algorithm uses the Montgomery forms of a and b to efficiently compute the Montgomery...
    31 KB (4,593 words) - 01:48, 12 May 2025
  • HyperLogLog is an algorithm for the count-distinct problem, approximating the number of distinct elements in a multiset. Calculating the exact cardinality...
    13 KB (1,874 words) - 17:02, 13 April 2025
  • Discrete calculus (category Finite differences)
    called the difference quotient function or just the difference quotient of the original function. In formal terms, the difference quotient is a linear operator...
    39 KB (6,577 words) - 14:32, 2 June 2025
  • In mathematics, divided differences is an algorithm, historically used for computing tables of logarithms and trigonometric functions.[citation needed]...
    16 KB (3,721 words) - 11:03, 9 April 2025
  • subtracted (in case the number of quotients is odd) by the difference of the remainders. (Place the other quotients of the mutual division successively...
    21 KB (2,502 words) - 19:19, 10 January 2025
  • Thumbnail for Factorization
    needs an algorithm for finding a divisor q of n or deciding that n is prime. When such a divisor is found, the repeated application of this algorithm to the...
    42 KB (7,863 words) - 13:39, 5 June 2025
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)