eigs_z.cc

// -*- mode: c++; fill-column: 80; c-basic-offset: 2; indent-tabs-mode: nil -*-
/*
    Copyright (c) 2010 Juan Jose Garcia Ripoll

    Tensor is free software; you can redistribute it and/or modify it
    under the terms of the GNU Library General Public License as published
    by the Free Software Foundation; either version 2 of the License, or
    (at your option) any later version.

    This program is distributed in the hope that it will be useful,
    but WITHOUT ANY WARRANTY; without even the implied warranty of
    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
    GNU Library General Public License for more details.

    You should have received a copy of the GNU General Public License along
    with this program; if not, write to the Free Software Foundation, Inc.,
    51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
*/

//----------------------------------------------------------------------
// ARPACK DRIVER FOR NONSYMMETRIC EIGENVALUE PROBLEMS
//

#include <tensor/linalg.h>
#include <tensor/arpack_z.h>
#include "gemv.cc"

namespace linalg {

  using namespace tensor;

  CTensor
  eigs(const CTensor &A, int eig_type, size_t neig, CTensor *eigenvectors,
       const CTensor::elt_t *initial_guess)
  {
    EigType t = (EigType)eig_type;
    size_t n = A.columns();

    if ((A.rank() != 2) || (A.rows() != n)) {
      std::cerr << "In eigs(): Can only compute eigenvalues of square matrices.";
      abort();
    }

    if (neig > n || neig == 0) {
      std::cerr << "In eigs(): Can only compute up to " << n << " eigenvalues\n"
                << "in a matrix that has " << n << " times " << n << " elements.";
      abort();
    }

    if (n <= 4) {
      /* For small sizes, the ARPACK solver produces wrong results!
       * In any case, for these sizes it is more efficient to do the solving
       * using the full routine.
       */
      CTensor vectors;
      CTensor values = eig(A, NULL, eigenvectors? &vectors : 0);
      Indices ndx = CArpack::sort_values(values, t);
      Indices ndx_out(neig);
      std::copy(ndx.begin(), ndx.begin() + neig, ndx_out.begin());
      if (eigenvectors) {
        *eigenvectors = vectors(range(), range(ndx_out));
      }
      return CTensor(values(range(ndx_out)));
    }

    CTensor output;
    {
      CArpack data(n, t, neig);

      if (initial_guess)
        data.set_start_vector(initial_guess);

      while (data.update() < CArpack::Finished) {
        blas::gemv('N', n, n, number_one<cdouble>(), A.begin(), n, data.get_x_vector(), 1,
                   number_zero<cdouble>(), data.get_y_vector(), 1);
      }
      if (data.get_status() != CArpack::Finished) {
        std::cerr << data.error_message() << '\n';
        abort();
      }
      output = data.get_data(eigenvectors);
    }
    return output;
  }

} //namespace linalg