Analysis of approximate factorization algorithm. I (Q1202761): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: Teluhiko Hilano / rank | |||
Property / author | |||
Property / author: Teluhiko Hilano / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3714165 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Approximate factorization of multivariate polynomials and absolute irreducibility testing / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/bf03167271 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2003998577 / rank | |||
Normal rank |
Latest revision as of 11:29, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Analysis of approximate factorization algorithm. I |
scientific article |
Statements
Analysis of approximate factorization algorithm. I (English)
0 references
16 February 1993
0 references
The approximate factorization of a multivariate polynomial over the field \(\mathbb{C}\) of complex numbers is applied to polynomials with approximate coefficients such as floating-point numbers. In a paper by \textit{T. Sasaki}, \textit{M. Suzuki}, \textit{M. Kolář} and \textit{M. Sasaki} [Jap. J. Ind. Appl. Math. 8, No. 3, 357-375 (1991; Zbl 0757.12006)] two algorithms of approximate factorization have been proposed but not proved. The paper now gives a mathematical analysis of one of the algorithms presented provided that the numerical coefficients are calculated with sufficient accuracy. This algorithm determines the approximately irreducible factors by calculating approximately dependent linear combinations of roots of the form \(\lambda_ 1 \varphi_ 1^ i+ \cdots+ \lambda_ n \varphi_ n^ i\), where \(\varphi_ 1, \dots, \varphi_ n\) are the roots of the given polynomial with respect to one variable and \(i=1,2,\ldots\).
0 references
several indeterminates
0 references
factorization of polynomials
0 references
approximate factorization
0 references
multivariate polynomial
0 references
algorithm
0 references