A note on level-2 condition numbers
From MaRDI portal
Publication:558006
DOI10.1016/j.jco.2005.01.001zbMath1074.15008OpenAlexW1997997136MaRDI QIDQ558006
Publication date: 30 June 2005
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jco.2005.01.001
Numerical computation of matrix norms, conditioning, scaling (65F35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Conditioning of matrices (15A12) Computer aspects of numerical algorithms (65Y99)
Related Items
Smoothed analysis of complex conic condition numbers ⋮ On level-2 condition number for the weighted Moore-Penrose inverse ⋮ The probability that a slightly perturbed numerical analysis problem is difficult ⋮ Perturbations and metric regularity ⋮ Uniform bounds of aliasing and truncated errors in sampling series of functions from anisotropic Besov class ⋮ Optimal recovery on the classes of functions with bounded mixed derivative
Uses Software
Cites Work
- An unconditional basis in periodic spaces with dominating mixed smoothness properties
- Parallel information-based complexity
- Deterministic and stochastic error bounds in numerical analysis
- Dual iterative techniques for solving a finite element approximation of the biharmonic equation
- Some problems in the approximation of functions of two variables and n- widths of integral operators
- Average widths of Sobolev classes on \(\mathbb{R}^ n\)
- Average-case analysis of numerical problems
- Whittaker-Kotelnikov-Shannon sampling theorem and aliasing error
- On approximate recovery of functions with bounded mixed derivative
- Über die beste Annäherung von Funktionen einer gegebenen Funktionenklasse
- The best accuracy of reconstruction of finitely smooth functions from their values at a given number of points
- Besov regularity for elliptic boundary value problems
- RECOVERING A FUNCTION WITH ITS DERIVATIVES FROM FUNCTION VALUES AT A GIVEN NUMBER OF POINTS
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item