The Probability That a Numerical Analysis Problem is Difficult
From MaRDI portal
Publication:3805780
DOI10.2307/2008617zbMath0657.65066OpenAlexW2089028133MaRDI QIDQ3805780
Publication date: 1988
Full work available at URL: https://doi.org/10.2307/2008617
eigenvaluecondition numberprobability distributionill-posed problemsmatrix inversionnumerical algorithmspolynomial zerofinding
Geometric probability and stochastic geometry (60D05) General theory of numerical analysis in abstract spaces (65J05) Numerical computation of solutions to single equations (65H05) Integral geometry (53C65) Conditioning of matrices (15A12) Numerical linear algebra (65Fxx)
Related Items
Shifted varieties and discrete neighborhoods around varieties, Smooth analysis of the condition number and the least singular value, Wilkinson's bus: weak condition numbers, with an application to singular polynomial eigenproblems, Some new results on the eigenvalues of complex non-central Wishart matrices with a rank-1 mean, Additive preconditioning for matrix computations, Randomized Iterative Methods for Linear Systems, The geometry of ill-conditioning, How well-conditioned can the eigenvector problem be?, Smoothed analysis of complex conic condition numbers, On the condition of the zeros of characteristic polynomials, On the complexity of the Plantinga-Vegter algorithm, Some characterizations of the distribution of the condition number of a complex Gaussian matrix, Linear programming, complexity theory and elementary functional analysis, A new randomized Kaczmarz based kernel canonical correlation analysis algorithm with applications to information retrieval, Some inferences on the distribution of the Demmel condition number of complex Wishart matrices, Condition numbers for the cube. I: Univariate polynomials and hypersurfaces, On the Condition Number of the Shifted Real Ginibre Ensemble, Complexity of path-following methods for the eigenvalue problem, Hausdorff approximations and volume of tubes of singular algebraic sets, Randomized preprocessing versus pivoting, Pseudospectral shattering, the sign function, and diagonalization in nearly matrix multiplication time, The extensions of convergence rates of Kaczmarz-type methods, Five-Precision GMRES-Based Iterative Refinement, Computational complexity of kernel-based density-ratio estimation: a condition number analysis, Complex random matrices have no real eigenvalues, An objective criterion for stopping light-surface interaction. Numerical validation and quality assessment, The average condition number of most tensor rank decomposition problems is infinite, Halting time is predictable for large models: a universality property and average-case analysis, A statistical analysis of the numerical condition of multiple roots of polynomials., A tight bound for the Delaunay triangulation of points on a polyhedron, Solving linear systems of equations with randomization, augmentation and aggregation, Constrained ERM Learning of Canonical Correlation Analysis: A Least Squares Perspective, Remarks on numerical algorithms for computing the inverse Laplace transform, Robust smoothed analysis of a condition number for linear programming, Condition numbers of random matrices, Largest Schmidt eigenvalue of random pure states and conductance distribution in chaotic cavities, Compact smallest eigenvalue expressions in Wishart–Laguerre ensembles with or without a fixed trace, Computing the homology of real projective sets, $p$-Adic Integral Geometry, How Many Eigenvalues of a Random Matrix are Real?, Characterizations of the distribution of the Demmel condition number of real Wishart matrices, On the probability distribution of data at points in real complete intersection varieties, A derandomization approach to recovering bandlimited signals across a wide range of random sampling rates, On componentwise condition numbers for eigenvalue problems with structured matrices, On the Distribution of a Scaled Condition Number, Statistical Condition Estimation for Linear Systems, The probability that a slightly perturbed numerical analysis problem is difficult, Generalizations of the Kolmogorov-Barzdin embedding estimates, On the singular values of Gaussian random matrices, Upper bounds on the distribution of the condition number of singular matrices, Randomized preprocessing of homogeneous linear systems of equations, Low-Rank Approximation of a Matrix: Novel Insights, New Progress, and Extensions, Efficient parallel factorization and solution of structured and unstructured linear systems, The numerical condition of univariate and bivariate degree elevated Bernstein polynomials, On the volume of tubular neighborhoods of real algebraic varieties, Adversarial smoothed analysis, A study of Auchmuty's error estimate, General formulas for the smoothed analysis of condition numbers, On the geometry of the set of symmetric matrices with repeated eigenvalues, A note on the characterizations of the distributions of the condition numbers of real Gaussian matrices, Estimating the norms of random circulant and Toeplitz matrices and their inverses, Computing the homology of semialgebraic sets. I: Lax formulas, Projected randomized Kaczmarz methods, Mixed and componentwise condition numbers for matrix decompositions, On local analysis, Rigid continuation paths I. Quasilinear average complexity for solving polynomial systems, On the generally randomized extended Gauss-Seidel method, A randomized Kaczmarz algorithm with exponential convergence, A note on the behavior of the randomized Kaczmarz algorithm of Strohmer and Vershynin, The asymptotic distribution of the condition number for random circulant matrices, Probabilistic analysis of the Grassmann condition number, On the probability distribution of condition numbers of complete intersection varieties and the average radius of convergence of Newton's method in the underdetermined case, Fluctuations of the spectrum in rotationally invariant random matrix ensembles, Random multipliers numerically stabilize Gaussian and block Gaussian elimination: proofs and an extension to low-rank approximation, Mysteries of mathematics and computation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On neighbouring matrices with quadratic elementary divisors
- On condition numbers and the distance to the nearest ill-posed problem
- Action of discrete amenable groups on von Neumann algebras
- Complexity theory of numerical linear algebra
- Comparison theorems for the volumes of tubes as generalizations of the Weyl tube formula
- Complex differential and integral geometry and curvature integrals associated to singularities of complex analytic varieties
- Volumes, limits, and extensions of analytic varieties
- The Lelong number of a point of a complex analytic set
- Properties of a matrix with a very ill-conditioned eigenproblem
- Note on matrices with a very ill-conditioned eigenproblem
- The fundamental theorem of algebra and complexity theory
- Error and Perturbation Bounds for Subspaces Associated with Certain Eigenvalue Problems
- On the Efficiency of Newton's Method in Approximating All Zeros of a System of Complex Polynomials
- A Theory of Condition
- On the Distribution of Numbers
- Numerical Linear Algebra
- On the Volume of Tubes
