Results 241 to 250 of about 1,922,795 (290)

Polynomials with Rational Coefficients Which are Hard to Compute

SIAM Journal on Computing, 1974
We present specific polynomials in \(\mathbb{C}[x]\) with algebraic or rational coefficients which are hard to compute (even though arbitrary complex numbers are allowed as inputs for the computation). Examples are: \(\sum_{\delta = 0}^d e^{2\pi i/2^\delta } x^\delta \), \(\sum_{\delta = 0}^d 2^{2^\delta } x^\delta \).
Volker Strassen
exaly   +3 more sources

Polynomials with Irrational Coefficients

2001
Polynomials in one or several variables have a specific type in MAPLE, the type polynom. However, introducing such objects doesn’t require any specific declaration. The user simply enters the polynomials with the help of the usual arithmetic operators +, -, * and ^.
Jack-Michel Cornil, Philippe Testud
openaire   +1 more source

Computation of the Galois group of a polynomial with rational coefficients. II

Journal of Mathematical Sciences, 2006
Summary: A new method, which enables us to compute rather efficiently the Galois group of a polynomial over \(\mathbb Q\) or over \(\mathbb Z\), is presented. Reductions of this polynomial with respect to different prime modules are studied, and the information obtained is used for the calculation of the Galois group of the initial polynomial.
openaire   +3 more sources

On the Zeros of Linear Differential Polynomials with Small Rational Coefficients

Journal of the London Mathematical Society, 1987
We prove the following: Suppose that f(z) is transcendental and meromorphic of finite order in the plane, and that the linear differential polynomial F(z) is defined by \[ F(z)=f^{(k)}(z)+...+a_ 0(z)f(z) \] and is non-constant, where \(a_{k-1}(z),...,a_ 0(z)\) are rational functions vanishing at infinity. Then \[ N(r,1/(fFF'))=O(\log r) \] implies that
openaire   +1 more source

Rational Polynomial Coefficients Modeling and Bias Correction by Using Iterative Polynomial Augmentation

Journal of the Indian Society of Remote Sensing, 2018
In this article, we establish an update procedure for rapid positioning coefficients or rational polynomial coefficients (RPCs) via iterative refinements using polynomial augmentation and reference images. RPCs are widely popular in establishing a ground-to-image relationship without using physical sensor model.
Bhaskar Dubey   +2 more
openaire   +1 more source

Rational polynomial coefficients generation for high resolution Ziyuan-3 imagery

2017 IEEE 14th International Conference on Networking, Sensing and Control (ICNSC), 2017
Sensor model is required to build the relationship between the three-dimensional (3D) object space and two-dimensional (2D) image space of high resolution satellite imagery (HRSI). However, each satellite sensor has its own imaging system with different physical sensor model, which increases the difficulty of geometric integration of heterogeneous ...
Zhonghua Hong   +5 more
openaire   +1 more source

Note on the coefficients of rational Ehrhart quasi-polynomials of Minkowski-sums

Online Journal of Analytic Combinatorics, 2015
By extending former results of Ehrhart, it was shown by Peter McMullen that the number of lattice points in the Minkowski-sum of dilated rational polytopes is a quasipolynomial function in the dilation factors. Here we take a closer look at the coefficients of these quasi-polynomials and show that they are piecewise polynomials themselves and that they
Henk, Martin, Link, Eva
openaire   +2 more sources

Home - About - Disclaimer - Privacy