Research Repository

Computing the common zeros of two bivariate functions via Bézout resultants

Nakatsukasa, Y and Noferini, V and Townsend, A (2014) 'Computing the common zeros of two bivariate functions via Bézout resultants.' Numerische Mathematik, 129 (1). 181 - 209. ISSN 0029-599X

[img]
Preview
Text
biroots2.pdf

Download (1MB) | Preview

Abstract

© 2014, Springer-Verlag Berlin Heidelberg. The common zeros of two bivariate functions can be computed by finding the common zeros of their polynomial interpolants expressed in a tensor Chebyshev basis. From here we develop a bivariate rootfinding algorithm based on the hidden variable resultant method and Bézout matrices with polynomial entries. Using techniques including domain subdivision, Bézoutian regularization, and local refinement we are able to reliably and accurately compute the simple common zeros of two smooth functions with polynomial interpolants of very high degree (≥ 1000). We analyze the resultant method and its conditioning by noting that the Bézout matrices are matrix polynomials. Two implementations are available: one on the Matlab Central File Exchange and another in the roots command in Chebfun2 that is adapted to suit Chebfun’s methodology.

Item Type: Article
Subjects: Q Science > QA Mathematics
Divisions: Faculty of Science and Health > Mathematical Sciences, Department of
Depositing User: Jim Jamieson
Date Deposited: 20 Oct 2015 13:36
Last Modified: 23 Jan 2019 05:15
URI: http://repository.essex.ac.uk/id/eprint/15323

Actions (login required)

View Item View Item