Search Results for ""
1211 - 1220 of 2275 for Interval_graphSearch Results
Suppose f(x) is continuous at a stationary point x_0. 1. If f^'(x)>0 on an open interval extending left from x_0 and f^'(x)<0 on an open interval extending right from x_0, ...
Let c and d!=c be real numbers (usually taken as c=1 and d=0). The Dirichlet function is defined by D(x)={c for x rational; d for x irrational (1) and is discontinuous ...
Chebyshev iteration is a method for solving nonsymmetric problems (Golub and van Loan 1996, §10.1.5; Varga, 1962, Ch. 5). Chebyshev iteration avoids the computation of inner ...
A convex function is a continuous function whose value at the midpoint of every interval in its domain does not exceed the arithmetic mean of its values at the ends of the ...
Let rho(x)dx be the fraction of time a typical dynamical map orbit spends in the interval [x,x+dx], and let rho(x) be normalized such that int_0^inftyrho(x)dx=1 over the ...
Taylor's inequality is an estimate result for the value of the remainder term R_n(x) in any n-term finite Taylor series approximation. Indeed, if f is any function which ...
If f is continuous on a closed interval [a,b], then there is at least one number x^* in [a,b] such that int_a^bf(x)dx=f(x^*)(b-a). The average value of the function (f^_) on ...
There are no fewer than three distinct notions of curve throughout mathematics. In topology, a curve is a one-dimensional continuum (Charatonik and Prajs 2001). In algebraic ...
The successive overrelaxation method (SOR) is a method of solving a linear system of equations Ax=b derived by extrapolating the Gauss-Seidel method. This extrapolation takes ...
Bisection is the division of a given curve, figure, or interval into two equal parts (halves). A simple bisection procedure for iteratively converging on a solution which is ...
...
View search results from all Wolfram sites (19078 matches)

