GPGCD, an Iterative Method for Calculating Approximate GCD of Univariate Polynomials, with the Complex Coefficients (Q5188250): Difference between revisions
From MaRDI portal
Set profile property. |
Changed an Item |
||
| (One intermediate revision by the same user not shown) | |||
| label / en | label / en | ||
GPGCD, an Iterative Method for Calculating Approximate GCD of Univariate Polynomials, with the Complex Coefficients | |||
| Property / arXiv classification | |||
math.AC | |||
| Property / arXiv classification: math.AC / rank | |||
Normal rank | |||
| Property / arXiv classification | |||
cs.SC | |||
| Property / arXiv classification: cs.SC / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1007.1834 / rank | |||
Normal rank | |||
Latest revision as of 23:37, 19 April 2024
scientific article; zbMATH DE number 5679802
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | GPGCD, an Iterative Method for Calculating Approximate GCD of Univariate Polynomials, with the Complex Coefficients |
scientific article; zbMATH DE number 5679802 |
Statements
10 March 2010
0 references
numerical examples
0 references
iterative method
0 references
greatest common divisor
0 references
polynomials with complex coefficients
0 references
algorithm
0 references
constrained minimization problem
0 references
Newton method
0 references
gradient-projection method
0 references
math.AC
0 references
cs.SC
0 references
