TOPICS
Search

Search Results for ""


381 - 390 of 1300 for Chebyshev integralSearch Results
The integral kernel in the Poisson integral, given by K(psi)=1/(2pi)(1-|z_0|^2)/(|z_0-e^(ipsi)|^2) (1) for the open unit disk D(0,1). Writing z_0=re^(itheta) and taking ...
A polar representation of a complex measure mu is analogous to the polar representation of a complex number as z=re^(itheta), where r=|z|, dmu=e^(itheta)d|mu|. (1) The analog ...
Let the two-dimensional cylinder function be defined by f(x,y)={1 for r<R; 0 for r>R. (1) Then the Radon transform is given by ...
If f(omega) is square integrable over the real omega-axis, then any one of the following implies the other two: 1. The Fourier transform F(t)=F_omega[f(omega)](t) is 0 for ...
A volume element is the differential element dV whose volume integral over some range in a given coordinate system gives the volume of a solid, V=intintint_(G)dxdydz. (1) In ...
The Van Lint-Schrijver Graph graph is a weakly regular Hamiltonian graph on 162 vertices with parameters (nu,k,lambda,mu)=(162,(6),(0),(0,1)). It is distance-regular with ...
The beta function B(p,q) is the name used by Legendre and Whittaker and Watson (1990) for the beta integral (also called the Eulerian integral of the first kind). It is ...
In graph theory, a cycle graph C_n, sometimes simply known as an n-cycle (Pemmaraju and Skiena 2003, p. 248), is a graph on n nodes containing a single cycle through all ...
The generalized minimal residual (GMRES) method (Saad and Schultz 1986) is an extension of the minimal residual method (MINRES), which is only applicable to symmetric ...
A spanning tree of a graph on n vertices is a subset of n-1 edges that form a tree (Skiena 1990, p. 227). For example, the spanning trees of the cycle graph C_4, diamond ...
1 ... 36|37|38|39|40|41|42 ... 130 Previous Next

...