Approximate least common multiple of several polynomials using the ERES division algorithm (Q331163)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6643899
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximate least common multiple of several polynomials using the ERES division algorithm |
scientific article; zbMATH DE number 6643899 |
Statements
Approximate least common multiple of several polynomials using the ERES division algorithm (English)
0 references
26 October 2016
0 references
greatest common divisor
0 references
linear systems
0 references
shifting operation
0 references
numerical errors
0 references
least squares
0 references
low-rank approximation
0 references
numerical optimization
0 references
numerical stability
0 references
complexity
0 references
0 references
0 references
0 references
0 references
0 references
0.8374958634376526
0 references
0.8266613483428955
0 references
0.8193378448486328
0 references
0.8181710243225098
0 references
0.8149502277374268
0 references
