You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
To fill the postion vector with the needed values mappings are needed.
37
42
38
43
local point ids -> global point id -> reduced contact block point id
39
44
The mapping has to be done in both directions, because the contact forces have to be applied to the local core point id.
40
45
41
-
42
-
43
46
---
44
47
45
48
**Computation**
46
49
47
50
- Step 1 -
48
-
Perform a nearest neighbor search with a user defined Contact Radius. The result is a list of potential contact pairs.
51
+
Perform a nearest neighbor search with a user defined Contact Radius. The result is a list of potential contact pairs.
49
52
- Step 2 -
50
-
A sub list nearest neighbor search is performed.
53
+
A sub list nearest neighbor search is performed.
51
54
- Step 3 -
52
-
All points found are than in contact.
55
+
All points found are than in contact.
53
56
54
57
The quasi code is given here
55
58
@@ -77,35 +80,35 @@ function contact_search(...)
77
80
end
78
81
79
82
```
80
-
The structure tries to minimize the search and the communication between cores.
81
83
84
+
The structure tries to minimize the search and the communication between cores.
82
85
83
86
**Synchronization**
84
87
All cores (except core 1) send it's displacement values to core 1. Core 1 sends them back.
85
88
!!! note "Efficiency"
86
-
Smaller contact areas are more efficient in numerical analysis, because less synchronisation have to occur.
89
+
Smaller contact areas are more efficient in numerical analysis, because less synchronisation have to occur.
87
90
88
-
----
91
+
---
89
92
90
93
## Contact Models
91
94
92
-
| Contact Model | Penalty Contact |
93
-
|------------------------|:---------------:|
94
-
| Contact Stiffness | ✔️|
95
+
| Contact Model | Penalty Contact |
96
+
|-----------------|:-------------: |
97
+
| Contact Stiffness |✔️ |
95
98
96
99
## Penalty Contact
97
100
98
-
A bond-based contact formulation is computed. The contact stiffness $ c_{contact}$ is defined in YAML input file. Based on that utilzing the horizon $\delta$ the penalty stiffness shown in the table is computed. These parameter are comparable to the [bond-based formulation](@ref"Bond-based Peridynamics"). The algorithm was taken from [Peridigm](https://github.com/peridigm/peridigm/blob/master/src/contact/Peridigm_ShortRangeForceContactModel.cpp)
A bond-based contact formulation is computed. The contact stiffness $ c\_{contact}$ is defined in YAML input file. Based on that utilzing the horizon $\delta$ the penalty stiffness shown in the table is computed. These parameter are comparable to the [bond-based formulation](@ref"Bond-based Peridynamics"). The algorithm was taken from [Peridigm](https://github.com/peridigm/peridigm/blob/master/src/contact/Peridigm_ShortRangeForceContactModel.cpp)
Within PeriLab the functions compute_master_force_density and compute_slave_force_density are used to apply the force to the correct postions. This is needed, becaus if a parallel process is run, master and slave nodes not necessarily are on the same core.
125
126
126
127
### Friction Contact
127
-
| Contact Model | Penalty Contact |
128
-
|------------------------|:---------------:|
129
-
| Friction Coeffient | ✔️|
128
+
129
+
| Contact Model | Penalty Contact |
130
+
| ------------------ | :-------------: |
131
+
| Friction Coeffient | ✔️ |
130
132
131
133
The model is computed if the ""Friction Coeffient"" is greater than zero.
are used. The tangential direction must be computed. Following the [Peridigm](https://github.com/peridigm/peridigm/blob/master/src/contact/Peridigm_ShortRangeForceContactModel.cpp) algorithm, the normal velocity of the master node $m$ and the slave node $s$ are
If the length of $\mathbf{v}_{tan-m}$ and $\mathbf{v}_{tan-s}$ is greater than zero, respectively, friction occurs. The friction force is computed as using the friction coefficient $\mu$.
0 commit comments