Given a linear system $Ax=b$ and some vector $\tilde{x}$, the backward error characterizes the smallest relative perturbation of $A,b$ such that $\tilde{x}$ is a solution of the perturbed system. If the input matrix has some structure such as being symmetric or Toeplitz, perturbations may be restricted to perturbations within the same class of structured matrices. For normwise perturbations, the symmetric and the general backward errors are equal, and the question about the relation between the symmetric and general componentwise backward errors arises. In this note we show for a number of common structures in numerical analysis that for componentwise perturbations the structured backward error can be equal to $1$, whilst the unstructured backward error is arbitrarily small. Structures cover symmetric, persymmetric, skewsymmetric, Toeplitz, symmetric Toeplitz, Hankel, persymmetric Hankel, and circulant matrices. This is true although the normwise condition number $\|A^{-1}\|\|A\|$ is close to $1$.
[1]
Stef Graillat,et al.
STRUCTURED CONDITION NUMBERS AND BACKWARD ERRORS IN SCALAR PRODUCT SPACES
,
2006
.
[2]
Robert H. Halstead,et al.
Matrix Computations
,
2011,
Encyclopedia of Parallel Computing.
[3]
Nicholas J. Higham,et al.
INVERSE PROBLEMS NEWSLETTER
,
1991
.
[4]
Siegfried M. Rump,et al.
Structured Perturbations Part II: Componentwise Distances
,
2003,
SIAM J. Matrix Anal. Appl..
[5]
Nicholas J. Higham,et al.
Structured Pseudospectra for Polynomial Eigenvalue Problems, with Applications
,
2001,
SIAM J. Matrix Anal. Appl..
[6]
J. Demmel,et al.
The strong stability of algorithms for solving symmetric linear systems
,
1989
.