Search Results for ""

An integer-relation algorithm which is based on a partial sum of squares approach, from which the algorithm takes its name.

Let f(x) be integrable in [-1,1], let (1-x^2)f(x) be of bounded variation in [-1,1], let M^' denote the least upper bound of |f(x)(1-x^2)| in [-1,1], and let V^' denote the ...

A general set of methods for integrating ordinary differential equations. Predictor-corrector methods proceed by extrapolating a polynomial fit to the derivative from the ...

Given a matrix A, its QR-decomposition is a matrix decomposition of the form A=QR, where R is an upper triangular matrix and Q is an orthogonal matrix, i.e., one satisfying ...

A variation of the method of false position for finding roots which fits the function in question with an exponential.

Let K subset= C be compact, let f be analytic on a neighborhood of K, and let P subset= C^*\K contain at least one point from each connected component of C^*\K. Then for any ...

A root-finding algorithm which assumes a function to be approximately linear in the region of interest. Each improvement is taken as the point where the approximating line ...

A singular integral is an integral whose integrand reaches an infinite value at one or more points in the domain of integration. Even so, such integrals can converge, in ...

X is a spherical t-design in E iff it is possible to exactly determine the average value on E of any polynomial f of degree at most t by sampling f at the points of X. In ...

A transform which localizes a function both in space and scaling and has some desirable properties compared to the Fourier transform. The transform is based on a wavelet ...