TOPICS
Search

Search Results for ""


1701 - 1710 of 4277 for Graphing FunctionsSearch Results
An integral equation of the form f(x)=int_a^xK(x,t)phi(t)dt, where K(x,t) is the integral kernel, f(x) is a specified function, and phi(t) is the function to be solved for.
An integral equation of the form phi(x)=f(x)+int_a^xK(x,t)phi(t)dt, where K(x,t) is the integral kernel, f(x) is a specified function, and phi(t) is the function to be solved ...
Adomian polynomials decompose a function u(x,t) into a sum of components u(x,t)=sum_(n=0)^inftyu_n(x,t) (1) for a nonlinear operator F as F(u(x,t))=sum_(n=0)^inftyA_n. (2) ...
Chebyshev-Gauss quadrature, also called Chebyshev quadrature, is a Gaussian quadrature over the interval [-1,1] with weighting function W(x)=(1-x^2)^(-1/2) (Abramowitz and ...
A harmonic number is a number of the form H_n=sum_(k=1)^n1/k (1) arising from truncation of the harmonic series. A harmonic number can be expressed analytically as ...
In functional analysis, the Lax-Milgram theorem is a sort of representation theorem for bounded linear functionals on a Hilbert space H. The result is of tantamount ...
In the most commonly used convention (e.g., Apostol 1967, pp. 205-207), the second fundamental theorem of calculus, also termed "the fundamental theorem, part II" (e.g., ...
The median of a statistical distribution with distribution function D(x) is the value x such D(x)=1/2. For a symmetric distribution, it is therefore equal to the mean. Given ...
The all-pairs shortest path problem is the determination of the shortest graph distances between every pair of vertices in a given graph. The problem can be solved using n ...
There are several definitions of "almost Hamiltonian" in use. As defined by Punnim et al. (2007), an almost Hamiltonian graph is a graph on n nodes having Hamiltonian number ...
1 ... 168|169|170|171|172|173|174 ... 428 Previous Next

...