Search Results for ""

An equation of the form y=ax^3+bx^2+cx+d where only one root is real.

One of the operations of addition, subtraction, multiplication, division, and integer (or rational) root extraction.

A ring without zero divisors in which an integer norm and an associated division algorithm (i.e., a Euclidean algorithm) can be defined. For signed integers, the usual norm ...

A specific prescription for carrying out a task or solving a problem. Also called an algorithm, method, or technique

A method for finding recurrence relations for hypergeometric polynomials directly from the series expansions of the polynomials. The method is effective and easily ...

An O(nlgn) sorting algorithm which is not quite as fast as quicksort. It is a "sort-in-place" algorithm and requires no auxiliary storage, which makes it particularly concise ...

A problem is assigned to the P (polynomial time) class if there exists at least one algorithm to solve that problem, such that the number of steps of the algorithm is bounded ...

A pair of closed form functions (F,G) is said to be a Wilf-Zeilberger pair if F(n+1,k)-F(n,k)=G(n,k+1)-G(n,k). (1) The Wilf-Zeilberger formalism provides succinct proofs of ...

A generalization of the Bulirsch-Stoer algorithm for solving ordinary differential equations.

The number of single operations (of addition, subtraction, and multiplication) required to complete an algorithm.