Numerical solution of bivariate and polyanalytic polynomial systems
From MaRDI portal
Recommendations
Cited in
(19)- Polynomial and rational interpolation in the numerical solution of stiff systems
- Numerical root finding via Cox rings
- Truncated normal forms for solving polynomial systems: generalized and efficient algorithms
- Numerical approximation of multiple isolated roots of analytical systems
- Computing the common zeros of two bivariate functions via Bézout resultants
- Numerical instability of resultant methods for multidimensional rootfinding
- Roots of bivariate polynomial systems via determinantal representations
- Numerical Solution of a Class of Deficient Polynomial Systems
- scientific article; zbMATH DE number 5995258 (Why is no real title available?)
- Solving polynomial systems via truncated normal forms
- scientific article; zbMATH DE number 852137 (Why is no real title available?)
- Solvability of bivariate polynomial systems under perturbation
- Review of "Numerically Solving Polynomial Systems with Bertini" by Daniel J. Bates, Jonathan D. Hauenstein, Andrew J. Sommese, and Charles W. Wampler
- BertiniLab: a MATLAB interface for solving systems of polynomial equations
- Exact line and plane search for tensor optimization
- A Fast Algorithm for Computing Macaulay Null Spaces of Bivariate Polynomial Systems
- On the zeros of polyanalytic polynomials
- Chebyshev varieties
- A multivariate generalization of Prony's method
This page was built for publication: Numerical solution of bivariate and polyanalytic polynomial systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2927822)