Suchergebnisse - Polynomial factorization algorithm
-
1
Algorithm for spectral factorization of polynomial matrices on the real line: Algorithm for spectral factorization of polynomial
ISSN: 2662-2009, 2538-225XVeröffentlicht: Cham Springer International Publishing 01.01.2025Veröffentlicht in Advances in operator theory (01.01.2025)“… In this paper, we extend the basic idea of the Janashia–Lagvilava algorithm to adapt it for the spectral factorization of positive-definite polynomial matrices on the real line …”
Volltext
Journal Article -
2
An explicit Wiener-Hopf factorization algorithm for matrix polynomials and its exact realizations within ExactMPF package
ISSN: 1364-5021Veröffentlicht: England 01.07.2022Veröffentlicht in Proceedings of the Royal Society. A, Mathematical, physical, and engineering sciences (01.07.2022)“… We discuss an explicit algorithm for solving the Wiener-Hopf factorization problem for matrix polynomials …”
Weitere Angaben
Journal Article -
3
A note on Gao’s algorithm for polynomial factorization
ISSN: 0304-3975, 1879-2294Veröffentlicht: Elsevier B.V 01.04.2011Veröffentlicht in Theoretical computer science (01.04.2011)“… Shuhong Gao (2003) [6] has proposed an efficient algorithm to factor a bivariate polynomial f over a field F …”
Volltext
Journal Article -
4
A note on Gao's algorithm for polynomial factorization: Symbolic and Numerical Algorithms
ISSN: 0304-3975Veröffentlicht: Oxford Elsevier 2011Veröffentlicht in Theoretical computer science (2011)Volltext
Journal Article -
5
Antenna Array Design in MIMO Radar Using NSK Polynomial Factorization Algorithm
ISSN: 1687-5869, 1687-5877Veröffentlicht: Cairo, Egypt Hindawi Publishing Corporation 01.01.2016Veröffentlicht in International journal of antennas and propagation (01.01.2016)“… In addition, an algorithm based on Newton-Schubert-Kronecker (NSK) polynomial factorization is proposed …”
Volltext
Journal Article -
6
Verifiable outsourced computation over encrypted data
ISSN: 0020-0255, 1872-6291Veröffentlicht: Elsevier Inc 01.04.2019Veröffentlicht in Information sciences (01.04.2019)“… •An end-to-end system enables the public to verify outsourced computations.•Perform computations in ciphertexts in order to preserve data …”
Volltext
Journal Article -
7
Improved dense multivariate polynomial factorization algorithms
ISSN: 0747-7171, 1095-855XVeröffentlicht: Elsevier Ltd 2007Veröffentlicht in Journal of symbolic computation (2007)“… We present new deterministic and probabilistic algorithms that reduce the factorization of dense polynomials from several variables to one variable …”
Volltext
Journal Article -
8
Multichannel spectral factorization algorithm using polynomial matrix eigenvalue decomposition
ISSN: 1058-6393Veröffentlicht: IEEE 01.11.2015Veröffentlicht in Conference record - Asilomar Conference on Signals, Systems, & Computers (01.11.2015)“… In this paper, we present a new multichannel spectral factorization algorithm which can be utilized to calculate the approximate spectral factor of any para-Hermitian polynomial matrix …”
Volltext
Tagungsbericht Journal Article -
9
Algorithm for spectral factorization of polynomial matrices on the real line
ISSN: 2662-2009, 2538-225XVeröffentlicht: 01.01.2025Veröffentlicht in Advances in operator theory (01.01.2025)Volltext
Journal Article -
10
ALGORITHM FOR WIENER-HOPF FACTORIZATION OF POLYNOMIAL MATRICES WITH MONOMIAL DETERMINANT
ISSN: 1072-3374, 1573-8795Veröffentlicht: 04.04.2025Veröffentlicht in Journal of mathematical sciences (New York, N.Y.) (04.04.2025)Volltext
Journal Article -
11
On the acceleration of an algorithm for polynomial factorization
ISSN: 1064-5624, 1531-8362Veröffentlicht: Boston Springer US 01.09.2013Veröffentlicht in Doklady. Mathematics (01.09.2013)Volltext
Journal Article -
12
Polynomial factorization algorithms over number fields
ISSN: 0747-7171, 1095-855XVeröffentlicht: Elsevier Ltd 01.11.2004Veröffentlicht in Journal of symbolic computation (01.11.2004)“… The aim of this paper is to describe two new factorization algorithms for polynomials …”
Volltext
Journal Article -
13
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
ISSN: 0097-5397, 1095-7111Veröffentlicht: Philadelphia, PA Society for Industrial and Applied Mathematics 01.10.1997Veröffentlicht in SIAM journal on computing (01.10.1997)“… These algorithms take a number of steps polynomial in the input size, e.g., the number of digits of the integer to be factored …”
Volltext
Journal Article -
14
Factorization of Boolean Polynomials: Parallel Algorithms and Experimental Evaluation
ISSN: 0361-7688, 1608-3261Veröffentlicht: Moscow Pleiades Publishing 01.03.2021Veröffentlicht in Programming and computer software (01.03.2021)“… Polynomial factorization is a classical algorithmic algebra problem with a wide range of applications …”
Volltext
Journal Article -
15
Polynomial Factorization Over Henselian Fields
ISSN: 1615-3375, 1615-3383Veröffentlicht: New York Springer US 01.04.2025Veröffentlicht in Foundations of computational mathematics (01.04.2025)“… This allows us to develop a polynomial factorization algorithm and an irreducibility test that go beyond the classical discrete, rank-one case …”
Volltext
Journal Article -
16
An Algorithm for the Factorization of Split Quaternion Polynomials
ISSN: 0188-7009, 1661-4909, 1661-4909Veröffentlicht: Cham Springer International Publishing 01.07.2021Veröffentlicht in Advances in applied Clifford algebras (01.07.2021)“… We present an algorithm to compute all factorizations into linear factors of univariate polynomials over the split quaternions, provided such a factorization exists …”
Volltext
Journal Article -
17
A New Polynomial Factorization Algorithm and its Implementation
ISSN: 0747-7171, 1095-855XVeröffentlicht: Elsevier Ltd 1995Veröffentlicht in Journal of symbolic computation (1995)“… We consider the problem of factoring univariate polynomials over a finite field. We demonstrate that the new baby step/giant step factoring method, recently developed by Kaltofen and Shoup, can be made into a very practical algorithm …”
Volltext
Journal Article -
18
A Verified Implementation of the Berlekamp–Zassenhaus Factorization Algorithm
ISSN: 0168-7433, 1573-0670, 1573-0670Veröffentlicht: Dordrecht Springer Netherlands 01.04.2020Veröffentlicht in Journal of automated reasoning (01.04.2020)“… We further adapt an existing formalization of Yun’s square-free factorization algorithm to integer polynomials, and thus provide an efficient and certified factorization algorithm for arbitrary univariate polynomials …”
Volltext
Journal Article -
19
Modular Las Vegas algorithms for polynomial absolute factorization
ISSN: 0747-7171, 1095-855XVeröffentlicht: Elsevier Ltd 01.12.2010Veröffentlicht in Journal of symbolic computation (01.12.2010)“… Let f(X,Y)∈Z[X,Y] be an irreducible polynomial over Q. We give a Las Vegas absolute irreducibility test based on a property of the Newton polytope of f, or more precisely, of f modulo some prime integer p …”
Volltext
Journal Article -
20
The Complete Analysis of a Polynomial Factorization Algorithm over Finite Fields
ISSN: 0196-6774, 1090-2678Veröffentlicht: San Diego, CA Elsevier Inc 01.07.2001Veröffentlicht in Journal of algorithms (01.07.2001)“… An outcome is a complete analysis of the standard polynomial factorization chain that is based on the elimination of repeated factors, distinct degree factorization, and equal degree separation …”
Volltext
Journal Article