Search Results for ""
541 - 550 of 1340 for Root Finding AlgorithmSearch Results
Let X be a set. Then a sigma-algebra F is a nonempty collection of subsets of X such that the following hold: 1. X is in F. 2. If A is in F, then so is the complement of A. ...
A solid of revolution is a solid enclosing the surface of revolution obtained by rotating a 1-dimensional curve, line, etc. about an axis. A portion of a solid of revolution ...
Squarefree factorization is a first step in many factoring algorithms. It factors nonsquarefree polynomials in terms of squarefree factors that are relatively prime. It can ...
A submersion is a smooth map f:M->N when dimM>=dimN, given that the differential, or Jacobian, is surjective at every x in M. The basic example of a submersion is the ...
A pair (M,omega), where M is a manifold and omega is a symplectic form on M. The phase space R^(2n)=R^n×R^n is a symplectic manifold. Near every point on a symplectic ...
Given a nonhomogeneous ordinary differential equation, select a differential operator which will annihilate the right side, and apply it to both sides. Find the solution to ...
The tribonacci numbers are a generalization of the Fibonacci numbers defined by T_1=1, T_2=1, T_3=2, and the recurrence equation T_n=T_(n-1)+T_(n-2)+T_(n-3) (1) for n>=4 ...
A regularly spaced array of points in a square array, i.e., points with coordinates (m,n,...), where m, n, ... are integers. Such an array is often called a grid or mesh, and ...
There are two problems commonly known as the subset sum problem. The first ("given sum problem") is the problem of finding what subset of a list of integers has a given sum, ...
An infinite sequence of positive integers 1<=b_1<b_2<b_3<..., (1) also called a Sidon sequence, such that all pairwise sums b_i+b_j (2) for i<=j are distinct (Guy 1994). An ...
...
View search results from all Wolfram sites (23349 matches)

