GPU-based parallel solver via the Kantorovich theorem for the nonlinear Bernstein polynomial systems
From MaRDI portal
Publication:660912
Recommendations
- Parallel degree computation for binomial systems
- Optimizations for tensorial Bernstein-Based solvers by using polyhedral bounds
- Solving Systems of Nonlinear Equations on a Message-Passing Multiprocessor
- An existence and nonexistence theorem for solutions of nonlinear systems and its application to algebraic equations
- scientific article; zbMATH DE number 4096696
Cites work
- Algorithms for intersecting parametric and algebraic curves I
- Blossoms are polar forms
- Bounds on a polynomial
- Computation of the solutions of nonlinear polynomial systems
- Eigenvalues and invariants of tensors
- scientific article; zbMATH DE number 1716506 (Why is no real title available?)
- scientific article; zbMATH DE number 3649911 (Why is no real title available?)
- scientific article; zbMATH DE number 3846864 (Why is no real title available?)
- scientific article; zbMATH DE number 3928227 (Why is no real title available?)
- Isolating real roots of real polynomials
- Loop detection in surface patch intersections
- Optimal bounding cones of vectors in three dimensions
- Subdivision methods for solving polynomial equations
Cited in
(3)- Using low-rank approximation of the Jacobian matrix in the Newton-Raphson method to solve certain singular equations
- Vertex versus pixel based intersection: using the GPU for investigation of surface intersections
- Tracking control based on adaptive Bernstein polynomial approximation for a class of unknown nonlinear dynamic systems
This page was built for publication: GPU-based parallel solver via the Kantorovich theorem for the nonlinear Bernstein polynomial systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q660912)