Suppose that we are to compute f(x) at some x. We know that algorithms sometimes do not produce very accurate answers. When thinking this over, we should comprehend that not only might an algorithm be “bad” but it might be a problem itself. An important question: how far can f(x) change when x goes through small perturbations?
KeywordsCondition Number Spectral Radius Piecewise Linear Function Nonsingular Matrix Jordan Block
Unable to display preview. Download preview PDF.