Condition. The geometry of numerical algorithms
From MaRDI portal
Publication:2837795
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
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)
Recommendations
Cited in
(only showing first 100 items - show all)- The Condition Number of Riemannian Approximation Problems
- On the von Neumann and Frank-Wolfe algorithms with away steps
- Probabilistic analysis of the Grassmann condition number
- Algebraic compressed sensing
- Numerical methods for accurate computation of the eigenvalues of Hermitian matrices and the singular values of general matrices
- Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy
- Mixed and componentwise condition numbers for matrix decompositions
- Rigid continuation paths I. Quasilinear average complexity for solving polynomial systems
- Estimating a sharp convergence bound for randomized ensembles
- Probabilistic analyses of condition numbers
- Convergence analysis of Riemannian Gauss-Newton methods and its connection with the geometric condition number
- Condition numbers for a linear function of the solution to the constrained and weighted least squares problem and their statistical estimation
- On condition number theorems in mathematical programming
- On condition numbers for least squares with quadric inequality constraint
- Sensitivity of low-rank matrix recovery
- The condition number of join decompositions
- Structured condition numbers for some matrix factorizations of structured matrices
- A Riemannian trust region method for the canonical tensor rank approximation problem
- Probabilistic condition number estimates for real polynomial systems. I: A broader family of distributions
- Computing the homology of semialgebraic sets. II: General formulas
- A deterministic algorithm to compute approximate roots of polynomial systems in polynomial average time
- Wilkinson's bus: weak condition numbers, with an application to singular polynomial eigenproblems
- A robust numerical path tracking algorithm for polynomial homotopy continuation
- Tensors in computations
- Relative error analysis of matrix exponential approximations for numerical integration
- On a condition number of general random polynomial systems
- New characterizations of Hoffman constants for systems of linear constraints
- Sixty-four curves of degree six
- Pencil-based algorithms for tensor rank decomposition are not stable
- Average-case complexity without the black swans
- Estimating the algorithmic variance of randomized ensembles via the bootstrap
- A note on the condition number of the scaled total least squares problem
- Computing the homology of real projective sets
- A theory of complexity, condition, and roundoff
- Perturbation analysis for the QX factorization for centrosymmetric matrices
- Structure and Optimisation in Computational Harmonic Analysis: On Key Aspects in Sparse Regularisation
- Mathematics of the genome
- On the geometry of the set of symmetric matrices with repeated eigenvalues
- On local analysis
- Distribution of the eigenvalues of a random system of homogeneous polynomials
- Counting real critical points of the distance to orthogonally invariant matrix sets
- Condition of intersecting a projective variety with a varying linear subspace
- The Expected Number of Eigenvalues of a Real Gaussian Tensor
- A polyhedral homotopy algorithm for real zeros
- The asymptotic distribution of the condition number for random circulant matrices
- Condition numbers for a linear function of the solution of the linear least squares problem with equality constraints
- \(p\)-adic integral geometry
- How perturbations in the matrix of linear systems of ordinary differential equations propagate along solutions
- On the zeta Mahler measure function of the Jacobian determinant, condition numbers and the height of the generic discriminant
- Rigid continuation paths II. structured polynomial systems
- Hausdorff approximations and volume of tubes of singular algebraic sets
- On the number of real zeros of random fewnomials
- Probabilistic Schubert calculus
- The complexity of subdivision for diameter-distance tests
- Unitarity and symmetries of the multicomponent scattering matrix
- The Hurwitz form of a projective variety
- Low-degree approximation of random polynomials
- On the expected number of zeros of nonlinear equations
- Relative error long-time behavior in matrix exponential approximations for numerical integration: the stiff situation
- The real polynomial eigenvalue problem is well conditioned on the average
- Random points on an algebraic manifold
- The numerical factorization of polynomials
- Lower bounds by Birkhoff interpolation
- Conditioning and relative error propagation in linear autonomous ordinary differential equations
- Analysis of a high-order trace finite element method for PDEs on level set surfaces
- Grid methods in computational real algebraic (and semialgebraic) geometry
- The structured condition number of a differentiable map between matrix manifolds, with applications
- A condition-based algorithm for solving polyhedral feasibility problems
- Fiber product homotopy method for multiparameter eigenvalue problems
- The Legacy of Turing in Numerical Analysis
- On the partial condition numbers for the indefinite least squares problem
- Radius theorems for subregularity in infinite dimensions
- 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
- Average degree of the essential variety
- A sequence of polynomials with optimal condition number
- Sampling rates for \(\ell^1\)-synthesis
- A partial condition number theorem in mathematical programming
- Best \(k\)-layer neural network approximations
- Real zeros of mixed random fewnomial systems
- Projection and Rescaling Algorithm for Finding Maximum Support Solutions to Polyhedral Conic Systems
- On the condition of the zeros of characteristic polynomials
- Method of moments for 3D single particle \textit{ab initio} modeling with non-uniform distribution of viewing angles
- scientific article; zbMATH DE number 7733463 (Why is no real title available?)
- Propagation of perturbations in the initial value along solutions of linear ODEs: a componentwise relative error analysis
- Condition numbers for the tensor rank decomposition
- The geometry of rank drop in a class of face-splitting matrix products. I
- Probabilistic bounds on best rank-1 approximation ratio
- Conditioning theory of the equality constrained quadratic programming and its applications
- Robust and continuous metric subregularity for linear inequality systems
- scientific article; zbMATH DE number 440635 (Why is no real title available?)
- Loss landscapes and optimization in over-parameterized non-linear systems and neural networks
- Line Multiview Varieties
- The zonoid algebra, generalized mixed volumes, and random determinants
- Learning paths from signature tensors
- Smale 17th Problem: Advances and Open Directions
- On the complexity of the Plantinga-Vegter algorithm
- On Łojasiewicz inequalities and the effective Putinar's Positivstellensatz
- Generalized Perron Roots and Solvability of the Absolute Value Equation
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)
