Smoothed Analysis of Moore–Penrose Inversion

DOI10.1137/100782954zbMath1227.65035arXiv1002.4690OpenAlexW2044142174WikidataQ57733126 ScholiaQ57733126MaRDI QIDQ3079770

Peter Bürgisser, Felipe Cucker

Publication date: 2 March 2011

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1002.4690

zbMATH Keywords

least-squaressmoothed analysisMoore-Penrose inversion

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Theory of matrix inversion and generalized inverses (15A09) Numerical computation of matrix norms, conditioning, scaling (65F35)

Related Items (6)

Average-case complexity without the black swans ⋮ The limit empirical spectral distribution of Gaussian monic complex matrix polynomials ⋮ Computational complexity of kernel-based density-ratio estimation: a condition number analysis ⋮ The average condition number of most tensor rank decomposition problems is infinite ⋮ On a problem posed by Steve Smale ⋮ Universality in polytope phase transitions and message passing algorithms

This page was built for publication: Smoothed Analysis of Moore–Penrose Inversion