Results 31 to 40 of about 4,447 (309)
The Numerical Factorization of a Polynomial [PDF]
SIAM Review, 1971 A number of methods can be found in the literature for the numerical factorization of a polynomial, and references to some are given in the bibliography below. Well-known examples are those of Lin and of Bairstow. Many are quadratically convergent, but most require a sufficiently close initial factorization to start with.
Householder, A. S., Stewart, G. W.
openaire +2 more sources
Polynomial factorization over henselian fields [PDF]
, 2022 Given a valued field $(K,v)$ and an irreducible polynomial $g\in K[x]$, we survey the ideas of Ore, Maclane, Okutsu, Montes, Vaqui\'e and Herrera-Olalla-Mahboub-Spivakovsky, leading (under certain conditions) to an algorithm to find the factorization of $
Roé, Joaquim +5 more
core +4 more sources
Factoring with cyclotomic polynomials [PDF]
26th Annual Symposium on Foundations of Computer Science (sfcs 1985), 1985 This paper discusses some new integer factoring methods involving cyclotomic polynomials. There are several polynomials f ( X
Eric Bach 0001, Jeffrey O. Shallit
openaire +1 more source
IEEE Access, 2018 Sparse arrays have potential advantages over their regularly spaced counterparts, but they will generate undesired grating lobes. This paper investigates a sparse linear phased-array for grating lobe suppression and arbitrary transmit-receive beampattern
Zhe Wang +3 more
doaj +1 more source
On the factorization of lacunary polynomials
Acta Arithmetica, 2023 This paper addresses the factorization of polynomials of the form $F(x) = f_{0}(x) + f_{1}(x) x^{n} + \cdots + f_{r-1}(x) x^{(r-1)n} + f_{r}(x) x^{rn}$ where $r$ is a fixed positive integer and the $f_{j}(x)$ are fixed polynomials in $\mathbb Z[x]$ for $0 \le j \le r$.
openaire +2 more sources
Inherited Fuzzy Interpolation Based on the Inherited Lower-upper Factorization
Fuzzy Information and Engineering, 2014 In this paper, a new scheme is proposed to find the fuzzy interpolation polynomial. In this case, the nodes are crisp data and the values are fuzzy numbers.
M.A. Fariborzi Araghi, A. Fallahzadeh
doaj +1 more source
Computation of Inner-Outer Factorizations of Rational Matrices [PDF]
, 1997 In this paper we propose a new numerically reliable computational approach to determine the inner-outer factorization of a rational transfer matrix G of a linear descriptor system.
A. Varga, Andras Varga, Varga, A.
core +1 more source
Construction of a transitive orientation using B-stable subgraphs [PDF]
Computer Science Journal of Moldova, 2015 A special method for construction of transitive orientations of the undirected graph $G=(X;U)$ is proposed. The method uses an iterative procedure for factorization of graph $G$. Factorization procedure consists in replacing of a B-stable subgraph with a
Nicolae Grigoriu
doaj
Minor Prime Factorization for n-D Polynomial Matrices over Arbitrary Coefficient Field
Complexity, 2018 In this paper, we investigate two classes of multivariate (n-D) polynomial matrices whose coefficient field is arbitrary and the greatest common divisor of maximal order minors satisfy certain condition.
Jinwang Liu, Dongmei Li, Licui Zheng
doaj +1 more source
HOPS: A Fast Algorithm for Segmenting Piecewise Polynomials of Arbitrary Orders
IEEE Access, 2021 The segmentation of piecewise polynomial signals arises in a variety of scientific and engineering fields. When a signal is modeled as a piecewise polynomial, the key then becomes the detection of breakpoints followed by curve fitting and parameter ...
Junbo Duan, Qing Wang, Yu-Ping Wang
doaj +1 more source