TOPICS
Search

Search Results for ""


2261 - 2270 of 13135 for dimensional analysisSearch Results
For r and x real, with 0<=arg(sqrt(k^2-tau^2))<pi and 0<=argk<pi, 1/2iint_(-infty)^inftyH_0^((1))(rsqrt(k^2-tau^2))e^(itaux)dtau=(e^(iksqrt(r^2+x^2)))/(sqrt(r^2+x^2)), where ...
An natural equation which expresses a curve in terms of its arc length s and tangential angle phi.
The second-order ordinary differential equation y^('')+[A+Bcos(2x)+Ccos(4x)]y=0.
An oriented surface for which every point belongs to a Wiedersehen pair. Proof of the Blaschke conjecture established that the only Wiedersehen surfaces are the standard ...
Recall the definition of the autocorrelation function C(t) of a function E(t), C(t)=int_(-infty)^inftyE^_(tau)E(t+tau)dtau. (1) Also recall that the Fourier transform of E(t) ...
The integral transform obtained by defining omega=-tan(1/2delta), (1) and writing H(omega)=R(omega)+iX(omega), (2) where R(omega) and X(omega) are a Hilbert transform pair as ...
Wilker's inequalities state that 2+(16)/(pi^4)x^3tanx<(sin^2x)/(x^2)+(tanx)/x<2+2/(45)x^3tanx for 0<x<pi/2, where the constants 2/45 and 16/pi^4 are the best possible ...
The integral transform defined by (Kphi)(x) =int_(-infty)^inftyG_(p+2,q)^(m,n+2)(t|1-nu+ix,1-nu-ix,(a_p); (b_p))phi(t)dt, where G_(c,d)^(a,b) is the Meijer G-function.
A discrete fast Fourier transform algorithm which can be implemented for N=2, 3, 4, 5, 7, 8, 11, 13, and 16 points.
Constants gamma such that [int_Omega|f|^qdx]^(1/q)<=gamma[int_Omegasum_(i=1)^N|(partialf)/(partialx_i)|^pdx]^(1/p), where f is a real-valued smooth function on a region Omega ...
1 ... 224|225|226|227|228|229|230 ... 1314 Previous Next

...