Results 1  10
of
332,361
Polynomial Coefficients
"... A large block of QuickBird Basic Imagery has been analyzed for optimal control distribution and scene ties. This has been done by three dimensional adjustment of a block of Basic Imagery using satellite ephemeris and attitude (quaternion) data along with ground control points (GCPs). Different GCPs ..."
Abstract
 Add to MetaCart
A large block of QuickBird Basic Imagery has been analyzed for optimal control distribution and scene ties. This has been done by three dimensional adjustment of a block of Basic Imagery using satellite ephemeris and attitude (quaternion) data along with ground control points (GCPs). Different GCPs configuration and check points were used to assess the achieved accuracy. Only the horizontal coordinates of the ground control points and check points have been available, so the SRTM – height model was used for the third dimension. Discrepancies between the inner and exterior accuracy determined by check points indicate remaining systematic effects of the QuickBird images. Recommendations for the handling and the control point density are given. 1.
LIMITS OF qPOLYNOMIAL COEFFICIENTS
, 1986
"... It is well known that the ^binomial (Gaussian) coefficients ..."
On the Evaluation of Polynomial Coefficients
 Numer. Algebra
"... The evaluation of the coecients of a polynomial from its zeros is considered. We show that when the evaluation is carried out by the standard algorithm in nite precision arithmetic, the accuracy of the computed coecients depends on the order in which the zeros are introduced. An ordering that enhan ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
The evaluation of the coecients of a polynomial from its zeros is considered. We show that when the evaluation is carried out by the standard algorithm in nite precision arithmetic, the accuracy of the computed coecients depends on the order in which the zeros are introduced. An ordering
Polynomial Coefficient Enumeration
, 2008
"... Abstract Let f(x1,..., xk) be a polynomial over a field K. This paper considers such questions as the enumeration of the number of nonzero coefficients of f or of the number of coefficients equal to α ∈ K ∗. For instance, if K = Fq then a matrix formula is obtained for the number of coefficients of ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract Let f(x1,..., xk) be a polynomial over a field K. This paper considers such questions as the enumeration of the number of nonzero coefficients of f or of the number of coefficients equal to α ∈ K ∗. For instance, if K = Fq then a matrix formula is obtained for the number of coefficients
Factoring polynomials with rational coefficients
 MATH. ANN
, 1982
"... In this paper we present a polynomialtime algorithm to solve the following problem: given a nonzero polynomial fe Q[X] in one variable with rational coefficients, find the decomposition of f into irreducible factors in Q[X]. It is well known that this is equivalent to factoring primitive polynomia ..."
Abstract

Cited by 982 (11 self)
 Add to MetaCart
In this paper we present a polynomialtime algorithm to solve the following problem: given a nonzero polynomial fe Q[X] in one variable with rational coefficients, find the decomposition of f into irreducible factors in Q[X]. It is well known that this is equivalent to factoring primitive
Hypergeometric solutions of linear recurrences with polynomial coefficients
 J. Symb. Comput
, 1992
"... We describe algorithm Hyper which can be used to find all hypergeometric solutions of linear recurrences with polynomial coefficients. Let K be a field of characteristic zero. We assume that K is computable, meaning that the elements of K can be finitely represented and that there exist algorithms f ..."
Abstract

Cited by 77 (11 self)
 Add to MetaCart
We describe algorithm Hyper which can be used to find all hypergeometric solutions of linear recurrences with polynomial coefficients. Let K be a field of characteristic zero. We assume that K is computable, meaning that the elements of K can be finitely represented and that there exist algorithms
Fault diagnosis · Vtransform · Polynomial coefficients
"... Abstract This paper is an exposition of recent advances made in polynomial coefficient and Vtransform coefficient based testing of parametric faults in linear and nonlinear analog circuits. Vtransform is a nonlinear transform that increases the sensitivity of polynomial coefficients with respect ..."
Abstract
 Add to MetaCart
Abstract This paper is an exposition of recent advances made in polynomial coefficient and Vtransform coefficient based testing of parametric faults in linear and nonlinear analog circuits. Vtransform is a nonlinear transform that increases the sensitivity of polynomial coefficients with respect
A,B,C Polynomial coefficients
"... ant colony algorithm. Journal of Aerospace Computing, Information, and Communication, 7 (9). pp. ..."
Abstract
 Add to MetaCart
ant colony algorithm. Journal of Aerospace Computing, Information, and Communication, 7 (9). pp.
Results 1  10
of
332,361