The paper presents a number of properties of the least common multiple (LCM) m(s) of a given set of polynomials P. These results lead to the formulation of a new procedure for computing the LCM that avoids the computation of roots. This procedure involves the computation of the greatest common divisor (GCD) z(s) of a set of polynomials T derived from P, and the factorisation of the product of the original set P, p(s) as p(s) = m(s)·z(s). The symbolic procedure leads to a numerical one, where robust methods for the computation of GCD are first used. In this numerical method the approximate factorisation of polynomials is an important part of the overall algorithm. The latter problem is handled by studying two associated problems: evaluation of order of approximation and the optimal completion problem. The new method provides a robust procedure for the computation of LCM and enables the computation of approximate values, when the original data are inaccurate.
Reliable Computing – Springer Journals
Published: Oct 16, 2004
It’s your single place to instantly
discover and read the research
that matters to you.
Enjoy affordable access to
over 12 million articles from more than
10,000 peer-reviewed journals.
All for just $49/month
Read as many articles as you need. Full articles with original layout, charts and figures. Read online, from anywhere.
Keep up with your field with Personalized Recommendations and Follow Journals to get automatic updates.
It’s easy to organize your research with our built-in tools.
Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.
All the latest content is available, no embargo periods.
“Hi guys, I cannot tell you how much I love this resource. Incredible. I really believe you've hit the nail on the head with this site in regards to solving the research-purchase issue.”Daniel C.
“Whoa! It’s like Spotify but for academic articles.”@Phil_Robichaud
“I must say, @deepdyve is a fabulous solution to the independent researcher's problem of #access to #information.”@deepthiw
“My last article couldn't be possible without the platform @deepdyve that makes journal papers cheaper.”@JoseServera