On a condition number of general random polynomial systems (Q2792338): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4372496 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Condition / 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: Eigenvalues and Condition Numbers of Random Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical inverting of matrices of high order / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Probability That a Random ± 1-Matrix Is Singular / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4279732 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic theory of finite dimensional normed spaces. With an appendix by M. Gromov: Isoperimetric inequalities in Riemannian manifolds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small Ball Probability, Inverse Theorems, and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of real roots of random polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Invertibility of random matrices: norm of the inverse / 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: Smallest singular value of a random rectangular matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Bezout's Theorem I: Geometric Aspects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3135179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Bezout's theorem. III: Condition number and packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Bezout's theorem. V: Polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Bezout’s Theorem IV: Probability of Success; Extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4418806 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smoothed analysis of algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse Littlewood-Offord theorems and the condition number of random discrete matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smooth analysis of the condition number and the least singular value / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random matrices: The distribution of the smallest singular values / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smoothed analysis of \(\kappa(A)\) / rank
 
Normal rank

Latest revision as of 14:46, 11 July 2024

scientific article
Language Label Description Also known as
English
On a condition number of general random polynomial systems
scientific article

    Statements

    On a condition number of general random polynomial systems (English)
    0 references
    0 references
    0 references
    9 March 2016
    0 references
    0 references
    singularity
    0 references
    condition numbers
    0 references
    system of equations
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references