Author Description

Excerpt from Gmres/Cr and Arnoldi/Lanczos as Matrix Approximation Problems <p>A comparison of (1) and (2) suggests that from an approximation point of view, the difference between the gmres and Arnoldi algorithms is slight. This analogy is rarely brought out in accounts of these algorithms, partly for historical reasons and partly because the usual applications of the two algorithms are differ ent. Whereas gmres is applied to solve systems of equations A3: b, so that (1) comes quickly to mind as a description of it, the Arnoldi iteration is traditionally thought of as a method for estimating eigenvalues of A. The Arnoldi eigenvalue estimatesl at step n are the eigenvalues of H, that is, the roots of p. But what the Arnoldi iteration actually does is solve its connection with eigenvalues is indirect and approximate. <p>About the Publisher <p>Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com <p>This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.