mirror of
https://gitlab.com/libeigen/eigen.git
synced 2025-04-18 19:30:38 +08:00
typo
This commit is contained in:
parent
c6e8caf090
commit
deecff97ed
@ -1,7 +1,7 @@
|
||||
// This file is part of Eigen, a lightweight C++ template library
|
||||
// for linear algebra.
|
||||
//
|
||||
// Copyright (C) 2009-2010 Gael Guennebaud <gael.guennebaud@inria.fr>
|
||||
// Copyright (C) 2009-2015 Gael Guennebaud <gael.guennebaud@inria.fr>
|
||||
//
|
||||
// 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
|
||||
@ -13,7 +13,6 @@
|
||||
#include <Eigen/Core>
|
||||
#include <Eigen/Jacobi>
|
||||
|
||||
#include <iostream>
|
||||
#include <complex>
|
||||
|
||||
#ifndef SCALAR
|
||||
|
@ -8,7 +8,7 @@
|
||||
// with this file, You can obtain one at http://mozilla.org/MPL/2.0/.
|
||||
|
||||
#include "common.h"
|
||||
|
||||
#include <stdio.h>
|
||||
int EIGEN_BLAS_FUNC(gemm)(char *opa, char *opb, int *m, int *n, int *k, RealScalar *palpha, RealScalar *pa, int *lda, RealScalar *pb, int *ldb, RealScalar *pbeta, RealScalar *pc, int *ldc)
|
||||
{
|
||||
// std::cerr << "in gemm " << *opa << " " << *opb << " " << *m << " " << *n << " " << *k << " " << *lda << " " << *ldb << " " << *ldc << " " << *palpha << " " << *pbeta << "\n";
|
||||
|
@ -1,5 +1,5 @@
|
||||
|
||||
#include <iostream>
|
||||
#include <stdio.h>
|
||||
|
||||
#if (defined __GNUC__) && (!defined __MINGW32__)
|
||||
#define EIGEN_WEAK_LINKING __attribute__ ((weak))
|
||||
@ -14,7 +14,7 @@ extern "C"
|
||||
|
||||
EIGEN_WEAK_LINKING int xerbla_(const char * msg, int *info, int)
|
||||
{
|
||||
std::cerr << "Eigen BLAS ERROR #" << *info << ": " << msg << "\n";
|
||||
printf("Eigen BLAS ERROR #%i: %s\n", *info, msg );
|
||||
return 0;
|
||||
}
|
||||
|
||||
|
@ -165,8 +165,8 @@ namespace Eigen {
|
||||
* The vectors x and b can be either dense or sparse.
|
||||
*
|
||||
* \tparam _MatrixType the type of the sparse matrix A, can be a dense or a sparse matrix.
|
||||
* \tparam _UpLo the triangular part that will be used for the computations. It can be Lower
|
||||
* or Upper. Default is Lower.
|
||||
* \tparam _UpLo the triangular part that will be used for the computations. It can be Lower,
|
||||
* Upper, or Lower|Upper in which the full matrix entries will be considered. Default is Lower.
|
||||
* \tparam _Preconditioner the type of the preconditioner. Default is DiagonalPreconditioner
|
||||
*
|
||||
* The maximal number of iterations and tolerance value can be controlled via the setMaxIterations()
|
||||
|
@ -21,7 +21,7 @@ template<typename T> void test_minres_T()
|
||||
// Diagonal preconditioner
|
||||
MINRES<SparseMatrix<T>, Lower, DiagonalPreconditioner<T> > minres_colmajor_lower_diag;
|
||||
MINRES<SparseMatrix<T>, Upper, DiagonalPreconditioner<T> > minres_colmajor_upper_diag;
|
||||
MINRES<SparseMatrix<T>, Upper, DiagonalPreconditioner<T> > minres_colmajor_uplo_diag;
|
||||
MINRES<SparseMatrix<T>, Lower|Upper, DiagonalPreconditioner<T> > minres_colmajor_uplo_diag;
|
||||
|
||||
// call tests for SPD matrix
|
||||
CALL_SUBTEST( check_sparse_spd_solving(minres_colmajor_lower_I) );
|
||||
|
Loading…
x
Reference in New Issue
Block a user