<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>06027501</id>
  <dt>j</dt>
  <an>06027501</an>
  <augroup>
    <au>Brezinski, C.</au>
    <au>Novati, P.</au>
    <au>Redivo-Zaglia, M.</au>
  </augroup>
  <ti>A rational Arnoldi approach for ill-conditioned linear systems.</ti>
  <so>J. Comput. Appl. Math. 236, No. 8, 2063-2077 (2012).</so>
  <py>2012</py>
  <pu>Elsevier Science B.V. (North-Holland), Amsterdam</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>ill-conditioned linear systems</ut>
    <ut>matrix function</ut>
    <ut>rational Arnoldi method</ut>
    <ut>Tikhonov regularization</ut>
    <ut>error estimates</ut>
    <ut>condition numbers</ut>
    <ut>numerical examples</ut>
    <ut>convergence</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1016/j.cam.2011.09.032</li>
  </ligroup>
  <abgroup>
    <ab>A rational Arnoldi method for the solution of ill-posed full rank linear systems $Ax=b$ is derived by reformulating the problem as $x = f_\lambda(Z_\lambda)b$, $f_\lambda(z) = (1/z - \lambda)^ {-1}$, $Z_\lambda = (A+\lambda I)^{-1}$ and applying the involved matrix-function $f_\lambda$ in a suitable way to the Hessenberg-matrices obtained in the Arnoldi-process. A-priori and a-posteriori error representations are proven. Increasing the parameter $\lambda$ improves the accuracy of the application of $Z_\lambda$ (which means solution of a linear system with matrix $A+\lambda I$) in each Arnoldi-step while at the same time the speed of convergence of the Arnoldi-process decreases. By balancing the condition numbers of $f_\lambda$ and $Z_\lambda$, a strategy for the choice of $\lambda$ is obtained. The performance of the method for unperturbed systems is demonstrated by several numerical examples. Finally, the method is extended to the case of noisy right hand sides $\tilde{b}$ by adapting it to the Tikhonov system $(A^TA + \lambda H^T H)x_\lambda = A^T \tilde{b}$.</ab>
    <rv>Martin Rei\ss el (Aachen)</rv>
  </abgroup>
</item>