Skip to content
GitLab
Projects
Groups
Snippets
/
Help
Help
Support
Community forum
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in
Toggle navigation
Menu
Open sidebar
Aland, Sebastian
amdis
Commits
0e7a58de
Commit
0e7a58de
authored
Feb 08, 2013
by
Hieram Neumann-Heyme
Browse files
Small issue with arh-files / append index, fixed a few typos
parent
57d26e55
Changes
8
Hide whitespace changes
Inline
Side-by-side
AMDiS/src/OEMSolver.h
View file @
0e7a58de
...
...
@@ -100,7 +100,7 @@ namespace AMDiS {
{
FUNCNAME
(
"OEMSolver::solveSystem()"
);
TEST_EXIT
(
false
)
(
"This linear solver is not suitable for sequenti
el
l problems
\n
"
);
(
"This linear solver is not suitable for sequenti
a
l problems
\n
"
);
return
-
1
;
}
...
...
@@ -122,7 +122,7 @@ namespace AMDiS {
{
FUNCNAME
(
"OEMSolver::solveSystem()"
);
TEST_EXIT
(
false
)
(
"This linear solver is not suitable for domaindecomposition problems
\n
"
);
(
"This linear solver is not suitable for domain
decomposition problems
\n
"
);
return
-
1
;
}
#endif
...
...
AMDiS/src/SurfaceAssembler.h
View file @
0e7a58de
...
...
@@ -39,7 +39,7 @@ namespace AMDiS {
class
SurfaceAssembler
:
public
Assembler
{
public:
/// Creates a SurfaceAssembler conforming to operat for the given \ref coords.
/// Creates a SurfaceAssembler conforming to operat
e
for the given \ref coords.
SurfaceAssembler
(
Operator
*
operat
,
const
FiniteElemSpace
*
rowFeSpace
,
const
FiniteElemSpace
*
colFeSpace
,
...
...
AMDiS/src/ZeroOrderTerm.h
View file @
0e7a58de
...
...
@@ -104,7 +104,7 @@ namespace AMDiS {
SubAssembler
*
subAssembler
,
Quadrature
*
quad
=
NULL
);
/// Implementation of \ref OperatorTerm::initElement() for multi
l
pe meshes.
/// Implementation of \ref OperatorTerm::initElement() for multip
l
e meshes.
void
initElement
(
const
ElInfo
*
smallElInfo
,
const
ElInfo
*
largeElInfo
,
SubAssembler
*
subAssembler
,
...
...
@@ -288,7 +288,7 @@ namespace AMDiS {
void
initElement
(
const
ElInfo
*
elInfo
,
SubAssembler
*
subAssembler
,
Quadrature
*
quad
=
NULL
);
/// Implements
Second
OrderTerm::getC().
/// Implements
Zero
OrderTerm::getC().
void
getC
(
const
ElInfo
*
elInfo
,
int
nPoints
,
ElementVector
&
C
);
/// Implements ZeroOrderTerm::eval().
...
...
@@ -456,7 +456,7 @@ namespace AMDiS {
void
initElement
(
const
ElInfo
*
elInfo
,
SubAssembler
*
subAssembler
,
Quadrature
*
quad
=
NULL
);
/// Implements
Second
OrderTerm::getC().
/// Implements
Zero
OrderTerm::getC().
void
getC
(
const
ElInfo
*
elInfo
,
int
nPoints
,
ElementVector
&
C
);
/// Implements ZeroOrderTerm::eval().
...
...
@@ -470,7 +470,7 @@ namespace AMDiS {
protected:
DOFVectorBase
<
double
>*
vec
;
/// Function wich maps \ref gradAtQPs to a double.
/// Function w
h
ich maps \ref gradAtQPs to a double.
AbstractFunction
<
double
,
WorldVector
<
double
>
>
*
f
;
/** \brief
...
...
AMDiS/src/est/Estimator.h
View file @
0e7a58de
...
...
@@ -249,7 +249,7 @@ namespace AMDiS {
double
timestep
;
/** \brief
* Stores information about which mesh(es) must be travesed to estimate
* Stores information about which mesh(es) must be trave
r
sed to estimate
* the error on the component matrices.
*/
ComponentTraverseInfo
traverseInfo
;
...
...
AMDiS/src/io/FileWriter.cc
View file @
0e7a58de
...
...
@@ -195,7 +195,7 @@ namespace AMDiS {
ArhWriter
::
write
(
paraFilename
+
".arh"
,
feSpace
->
getMesh
(),
solutionVecs
);
#else
if
(
writeArhFormat
)
ArhWriter
::
write
(
f
ilename
+
".arh"
,
feSpace
->
getMesh
(),
solutionVecs
);
ArhWriter
::
write
(
f
n
+
".arh"
,
feSpace
->
getMesh
(),
solutionVecs
);
#endif
...
...
AMDiS/src/parallel/MeshDistributor.h
View file @
0e7a58de
...
...
@@ -196,9 +196,9 @@ namespace AMDiS {
* This function must be used if the values of a DOFVector must be
* synchronised over all ranks. That means, that each rank sends the
* values of the DOFs, which are owned by the rank and lie on an interior
* bounday, to all other ranks also having these DOFs.
* bounda
r
y, to all other ranks also having these DOFs.
*
* This function must be used, for example, after the linear
y
system is
* This function must be used, for example, after the linear system is
* solved, or after the DOFVector is set by some user defined functions,
* e.g., initial solution functions.
*/
...
...
@@ -348,7 +348,7 @@ namespace AMDiS {
const
FiniteElemSpace
*
feSpace
);
protected:
/// Creates an initial paritioning of the mesh.
/// Creates an initial par
t
itioning of the mesh.
void
createInitialPartitioning
();
/// Set for each element on the partitioning level the number of
...
...
AMDiS/src/parallel/MeshPartitioner.h
View file @
0e7a58de
...
...
@@ -64,7 +64,7 @@ namespace AMDiS {
virtual
~
MeshPartitioner
()
{}
/** \brief
* Creates an initial paritioning of the AMDiS mesh. This partitioning
* Creates an initial par
t
itioning of the AMDiS mesh. This partitioning
* can be arbitrary, the only requirement is that each macro element
* must be uniquely assign to a rank.
*
...
...
@@ -84,7 +84,7 @@ namespace AMDiS {
* elements in this macro element.
* \param[in] mode Most external partitioning libraries can make
* a difference whether we want to create a
* first partitioning or we alread have created
* first partitioning or we alread
y
have created
* one using this library but due to some mesh
* adaptivity we want to repartition the mesh. In
* the later case, the libraries also consider the
...
...
@@ -162,9 +162,9 @@ namespace AMDiS {
/// The mesh partitioner can be used in to different modes, the standard
/// mode and the so called "box partitioning". The standard mode assigns
/// macro elements to ranks. If box partitioning is enabled, which makes
/// only sen
c
e if the macro mesh results from meshconv's "lego mesher",
/// only sen
s
e if the macro mesh results from meshconv's "lego mesher",
/// then in 2D boxed (2 macro elements) and in 3D cubes (6 macro
/// elements) are assigned as a uni
i
on to ranks.
/// elements) are assigned as a union to ranks.
bool
boxPartitioning
;
/// In box partitioning mode this map stores for each box number the set
...
...
@@ -188,7 +188,7 @@ namespace AMDiS {
map
<
int
,
bool
>
elementInRank
;
/// Maps to each macro element index (or box index in box
/// partitiong mode) the rank number the element belongs to.
/// partition
in
g mode) the rank number the element belongs to.
map
<
int
,
int
>
partitionMap
;
/// After mesh repartitioning these maps stores which elements are communicated
...
...
extensions/GradientCalculations.h
View file @
0e7a58de
...
...
@@ -9,9 +9,16 @@ using namespace AMDiS;
namespace
experimental
{
/// Extended recovery gradient assuming mirror/point symmetry (pointSym=false/true)
/// of the solution at domain boundaries
/// --> Simon, es hat sich herausgestellt, dass meine ursprüngliche Version mit *nrm
/// effizienter ist, da Speicher nur für einige Ausnahmeknoten belegt wird (ok, ist
/// vielleicht etwas unübersichtlich)
inline
void
getRecoveryGradientSym
(
const
DOFVector
<
double
>
*
u
,
DOFVector
<
WorldVector
<
double
>
>
*
result
,
bool
as
ym
=
tru
e
)
bool
pointS
ym
=
fals
e
)
{
FUNCNAME
(
"getRecoveryGradientSym()"
);
const
FiniteElemSpace
*
feSpace
=
u
->
getFeSpace
();
...
...
@@ -59,7 +66,7 @@ namespace experimental {
WorldVector
<
double
>
n
,
rgrd
;
elInfo
->
getNormal
(
i
,
n
);
if
(
as
ym
)
if
(
pointS
ym
)
rgrd
=
grd
;
else
rgrd
=
grd
-
2.0
*
n
*
(
grd
*
n
);
// reflect gradient at boundary
...
...
@@ -95,7 +102,7 @@ namespace experimental {
u
->
getLocalVector
(
elInfo
->
getElement
(),
localUh
);
basFcts
->
evalGrdUh
(
bary
,
grdLambda
,
localUh
,
grd
);
if
(
as
ym
)
if
(
pointS
ym
)
rgrd
=
grd
;
else
{
n
=
1.0
/
norm
(
nrm
[
localIndices
[
i
]])
*
nrm
[
localIndices
[
i
]];
...
...
@@ -120,4 +127,4 @@ namespace experimental {
}
// end namespace experimental
#endif // GRADIENT_CALCULATIONS_H
\ No newline at end of file
#endif // GRADIENT_CALCULATIONS_H
Write
Preview
Supports
Markdown
0%
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment