-
Notifications
You must be signed in to change notification settings - Fork 247
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
[ContactStructuralMechanicsApplication] Refactor ContactUtilities to cpp #7616
Merged
Merged
Changes from all commits
Commits
Show all changes
8 commits
Select commit
Hold shift + click to select a range
6d08d44
[ContactStructuralMechanicsApplication] Refactor ContactUtilities to cpp
6e7e23b
Standard class
loumalouomega 10f8857
Refactor
loumalouomega a231a30
Merge branch 'master' into contact/refactor-ContactUtilities
loumalouomega 49c1132
Ups
loumalouomega 3e74e00
Merge branch 'master' into contact/refactor-ContactUtilities
philbucher c7f1386
Merge branch 'master' into contact/refactor-ContactUtilities
loumalouomega 65cd5c3
Minor
loumalouomega File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
There are no files selected for viewing
321 changes: 321 additions & 0 deletions
321
applications/ContactStructuralMechanicsApplication/custom_utilities/contact_utilities.cpp
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,321 @@ | ||
| // KRATOS ___| | | | | ||
| // \___ \ __| __| | | __| __| | | __| _` | | | ||
| // | | | | | ( | | | | ( | | | ||
| // _____/ \__|_| \__,_|\___|\__|\__,_|_| \__,_|_| MECHANICS | ||
| // | ||
| // License: BSD License | ||
| // license: StructuralMechanicsApplication/license.txt | ||
| // | ||
| // Main authors: Vicente Mataix Ferrandiz | ||
| // | ||
|
|
||
| // System includes | ||
|
|
||
| // External includes | ||
|
|
||
| // Project includes | ||
| #include "utilities/openmp_utils.h" | ||
| #include "utilities/math_utils.h" | ||
| #include "custom_utilities/contact_utilities.h" | ||
|
|
||
| namespace Kratos | ||
| { | ||
| double ContactUtilities::CalculateRelativeSizeMesh(ModelPart& rModelPart) | ||
| { | ||
| return CalculateMaxNodalH(rModelPart)/CalculateMinimalNodalH(rModelPart); | ||
| } | ||
|
|
||
| /***********************************************************************************/ | ||
| /***********************************************************************************/ | ||
|
|
||
| double ContactUtilities::CalculateMaxNodalH(ModelPart& rModelPart) | ||
| { | ||
| // We iterate over the nodes | ||
| NodesArrayType& r_nodes_array = rModelPart.Nodes(); | ||
| const auto it_node_begin = r_nodes_array.begin(); | ||
|
|
||
| // // Creating the max auxiliar value | ||
| // double max_value = 0.0; | ||
| // | ||
| // #pragma omp parallel for reduction(max:max_value) | ||
| // for(int i = 0; i < static_cast<int>(r_nodes_array.size()); ++i) { | ||
| // auto it_node = it_node_begin + i; | ||
| // KRATOS_DEBUG_ERROR_IF_NOT(it_node->SolutionStepsDataHas(NODAL_H)) << "ERROR:: NODAL_H not added" << std::endl; | ||
| // max_value = std::max(max_value, it_node->FastGetSolutionStepValue(NODAL_H)); | ||
| // } | ||
| // | ||
| // return max_value; | ||
|
|
||
| // Creating a buffer for parallel vector fill | ||
| const int num_threads = OpenMPUtils::GetNumThreads(); | ||
| std::vector<double> max_vector(num_threads, 0.0); | ||
| double nodal_h; | ||
| #pragma omp parallel for private(nodal_h) | ||
| for(int i = 0; i < static_cast<int>(r_nodes_array.size()); ++i) { | ||
| auto it_node = it_node_begin + i; | ||
| KRATOS_DEBUG_ERROR_IF_NOT(it_node->SolutionStepsDataHas(NODAL_H)) << "ERROR:: NODAL_H not added" << std::endl; | ||
| nodal_h = it_node->FastGetSolutionStepValue(NODAL_H); | ||
|
|
||
| const int id = OpenMPUtils::ThisThread(); | ||
|
|
||
| if (nodal_h > max_vector[id]) | ||
| max_vector[id] = nodal_h; | ||
| } | ||
|
|
||
| return *std::max_element(max_vector.begin(), max_vector.end()); | ||
| } | ||
|
|
||
| /***********************************************************************************/ | ||
| /***********************************************************************************/ | ||
|
|
||
| double ContactUtilities::CalculateMeanNodalH(ModelPart& rModelPart) | ||
| { | ||
| // We iterate over the nodes | ||
| NodesArrayType& r_nodes_array = rModelPart.Nodes(); | ||
| const auto it_node_begin = r_nodes_array.begin(); | ||
|
|
||
| // Creating the sum auxiliar value | ||
| double sum_nodal_h = 0.0; | ||
|
|
||
| #pragma omp parallel for reduction(+:sum_nodal_h) | ||
| for(int i = 0; i < static_cast<int>(r_nodes_array.size()); ++i) { | ||
| auto it_node = it_node_begin + i; | ||
| KRATOS_DEBUG_ERROR_IF_NOT(it_node->SolutionStepsDataHas(NODAL_H)) << "ERROR:: NODAL_H not added" << std::endl; | ||
| sum_nodal_h += it_node->FastGetSolutionStepValue(NODAL_H);; | ||
| } | ||
|
|
||
| return sum_nodal_h/static_cast<double>(r_nodes_array.size()); | ||
| } | ||
|
|
||
| /***********************************************************************************/ | ||
| /***********************************************************************************/ | ||
|
|
||
| double ContactUtilities::CalculateMinimalNodalH(ModelPart& rModelPart) | ||
| { | ||
| // We iterate over the nodes | ||
| NodesArrayType& r_nodes_array = rModelPart.Nodes(); | ||
| const auto it_node_begin = r_nodes_array.begin(); | ||
|
|
||
| // // Creating the min auxiliar value | ||
| // double min_value = 0.0; | ||
| // | ||
| // #pragma omp parallel for reduction(min:min_value) | ||
| // for(int i = 0; i < static_cast<int>(r_nodes_array.size()); ++i) { | ||
| // auto it_node = it_node_begin + i; | ||
| // KRATOS_DEBUG_ERROR_IF_NOT(it_node->SolutionStepsDataHas(NODAL_H)) << "ERROR:: NODAL_H not added" << std::endl; | ||
| // min_value = std::min(min_value, it_node->FastGetSolutionStepValue(NODAL_H)); | ||
| // } | ||
| // | ||
| // return min_value; | ||
|
|
||
| // Creating a buffer for parallel vector fill | ||
| const int num_threads = OpenMPUtils::GetNumThreads(); | ||
| std::vector<double> min_vector(num_threads, 0.0); | ||
| double nodal_h; | ||
| #pragma omp parallel for private(nodal_h) | ||
| for(int i = 0; i < static_cast<int>(r_nodes_array.size()); ++i) { | ||
| auto it_node = it_node_begin + i; | ||
| KRATOS_DEBUG_ERROR_IF_NOT(it_node->SolutionStepsDataHas(NODAL_H)) << "ERROR:: NODAL_H not added" << std::endl; | ||
| nodal_h = it_node->FastGetSolutionStepValue(NODAL_H); | ||
|
|
||
| const int id = OpenMPUtils::ThisThread(); | ||
|
|
||
| if (nodal_h > min_vector[id]) | ||
| min_vector[id] = nodal_h; | ||
| } | ||
|
|
||
| return *std::min_element(min_vector.begin(), min_vector.end()); | ||
| } | ||
|
|
||
| /***********************************************************************************/ | ||
| /***********************************************************************************/ | ||
|
|
||
| double ContactUtilities::DistancePoints( | ||
| const GeometryType::CoordinatesArrayType& rPointOrigin, | ||
| const GeometryType::CoordinatesArrayType& rPointDestiny | ||
| ) | ||
| { | ||
| return std::sqrt((rPointOrigin[0] - rPointDestiny[0]) * (rPointOrigin[0] - rPointDestiny[0]) | ||
| + (rPointOrigin[1] - rPointDestiny[1]) * (rPointOrigin[1] - rPointDestiny[1]) | ||
| + (rPointOrigin[2] - rPointDestiny[2]) * (rPointOrigin[2] - rPointDestiny[2])); | ||
| } | ||
|
|
||
| /***********************************************************************************/ | ||
| /***********************************************************************************/ | ||
|
|
||
| void ContactUtilities::ComputeStepJump( | ||
| ModelPart& rModelPart, | ||
| const double DeltaTime, | ||
| const bool HalfJump | ||
| ) | ||
| { | ||
| // Time constants | ||
| const double velocity_constant = HalfJump ? 0.25 : 0.5; | ||
| const double acceleration_constant = HalfJump ? 0.125 : 0.5; | ||
|
|
||
| // Iterate over the nodes | ||
| NodesArrayType& r_nodes_array = rModelPart.Nodes(); | ||
|
|
||
| // Node iterator | ||
| const auto it_node_begin = r_nodes_array.begin(); | ||
|
|
||
| // We compute the half jump | ||
| array_1d<double, 3> new_delta_disp; | ||
| #pragma omp parallel for firstprivate(new_delta_disp) | ||
| for(int i = 0; i < static_cast<int>(r_nodes_array.size()); ++i) { | ||
| auto it_node = it_node_begin + i; | ||
| const array_1d<double, 3>& r_current_velocity = it_node->FastGetSolutionStepValue(VELOCITY); | ||
| const array_1d<double, 3>& r_previous_velocity = it_node->FastGetSolutionStepValue(VELOCITY, 1); | ||
| const array_1d<double, 3>& r_previous_acceleration = it_node->FastGetSolutionStepValue(ACCELERATION, 1); | ||
| noalias(new_delta_disp) = velocity_constant * DeltaTime * (r_current_velocity + r_previous_velocity) + acceleration_constant * std::pow(DeltaTime, 2) * r_previous_acceleration; | ||
| if (it_node->IsFixed(DISPLACEMENT_X)) new_delta_disp[0] = 0.0; | ||
| if (it_node->IsFixed(DISPLACEMENT_Y)) new_delta_disp[1] = 0.0; | ||
| if (it_node->IsFixed(DISPLACEMENT_Z)) new_delta_disp[2] = 0.0; | ||
| it_node->SetValue(DELTA_COORDINATES, new_delta_disp); | ||
| } | ||
| } | ||
|
|
||
| /***********************************************************************************/ | ||
| /***********************************************************************************/ | ||
|
|
||
| bool ContactUtilities::CheckActivity( | ||
| ModelPart& rModelPart, | ||
| const bool ThrowError | ||
| ) | ||
| { | ||
| // Iterate over the nodes | ||
| NodesArrayType& r_nodes_array = rModelPart.Nodes(); | ||
|
|
||
| // Node iterator | ||
| const auto it_node_begin = r_nodes_array.begin(); | ||
|
|
||
| // We compute the half jump | ||
| IndexType aux_check = 0; | ||
| #pragma omp parallel for reduction(+:aux_check) | ||
| for(int i = 0; i < static_cast<int>(r_nodes_array.size()); ++i) { | ||
| auto it_node = it_node_begin + i; | ||
| if (it_node->Is(SLAVE)) { | ||
| if (it_node->Is(ACTIVE)) { | ||
| aux_check += 1; | ||
| } | ||
| } | ||
| } | ||
|
|
||
| const bool is_active = aux_check == 0 ? false : true; | ||
|
|
||
| KRATOS_ERROR_IF(ThrowError && !is_active) << "CONTACT LOST::ARE YOU SURE YOU ARE SUPPOSED TO HAVE CONTACT?" << std::endl; | ||
|
|
||
| return is_active; | ||
| } | ||
|
|
||
| /***********************************************************************************/ | ||
| /***********************************************************************************/ | ||
|
|
||
| void ContactUtilities::CleanContactModelParts(ModelPart& rModelPart) | ||
| { | ||
| ConditionsArrayType& r_conditions_array = rModelPart.Conditions(); | ||
| KRATOS_TRACE_IF("Empty model part", r_conditions_array.size() == 0) << "YOUR CONTACT MODEL PART IS EMPTY" << std::endl; | ||
| const auto it_cond_begin = r_conditions_array.begin(); | ||
| #pragma omp parallel for | ||
| for(int i = 0; i < static_cast<int>(r_conditions_array.size()); ++i) { | ||
| auto it_cond = it_cond_begin + i; | ||
| const auto& r_geometry = it_cond->GetGeometry(); | ||
| if (r_geometry.NumberOfGeometryParts() > 0) { | ||
| it_cond->Set(TO_ERASE); | ||
| } | ||
| } | ||
| rModelPart.RemoveConditionsFromAllLevels(TO_ERASE); | ||
| } | ||
|
|
||
| /***********************************************************************************/ | ||
| /***********************************************************************************/ | ||
|
|
||
| void ContactUtilities::ComputeExplicitContributionConditions(ModelPart& rModelPart) | ||
| { | ||
| ConditionsArrayType& r_conditions_array = rModelPart.Conditions(); | ||
| KRATOS_TRACE_IF("Empty model part", r_conditions_array.size() == 0) << "YOUR COMPUTING CONTACT MODEL PART IS EMPTY" << std::endl; | ||
| const auto it_cond_begin = r_conditions_array.begin(); | ||
| const ProcessInfo& r_process_info = rModelPart.GetProcessInfo(); | ||
| #pragma omp parallel for | ||
| for(int i = 0; i < static_cast<int>(r_conditions_array.size()); ++i) { | ||
| auto it_cond = it_cond_begin + i; | ||
| it_cond->AddExplicitContribution(r_process_info); | ||
| } | ||
| } | ||
|
|
||
| /***********************************************************************************/ | ||
| /***********************************************************************************/ | ||
|
|
||
| void ContactUtilities::ActivateConditionWithActiveNodes(ModelPart& rModelPart) | ||
| { | ||
| ConditionsArrayType& r_conditions_array = rModelPart.Conditions(); | ||
| KRATOS_TRACE_IF("Empty model part", r_conditions_array.size() == 0) << "YOUR COMPUTING CONTACT MODEL PART IS EMPTY" << std::endl; | ||
| const auto it_cond_begin = r_conditions_array.begin(); | ||
|
|
||
| bool is_active = false; | ||
| #pragma omp parallel for firstprivate(is_active) | ||
| for(int i = 0; i < static_cast<int>(r_conditions_array.size()); ++i) { | ||
| auto it_cond = it_cond_begin + i; | ||
| const GeometryType& r_geometry = it_cond->GetGeometry(); | ||
| if (r_geometry.NumberOfGeometryParts() > 0) { | ||
| const GeometryType& r_parent_geometry = r_geometry.GetGeometryPart(0); | ||
| is_active = false; | ||
| for ( IndexType i_node = 0; i_node < r_parent_geometry.size(); ++i_node ) { | ||
| if (r_parent_geometry[i_node].Is(ACTIVE)) { | ||
| is_active = true; | ||
| break; | ||
| } | ||
| } | ||
| it_cond->Set(ACTIVE, is_active); | ||
| } | ||
| } | ||
| } | ||
|
|
||
| /***********************************************************************************/ | ||
| /***********************************************************************************/ | ||
|
|
||
| array_1d<double, 3> ContactUtilities::GetHalfJumpCenter(GeometryType& rThisGeometry) | ||
| { | ||
| array_1d<double, 3> center = (rThisGeometry.Center()).Coordinates(); | ||
|
|
||
| // Initialize variables | ||
| Vector N; | ||
| GeometryType::CoordinatesArrayType local_point; | ||
|
|
||
| // Get shape functions | ||
| rThisGeometry.PointLocalCoordinates( local_point, center ); | ||
| rThisGeometry.ShapeFunctionsValues( N, local_point ); | ||
|
|
||
| KRATOS_DEBUG_ERROR_IF_NOT(rThisGeometry[0].Has(DELTA_COORDINATES)) << "Please call ComputeStepJump() first" << std::endl; | ||
|
|
||
| const Vector new_delta_disp_center = prod(trans(GetVariableMatrix(rThisGeometry, DELTA_COORDINATES)), N); | ||
|
|
||
| for (IndexType i = 0; i < new_delta_disp_center.size(); ++i) | ||
| center[i] += new_delta_disp_center[i]; | ||
|
|
||
| return center; | ||
| } | ||
|
|
||
| /***********************************************************************************/ | ||
| /***********************************************************************************/ | ||
|
|
||
| Matrix ContactUtilities::GetVariableMatrix( | ||
| const GeometryType& rNodes, | ||
| const Variable<array_1d<double,3> >& rVarName | ||
| ) | ||
| { | ||
| /* DEFINITIONS */ | ||
| const SizeType num_nodes = rNodes.size(); | ||
| const SizeType dim = rNodes.WorkingSpaceDimension(); | ||
| Matrix var_matrix(num_nodes, dim); | ||
|
|
||
| for (IndexType i_node = 0; i_node < num_nodes; i_node++) { | ||
| const array_1d<double, 3> value = rNodes[i_node].GetValue(rVarName); | ||
| for (IndexType i_dof = 0; i_dof < dim; i_dof++) | ||
| var_matrix(i_node, i_dof) = value[i_dof]; | ||
| } | ||
|
|
||
| return var_matrix; | ||
| } | ||
|
|
||
| } | ||
Oops, something went wrong.
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
just to say that this could be done simpler with the ParallelUtilities
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
I have it in my TODO list