sequenzo 0.1.18__cp310-cp310-win_amd64.whl → 0.1.19__cp310-cp310-win_amd64.whl

sequenzo/dissimilarity_measures/src/eigen/unsupported/Eigen/src/KroneckerProduct/KroneckerTensorProduct.h

@@ -1,305 +0,0 @@
-// This file is part of Eigen, a lightweight C++ template library
-// for linear algebra.
-//
-// Copyright (C) 2011 Kolja Brix <brix@igpm.rwth-aachen.de>
-// Copyright (C) 2011 Andreas Platen <andiplaten@gmx.de>
-// Copyright (C) 2012 Chen-Pang He <jdh8@ms63.hinet.net>
-//
-// This Source Code Form is subject to the terms of the Mozilla
-// Public License v. 2.0. If a copy of the MPL was not distributed
-// with this file, You can obtain one at http://mozilla.org/MPL/2.0/.
-
-#ifndef KRONECKER_TENSOR_PRODUCT_H
-#define KRONECKER_TENSOR_PRODUCT_H
-
-namespace Eigen {
-
-/*!
- * \ingroup KroneckerProduct_Module
- *
- * \brief The base class of dense and sparse Kronecker product.
- *
- * \tparam Derived is the derived type.
- */
-template<typename Derived>
-class KroneckerProductBase : public ReturnByValue<Derived>
-{
-  private:
-    typedef typename internal::traits<Derived> Traits;
-    typedef typename Traits::Scalar Scalar;
-
-  protected:
-    typedef typename Traits::Lhs Lhs;
-    typedef typename Traits::Rhs Rhs;
-
-  public:
-    /*! \brief Constructor. */
-    KroneckerProductBase(const Lhs& A, const Rhs& B)
-      : m_A(A), m_B(B)
-    {}
-
-    inline Index rows() const { return m_A.rows() * m_B.rows(); }
-    inline Index cols() const { return m_A.cols() * m_B.cols(); }
-
-    /*!
-     * This overrides ReturnByValue::coeff because this function is
-     * efficient enough.
-     */
-    Scalar coeff(Index row, Index col) const
-    {
-      return m_A.coeff(row / m_B.rows(), col / m_B.cols()) *
-             m_B.coeff(row % m_B.rows(), col % m_B.cols());
-    }
-
-    /*!
-     * This overrides ReturnByValue::coeff because this function is
-     * efficient enough.
-     */
-    Scalar coeff(Index i) const
-    {
-      EIGEN_STATIC_ASSERT_VECTOR_ONLY(Derived);
-      return m_A.coeff(i / m_A.size()) * m_B.coeff(i % m_A.size());
-    }
-
-  protected:
-    typename Lhs::Nested m_A;
-    typename Rhs::Nested m_B;
-};
-
-/*!
- * \ingroup KroneckerProduct_Module
- *
- * \brief Kronecker tensor product helper class for dense matrices
- *
- * This class is the return value of kroneckerProduct(MatrixBase,
- * MatrixBase). Use the function rather than construct this class
- * directly to avoid specifying template prarameters.
- *
- * \tparam Lhs  Type of the left-hand side, a matrix expression.
- * \tparam Rhs  Type of the rignt-hand side, a matrix expression.
- */
-template<typename Lhs, typename Rhs>
-class KroneckerProduct : public KroneckerProductBase<KroneckerProduct<Lhs,Rhs> >
-{
-  private:
-    typedef KroneckerProductBase<KroneckerProduct> Base;
-    using Base::m_A;
-    using Base::m_B;
-
-  public:
-    /*! \brief Constructor. */
-    KroneckerProduct(const Lhs& A, const Rhs& B)
-      : Base(A, B)
-    {}
-
-    /*! \brief Evaluate the Kronecker tensor product. */
-    template<typename Dest> void evalTo(Dest& dst) const;
-};
-
-/*!
- * \ingroup KroneckerProduct_Module
- *
- * \brief Kronecker tensor product helper class for sparse matrices
- *
- * If at least one of the operands is a sparse matrix expression,
- * then this class is returned and evaluates into a sparse matrix.
- *
- * This class is the return value of kroneckerProduct(EigenBase,
- * EigenBase). Use the function rather than construct this class
- * directly to avoid specifying template prarameters.
- *
- * \tparam Lhs  Type of the left-hand side, a matrix expression.
- * \tparam Rhs  Type of the rignt-hand side, a matrix expression.
- */
-template<typename Lhs, typename Rhs>
-class KroneckerProductSparse : public KroneckerProductBase<KroneckerProductSparse<Lhs,Rhs> >
-{
-  private:
-    typedef KroneckerProductBase<KroneckerProductSparse> Base;
-    using Base::m_A;
-    using Base::m_B;
-
-  public:
-    /*! \brief Constructor. */
-    KroneckerProductSparse(const Lhs& A, const Rhs& B)
-      : Base(A, B)
-    {}
-
-    /*! \brief Evaluate the Kronecker tensor product. */
-    template<typename Dest> void evalTo(Dest& dst) const;
-};
-
-template<typename Lhs, typename Rhs>
-template<typename Dest>
-void KroneckerProduct<Lhs,Rhs>::evalTo(Dest& dst) const
-{
-  const int BlockRows = Rhs::RowsAtCompileTime,
-            BlockCols = Rhs::ColsAtCompileTime;
-  const Index Br = m_B.rows(),
-              Bc = m_B.cols();
-  for (Index i=0; i < m_A.rows(); ++i)
-    for (Index j=0; j < m_A.cols(); ++j)
-      Block<Dest,BlockRows,BlockCols>(dst,i*Br,j*Bc,Br,Bc) = m_A.coeff(i,j) * m_B;
-}
-
-template<typename Lhs, typename Rhs>
-template<typename Dest>
-void KroneckerProductSparse<Lhs,Rhs>::evalTo(Dest& dst) const
-{
-  Index Br = m_B.rows(), Bc = m_B.cols();
-  dst.resize(this->rows(), this->cols());
-  dst.resizeNonZeros(0);
-  
-  // 1 - evaluate the operands if needed:
-  typedef typename internal::nested_eval<Lhs,Dynamic>::type Lhs1;
-  typedef typename internal::remove_all<Lhs1>::type Lhs1Cleaned;
-  const Lhs1 lhs1(m_A);
-  typedef typename internal::nested_eval<Rhs,Dynamic>::type Rhs1;
-  typedef typename internal::remove_all<Rhs1>::type Rhs1Cleaned;
-  const Rhs1 rhs1(m_B);
-    
-  // 2 - construct respective iterators
-  typedef Eigen::InnerIterator<Lhs1Cleaned> LhsInnerIterator;
-  typedef Eigen::InnerIterator<Rhs1Cleaned> RhsInnerIterator;
-  
-  // compute number of non-zeros per innervectors of dst
-  {
-    // TODO VectorXi is not necessarily big enough!
-    VectorXi nnzA = VectorXi::Zero(Dest::IsRowMajor ? m_A.rows() : m_A.cols());
-    for (Index kA=0; kA < m_A.outerSize(); ++kA)
-      for (LhsInnerIterator itA(lhs1,kA); itA; ++itA)
-        nnzA(Dest::IsRowMajor ? itA.row() : itA.col())++;
-      
-    VectorXi nnzB = VectorXi::Zero(Dest::IsRowMajor ? m_B.rows() : m_B.cols());
-    for (Index kB=0; kB < m_B.outerSize(); ++kB)
-      for (RhsInnerIterator itB(rhs1,kB); itB; ++itB)
-        nnzB(Dest::IsRowMajor ? itB.row() : itB.col())++;
-    
-    Matrix<int,Dynamic,Dynamic,ColMajor> nnzAB = nnzB * nnzA.transpose();
-    dst.reserve(VectorXi::Map(nnzAB.data(), nnzAB.size()));
-  }
-
-  for (Index kA=0; kA < m_A.outerSize(); ++kA)
-  {
-    for (Index kB=0; kB < m_B.outerSize(); ++kB)
-    {
-      for (LhsInnerIterator itA(lhs1,kA); itA; ++itA)
-      {
-        for (RhsInnerIterator itB(rhs1,kB); itB; ++itB)
-        {
-          Index i = itA.row() * Br + itB.row(),
-                j = itA.col() * Bc + itB.col();
-          dst.insert(i,j) = itA.value() * itB.value();
-        }
-      }
-    }
-  }
-}
-
-namespace internal {
-
-template<typename _Lhs, typename _Rhs>
-struct traits<KroneckerProduct<_Lhs,_Rhs> >
-{
-  typedef typename remove_all<_Lhs>::type Lhs;
-  typedef typename remove_all<_Rhs>::type Rhs;
-  typedef typename ScalarBinaryOpTraits<typename Lhs::Scalar, typename Rhs::Scalar>::ReturnType Scalar;
-  typedef typename promote_index_type<typename Lhs::StorageIndex, typename Rhs::StorageIndex>::type StorageIndex;
-
-  enum {
-    Rows = size_at_compile_time<traits<Lhs>::RowsAtCompileTime, traits<Rhs>::RowsAtCompileTime>::ret,
-    Cols = size_at_compile_time<traits<Lhs>::ColsAtCompileTime, traits<Rhs>::ColsAtCompileTime>::ret,
-    MaxRows = size_at_compile_time<traits<Lhs>::MaxRowsAtCompileTime, traits<Rhs>::MaxRowsAtCompileTime>::ret,
-    MaxCols = size_at_compile_time<traits<Lhs>::MaxColsAtCompileTime, traits<Rhs>::MaxColsAtCompileTime>::ret
-  };
-
-  typedef Matrix<Scalar,Rows,Cols> ReturnType;
-};
-
-template<typename _Lhs, typename _Rhs>
-struct traits<KroneckerProductSparse<_Lhs,_Rhs> >
-{
-  typedef MatrixXpr XprKind;
-  typedef typename remove_all<_Lhs>::type Lhs;
-  typedef typename remove_all<_Rhs>::type Rhs;
-  typedef typename ScalarBinaryOpTraits<typename Lhs::Scalar, typename Rhs::Scalar>::ReturnType Scalar;
-  typedef typename cwise_promote_storage_type<typename traits<Lhs>::StorageKind, typename traits<Rhs>::StorageKind, scalar_product_op<typename Lhs::Scalar, typename Rhs::Scalar> >::ret StorageKind;
-  typedef typename promote_index_type<typename Lhs::StorageIndex, typename Rhs::StorageIndex>::type StorageIndex;
-
-  enum {
-    LhsFlags = Lhs::Flags,
-    RhsFlags = Rhs::Flags,
-
-    RowsAtCompileTime = size_at_compile_time<traits<Lhs>::RowsAtCompileTime, traits<Rhs>::RowsAtCompileTime>::ret,
-    ColsAtCompileTime = size_at_compile_time<traits<Lhs>::ColsAtCompileTime, traits<Rhs>::ColsAtCompileTime>::ret,
-    MaxRowsAtCompileTime = size_at_compile_time<traits<Lhs>::MaxRowsAtCompileTime, traits<Rhs>::MaxRowsAtCompileTime>::ret,
-    MaxColsAtCompileTime = size_at_compile_time<traits<Lhs>::MaxColsAtCompileTime, traits<Rhs>::MaxColsAtCompileTime>::ret,
-
-    EvalToRowMajor = (int(LhsFlags) & int(RhsFlags) & RowMajorBit),
-    RemovedBits = ~(EvalToRowMajor ? 0 : RowMajorBit),
-
-    Flags = ((int(LhsFlags) | int(RhsFlags)) & HereditaryBits & RemovedBits)
-          | EvalBeforeNestingBit,
-    CoeffReadCost = HugeCost
-  };
-
-  typedef SparseMatrix<Scalar, 0, StorageIndex> ReturnType;
-};
-
-} // end namespace internal
-
-/*!
- * \ingroup KroneckerProduct_Module
- *
- * Computes Kronecker tensor product of two dense matrices
- *
- * \warning If you want to replace a matrix by its Kronecker product
- *          with some matrix, do \b NOT do this:
- * \code
- * A = kroneckerProduct(A,B); // bug!!! caused by aliasing effect
- * \endcode
- * instead, use eval() to work around this:
- * \code
- * A = kroneckerProduct(A,B).eval();
- * \endcode
- *
- * \param a  Dense matrix a
- * \param b  Dense matrix b
- * \return   Kronecker tensor product of a and b
- */
-template<typename A, typename B>
-KroneckerProduct<A,B> kroneckerProduct(const MatrixBase<A>& a, const MatrixBase<B>& b)
-{
-  return KroneckerProduct<A, B>(a.derived(), b.derived());
-}
-
-/*!
- * \ingroup KroneckerProduct_Module
- *
- * Computes Kronecker tensor product of two matrices, at least one of
- * which is sparse
- *
- * \warning If you want to replace a matrix by its Kronecker product
- *          with some matrix, do \b NOT do this:
- * \code
- * A = kroneckerProduct(A,B); // bug!!! caused by aliasing effect
- * \endcode
- * instead, use eval() to work around this:
- * \code
- * A = kroneckerProduct(A,B).eval();
- * \endcode
- *
- * \param a  Dense/sparse matrix a
- * \param b  Dense/sparse matrix b
- * \return   Kronecker tensor product of a and b, stored in a sparse
- *           matrix
- */
-template<typename A, typename B>
-KroneckerProductSparse<A,B> kroneckerProduct(const EigenBase<A>& a, const EigenBase<B>& b)
-{
-  return KroneckerProductSparse<A,B>(a.derived(), b.derived());
-}
-
-} // end namespace Eigen
-
-#endif // KRONECKER_TENSOR_PRODUCT_H

sequenzo/dissimilarity_measures/src/eigen/unsupported/Eigen/src/LevenbergMarquardt/LMcovar.h

@@ -1,84 +0,0 @@
-// This file is part of Eigen, a lightweight C++ template library
-// for linear algebra.
-//
-// This code initially comes from MINPACK whose original authors are:
-// Copyright Jorge More - Argonne National Laboratory
-// Copyright Burt Garbow - Argonne National Laboratory
-// Copyright Ken Hillstrom - Argonne National Laboratory
-//
-// This Source Code Form is subject to the terms of the Minpack license
-// (a BSD-like license) described in the campaigned CopyrightMINPACK.txt file.
-
-#ifndef EIGEN_LMCOVAR_H
-#define EIGEN_LMCOVAR_H
-
-namespace Eigen { 
-
-namespace internal {
-
-template <typename Scalar>
-void covar(
-        Matrix< Scalar, Dynamic, Dynamic > &r,
-        const VectorXi& ipvt,
-        Scalar tol = std::sqrt(NumTraits<Scalar>::epsilon()) )
-{
-    using std::abs;
-    /* Local variables */
-    Index i, j, k, l, ii, jj;
-    bool sing;
-    Scalar temp;
-
-    /* Function Body */
-    const Index n = r.cols();
-    const Scalar tolr = tol * abs(r(0,0));
-    Matrix< Scalar, Dynamic, 1 > wa(n);
-    eigen_assert(ipvt.size()==n);
-
-    /* form the inverse of r in the full upper triangle of r. */
-    l = -1;
-    for (k = 0; k < n; ++k)
-        if (abs(r(k,k)) > tolr) {
-            r(k,k) = 1. / r(k,k);
-            for (j = 0; j <= k-1; ++j) {
-                temp = r(k,k) * r(j,k);
-                r(j,k) = 0.;
-                r.col(k).head(j+1) -= r.col(j).head(j+1) * temp;
-            }
-            l = k;
-        }
-
-    /* form the full upper triangle of the inverse of (r transpose)*r */
-    /* in the full upper triangle of r. */
-    for (k = 0; k <= l; ++k) {
-        for (j = 0; j <= k-1; ++j)
-            r.col(j).head(j+1) += r.col(k).head(j+1) * r(j,k);
-        r.col(k).head(k+1) *= r(k,k);
-    }
-
-    /* form the full lower triangle of the covariance matrix */
-    /* in the strict lower triangle of r and in wa. */
-    for (j = 0; j < n; ++j) {
-        jj = ipvt[j];
-        sing = j > l;
-        for (i = 0; i <= j; ++i) {
-            if (sing)
-                r(i,j) = 0.;
-            ii = ipvt[i];
-            if (ii > jj)
-                r(ii,jj) = r(i,j);
-            if (ii < jj)
-                r(jj,ii) = r(i,j);
-        }
-        wa[jj] = r(j,j);
-    }
-
-    /* symmetrize the covariance matrix in r. */
-    r.topLeftCorner(n,n).template triangularView<StrictlyUpper>() = r.topLeftCorner(n,n).transpose();
-    r.diagonal() = wa;
-}
-
-} // end namespace internal
-
-} // end namespace Eigen
-
-#endif // EIGEN_LMCOVAR_H

sequenzo/dissimilarity_measures/src/eigen/unsupported/Eigen/src/LevenbergMarquardt/LMonestep.h

@@ -1,202 +0,0 @@
-// This file is part of Eigen, a lightweight C++ template library
-// for linear algebra.
-//
-// Copyright (C) 2009 Thomas Capricelli <orzel@freehackers.org>
-//
-// This code initially comes from MINPACK whose original authors are:
-// Copyright Jorge More - Argonne National Laboratory
-// Copyright Burt Garbow - Argonne National Laboratory
-// Copyright Ken Hillstrom - Argonne National Laboratory
-//
-// This Source Code Form is subject to the terms of the Minpack license
-// (a BSD-like license) described in the campaigned CopyrightMINPACK.txt file.
-
-#ifndef EIGEN_LMONESTEP_H
-#define EIGEN_LMONESTEP_H
-
-namespace Eigen {
-
-template<typename FunctorType>
-LevenbergMarquardtSpace::Status
-LevenbergMarquardt<FunctorType>::minimizeOneStep(FVectorType  &x)
-{
-  using std::abs;
-  using std::sqrt;
-  RealScalar temp, temp1,temp2; 
-  RealScalar ratio; 
-  RealScalar pnorm, xnorm, fnorm1, actred, dirder, prered;
-  eigen_assert(x.size()==n); // check the caller is not cheating us
-
-  temp = 0.0; xnorm = 0.0;
-  /* calculate the jacobian matrix. */
-  Index df_ret = m_functor.df(x, m_fjac);
-  if (df_ret<0)
-      return LevenbergMarquardtSpace::UserAsked;
-  if (df_ret>0)
-      // numerical diff, we evaluated the function df_ret times
-      m_nfev += df_ret;
-  else m_njev++;
-
-  /* compute the qr factorization of the jacobian. */
-  for (int j = 0; j < x.size(); ++j)
-    m_wa2(j) = m_fjac.col(j).blueNorm();
-  QRSolver qrfac(m_fjac);
-  if(qrfac.info() != Success) {
-    m_info = NumericalIssue;
-    return LevenbergMarquardtSpace::ImproperInputParameters;
-  }
-  // Make a copy of the first factor with the associated permutation
-  m_rfactor = qrfac.matrixR();
-  m_permutation = (qrfac.colsPermutation());
-
-  /* on the first iteration and if external scaling is not used, scale according */
-  /* to the norms of the columns of the initial jacobian. */
-  if (m_iter == 1) {
-      if (!m_useExternalScaling)
-          for (Index j = 0; j < n; ++j)
-              m_diag[j] = (m_wa2[j]==0.)? 1. : m_wa2[j];
-
-      /* on the first iteration, calculate the norm of the scaled x */
-      /* and initialize the step bound m_delta. */
-      xnorm = m_diag.cwiseProduct(x).stableNorm();
-      m_delta = m_factor * xnorm;
-      if (m_delta == 0.)
-          m_delta = m_factor;
-  }
-
-  /* form (q transpose)*m_fvec and store the first n components in */
-  /* m_qtf. */
-  m_wa4 = m_fvec;
-  m_wa4 = qrfac.matrixQ().adjoint() * m_fvec; 
-  m_qtf = m_wa4.head(n);
-
-  /* compute the norm of the scaled gradient. */
-  m_gnorm = 0.;
-  if (m_fnorm != 0.)
-      for (Index j = 0; j < n; ++j)
-          if (m_wa2[m_permutation.indices()[j]] != 0.)
-              m_gnorm = (std::max)(m_gnorm, abs( m_rfactor.col(j).head(j+1).dot(m_qtf.head(j+1)/m_fnorm) / m_wa2[m_permutation.indices()[j]]));
-
-  /* test for convergence of the gradient norm. */
-  if (m_gnorm <= m_gtol) {
-    m_info = Success;
-    return LevenbergMarquardtSpace::CosinusTooSmall;
-  }
-
-  /* rescale if necessary. */
-  if (!m_useExternalScaling)
-      m_diag = m_diag.cwiseMax(m_wa2);
-
-  do {
-    /* determine the levenberg-marquardt parameter. */
-    internal::lmpar2(qrfac, m_diag, m_qtf, m_delta, m_par, m_wa1);
-
-    /* store the direction p and x + p. calculate the norm of p. */
-    m_wa1 = -m_wa1;
-    m_wa2 = x + m_wa1;
-    pnorm = m_diag.cwiseProduct(m_wa1).stableNorm();
-
-    /* on the first iteration, adjust the initial step bound. */
-    if (m_iter == 1)
-        m_delta = (std::min)(m_delta,pnorm);
-
-    /* evaluate the function at x + p and calculate its norm. */
-    if ( m_functor(m_wa2, m_wa4) < 0)
-        return LevenbergMarquardtSpace::UserAsked;
-    ++m_nfev;
-    fnorm1 = m_wa4.stableNorm();
-
-    /* compute the scaled actual reduction. */
-    actred = -1.;
-    if (Scalar(.1) * fnorm1 < m_fnorm)
-        actred = 1. - numext::abs2(fnorm1 / m_fnorm);
-
-    /* compute the scaled predicted reduction and */
-    /* the scaled directional derivative. */
-    m_wa3 = m_rfactor.template triangularView<Upper>() * (m_permutation.inverse() *m_wa1);
-    temp1 = numext::abs2(m_wa3.stableNorm() / m_fnorm);
-    temp2 = numext::abs2(sqrt(m_par) * pnorm / m_fnorm);
-    prered = temp1 + temp2 / Scalar(.5);
-    dirder = -(temp1 + temp2);
-
-    /* compute the ratio of the actual to the predicted */
-    /* reduction. */
-    ratio = 0.;
-    if (prered != 0.)
-        ratio = actred / prered;
-
-    /* update the step bound. */
-    if (ratio <= Scalar(.25)) {
-        if (actred >= 0.)
-            temp = RealScalar(.5);
-        if (actred < 0.)
-            temp = RealScalar(.5) * dirder / (dirder + RealScalar(.5) * actred);
-        if (RealScalar(.1) * fnorm1 >= m_fnorm || temp < RealScalar(.1))
-            temp = Scalar(.1);
-        /* Computing MIN */
-        m_delta = temp * (std::min)(m_delta, pnorm / RealScalar(.1));
-        m_par /= temp;
-    } else if (!(m_par != 0. && ratio < RealScalar(.75))) {
-        m_delta = pnorm / RealScalar(.5);
-        m_par = RealScalar(.5) * m_par;
-    }
-
-    /* test for successful iteration. */
-    if (ratio >= RealScalar(1e-4)) {
-        /* successful iteration. update x, m_fvec, and their norms. */
-        x = m_wa2;
-        m_wa2 = m_diag.cwiseProduct(x);
-        m_fvec = m_wa4;
-        xnorm = m_wa2.stableNorm();
-        m_fnorm = fnorm1;
-        ++m_iter;
-    }
-
-    /* tests for convergence. */
-    if (abs(actred) <= m_ftol && prered <= m_ftol && Scalar(.5) * ratio <= 1. && m_delta <= m_xtol * xnorm)
-    {
-       m_info = Success;
-      return LevenbergMarquardtSpace::RelativeErrorAndReductionTooSmall;
-    }
-    if (abs(actred) <= m_ftol && prered <= m_ftol && Scalar(.5) * ratio <= 1.) 
-    {
-      m_info = Success;
-      return LevenbergMarquardtSpace::RelativeReductionTooSmall;
-    }
-    if (m_delta <= m_xtol * xnorm)
-    {
-      m_info = Success;
-      return LevenbergMarquardtSpace::RelativeErrorTooSmall;
-    }
-
-    /* tests for termination and stringent tolerances. */
-    if (m_nfev >= m_maxfev) 
-    {
-      m_info = NoConvergence;
-      return LevenbergMarquardtSpace::TooManyFunctionEvaluation;
-    }
-    if (abs(actred) <= NumTraits<Scalar>::epsilon() && prered <= NumTraits<Scalar>::epsilon() && Scalar(.5) * ratio <= 1.)
-    {
-      m_info = Success;
-      return LevenbergMarquardtSpace::FtolTooSmall;
-    }
-    if (m_delta <= NumTraits<Scalar>::epsilon() * xnorm) 
-    {
-      m_info = Success;
-      return LevenbergMarquardtSpace::XtolTooSmall;
-    }
-    if (m_gnorm <= NumTraits<Scalar>::epsilon())
-    {
-      m_info = Success;
-      return LevenbergMarquardtSpace::GtolTooSmall;
-    }
-
-  } while (ratio < Scalar(1e-4));
-
-  return LevenbergMarquardtSpace::Running;
-}
-
-  
-} // end namespace Eigen
-
-#endif // EIGEN_LMONESTEP_H