// This file is triangularView of Eigen, a lightweight C++ template library // for linear algebra. // // Copyright (C) 2008-2009 Gael Guennebaud // // Eigen is free software; you can redistribute it and/or // modify it under the terms of the GNU Lesser General Public // License as published by the Free Software Foundation; either // version 3 of the License, or (at your option) any later version. // // Alternatively, you can redistribute it and/or // modify it under the terms of the GNU General Public License as // published by the Free Software Foundation; either version 2 of // the License, or (at your option) any later version. // // Eigen 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 Lesser General Public License or the // GNU General Public License for more details. // // You should have received a copy of the GNU Lesser General Public // License and a copy of the GNU General Public License along with // Eigen. If not, see . #include "main.h" template void trmv(const MatrixType& m) { typedef typename MatrixType::Index Index; typedef typename MatrixType::Scalar Scalar; typedef typename NumTraits::Real RealScalar; typedef Matrix VectorType; RealScalar largerEps = 10*test_precision(); Index rows = m.rows(); Index cols = m.cols(); MatrixType m1 = MatrixType::Random(rows, cols), m3(rows, cols); VectorType v1 = VectorType::Random(rows); Scalar s1 = ei_random(); m1 = MatrixType::Random(rows, cols); // check with a column-major matrix m3 = m1.template triangularView(); VERIFY((m3 * v1).isApprox(m1.template triangularView() * v1, largerEps)); m3 = m1.template triangularView(); VERIFY((m3 * v1).isApprox(m1.template triangularView() * v1, largerEps)); m3 = m1.template triangularView(); VERIFY((m3 * v1).isApprox(m1.template triangularView() * v1, largerEps)); m3 = m1.template triangularView(); VERIFY((m3 * v1).isApprox(m1.template triangularView() * v1, largerEps)); // check conjugated and scalar multiple expressions (col-major) m3 = m1.template triangularView(); VERIFY(((s1*m3).conjugate() * v1).isApprox((s1*m1).conjugate().template triangularView() * v1, largerEps)); m3 = m1.template triangularView(); VERIFY((m3.conjugate() * v1.conjugate()).isApprox(m1.conjugate().template triangularView() * v1.conjugate(), largerEps)); // check with a row-major matrix m3 = m1.template triangularView(); VERIFY((m3.transpose() * v1).isApprox(m1.transpose().template triangularView() * v1, largerEps)); m3 = m1.template triangularView(); VERIFY((m3.transpose() * v1).isApprox(m1.transpose().template triangularView() * v1, largerEps)); m3 = m1.template triangularView(); VERIFY((m3.transpose() * v1).isApprox(m1.transpose().template triangularView() * v1, largerEps)); m3 = m1.template triangularView(); VERIFY((m3.transpose() * v1).isApprox(m1.transpose().template triangularView() * v1, largerEps)); // check conjugated and scalar multiple expressions (row-major) m3 = m1.template triangularView(); VERIFY((m3.adjoint() * v1).isApprox(m1.adjoint().template triangularView() * v1, largerEps)); m3 = m1.template triangularView(); VERIFY((m3.adjoint() * (s1*v1.conjugate())).isApprox(m1.adjoint().template triangularView() * (s1*v1.conjugate()), largerEps)); m3 = m1.template triangularView(); // check transposed cases: m3 = m1.template triangularView(); VERIFY((v1.transpose() * m3).isApprox(v1.transpose() * m1.template triangularView(), largerEps)); VERIFY((v1.adjoint() * m3).isApprox(v1.adjoint() * m1.template triangularView(), largerEps)); VERIFY((v1.adjoint() * m3.adjoint()).isApprox(v1.adjoint() * m1.template triangularView().adjoint(), largerEps)); // TODO check with sub-matrices } void test_product_trmv() { int s; for(int i = 0; i < g_repeat ; i++) { CALL_SUBTEST_1( trmv(Matrix()) ); CALL_SUBTEST_2( trmv(Matrix()) ); CALL_SUBTEST_3( trmv(Matrix3d()) ); s = ei_random(1,200); CALL_SUBTEST_4( trmv(MatrixXcf(s)) ); s = ei_random(1,200); CALL_SUBTEST_5( trmv(MatrixXcd(s,s)) ); s = ei_random(1,320); CALL_SUBTEST_6( trmv(Matrix(s, s)) ); } }