Search Results for ""
271 - 280 of 616 for sort algorithmsSearch Results
Ruffini's rule a shortcut method for dividing a polynomial by a linear factor of the form x-a which can be used in place of the standard long division algorithm. This method ...
The shoelace formula, also known as Gauss's area formula, the shoelace algorithm, shoelace method, or surveyor's formula, is a name sometimes given to the polygon area ...
An algorithm for making tables of primes. Sequentially write down the integers from 2 to the highest number n you wish to include in the table. Cross out all numbers >2 which ...
There appears to be no term in standard use for a graph with graph crossing number 1. Furthermore, the terms "almost planar" and "1-planar" are used in the literature for ...
A method for finding recurrence relations for hypergeometric polynomials directly from the series expansions of the polynomials. The method is effective and easily ...
The Soifer graph, illustrated above in a number of embeddings, is a planar graph on 9 nodes that tangles the Kempe chains in Kempe's algorithm and thus provides an example of ...
The square root method is an algorithm which solves the matrix equation Au=g (1) for u, with A a p×p symmetric matrix and g a given vector. Convert A to a triangular matrix ...
The successive square method is an algorithm to compute a^b in a finite field GF(p). The first step is to decompose b in successive powers of two, b=sum_(i)delta_i2^i, (1) ...
The conjugate gradient method can be viewed as a special variant of the Lanczos method for positive definite symmetric systems. The minimal residual method and symmetric LQ ...
Synthetic division is a shortcut method for dividing two polynomials which can be used in place of the standard long division algorithm. This method reduces the dividend and ...
...
View search results from all Wolfram sites (14029 matches)

