2020
DOI: 10.48550/arxiv.2004.06879
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

On the Complexity of the Plantinga-Vegter Algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
13
0

Year Published

2020
2020
2021
2021

Publication Types

Select...
2

Relationship

2
0

Authors

Journals

citations
Cited by 2 publications
(13 citation statements)
references
References 0 publications
0
13
0
Order By: Relevance
“…In what follows, we will focus on algorithms dealing with real algebraic sets. The algorithms we have in mind are the ones in [23,24,25,26] and the Plantinga-Vegter algorithm [43] as described and analyzed in [22] (cf. [21]).…”
Section: Numerical Algorithms In Real Algebraic Geometrymentioning
confidence: 99%
See 3 more Smart Citations
“…In what follows, we will focus on algorithms dealing with real algebraic sets. The algorithms we have in mind are the ones in [23,24,25,26] and the Plantinga-Vegter algorithm [43] as described and analyzed in [22] (cf. [21]).…”
Section: Numerical Algorithms In Real Algebraic Geometrymentioning
confidence: 99%
“…is the homogenization of f . Taking the maps (2.3), (2.4), (2.5) in [22] and substituting on them the Weyl norm by the real L ∞ -norm we get…”
Section: The Plantinga-vegter Subdivision Algorithmmentioning
confidence: 99%
See 2 more Smart Citations
“…This significantly extends the results of [7] (cf. [9]). Additionally, we also cover Gaussian polynomials, in which all coefficients have the same variance.…”
Section: Introductionmentioning
confidence: 99%