<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>05279971</id>
  <dt>j</dt>
  <an>05279971</an>
  <augroup>
    <au>Hecker, David</au>
    <au>Lurie, Deborah</au>
  </augroup>
  <ti>Using least-squares to find an approximate eigenvector.</ti>
  <so>Electron. J. Linear Algebra 16, 99-110, electronic only (2007).</so>
  <py>2007</py>
  <pu>ILAS - The International Linear Algebra Society c/o Daniel Hershkowitz, Department of Mathematics, Technion - Israel Institute of Techonolgy, Haifa</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>least-squares method</ut>
    <ut>eigenvalue error</ut>
    <ut>estimates</ut>
    <ut>empirical results</ut>
    <ut>approximate eigenvector</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
  </ligroup>
  <abgroup>
    <ab>Summary: The least-squares method can be used to approximate an eigenvector for a matrix when only an approximation is known for the corresponding eigenvalue. In this paper, this technique is analyzed and error estimates are established proving that if the error in the eigenvalue is sufficiently small, then the error in the approximate eigenvector produced by the least-squares method is also small. Also reported are some empirical results based on using the algorithm.</ab>
    <rv></rv>
  </abgroup>
</item>