Výsledky vyhľadávania - irreducible factorization algorithms

Polynomial Factorization Over Henselian Fields Autor Alberich-Carramiñana, Maria, Guàrdia, Jordi, Nart, Enric, Poteaux, Adrien, Roé, Joaquim, Weimann, Martin

“…We present an algorithm that, given an irreducible polynomial g over a general valued field ( K ,  v…”
Získať plný text

Edge detection using G-lets based on matrix factorization by group representations Autor B, Rajathilagam, Rangarajan, Murali

“…Features of G-lets Edge Operator:•Geometry of objects in the image are preserved.•Edges are continuous.•Tracking outlines of small objects in cluttered images…”
Získať plný text

Factoring polynomials of the form f(xn)∈Fq[x] Autor Brochero Martínez, F.E., Reis, Lucas

“…(xn). Using this algorithm, we give the complete factorization of xn−1 into irreducible factors in the case where n…”
Získať plný text

A characterization of strongly computable finite factorization domains Autor Soto-Rosa, Geraldo, Ocasio-González, Victor

“… It was shown that strongly computable strong finite factorization domains (SCSFFD) have necessarily computable irreducible elements and a computable division algorithm…”
Získať plný text

Plane curve germs and contact factorization Autor van der Hoeven, Joris, Lecerf, Grégoire

“… With a suitable representation of the irreducible components, and whenever the characteristic of the ground field is zero or larger than the degree of the germ, we design a new algorithm…”
Získať plný text

Parameter-Transferred Irreducible LSTM for Traffic Data Imputation Autor Kwon, Jungmin, Park, Hyunggon

“…We propose an imputation algorithm for missing spatiotemporal data based on long short-term memory (LSTM…”
Získať plný text

A characterization of strongly computable finite factorization domains: A Characterization of Strongly Autor Soto-Rosa, Geraldo, Ocasio-González, Victor

“… It was shown that strongly computable strong finite factorization domains (SCSFFD) have necessarily computable irreducible elements and a computable division algorithm…”
Získať plný text

Zeroing the Output of Nonlinear Systems Without Relative Degree Autor Gray, W. Steven, Ebrahimi-Fard, Kurusch, Schmeding, Alexander

“… This is achieved by viewing the latter as the symmetric algebra over the commutative polynomials in Lyndon words in order to show that it is a unique factorization domain…”
Získať plný text

On dynamic algorithms for factorization invariants in numerical monoids Autor Barron, Thomas, O'Neill, Christopher, Pelayo, Roberto

“… While progress in this field has been accelerated by the use of computer algebra systems, many existing algorithms are computationally infeasible for numerical monoids with several irreducible elements…”
Získať plný text

Plane curve germs and contact factorization: Plane curve germs Autor van der Hoeven, Joris, Lecerf, Grégoire

“… With a suitable representation of the irreducible components, and whenever the characteristic of the ground field is zero or larger than the degree of the germ, we design a new algorithm…”
Získať plný text

One-particle many-body Green's function theory: Algebraic recursive definitions, linked-diagram theorem, irreducible-diagram theorem, and general-order algorithms Autor Hirata, So, Doran, Alexander E, Knowles, Peter J, Ortiz, J V

“… Six general-order algorithms of MBGF are developed, each implementing one of the three recursions, the ΔMPn method…”
Zistit podrobnosti o prístupe

Satellite Unknowns in Irreducible Differential Systems Autor Panferov, A. A.

“… An algorithm for factorization of differential systems is proposed that is not always applicable but executable in polynomial time…”
Získať plný text

Approximate contact factorization of germs of plane curves Autor van der Hoeven, Joris, Lecerf, Grégoire

“… With a suitable representation of the irreducible components, and whenever the characteristic of the ground field is zero or larger than the degree of the germ, we design a new algorithm…”
Získať plný text

Factorization and irreducibility of composed products Autor Kölsch, Lukas, Krompholz, Lucas, Kyureghyan, Gohar

“… Composed products yield a method to construct irreducible polynomials of large composite degrees from irreducible polynomials of lower degrees…”
Získať plný text

On Efficient Noncommutative Polynomial Factorization via Higman Linearization Autor Arvind, V., Joglekar, Pushkar S.

“… = F q is a finite field, we give a randomized algorithm that runs in time polynomial in s , n and log 2 q that computes a factorization of f as a product f = f 1 f 2…”
Získať plný text

Towards toric absolute factorization Autor Elkadi, M., Galligo, A., Weimann, M.

“…This article presents an algorithmic approach to study and compute the absolute factorization of a bivariate polynomial, taking into account the geometry of its monomials…”
Získať plný text

Decompositions of Nonlinear Input-Output Systems to Zero the Output Autor Gray, W Steven, Ebrahimi-Fard, Kurusch, Schmeding, Alexander

“…Consider an input-output system where the output is the tracking error given some desired reference signal. It is natural to consider under what conditions the…”
Získať plný text

Equal-degree factorization of binomials and trinomials over finite fields Autor Singh, Manjit, Deepak Sehrawat

“… . Equal-degree factorization (EDF) factors a polynomial whose irreducible factors have the same degree…”
Získať plný text

Exact and Heuristic Algorithms for Semi-Nonnegative Matrix Factorization Autor Gillis, Nicolas, Kumar, Abhishek

Získať plný text

Computational aspects of modular forms and Galois representations: how one can compute in polynomial time the value of Ramanujan's tau at a prime. Autor Couveignes, Jean-Marc, Couveignes, Jean-Marc, Edixhoven, Bas

“… Prior to this book, the fastest known algorithms for computing these Fourier coefficients took exponential time, except in some special cases…”
Získať plný text