GPGCD: an iterative method for calculating approximate GCD of univariate polynomials (Q385007): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 65H10 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 12Y05 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 12E05 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68W30 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6234580 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
approximate polynomial GCD | |||
| Property / zbMATH Keywords: approximate polynomial GCD / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
gradient-projection method | |||
| Property / zbMATH Keywords: gradient-projection method / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
ill-conditioned problem | |||
| Property / zbMATH Keywords: ill-conditioned problem / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
optimization | |||
| Property / zbMATH Keywords: optimization / rank | |||
Normal rank | |||
Revision as of 12:39, 29 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | GPGCD: an iterative method for calculating approximate GCD of univariate polynomials |
scientific article |
Statements
GPGCD: an iterative method for calculating approximate GCD of univariate polynomials (English)
0 references
29 November 2013
0 references
approximate polynomial GCD
0 references
gradient-projection method
0 references
ill-conditioned problem
0 references
optimization
0 references
