Condition. The geometry of numerical algorithms

DOI10.1007/978-3-642-38896-5zbMATH Open1280.65041OpenAlexW4254852607WikidataQ61012651 ScholiaQ61012651MaRDI QIDQ2837795FDOQ2837795

Peter Bürgisser, Felipe Cucker

Publication date: 5 July 2013

Published in: Grundlehren der Mathematischen Wissenschaften (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38896-5

Recommendations

• Probabilistic analyses of condition numbers
• Numerical matrix analysis. Linear systems and least squares
• scientific article; zbMATH DE number 503385
• Smoothed analysis of condition numbers
• Mathematical aspects of computer science smoothed analysis of condition numbers

zbMATH Keywords

monographerror analysisinterior-point methodsNewton's methodcondition numbersellipsoid methodSmale's 17th problemtriangular linear systemscondition in linear algebracondition in linear optimizationcondition in polynomial equation solvingiterative algorithms for solving systems of linear equationsprobabilistic analysis of the condition number

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Interior-point methods (90C51) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Numerical computation of solutions to systems of equations (65H10) Conditioning of matrices (15A12) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) General topics in the theory of algorithms (68W01)

Cited In (only showing first 100 items - show all)

• Wilkinson's bus: weak condition numbers, with an application to singular polynomial eigenproblems
• Relative error analysis of matrix exponential approximations for numerical integration
• On local analysis
• Distribution of the eigenvalues of a random system of homogeneous polynomials
• Probabilistic analysis of the Grassmann condition number
• Relative error long-time behavior in matrix exponential approximations for numerical integration: the stiff situation
• On condition number theorems in mathematical programming
• The Legacy of Turing in Numerical Analysis
• A deterministic algorithm to compute approximate roots of polynomial systems in polynomial average time
• The Expected Number of Eigenvalues of a Real Gaussian Tensor
• A note on the condition number of the scaled total least squares problem
• On the partial condition numbers for the indefinite least squares problem
• Tensors in computations
• The Structured Condition Number of a Differentiable Map between Matrix Manifolds, with Applications
• Sensitivity of low-rank matrix recovery
• Condition of Intersecting a Projective Variety with a Varying Linear Subspace
• Unitarity and symmetries of the multicomponent scattering matrix
• Grid methods in computational real algebraic (and semialgebraic) geometry
• Estimating a sharp convergence bound for randomized ensembles
• Average-case complexity without the black swans
• Structure and Optimisation in Computational Harmonic Analysis: On Key Aspects in Sparse Regularisation
• Condition numbers for a linear function of the solution of the linear least squares problem with equality constraints
• The complexity of subdivision for diameter-distance tests
• New characterizations of Hoffman constants for systems of linear constraints
• On the geometry of the set of symmetric matrices with repeated eigenvalues
• Probabilistic Schubert calculus
• The real polynomial eigenvalue problem is well conditioned on the average
• A Robust Numerical Path Tracking Algorithm for Polynomial Homotopy Continuation
• A Riemannian Trust Region Method for the Canonical Tensor Rank Approximation Problem
• Hausdorff approximations and volume of tubes of singular algebraic sets
• On the zeta Mahler measure function of the Jacobian determinant, condition numbers and the height of the generic discriminant
• Counting Real Critical Points of the Distance to Orthogonally Invariant Matrix Sets
• A condition-based algorithm for solving polyhedral feasibility problems
• The Hurwitz form of a projective variety
• Conditioning and relative error propagation in linear autonomous ordinary differential equations
• Fiber product homotopy method for multiparameter eigenvalue problems
• On condition numbers for least squares with quadric inequality constraint
• Mixed and componentwise condition numbers for matrix decompositions
• Probabilistic condition number estimates for real polynomial systems. I: A broader family of distributions
• Computing the homology of semialgebraic sets. II: General formulas
• Probabilistic analyses of condition numbers
• Condition numbers for a linear function of the solution to the constrained and weighted least squares problem and their statistical estimation
• Numerical methods for accurate computation of the eigenvalues of Hermitian matrices and the singular values of general matrices
• On the Number of Real Zeros of Random Fewnomials
• Mathematics of the genome
• A polyhedral homotopy algorithm for real zeros
• Rigid continuation paths I. Quasilinear average complexity for solving polynomial systems
• Analysis of a High-Order Trace Finite Element Method for PDEs on Level Set Surfaces
• The asymptotic distribution of the condition number for random circulant matrices
• The Condition Number of Riemannian Approximation Problems
• Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy
• Algebraic compressed sensing
• Perturbation analysis for the QX factorization for centrosymmetric matrices
• How perturbations in the matrix of linear systems of ordinary differential equations propagate along solutions
• Convergence analysis of Riemannian Gauss-Newton methods and its connection with the geometric condition number
• Random Points on an Algebraic Manifold
• The Condition Number of Join Decompositions
• Rigid continuation paths II. structured polynomial systems
• Lower bounds by Birkhoff interpolation
• Structured condition numbers for some matrix factorizations of structured matrices
• On a condition number of general random polynomial systems
• Pencil-Based Algorithms for Tensor Rank Decomposition are not Stable
• Low-degree approximation of random polynomials
• On the expected number of zeros of nonlinear equations
• Sixty-Four Curves of Degree Six
• Estimating the algorithmic variance of randomized ensembles via the bootstrap
• Computing the homology of real projective sets
• A THEORY OF COMPLEXITY, CONDITION, AND ROUNDOFF
• On the von Neumann and Frank-Wolfe algorithms with away steps
• The numerical factorization of polynomials
• $p$-Adic Integral Geometry
• A sequence of polynomials with optimal condition number
• Real zeros of mixed random fewnomial systems
• Propagation of perturbations in the initial value along solutions of linear ODEs: a componentwise relative error analysis
• Method of moments for 3D single particleab initiomodeling with non-uniform distribution of viewing angles
• Smale 17th Problem: Advances and Open Directions
• On the topology of random real complete intersections
• Random Toeplitz matrices: The condition number under high stochastic dependence
• Average degree of the essential variety
• Toric eigenvalue methods for solving sparse polynomial systems
• Robust and continuous metric subregularity for linear inequality systems
• Radius theorems for subregularity in infinite dimensions
• Best \(k\)-layer neural network approximations
• Title not available (Why is that?)
• Smoothed analysis for the condition number of structured real polynomial systems
• The geometry of rank drop in a class of face-splitting matrix products. I
• Line Multiview Varieties
• Which constraints of a numerical problem cause ill-conditioning?
• Projection and Rescaling Algorithm for Finding Maximum Support Solutions to Polyhedral Conic Systems
• The limit empirical spectral distribution of Gaussian monic complex matrix polynomials
• Loss landscapes and optimization in over-parameterized non-linear systems and neural networks
• The zonoid algebra, generalized mixed volumes, and random determinants
• Analysis of normal-form algorithms for solving systems of polynomial equations
• Perturbation analysis and condition numbers for the Tikhonov regularization of total least squares problem and their statistical estimation
• Efficient sampling in spectrahedra and volume approximation
• The condition number of many tensor decompositions is invariant under Tucker compression
• Asymptotics of lower dimensional zero-density regions
• Exploring the Numerics of Branch-and-Cut for Mixed Integer Linear Optimization
• Condition numbers for the tensor rank decomposition
• On Łojasiewicz inequalities and the effective Putinar's Positivstellensatz

This page was built for publication: Condition. The geometry of numerical algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2837795)