Spherical Radon transform and the average of the condition number on certain Schubert subvarieties of a Grassmannian
DOI10.1016/j.jco.2011.11.005zbMath1248.65046OpenAlexW2060270409MaRDI QIDQ423886
Jérémy Berthomieu, Luis Miguel Pardo
Publication date: 30 May 2012
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jco.2011.11.005
computational complexityintegral geometrycomplex coefficientsspherical Radon transformapproximate zero theorycomplex solutionsGrassmannian of great circles on a sphereprobabilistic polynomial timeSchubert subvarietySmale's 17th problemsystems of multivariate polynomial equations
Numerical computation of solutions to systems of equations (65H10) Radon transform (44A12) Approximation in the complex plane (30E10) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) Numerical methods for integral transforms (65R10) Integral geometry (53C65) Complexity and performance of numerical algorithms (65Y20) Numerical computation of roots of polynomial equations (65H04)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algorithms of intrinsic complexity for point searching in compact real singular hypersurfaces
- A continuation method to solve polynomial systems and its complexity
- Fast linear homotopy to find approximate zeros of polynomial systems
- A numerical algorithm for zero counting. III: Randomization and condition
- Khovanskii-Rolle continuation for real solutions
- On a problem posed by Steve Smale
- Smoothed analysis of complex conic condition numbers
- On the probability distribution of data at points in real complete intersection varieties
- A numerical algorithm for zero counting. I: Complexity and accuracy
- On the intrinsic complexity of point finding in real singular hypersurfaces
- Complexity of Bezout's theorem. VI: Geodesics in the condition (number) metric
- Complexity of Bezout's theorem. VII: Distance estimates in the condition metric
- Computing the real roots of a polynomial by the exclusion algorithm
- Inversion formulas for the spherical Radon transform and the generalized cosine transform.
- On the geometry of polar varieties
- Generalized polar varieties: geometry and algorithms
- Efficient polynomial system-solving by numerical methods
- A numerical algorithm for zero counting. II: Distance to ill-posedness and smoothed analysis
- On the roots of a random system of equations. The theorem of Shub and Smale and some extensions
- On the Kostlan-Shub-Smale model for random polynomial systems. Variance of the number of roots
- The expected number of real roots of a multihomogeneous system of polynomial equations
- Smale’s 17th problem: Average polynomial time to compute affine and projective solutions
- Some Elementary Inequalities Relating to the Gamma and Incomplete Gamma Function
- Some Extensions of W. Gautschi's Inequalities for the Gamma Function
- Convexity Properties of the Condition Number
- Complexity of Bezout's Theorem I: Geometric Aspects
- On the distribution of points in projective space of bounded height
- Complexity of Bezout’s Theorem IV: Probability of Success; Extensions
- Adaptive step-size selection for homotopy methods to solve polynomial equations
- The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
- Algorithms in real algebraic geometry
