TOPICS
Search

Search Results for ""


401 - 410 of 1797 for Exponential EquationSearch Results
The finite Fourier cosine transform of an apodization function, also known as an apparatus function. The instrument function I(k) corresponding to a given apodization ...
If f_1,...,f_m:R^n->R are exponential polynomials, then {x in R^n:f_1(x)=...f_n(x)=0} has finitely many connected components.
The Kronecker sum is the matrix sum defined by A direct sum B=A tensor I_b+I_a tensor B, (1) where A and B are square matrices of order a and b, respectively, I_n is the ...
A statistic defined to improve the Kolmogorov-Smirnov test in the tails.
(theta_3(z,t)theta_4(z,t))/(theta_4(2z,2t))=(theta_3(0,t)theta_4(0,t))/(theta_4(0,2t))=(theta_2(z,t)theta_1(z,t))/(theta_1(2z,2t)), where theta_i are Jacobi theta functions. ...
Given a function of the form y=a+blnx, (1) the coefficients can be found from least squares fitting as b = ...
Given a function of the form y=Ax^B, (1) least squares fitting gives the coefficients as b = ...
Let f(x) be a finite and measurable function in (-infty,infty), and let epsilon be freely chosen. Then there is a function g(x) such that 1. g(x) is continuous in ...
The power A^n of a matrix A for n a nonnegative integer is defined as the matrix product of n copies of A, A^n=A...A_()_(n). A matrix to the zeroth power is defined to be the ...
The maximal matching-generating polynomial M_G(x) for the graph G may be defined as the polynomial M_G(x)=sum_(k=nu_L(G))^(nu(G))m_kx^k, where nu_L(G) is the lower matching ...
1 ... 38|39|40|41|42|43|44 ... 180 Previous Next

...