Suchergebnisse - irreducible factorization algorithms

Polynomial Factorization Over Henselian Fields von 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 …”
Volltext

Edge detection using G-lets based on matrix factorization by group representations von 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 …”
Volltext

Factoring polynomials of the form f(xn)∈Fq[x] von 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 …”
Volltext

A characterization of strongly computable finite factorization domains von 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 …”
Volltext

Plane curve germs and contact factorization von 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 …”
Volltext

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

“… We propose an imputation algorithm for missing spatiotemporal data based on long short-term memory (LSTM …”
Volltext

A characterization of strongly computable finite factorization domains: A Characterization of Strongly von 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 …”
Volltext

Zeroing the Output of Nonlinear Systems Without Relative Degree von 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 …”
Volltext

On dynamic algorithms for factorization invariants in numerical monoids von 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 …”
Volltext

Plane curve germs and contact factorization: Plane curve germs von 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 …”
Volltext

One-particle many-body Green's function theory: Algebraic recursive definitions, linked-diagram theorem, irreducible-diagram theorem, and general-order algorithms von 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 …”
Weitere Angaben

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

“… An algorithm for factorization of differential systems is proposed that is not always applicable but executable in polynomial time …”
Volltext

Approximate contact factorization of germs of plane curves von 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 …”
Volltext

Factorization and irreducibility of composed products von 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 …”
Volltext

On Efficient Noncommutative Polynomial Factorization via Higman Linearization von 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 …”
Volltext

Towards toric absolute factorization von 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 …”
Volltext

Decompositions of Nonlinear Input-Output Systems to Zero the Output von 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 …”
Volltext

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

“… . Equal-degree factorization (EDF) factors a polynomial whose irreducible factors have the same degree …”
Volltext

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

Volltext

Computational aspects of modular forms and Galois representations: how one can compute in polynomial time the value of Ramanujan's tau at a prime. von 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 …”
Volltext