Computing common zeros of two bivariate function: r = rootsb(f,g,xydomain) finds the common zeros of two bivariate functions f and g in the domain xydomain (4-element vector), which are given as function handles. This code exists besides roots(f,g) in chebfun2 (which does essentially the same task) because it is sometimes better for accuracy to resample the functions when working in a subdivided, smaller domain. If xydomain is not provided, it defaults to [-1 1 -1 1]. test.m runs a simple test and shows the plots of the solution along with the zero curves. The solutions should be the intersections of the curves. This code always employs the algorithm based on the hidden variable resultant method. For the algorithmic details, see 1] Y. Nakatsukasa, V. Noferini, and A. Townsend, Computing the common zeros of two bivariate functions via Bezout resultants, submitted (2013).
Keywords for this software
References in zbMATH (referenced in 8 articles )
Showing results 1 to 8 of 8.
- Nakatsukasa, Yuji; Noferini, Vanni: On the stability of computing polynomial roots via confederate linearizations (2016)
- Noferini, Vanni; Townsend, Alex: Numerical instability of resultant methods for multidimensional rootfinding (2016)
- Plestenjak, Bor; Hochstenbach, Michiel E.: Roots of bivariate polynomial systems via determinantal representations (2016)
- Sakaue, Shinsaku; Nakatsukasa, Yuji; Takeda, Akiko; Iwata, Satoru: Solving generalized CDT problems via two-parameter eigenvalues (2016)
- Aruliah, D.A.; Corless, R.M.; Diaz-Toca, G.M.; Gonzalez-Vega, L.; Shakoori, A.: The Bézout matrix for Hermite interpolants (2015)
- Hochstenbach, Michiel E.; Muhič, Andrej; Plestenjak, Bor: Jacobi-Davidson methods for polynomial two-parameter eigenvalue problems (2015)
- Iwata, Satoru; Nakatsukasa, Yuji; Takeda, Akiko: Computing the signed distance between overlapping ellipsoids (2015)
- Nakatsukasa, Yuji; Noferini, Vanni; Townsend, Alex: Computing the common zeros of two bivariate functions via Bézout resultants (2015)