Computer Algebra in Scientific Computing
From MaRDI portal
Publication:5479233
DOI10.1007/11555964zbMATH Open1169.65317OpenAlexW4300628649MaRDI QIDQ5479233FDOQ5479233
Elias P. Tsigaridas, Ioannis Z. Emiris
Publication date: 7 July 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11555964
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computer science aspects of computer-aided design (68U07) Numerical computation of solutions to systems of equations (65H10)
Cited In (13)
- Parallel computation of real solving bivariate polynomial systems by zero-matching method
- A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers
- Solving bivariate systems using rational univariate representations
- p-adic algorithm for bivariate Gröbner bases
- Real solutions to two-sided polynomial matrix equations
- On the asymptotic and practical complexity of solving bivariate systems over the reals
- The Method of Resultants for Computing Real Solutions of Polynomial Systems
- Solvability of bivariate polynomial systems under perturbation
- Certified numerical real root isolation for bivariate nonlinear systems
- A generic position based method for real root isolation of zero-dimensional polynomial systems
- An \(\mathfrak{m}\)-adic algorithm for bivariate Gröbner bases
- Computing real witness points of positive dimensional polynomial systems
- From approximate factorization to root isolation with application to cylindrical algebraic decomposition
Uses Software
This page was built for publication: Computer Algebra in Scientific Computing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5479233)
