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
98
99
100
101
102
103
104
105
|
/*
* Copyright 2008-2009 NVIDIA Corporation
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
/*! \file multilevel.h
* \brief Multilevel hierarchy
*
*/
#pragma once
#include <cusp/detail/config.h>
#include <cusp/detail/lu.h>
#include <cusp/array1d.h>
#include <cusp/linear_operator.h>
namespace cusp
{
/*! \addtogroup iterative_solvers Multilevel hiearchy
* \ingroup iterative_solvers
* \{
*/
/*! \p multilevel : multilevel hierarchy
*
*
* TODO
*/
template <typename MatrixType, typename SmootherType, typename SolverType>
class multilevel : public cusp::linear_operator<typename MatrixType::value_type,
typename MatrixType::memory_space>
{
public:
typedef typename MatrixType::index_type IndexType;
typedef typename MatrixType::value_type ValueType;
typedef typename MatrixType::memory_space MemorySpace;
struct level
{
MatrixType R; // restriction operator
MatrixType A; // matrix
MatrixType P; // prolongation operator
cusp::array1d<ValueType,MemorySpace> x; // per-level solution
cusp::array1d<ValueType,MemorySpace> b; // per-level rhs
cusp::array1d<ValueType,MemorySpace> residual; // per-level residual
SmootherType smoother;
level(){}
template<typename Level_Type>
level(const Level_Type& level) : R(level.R), A(level.A), P(level.P), x(level.x), b(level.b), residual(level.residual), smoother(level.smoother){}
};
SolverType solver;
std::vector<level> levels;
multilevel(){};
template <typename MatrixType2, typename SmootherType2, typename SolverType2>
multilevel(const multilevel<MatrixType2, SmootherType2, SolverType2>& M);
template <typename Array1, typename Array2>
void operator()(const Array1& x, Array2& y);
template <typename Array1, typename Array2>
void solve(const Array1& b, Array2& x);
template <typename Array1, typename Array2, typename Monitor>
void solve(const Array1& b, Array2& x, Monitor& monitor);
void print( void );
double operator_complexity( void );
double grid_complexity( void );
protected:
template <typename Array1, typename Array2>
void _solve(const Array1& b, Array2& x, const size_t i);
};
/*! \}
*/
} // end namespace cusp
#include <cusp/detail/multilevel.inl>
|
