Results 91 to 100 of about 1,498,288 (136)

RPC Correction Coefficient Extrapolation for KOMPSAT-3A Imagery in Inaccessible Regions

Remote Sensing
High-resolution pushbroom satellites routinely acquire multi-tenskilometer-scale strips whose vendors’ rational polynomial coefficients (RPCs) exhibit systematic, direction-dependent biases that accumulate downstream when ground control is sparse.
Namhoon Kim
doaj   +1 more source

Partial fraction evaluation and incomplete decomposition of a rational function whose denominator contains a repeated polynomial factor

, 1985
Attention is directed to those proper rational functions whose denominators may be expressed as the product of an Nth degree polynomial raised to the Kth power and another polynomial of degree M.
J. F. Mahoney
core   +1 more source

Polynomial cubic splines with tension properties [PDF]

, 2010
In this paper we present a new class of spline functions with tension properties. These splines are composed by polynomial cubic pieces and therefore are conformal to the standard, NURBS based CAD/CAM ...
Costantini, P., Manni, C., Kaklis, Panagiotis   +2 more
core  

Rational functions with positive coefficients, polynomials and uniform approximations [PDF]

Pacific Journal of Mathematics, 1980
openaire   +2 more sources

Limits of quotients of polynomial functions of three variables, Classification of G-graded twisted algebras and the computation of the F-rational locus

, 2015
This thesis is divided in three main parts. In the first part we provide a theoretical method to determine the existence of the limit of a quotient of polynomial functions of three variables.
Hernández Rodas, Juan Pablo
core  

Uniform approximation of rational functions by polynomials with integral coefficients

Duke Mathematical Journal, 1969
openaire   +3 more sources

On the Neighbourhood Polynomial

, 2017
The neighbourhood polynomial of a graph is the generating function for the neighbourhood complex, which contains all subsets of vertices which have a common neighbour. We begin with some formulas for computing the neighbourhood polynomial. We then show a
Day, Dylan
core  

Factoring polynomials with rational coefficients [PDF]

Mathematische Annalen, 1982
This paper describes a polynomial-time algorithm for the factorization of primitive polynomials \(f\in \mathbb Z[X]\) into irreducible factors. The number of bit operations used by the algorithm is \(O(n^{12} + n^9(\log \vert f\vert)^3)\), where \(n\) is the degree of \(f\) and \(\vert \sum_i a_iX^i \vert = (\sum_i a_i^2)^{1/2})\).
H W Lenstra, L Lovasz
exaly   +5 more sources

Some of the next articles are maybe not open access.

Related searches:

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

Logic Synthesis from Polynomials with Coefficients in the Field of Rationals

2023 IEEE 53rd International Symposium on Multiple-Valued Logic (ISMVL), 2023
Priyank Kalla
exaly   +3 more sources