Skip to content
GitLab
Explore
Sign in
Register
Primary navigation
Search or go to…
Project
O
ogs
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Requirements
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Locked files
Build
Pipelines
Jobs
Pipeline schedules
Test cases
Artifacts
Deploy
Releases
Package registry
Container Registry
Model registry
Operate
Environments
Terraform modules
Monitor
Incidents
Service Desk
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Code review analytics
Issue analytics
Insights
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
Dmitri Naumov
ogs
Commits
10b54e0d
Commit
10b54e0d
authored
9 years ago
by
Christoph Lehmann
Browse files
Options
Downloads
Patches
Plain Diff
[Asm] CompSparsPat now also computes NodeAdjTable
parent
5614a2c2
No related branches found
No related tags found
No related merge requests found
Changes
2
Hide whitespace changes
Inline
Side-by-side
Showing
2 changed files
AssemblerLib/ComputeSparsityPattern.cpp
+7
-3
7 additions, 3 deletions
AssemblerLib/ComputeSparsityPattern.cpp
AssemblerLib/ComputeSparsityPattern.h
+2
-4
2 additions, 4 deletions
AssemblerLib/ComputeSparsityPattern.h
with
9 additions
and
7 deletions
AssemblerLib/ComputeSparsityPattern.cpp
+
7
−
3
View file @
10b54e0d
...
@@ -7,18 +7,22 @@
...
@@ -7,18 +7,22 @@
*
*
*/
*/
#include
"MeshLib/NodeAdjacencyTable.h"
#include
"LocalToGlobalIndexMap.h"
#include
"ComputeSparsityPattern.h"
#include
"ComputeSparsityPattern.h"
namespace
AssemblerLib
namespace
AssemblerLib
{
{
SparsityPattern
SparsityPattern
computeSparsityPattern
(
computeSparsityPattern
(
LocalToGlobalIndexMap
const
&
dof_table
,
MeshLib
::
NodeAdjacencyTable
const
&
node_adjacency_table
,
LocalToGlobalIndexMap
const
&
dof_table
,
MeshLib
::
Mesh
const
&
mesh
MeshLib
::
Mesh
const
&
mesh
)
)
{
{
MeshLib
::
NodeAdjacencyTable
node_adjacency_table
;
node_adjacency_table
.
createTable
(
mesh
.
getNodes
());
std
::
vector
<
std
::
vector
<
GlobalIndexType
>
>
global_idcs
;
std
::
vector
<
std
::
vector
<
GlobalIndexType
>
>
global_idcs
;
global_idcs
.
reserve
(
mesh
.
getNNodes
());
global_idcs
.
reserve
(
mesh
.
getNNodes
());
for
(
std
::
size_t
n
=
0
;
n
<
mesh
.
getNNodes
();
++
n
)
for
(
std
::
size_t
n
=
0
;
n
<
mesh
.
getNNodes
();
++
n
)
...
...
This diff is collapsed.
Click to expand it.
AssemblerLib/ComputeSparsityPattern.h
+
2
−
4
View file @
10b54e0d
...
@@ -12,19 +12,18 @@
...
@@ -12,19 +12,18 @@
#include
<vector>
#include
<vector>
#include
"MeshLib/NodeAdjacencyTable.h"
#include
"LocalToGlobalIndexMap.h"
#include
"ProcessLib/NumericsConfig.h"
#include
"ProcessLib/NumericsConfig.h"
namespace
AssemblerLib
namespace
AssemblerLib
{
{
class
LocalToGlobalIndexMap
;
using
SparsityPattern
=
std
::
vector
<
GlobalIndexType
>
;
using
SparsityPattern
=
std
::
vector
<
GlobalIndexType
>
;
/**
/**
* @brief Computes a sparsity pattern for the given inputs.
* @brief Computes a sparsity pattern for the given inputs.
*
*
* @param node_adjacency_table describes the mesh topology
* @param dof_table maps mesh nodes to global indices
* @param dof_table maps mesh nodes to global indices
* @param mesh mesh for which the two parameters above are defined
* @param mesh mesh for which the two parameters above are defined
*
*
...
@@ -32,7 +31,6 @@ using SparsityPattern = std::vector<GlobalIndexType>;
...
@@ -32,7 +31,6 @@ using SparsityPattern = std::vector<GlobalIndexType>;
*/
*/
SparsityPattern
SparsityPattern
computeSparsityPattern
(
computeSparsityPattern
(
MeshLib
::
NodeAdjacencyTable
const
&
node_adjacency_table
,
LocalToGlobalIndexMap
const
&
dof_table
,
LocalToGlobalIndexMap
const
&
dof_table
,
MeshLib
::
Mesh
const
&
mesh
MeshLib
::
Mesh
const
&
mesh
);
);
...
...
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
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!
Save comment
Cancel
Please
register
or
sign in
to comment