Numerical computation of the least common multiple of a set of polynomials (Q5926519)
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 1572966
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Numerical computation of the least common multiple of a set of polynomials |
scientific article; zbMATH DE number 1572966 |
Statements
Numerical computation of the least common multiple of a set of polynomials (English)
0 references
13 May 2001
0 references
A number of properties of the least common multiple (LCM) of a given set of polynomials is discussed which lead to the formulation of a new procedure for computing the LCM that avoids the computations of roots. It is illustrated by two associated problems: evaluation of order of approximation and the optimal completion problem.
0 references
ERES method
0 references
greatest common divisor
0 references
least commong multiple
0 references
set of polynomials
0 references
order of approximation
0 references
optimal completion problem
0 references
0.8852846622467041
0 references
0.8721674680709839
0 references
0.8266613483428955
0 references
