نتایج جستجو برای: inverse polynomial
تعداد نتایج: 185783 فیلتر نتایج به سال:
We study the invertibility of M -variate polynomial (respectively : Laurent polynomial) matrices of size N by P . Such matrices represent multidimensional systems in various settings including filter banks, multipleinput multiple-output systems, and multirate systems. Given an N × P polynomial matrix H(z) of degree at most k, we want to find a P × N polynomial (resp. : Laurent polynomial) left ...
Motivated by the concepts of inverse Kazhdan--Lusztig polynomial and equivariant polynomial, Proudfoot defined for a matroid. In this paper, we show that matroid is very useful determining its polynomials, determine polynomials Boolean matroids uniform matroids. As an application, give new proof Gedeon, Proudfoot, Young's formula Inspired Lee, Nasr, Radcliffe's combinatorial interpretation ordi...
Inverse maximum flow (IMDF), is among the most important problems in the field ofdynamic network flow, which has been considered the Euclidean norms measure in previousresearches. However, recent studies have mainly focused on the inverse problems under theHamming distance measure due to their practical and important applications. In this paper,we studies a general approach for handling the inv...
This work is concerned with the development of inverse-type inequalities for piecewise polynomial functions and, in particular, functions belonging to hp-finite element spaces. The cases of positive and negative Sobolev norms are considered for both continuous and discontinuous finite element functions.The inequalities are explicit both in the local polynomial degree and the local mesh size.The...
We study the compositional inverses of some general classes of permutation polynomials over finite fields. We show that we can write these inverses in terms of the inverses of two other polynomials bijecting subspaces of the finite field, where one of these is a linearized polynomial. In some cases we are able to explicitly obtain these inverses, thus obtaining the compositional inverse of the ...
Abstract Given polynomials a(λ) of degree m and b(λ) of degree n, we represent the inverse to the Sylvester resultant matrix of a and b, if this inverse exists, as a canonical sum of m + n dyadic matrices each of which is a rational function of zeros of a and b. As a result, we obtain the polynomial solutions x(λ) of degree n − 1 and y(λ) of degree m − 1 to the equation a(λ)x(λ) + b(λ)y(λ) = c(...
We prove that if there is a polynomial time algorithm which computes the permanent of a matrix of order n for any inverse polynomial fraction of all inputs, then there is a BPP algorithm computing the permanent for every matrix. It follows that this hypothesis implies P #P = BPP. Our algorithm works over any suuciently large nite eld (polynomially larger than the inverse of the assumed success ...
a function is said to be bi-univalent on the open unit disk d if both the function and its inverse are univalent in d. not much is known about the behavior of the classes of bi-univalent functions let alone about their coefficients. in this paper we use the faber polynomial expansions to find coefficient estimates for four well-known classes of bi-univalent functions which are defined by subord...
We give a short and elementary proof of an inverse Bernsteintype inequality found by S. Khrushchev for the derivative of a polynomial having all its zeros on the unit circle . The inequality is used to show that equally-spaced points solve a min-max-min problem for the logarithmic potential of such polynomials. Using techniques recently developed for polarization (Chebyshev-type) problems, we s...
A recurrence scheme is defined for the numerical determination of high degree polynomial approximations to functions as, for instance, inverse powers near zero. As an example, polynomials needed in the two-step multi-boson (TSMB) algorithm for fermion simulations are considered. For the polynomials needed in TSMB a code in C is provided which is easily applicable to polynomial degrees of severa...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید