Search Results for ""

The Frobenius equation is the Diophantine equation a_1x_1+a_2x_2+...+a_nx_n=b, where the a_i are positive integers, b is an integer, and the solutions x_i are nonnegative ...

Let A=a_(ij) be a matrix with positive coefficients so that a_(ij)>0 for all i,j=1, 2, ..., n, then A has a positive eigenvalue lambda_0, and all its eigenvalues lie on the ...

Let C_(L,M) be a Padé approximant. Then C_((L+1)/M)S_((L-1)/M)-C_(L/(M+1))S_(L/(M+1)) = C_(L/M)S_(L/M) (1) C_(L/(M+1))S_((L+1)/M)-C_((L+1)/M)S_(L/(M+1)) = ...

If f^'(x) is continuous and the integral converges, int_0^infty(f(ax)-f(bx))/xdx=[f(0)-f(infty)]ln(b/a).

A system of linear differential equations (dy)/(dz)=A(z)y, (1) with A(z) an analytic n×n matrix, for which the matrix A(z) is analytic in C^_\{a_1,...,a_N} and has a pole of ...

At least one power series solution will be obtained when applying the Frobenius method if the expansion point is an ordinary, or regular, singular point. The number of roots ...

A function element is an ordered pair (f,U) where U is a disk D(Z_0,r) and f is an analytic function defined on U. If W is an open set, then a function element in W is a pair ...

A finite extension K=Q(z)(w) of the field Q(z) of rational functions in the indeterminate z, i.e., w is a root of a polynomial a_0+a_1alpha+a_2alpha^2+...+a_nalpha^n, where ...

The infimum of all number a for which |f(z)|<=exp(|z|^a) holds for all |z|>r and f an entire function, is called the order of f, denoted lambda=lambda(f) (Krantz 1999, p. ...

f(I) is the collection of all real-valued continuous functions defined on some interval I. f^((n))(I) is the collection of all functions in f(I) with continuous nth ...