Numerical computation of the least common multiple of a set of polynomials (Q5926519): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1023/a:1009979130810 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W130500341 / rank | |||
Normal rank | |||
Latest revision as of 09:22, 30 July 2024
scientific article; zbMATH DE number 1572966
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
