Bourne, M., Winkler, J.R. and Yi, S. (2017) The computation of the degree of an approximate greatest common divisor of two Bernstein polynomials. Applied Numerical Mathematics, 111. pp. 17-35. ISSN 0168-9274
Abstract
This paper considers the computation of the degree t of an approximate greatest common divisor d(y) of two Bernstein polynomials f(y) and g(y), which are of degrees m and n respectively. The value of t is computed from the QR decomposition of the Sylvester resultant matrix S(f, g) and its subresultant matrices Sk(f, g), k = 2, . . . , min(m, n), where S1(f, g) = S(f, g). It is shown that the computation of t is significantly more complicated than its equivalent for two power basis polynomials because (a) Sk(f, g) can be written in several forms that differ in the complexity of the computation of their entries, (b) different forms of Sk(f, g) may yield different values of t, and (c) the binomial terms in the entries of Sk(f, g) may cause the ratio of its entry of maximum magnitude to its entry of minimum magnitude to be large, which may lead to numerical problems. It is shown that the QR decomposition and singular value decomposition (SVD) of the Sylvester matrix and its subresultant matrices yield better results than the SVD of the B´ezout matrix, and that f(y) and g(y) must be processed before computations are performed on these resultant and subresultant matrices in order to obtain good results.
Metadata
Item Type: | Article |
---|---|
Authors/Creators: |
|
Copyright, Publisher and Additional Information: | © 2016 IMACS. Published by Elsevier B.V. This is an author produced version of a paper subsequently published in Applied Numerical Mathematics. Uploaded in accordance with the publisher's self-archiving policy. Article available under the terms of the CC-BY-NC-ND licence (https://creativecommons.org/licenses/by-nc-nd/4.0/) |
Keywords: | Sylvester resultant matrix; Bernstein polynomials; approximate greatest common divisor |
Dates: |
|
Institution: | The University of Sheffield |
Academic Units: | The University of Sheffield > Faculty of Engineering (Sheffield) > Department of Computer Science (Sheffield) |
Depositing User: | Symplectic Sheffield |
Date Deposited: | 08 Sep 2016 13:41 |
Last Modified: | 07 Sep 2017 23:26 |
Published Version: | https://doi.org/10.1016/j.apnum.2016.08.005 |
Status: | Published |
Publisher: | Elsevier |
Refereed: | Yes |
Identification Number: | 10.1016/j.apnum.2016.08.005 |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:104349 |