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
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
|
// This file is part of ff3d - http://www.freefem.org/ff3d
// Copyright (C) 2001, 2002, 2003 Stphane Del Pino
// This program is free software; 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, or (at your option)
// any later version.
// This program 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 General Public License for more details.
// You should have received a copy of the GNU General Public License
// along with this program; if not, write to the Free Software Foundation,
// Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
// $Id: Discretization.hpp,v 1.1.1.1 2003/02/17 16:32:51 delpinux Exp $
#ifndef _DISCRETIZATION_HPP_
#define _DISCRETIZATION_HPP_
#include <ReferenceCounting.hpp>
#include <BaseVector.hpp>
#include <BaseMatrix.hpp>
#include <PDESystem.hpp>
/*!
\class Discretization
this class is used to define discretizations of PDEProblems.
\author Stephane Del Pino
*/
class Discretization
{
public:
//! The set of discretization types
enum Type {
FEM
};
protected:
//! The discretization type
const Discretization::Type __type;
//! The PDEProblem to discretize.
const Problem& __problem;
//! The matrix which will contain the discretization.
BaseMatrix& __A;
//! The second member
BaseVector& __b;
public:
//! Computes the matrix using the problem
virtual void assembleMatrix() = 0;
//! Computes the second memeber using the problem
virtual void assembleSecondMember() = 0;
//! Provides interface for to allow computation without matrix
virtual void getDiagonal(BaseVector&) const = 0;
//! Provides interface for to allow computation without matrix
virtual void timesX(const BaseVector&, BaseVector&) const = 0;
//! Gives the Problem
const Problem& problem() const
{
return __problem;
}
//! Which is the discretization type
const Discretization::Type& type() const
{
return __type;
}
//! Access to the matrix.
BaseMatrix& A()
{
return __A;
}
//! Access to the second member.
BaseVector& b()
{
return __b;
}
/*!
The constructor.
The matrix A and the second member b should be computed here.
*/
Discretization(const Discretization::Type t,
const Problem& p,
BaseMatrix& a,
BaseVector& bb)
: __type(t),
__problem(p),
__A(a),
__b(bb)
{
;
}
Discretization(const Discretization& D)
: __type(D.__type),
__problem(D.__problem),
__A(D.__A),
__b(D.__b)
{
;
}
//! The virtual destructor
virtual ~Discretization()
{
;
}
};
#endif // _DISCRETIZATION_HPP_
|
