Christou, D., Karcanias, N. & Mitrouli, M. (2016). Approximate least common multiple of several polynomials using the ERES division algorithm. Linear Algebra and Its Applications, 511, pp. 141-175. doi: 10.1016/j.laa.2016.09.010
- Accepted Version
Restricted to Repository staff only until 12 September 2017.
Available under License : See the attached licence file.
Download (532kB) | Request a copy
Text (Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International Licence)
Download (201kB) | Preview
In this paper a numerical method for the computation of the approximate least common multiple (ALCM) of a set of several univariate real polynomials is presented. The most important characteristic of the proposed method is that it avoids root finding procedures and computations involving the greatest common divisor (GCD). Conversely, it is based on the algebraic construction of a special matrix which contains key data from the original set of polynomials and leads to the formulation of a linear system which provides the degree and the coefficients of the ALCM using low-rank approximation techniques and numerical optimization tools particularly in the presence of inaccurate data. The numerical stability and complexity of the method are analysed, and a comparison with other methods is provided.
|Uncontrolled Keywords:||Greatest common divisor; Linear systems; Shifting operation; Numerical errors; Least squares|
|Subjects:||Q Science > QA Mathematics|
|Divisions:||School of Engineering & Mathematical Sciences > Engineering|
Actions (login required)
Downloads per month over past year