/usr/include/InsightToolkit/Review/VNLIterativeSparseSolverTraits.h is in libinsighttoolkit3-dev 3.20.1-1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 | /*=========================================================================
Program: Insight Segmentation & Registration Toolkit
Module: VNLIterativeSparseSolverTraits.h
Language: C++
Date: $Date$
Version: $Revision$
Copyright (c) Insight Software Consortium. All rights reserved.
See ITKCopyright.txt or http://www.itk.org/HTML/Copyright.htm for details.
This software is distributed WITHOUT ANY WARRANTY; without even
the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
PURPOSE. See the above copyright notices for more information.
=========================================================================*/
#ifndef __VNLIterativeSparseSolverTraits_h
#define __VNLIterativeSparseSolverTraits_h
#include <vnl/vnl_vector.h>
#include <vnl/vnl_sparse_matrix.h>
#include <vnl/vnl_sparse_matrix_linear_system.h>
#include <vnl/algo/vnl_lsqr.h>
template< typename T = double >
class VNLIterativeSparseSolverTraits
{
public:
typedef T ValueType;
typedef vnl_sparse_matrix< ValueType > MatrixType;
typedef vnl_vector< ValueType > VectorType;
typedef vnl_lsqr SolverType;
VNLIterativeSparseSolverTraits() {}
~VNLIterativeSparseSolverTraits() {}
bool IsDirectSolver() const
{
return false;
}
MatrixType InitializeSparseMatrix( const unsigned int& iN ) const
{
return MatrixType( iN, iN );
}
VectorType InitializeVector( const unsigned int& iN ) const
{
return VectorType( iN );
}
void FillMatrix( MatrixType& iA, const unsigned int& iR, const unsigned int& iC, const ValueType& iV ) const
{
iA( iR, iC ) = iV;
}
void AddToMatrix( MatrixType& iA, const unsigned int& iR, const unsigned int& iC, const ValueType& iV ) const
{
iA( iR, iC ) += iV;
}
bool Solve( const MatrixType& iA, const VectorType& iB, VectorType& oX ) const
{
typedef vnl_sparse_matrix_linear_system< ValueType > SparseLinearSystemType;
SparseLinearSystemType system( iA, iB );
SolverType solver( system );
return solver.minimize( oX );
}
// no interest to use this method...
bool Solve( const MatrixType& iA,
const VectorType& iBx, const VectorType& iBy,
VectorType& oX, VectorType& oY ) const
{
bool result1 = Solve( iA, iBx, oX );
bool result2 = Solve( iA, iBy, oY );
return( result1 && result2 );
}
bool Solve( const MatrixType& iA,
const VectorType& iB,
const long& iNbIter,
VectorType& oX ) const
{
typedef vnl_sparse_matrix_linear_system< ValueType > SparseLinearSystemType;
SparseLinearSystemType system( iA, iB );
SolverType solver( system );
solver.set_max_iterations( iNbIter );
return solver.minimize( oX );
}
};
#endif
|