Condition. The geometry of numerical algorithms
From MaRDI portal
condition in linear algebracondition in linear optimizationcondition in polynomial equation solvingcondition numbersellipsoid methoderror analysisinterior-point methodsiterative algorithms for solving systems of linear equationsmonographNewton's methodprobabilistic analysis of the condition numberSmale's 17th problemtriangular linear systems
Conditioning of matrices (15A12) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Numerical computation of solutions to systems of equations (65H10) Numerical mathematical programming methods (65K05) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) General topics in the theory of algorithms (68W01) Interior-point methods (90C51)
Recommendations
Cited in
(only showing first 100 items - show all)- A note on the condition number of the scaled total least squares problem
- Conditioning and relative error propagation in linear autonomous ordinary differential equations
- On the partial condition numbers for the indefinite least squares problem
- Mathematics of the genome
- A deterministic algorithm to compute approximate roots of polynomial systems in polynomial average time
- Convergence analysis of Riemannian Gauss-Newton methods and its connection with the geometric condition number
- On condition number theorems in mathematical programming
- Structured condition numbers for some matrix factorizations of structured matrices
- Probabilistic condition number estimates for real polynomial systems. I: A broader family of distributions
- Grid methods in computational real algebraic (and semialgebraic) geometry
- Relative error analysis of matrix exponential approximations for numerical integration
- On condition numbers for least squares with quadric inequality constraint
- New characterizations of Hoffman constants for systems of linear constraints
- Fiber product homotopy method for multiparameter eigenvalue problems
- Computing the homology of semialgebraic sets. II: General formulas
- Numerical methods for accurate computation of the eigenvalues of Hermitian matrices and the singular values of general matrices
- How perturbations in the matrix of linear systems of ordinary differential equations propagate along solutions
- The asymptotic distribution of the condition number for random circulant matrices
- Sensitivity of low-rank matrix recovery
- On the topology of random real complete intersections
- Best \(k\)-layer neural network approximations
- Loss landscapes and optimization in over-parameterized non-linear systems and neural networks
- The zonoid algebra, generalized mixed volumes, and random determinants
- Perturbation analysis and condition numbers for the Tikhonov regularization of total least squares problem and their statistical estimation
- Analysis of normal-form algorithms for solving systems of polynomial equations
- Efficient sampling in spectrahedra and volume approximation
- Relative error long-time behavior in matrix exponential approximations for numerical integration: the stiff situation
- On the complexity of the Plantinga-Vegter algorithm
- The complexity of subdivision for diameter-distance tests
- The radius of metric subregularity
- Unitarity and symmetries of the multicomponent scattering matrix
- Condition numbers for a linear function of the solution to the constrained and weighted least squares problem and their statistical estimation
- On the geometry of the set of symmetric matrices with repeated eigenvalues
- Structured condition number for multiple right-hand side linear systems with parameterized quasiseparable coefficient matrix
- Probabilistic Schubert calculus
- On local analysis
- The real polynomial eigenvalue problem is well conditioned on the average
- Estimating a sharp convergence bound for randomized ensembles
- Probabilistic analysis of the Grassmann condition number
- Average-case complexity without the black swans
- On the condition of the zeros of characteristic polynomials
- Condition numbers for the tensor rank decomposition
- On the expected number of zeros of nonlinear equations
- Distribution of the eigenvalues of a random system of homogeneous polynomials
- Condition numbers for the cube. I: Univariate polynomials and hypersurfaces
- Low-degree approximation of random polynomials
- The average condition number of most tensor rank decomposition problems is infinite
- On the von Neumann and Frank-Wolfe algorithms with away steps
- On a condition number of general random polynomial systems
- The Legacy of Turing in Numerical Analysis
- scientific article; zbMATH DE number 440635 (Why is no real title available?)
- 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
- The Hurwitz form of a projective variety
- Smale 17th Problem: Advances and Open Directions
- Structure and Optimisation in Computational Harmonic Analysis: On Key Aspects in Sparse Regularisation
- A condition-based algorithm for solving polyhedral feasibility problems
- Analysis of a high-order trace finite element method for PDEs on level set surfaces
- The condition number of join decompositions
- Learning paths from signature tensors
- Exploring the numerics of branch-and-cut for mixed integer linear optimization
- Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy
- On the cost of iterative computations
- Smoothed analysis for the condition number of structured real polynomial systems
- Method of moments for 3D single particle \textit{ab initio} modeling with non-uniform distribution of viewing angles
- Random points on an algebraic manifold
- How well-conditioned can the eigenvector problem be?
- Propagation of perturbations in the initial value along solutions of linear ODEs: a componentwise relative error analysis
- Random Toeplitz matrices: The condition number under high stochastic dependence
- Toric eigenvalue methods for solving sparse polynomial systems
- A partial condition number theorem in mathematical programming
- Lower bounds by Birkhoff interpolation
- A robust numerical path tracking algorithm for polynomial homotopy continuation
- A sequence of polynomials with optimal condition number
- \(p\)-adic integral geometry
- A theory of complexity, condition, and roundoff
- On the number of real zeros of random fewnomials
- Rigid continuation paths I. Quasilinear average complexity for solving polynomial systems
- Pencil-based algorithms for tensor rank decomposition are not stable
- The structured condition number of a differentiable map between matrix manifolds, with applications
- The numerical factorization of polynomials
- Condition of intersecting a projective variety with a varying linear subspace
- A Riemannian trust region method for the canonical tensor rank approximation problem
- Sixty-four curves of degree six
- The Expected Number of Eigenvalues of a Real Gaussian Tensor
- Probabilistic analyses of condition numbers
- The Condition Number of Riemannian Approximation Problems
- Conditioning theory of the equality constrained quadratic programming and its applications
- Perturbation analysis for the QX factorization for centrosymmetric matrices
- Projection and Rescaling Algorithm for Finding Maximum Support Solutions to Polyhedral Conic Systems
- Tensors in computations
- Mixed and componentwise condition numbers for matrix decompositions
- Algebraic compressed sensing
- The limit empirical spectral distribution of Gaussian monic complex matrix polynomials
- A polyhedral homotopy algorithm for real zeros
- The condition number of many tensor decompositions is invariant under Tucker compression
- Real zeros of mixed random fewnomial systems
- Generalized Perron Roots and Solvability of the Absolute Value Equation
- Hausdorff approximations and volume of tubes of singular algebraic sets
- Rigid continuation paths II. structured polynomial systems
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)
