Stokhos_Lanczos.hpp

Go to the documentation of this file.

// @HEADER
// ***********************************************************************
// 
//                           Stokhos Package
//                 Copyright (2009) Sandia Corporation
// 
// Under terms of Contract DE-AC04-94AL85000, there is a non-exclusive
// license for use of this work by or on behalf of the U.S. Government.
// 
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
// 1. Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
//
// 2. Redistributions in binary form must reproduce the above copyright
// notice, this list of conditions and the following disclaimer in the
// documentation and/or other materials provided with the distribution.
//
// 3. Neither the name of the Corporation nor the names of the
// contributors may be used to endorse or promote products derived from
// this software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY
// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE
// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
//
// Questions? Contact Eric T. Phipps (etphipp@sandia.gov).
// 
// ***********************************************************************
// @HEADER
 
#ifndef STOKHOS_LANCZOS_HPP
#define STOKHOS_LANCZOS_HPP
 
#include "Teuchos_Array.hpp"
#include "Teuchos_SerialDenseVector.hpp"
#include "Teuchos_SerialDenseMatrix.hpp"
#include "Teuchos_SerialDenseHelpers.hpp"
 
namespace Stokhos {
 
  template <typename ord_type, typename val_type>
  class WeightedVectorSpace {
  public:
    typedef ord_type ordinal_type;
    typedef val_type value_type;
    typedef Teuchos::SerialDenseVector<ordinal_type, value_type> vector_type;
 
    WeightedVectorSpace(const vector_type& weights) :
      w(weights),
      n(weights.length())
    {
    }
 
    ~WeightedVectorSpace() {}
 
    vector_type create_vector() const { return vector_type(n); }
    
    value_type 
    inner_product(const vector_type& u, const vector_type& v) const {
                  value_type val = value_type(0);
      for (ordinal_type j=0; j<n; j++)
  val += w[j]*u[j]*v[j];
      return val;
    }
 
    void
    add2(const value_type& a, const vector_type& u1,
         const value_type& b, const vector_type& u2, vector_type& v) const {
      for (ordinal_type j=0; j<n; j++)
        v[j] = a*u1[j] + b*u2[j];
    }
 
    void
    add3(const value_type& a, const vector_type& u1,
         const value_type& b, const vector_type& u2, 
         const value_type& c, const vector_type& u3, vector_type& v) const {
      for (ordinal_type j=0; j<n; j++)
        v[j] = a*u1[j] + b*u2[j] +c*u3[j];
    }
 
  protected:
 
    const vector_type& w;
    ordinal_type n;
 
  };

  template <typename vectorspace_type, typename operator_type> 
  class Lanczos {
  public:
 
    typedef typename operator_type::ordinal_type ordinal_type;
    typedef typename operator_type::value_type value_type;
    typedef Teuchos::SerialDenseVector<ordinal_type,value_type> vector_type;
    typedef Teuchos::SerialDenseMatrix<ordinal_type,value_type> matrix_type;

    static void compute(ordinal_type k, 
                        const vectorspace_type& vs,
      const operator_type& A,
      const vector_type& u_init,
      matrix_type& u,
      Teuchos::Array<value_type>& alpha,
      Teuchos::Array<value_type>& beta,
      Teuchos::Array<value_type>& nrm_sqrd) {
      beta[0] = 1.0;
 
      // u[i-1], u[i], u[i+1]
      vector_type u0, u1, u2;
 
      // set starting vector
      u0 = Teuchos::getCol(Teuchos::View, u, 0);
      u0.assign(u_init);
      u1 = u0;
 
      value_type nrm;
      vector_type v = vs.create_vector();
      for (ordinal_type i=0; i<k; i++) {
 
  // Compute (u_i,u_i)
  nrm_sqrd[i] = vs.inner_product(u1, u1);
 
  // Compute v = A*u_i
        A.apply(u1, v);
 
  // Compute (v,u_i)
  nrm = vs.inner_product(u1, v);
 
  // Compute alpha = (v,u_i) / (u_i,u_i)
  alpha[i] = nrm / nrm_sqrd[i];
 
  // Compute beta = (u_i,u_i) / (u_{i-1}.u_{i-1})
  if (i > 0)
    beta[i] = nrm_sqrd[i] / nrm_sqrd[i-1];
 
  // Compute u_{i+1} = v - alpha_i*u_i - beta_i*u_{i-1}
  if (i < k-1) {
    u2 = Teuchos::getCol(Teuchos::View, u, i+1);
    if (i == 0) 
      vs.add2(value_type(1), v, -alpha[i], u1, u2);
    else
      vs.add3(value_type(1), v, -alpha[i], u1, -beta[i], u0, u2);
    gramSchmidt(i+1, vs, u, u2);
  }
 
  // std::cout << "i = " << i 
  //    << " alpha = " << alpha[i] << " beta = " << beta[i]
  //    << " nrm = " << nrm_sqrd[i] << std::endl;
        TEUCHOS_TEST_FOR_EXCEPTION(nrm_sqrd[i] < 0, std::logic_error,
                     "Stokhos::LanczosProjPCEBasis::lanczos():  "
               << " Polynomial " << i << " out of " << k
               << " has norm " << nrm_sqrd[i] << "!");
 
  // Shift -- these are just pointer copies
  u0 = u1;
  u1 = u2;      
 
      }
    }

    static void computeNormalized(ordinal_type k, 
          const vectorspace_type& vs,
          const operator_type& A,
          const vector_type& u_init,
          matrix_type& u,
          Teuchos::Array<value_type>& alpha,
          Teuchos::Array<value_type>& beta,
          Teuchos::Array<value_type>& nrm_sqrd) {
 
      // u[i-1], u[i], u[i+1]
      vector_type u0, u1, u2;
 
      // set starting vector
      u0 = Teuchos::getCol(Teuchos::View, u, 0);
      u0.assign(u_init);
      u1 = u0;
 
      vector_type v = vs.create_vector();
      for (ordinal_type i=0; i<k; i++) {
 
  // Compute (u_i,u_i)
  beta[i] = std::sqrt(vs.inner_product(u1, u1));
  u1.scale(1.0/beta[i]);
  nrm_sqrd[i] = value_type(1.0);
 
  // Compute v = A*u_i
        A.apply(u1, v);
 
  // Compute (v,u_i)
  alpha[i] = vs.inner_product(u1, v);
 
  // Compute u_{i+1} = v - alpha_i*u_i - beta_i*u_{i-1}
  if (i < k-1) {
    u2 = Teuchos::getCol(Teuchos::View, u, i+1);
    if (i == 0) 
      vs.add2(value_type(1), v, -alpha[i], u1, u2);
    else
      vs.add3(value_type(1), v, -alpha[i], u1, -beta[i], u0, u2);
    gramSchmidt(i+1, vs, u, u2);
  }
 
  // std::cout << "i = " << i 
  //    << " alpha = " << alpha[i] << " beta = " << beta[i]
  //    << " nrm = " << nrm_sqrd[i] << std::endl;
        TEUCHOS_TEST_FOR_EXCEPTION(nrm_sqrd[i] < 0, std::logic_error,
                     "Stokhos::LanczosProjPCEBasis::lanczos():  "
               << " Polynomial " << i << " out of " << k
               << " has norm " << nrm_sqrd[i] << "!");
 
  // Shift -- these are just pointer copies
  u0 = u1;
  u1 = u2;      
 
      }
    }

    static void gramSchmidt(ordinal_type k, const vectorspace_type& vs, 
          matrix_type& u, vector_type& u2) {
      vector_type u0;
      value_type nrm, dp;
      for (ordinal_type i=0; i<k; i++) {
  u0 = Teuchos::getCol(Teuchos::View, u, i);
  nrm = vs.inner_product(u0, u0);
  dp = vs.inner_product(u2, u0);
  vs.add2(value_type(1), u2, -dp/nrm, u0, u2);
      }
    }
 
  };
}
 
#endif // STOKHOS_LANCZOS_HPP