On the complexity of the Plantinga-Vegter algorithm (Q2172649): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A Class of Fast and Accurate Summation Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Condition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the Homology of Basic Semialgebraic Sets in Weak Exponential Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smoothed analysis of complex conic condition numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: The probability that a slightly perturbed numerical analysis problem is difficult / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the homology of semialgebraic sets. I: Lax formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the homology of semialgebraic sets. II: General formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Continuous amortization and extensions: with applications to bisection-based root isolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of an Adaptive Subdivision Method for Approximating Real Curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of subdivision for diameter-distance tests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate zeros and condition numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Plantinga-Vegter Algorithm takes Average Polynomial Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A numerical algorithm for zero counting. I: Complexity and accuracy / rank
 
Normal rank
Property / cites work
 
Property / cites work: A numerical algorithm for zero counting. II: Distance to ill-posedness and smoothed analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: A numerical algorithm for zero counting. III: Randomization and condition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the homology of real projective sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Primal-Dual Algorithm for Solving Polyhedral Conic Systems with a Finite-Precision Machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Probability That a Numerical Analysis Problem is Difficult / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic condition number estimates for real polynomial systems. I: A broader family of distributions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smoothed analysis for the condition number of structured real polynomial systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Of What Use Is Floating-Point Arithmetic in Computational Geometry? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical Inverting of Matrices of High Order. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4864704 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploiting Structure in Floating-Point Arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sharp bounds for marginal densities of product measures / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the volume of tubular neighborhoods of real algebraic varieties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3707258 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Littlewood-Offord problem and invertibility of random matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small Ball Probabilities for Linear Images of High-Dimensional Distributions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4356579 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4418806 / rank
 
Normal rank
Property / cites work
 
Property / cites work: High-Dimensional Probability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective Subdivision Algorithm for Isolating Zeros of Real Systems of Equations, with Complexity Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards soft exact computation (invited talk) / rank
 
Normal rank

Revision as of 03:14, 30 July 2024

scientific article
Language Label Description Also known as
English
On the complexity of the Plantinga-Vegter algorithm
scientific article

    Statements

    On the complexity of the Plantinga-Vegter algorithm (English)
    0 references
    0 references
    0 references
    0 references
    16 September 2022
    0 references
    Plantinga-Vegter algorithm
    0 references
    subdivision methods
    0 references
    complexity analysis
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references