Pages that link to "Item:Q3805780"

The following pages link to The Probability That a Numerical Analysis Problem is Difficult (Q3805780):

Displaying 50 items.

• Some new results on the eigenvalues of complex non-central Wishart matrices with a rank-1 mean (Q290695) (← links)
• Complexity of path-following methods for the eigenvalue problem (Q404275) (← links)
• A tight bound for the Delaunay triangulation of points on a polyhedron (Q443906) (← links)
• Solving linear systems of equations with randomization, augmentation and aggregation (Q454828) (← links)
• Remarks on numerical algorithms for computing the inverse Laplace transform (Q480420) (← links)
• Characterizations of the distribution of the Demmel condition number of real Wishart matrices (Q501415) (← links)
• Robust smoothed analysis of a condition number for linear programming (Q662310) (← links)
• Computing the homology of real projective sets (Q667646) (← links)
• Shifted varieties and discrete neighborhoods around varieties (Q820939) (← links)
• Wilkinson's bus: weak condition numbers, with an application to singular polynomial eigenproblems (Q827005) (← links)
• Additive preconditioning for matrix computations (Q846341) (← links)
• Smoothed analysis of complex conic condition numbers (Q864180) (← links)
• On the probability distribution of data at points in real complete intersection varieties (Q945919) (← links)
• Randomized preprocessing of homogeneous linear systems of equations (Q968998) (← links)
• Adversarial smoothed analysis (Q983182) (← links)
• A randomized Kaczmarz algorithm with exponential convergence (Q1027734) (← links)
• A note on the behavior of the randomized Kaczmarz algorithm of Strohmer and Vershynin (Q1040681) (← links)
• The geometry of ill-conditioning (Q1100848) (← links)
• Condition numbers of random matrices (Q1179026) (← links)
• Mysteries of mathematics and computation (Q1323030) (← links)
• A statistical analysis of the numerical condition of multiple roots of polynomials. (Q1416369) (← links)
• Some inferences on the distribution of the Demmel condition number of complex Wishart matrices (Q1678987) (← links)
• An objective criterion for stopping light-surface interaction. Numerical validation and quality assessment (Q1701991) (← links)
• A derandomization approach to recovering bandlimited signals across a wide range of random sampling rates (Q1744044) (← links)
• Generalizations of the Kolmogorov-Barzdin embedding estimates (Q1759766) (← links)
• A note on the characterizations of the distributions of the condition numbers of real Gaussian matrices (Q1792441) (← links)
• Linear programming, complexity theory and elementary functional analysis (Q1924066) (← links)
• Randomized preprocessing versus pivoting (Q1940337) (← links)
• Computational complexity of kernel-based density-ratio estimation: a condition number analysis (Q1945037) (← links)
• On the generally randomized extended Gauss-Seidel method (Q2058411) (← links)
• The asymptotic distribution of the condition number for random circulant matrices (Q2093404) (← links)
• On the complexity of the Plantinga-Vegter algorithm (Q2172649) (← links)
• Some characterizations of the distribution of the condition number of a complex Gaussian matrix (Q2175179) (← links)
• A new randomized Kaczmarz based kernel canonical correlation analysis algorithm with applications to information retrieval (Q2179300) (← links)
• The extensions of convergence rates of Kaczmarz-type methods (Q2196068) (← links)
• On the geometry of the set of symmetric matrices with repeated eigenvalues (Q2283191) (← links)
• Computing the homology of semialgebraic sets. I: Lax formulas (Q2291730) (← links)
• Projected randomized Kaczmarz methods (Q2297173) (← links)
• On local analysis (Q2303420) (← links)
• Probabilistic analysis of the Grassmann condition number (Q2340501) (← links)
• Random multipliers numerically stabilize Gaussian and block Gaussian elimination: proofs and an extension to low-rank approximation (Q2350005) (← links)
• On the condition of the zeros of characteristic polynomials (Q2402421) (← links)
• Upper bounds on the distribution of the condition number of singular matrices (Q2484545) (← links)
• Efficient parallel factorization and solution of structured and unstructured linear systems (Q2486566) (← links)
• The numerical condition of univariate and bivariate degree elevated Bernstein polynomials (Q2490716) (← links)
• General formulas for the smoothed analysis of condition numbers (Q2499745) (← links)
• Estimating the norms of random circulant and Toeplitz matrices and their inverses (Q2512809) (← links)
• Condition numbers for the cube. I: Univariate polynomials and hypersurfaces (Q2674002) (← links)
• The average condition number of most tensor rank decomposition problems is infinite (Q2697393) (← links)
• Halting time is predictable for large models: a universality property and average-case analysis (Q2697399) (← links)