Average condition number for solving linear equations

DOI10.1016/0024-3795(86)90266-1zbMath0603.65025OpenAlexW2018239771MaRDI QIDQ1082774

B. George

Publication date: 1986

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(86)90266-1

zbMATH Keywords

Frobenius normdisturbed systemspectral normworst caseaverage condition number

Mathematics Subject Classification ID

Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Numerical computation of matrix norms, conditioning, scaling (65F35) Conditioning of matrices (15A12)

Related Items (5)

Wilkinson's bus: weak condition numbers, with an application to singular polynomial eigenproblems ⋮ Invertibility of random fredholm operators ⋮ Condition numbers of random matrices ⋮ Stochastic perturbations and smooth condition numbers ⋮ Probabilistic analyses of condition numbers

Cites Work

• Complexity theory of numerical linear algebra
• Evaluating Rational Functions: Infinite Precision is Finite Cost and Tractable on Average
• Iterative Refinement Implies Numerical Stability for Gaussian Elimination
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Average condition number for solving linear equations