Skip to content
GitLab
Explore
Sign in
Register
Primary navigation
Search or go to…
Project
O
ogs-feliks
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Requirements
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
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
Feliks Kiszkurno
ogs-feliks
Commits
a1ec2404
Commit
a1ec2404
authored
1 year ago
by
wenqing
Committed by
Dmitri Naumov
1 year ago
Browse files
Options
Downloads
Patches
Plain Diff
[TimeLoop] Use the new class StaggeredCoupling
parent
45c6bcc2
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
ProcessLib/TimeLoop.cpp
+15
-153
15 additions, 153 deletions
ProcessLib/TimeLoop.cpp
ProcessLib/TimeLoop.h
+3
-23
3 additions, 23 deletions
ProcessLib/TimeLoop.h
with
18 additions
and
176 deletions
ProcessLib/TimeLoop.cpp
+
15
−
153
View file @
a1ec2404
...
@@ -12,7 +12,6 @@
...
@@ -12,7 +12,6 @@
#include
<range/v3/algorithm/any_of.hpp>
#include
<range/v3/algorithm/any_of.hpp>
#include
<range/v3/algorithm/contains.hpp>
#include
<range/v3/algorithm/contains.hpp>
#include
<range/v3/view/map.hpp>
#include
"BaseLib/Error.h"
#include
"BaseLib/Error.h"
#include
"BaseLib/RunTime.h"
#include
"BaseLib/RunTime.h"
...
@@ -20,15 +19,11 @@
...
@@ -20,15 +19,11 @@
#include
"NumLib/ODESolver/ConvergenceCriterionPerComponent.h"
#include
"NumLib/ODESolver/ConvergenceCriterionPerComponent.h"
#include
"NumLib/ODESolver/PETScNonlinearSolver.h"
#include
"NumLib/ODESolver/PETScNonlinearSolver.h"
#include
"NumLib/ODESolver/TimeDiscretizedODESystem.h"
#include
"NumLib/ODESolver/TimeDiscretizedODESystem.h"
#include
"NumLib/StaggeredCoupling/StaggeredCoupling.h"
#include
"ProcessData.h"
#include
"ProcessData.h"
namespace
namespace
{
{
bool
isMonolithicProcess
(
ProcessLib
::
ProcessData
const
&
process_data
)
{
return
process_data
.
process
.
isMonolithicSchemeUsed
();
}
void
updateDeactivatedSubdomains
(
void
updateDeactivatedSubdomains
(
std
::
vector
<
std
::
unique_ptr
<
ProcessLib
::
ProcessData
>>
const
&
std
::
vector
<
std
::
unique_ptr
<
ProcessLib
::
ProcessData
>>
const
&
per_process_data
,
per_process_data
,
...
@@ -268,38 +263,19 @@ NumLib::NonlinearSolverStatus solveOneTimeStepOneProcess(
...
@@ -268,38 +263,19 @@ NumLib::NonlinearSolverStatus solveOneTimeStepOneProcess(
return
nonlinear_solver_status
;
return
nonlinear_solver_status
;
}
}
TimeLoop
::
TimeLoop
(
std
::
vector
<
Output
>&&
outputs
,
TimeLoop
::
TimeLoop
(
std
::
vector
<
std
::
unique_ptr
<
ProcessData
>>&&
per_process_data
,
std
::
vector
<
Output
>&&
outputs
,
const
int
global_coupling_max_iterations
,
std
::
vector
<
std
::
unique_ptr
<
ProcessData
>>&&
per_process_data
,
std
::
vector
<
std
::
unique_ptr
<
NumLib
::
ConvergenceCriterion
>>&&
std
::
unique_ptr
<
NumLib
::
StaggeredCoupling
>&&
staggered_coupling
,
global_coupling_conv_crit
,
const
double
start_time
,
const
double
end_time
)
std
::
map
<
std
::
string
,
int
>&&
local_coupling_processes
,
const
double
start_time
,
const
double
end_time
)
:
_outputs
{
std
::
move
(
outputs
)},
:
_outputs
{
std
::
move
(
outputs
)},
_per_process_data
(
std
::
move
(
per_process_data
)),
_per_process_data
(
std
::
move
(
per_process_data
)),
_start_time
(
start_time
),
_start_time
(
start_time
),
_end_time
(
end_time
),
_end_time
(
end_time
),
_global_coupling_max_iterations
(
global_coupling_max_iterations
),
_staggered_coupling
(
std
::
move
(
staggered_coupling
))
_global_coupling_conv_crit
(
std
::
move
(
global_coupling_conv_crit
)),
_local_coupling_processes
(
std
::
move
(
local_coupling_processes
))
{
{
}
}
void
TimeLoop
::
setCoupledSolutions
()
{
for
(
auto
const
&
process_data
:
_per_process_data
)
{
auto
const
&
x
=
*
_process_solutions
[
process_data
->
process_id
];
// Create a vector to store the solution of the last coupling iteration
auto
&
x0
=
NumLib
::
GlobalVectorProvider
::
provider
.
getVector
(
x
);
MathLib
::
LinAlg
::
copy
(
x
,
x0
);
// append a solution vector of suitable size
_solutions_of_last_cpl_iteration
.
emplace_back
(
&
x0
);
}
}
bool
computationOfChangeNeeded
(
bool
computationOfChangeNeeded
(
NumLib
::
TimeStepAlgorithm
const
&
timestep_algorithm
,
double
const
time
)
NumLib
::
TimeStepAlgorithm
const
&
timestep_algorithm
,
double
const
time
)
{
{
...
@@ -512,13 +488,9 @@ void TimeLoop::initialize()
...
@@ -512,13 +488,9 @@ void TimeLoop::initialize()
std
::
tie
(
_process_solutions
,
_process_solutions_prev
)
=
std
::
tie
(
_process_solutions
,
_process_solutions_prev
)
=
setInitialConditions
(
_start_time
,
_per_process_data
);
setInitialConditions
(
_start_time
,
_per_process_data
);
// All _per_process_data share the first process.
if
(
_staggered_coupling
)
bool
const
is_staggered_coupling
=
!
isMonolithicProcess
(
*
_per_process_data
[
0
]);
if
(
is_staggered_coupling
)
{
{
setCoupledSolutions
(
);
_staggered_coupling
->
initializeCoupledSolutions
(
_process_solutions
);
}
}
updateDeactivatedSubdomains
(
_per_process_data
,
_start_time
);
updateDeactivatedSubdomains
(
_per_process_data
,
_start_time
);
...
@@ -622,12 +594,9 @@ bool TimeLoop::preTsNonlinearSolvePostTs(double const t, double const dt,
...
@@ -622,12 +594,9 @@ bool TimeLoop::preTsNonlinearSolvePostTs(double const t, double const dt,
{
{
preTimestepForAllProcesses
(
t
,
dt
,
_per_process_data
,
_process_solutions
);
preTimestepForAllProcesses
(
t
,
dt
,
_per_process_data
,
_process_solutions
);
// All _per_process_data share the first process.
bool
const
is_staggered_coupling
=
!
isMonolithicProcess
(
*
_per_process_data
[
0
]);
NumLib
::
NonlinearSolverStatus
nonlinear_solver_status
;
NumLib
::
NonlinearSolverStatus
nonlinear_solver_status
;
if
(
is
_staggered_coupling
)
if
(
_staggered_coupling
)
{
{
nonlinear_solver_status
=
nonlinear_solver_status
=
solveCoupledEquationSystemsByStaggeredScheme
(
t
,
dt
,
timesteps
);
solveCoupledEquationSystemsByStaggeredScheme
(
t
,
dt
,
timesteps
);
...
@@ -723,114 +692,12 @@ NumLib::NonlinearSolverStatus
...
@@ -723,114 +692,12 @@ NumLib::NonlinearSolverStatus
TimeLoop
::
solveCoupledEquationSystemsByStaggeredScheme
(
TimeLoop
::
solveCoupledEquationSystemsByStaggeredScheme
(
const
double
t
,
const
double
dt
,
const
std
::
size_t
timestep_id
)
const
double
t
,
const
double
dt
,
const
std
::
size_t
timestep_id
)
{
{
// Coupling iteration
auto
const
nonlinear_solver_status
=
if
(
_global_coupling_max_iterations
!=
0
)
_staggered_coupling
->
execute
<
ProcessData
,
Output
>
(
{
t
,
dt
,
timestep_id
,
_process_solutions
,
_process_solutions_prev
,
// Set the flag of the first iteration be true.
_per_process_data
,
_outputs
,
&
solveOneTimeStepOneProcess
);
for
(
auto
&
conv_crit
:
_global_coupling_conv_crit
)
{
conv_crit
->
preFirstIteration
();
}
}
auto
resetCouplingConvergenceCriteria
=
[
&
]()
{
for
(
auto
&
conv_crit
:
_global_coupling_conv_crit
)
{
conv_crit
->
reset
();
}
};
NumLib
::
NonlinearSolverStatus
nonlinear_solver_status
{
false
,
-
1
};
bool
coupling_iteration_converged
=
true
;
bool
local_coupling_iteration_converged
=
true
;
for
(
int
global_coupling_iteration
=
0
;
global_coupling_iteration
<
_global_coupling_max_iterations
;
global_coupling_iteration
++
,
resetCouplingConvergenceCriteria
())
{
// TODO(wenqing): use process name
coupling_iteration_converged
=
true
;
bool
local_iteration_converged
=
true
;
for
(
auto
const
&
process_data
:
_per_process_data
)
{
auto
const
process_id
=
process_data
->
process_id
;
bool
const
isLocalCouplingProcess
=
ranges
::
contains
(
_local_coupling_processes
|
ranges
::
views
::
values
,
process_id
);
if
(
!
local_coupling_iteration_converged
&&
!
isLocalCouplingProcess
)
{
coupling_iteration_converged
=
false
;
continue
;
}
BaseLib
::
RunTime
time_timestep_process
;
time_timestep_process
.
start
();
nonlinear_solver_status
=
solveOneTimeStepOneProcess
(
_process_solutions
,
_process_solutions_prev
,
timestep_id
,
t
,
dt
,
*
process_data
,
_outputs
);
process_data
->
nonlinear_solver_status
=
nonlinear_solver_status
;
INFO
(
"[time] Solving process #{:d} took {:g} s in time step #{:d} "
"coupling iteration #{:d}"
,
process_id
,
time_timestep_process
.
elapsed
(),
timestep_id
,
global_coupling_iteration
);
if
(
!
nonlinear_solver_status
.
error_norms_met
)
{
WARN
(
"The nonlinear solver failed in time step #{:d} at t = "
"{:g} s for process #{:d}."
,
timestep_id
,
t
,
process_id
);
_last_step_rejected
=
true
;
return
nonlinear_solver_status
;
}
// Check the convergence of the coupling iteration
auto
&
x
=
*
_process_solutions
[
process_id
];
auto
&
x_old
=
*
_solutions_of_last_cpl_iteration
[
process_id
];
if
(
global_coupling_iteration
>
0
)
{
MathLib
::
LinAlg
::
axpy
(
x_old
,
-
1.0
,
x
);
// save dx to x_old
INFO
(
"------- Checking convergence criterion for coupled "
"solution of process #{:d} -------"
,
process_id
);
_global_coupling_conv_crit
[
process_id
]
->
checkDeltaX
(
x_old
,
x
);
coupling_iteration_converged
=
coupling_iteration_converged
&&
_global_coupling_conv_crit
[
process_id
]
->
isSatisfied
();
if
(
isLocalCouplingProcess
)
{
local_iteration_converged
=
local_iteration_converged
&&
_global_coupling_conv_crit
[
process_id
]
->
isSatisfied
();
}
}
MathLib
::
LinAlg
::
copy
(
x
,
x_old
);
}
// end of for (auto& process_data : _per_process_data)
local_coupling_iteration_converged
=
local_iteration_converged
;
if
(
local_coupling_iteration_converged
&&
coupling_iteration_converged
&&
global_coupling_iteration
>
0
)
{
break
;
}
if
(
!
nonlinear_solver_status
.
error_norms_met
)
{
return
nonlinear_solver_status
;
}
}
if
(
!
coupling_iteration_converged
||
!
local_coupling_iteration_converged
)
_last_step_rejected
=
nonlinear_solver_status
.
error_norms_met
;
{
WARN
(
"The coupling iterations reaches its maximum number in time step "
"#{:d} at t = {:g} s"
,
timestep_id
,
t
);
}
{
{
for
(
auto
const
&
process_data
:
_per_process_data
)
for
(
auto
const
&
process_data
:
_per_process_data
)
...
@@ -883,11 +750,6 @@ TimeLoop::~TimeLoop()
...
@@ -883,11 +750,6 @@ TimeLoop::~TimeLoop()
{
{
NumLib
::
GlobalVectorProvider
::
provider
.
releaseVector
(
*
x
);
NumLib
::
GlobalVectorProvider
::
provider
.
releaseVector
(
*
x
);
}
}
for
(
auto
*
x
:
_solutions_of_last_cpl_iteration
)
{
NumLib
::
GlobalVectorProvider
::
provider
.
releaseVector
(
*
x
);
}
}
}
void
TimeLoop
::
preOutputInitialConditions
(
const
double
t
)
const
void
TimeLoop
::
preOutputInitialConditions
(
const
double
t
)
const
...
...
This diff is collapsed.
Click to expand it.
ProcessLib/TimeLoop.h
+
3
−
23
View file @
a1ec2404
...
@@ -21,6 +21,7 @@
...
@@ -21,6 +21,7 @@
namespace
NumLib
namespace
NumLib
{
{
class
ConvergenceCriterion
;
class
ConvergenceCriterion
;
class
StaggeredCoupling
;
}
}
namespace
ChemistryLib
namespace
ChemistryLib
...
@@ -38,10 +39,7 @@ class TimeLoop
...
@@ -38,10 +39,7 @@ class TimeLoop
public:
public:
TimeLoop
(
std
::
vector
<
Output
>&&
outputs
,
TimeLoop
(
std
::
vector
<
Output
>&&
outputs
,
std
::
vector
<
std
::
unique_ptr
<
ProcessData
>>&&
per_process_data
,
std
::
vector
<
std
::
unique_ptr
<
ProcessData
>>&&
per_process_data
,
const
int
global_coupling_max_iterations
,
std
::
unique_ptr
<
NumLib
::
StaggeredCoupling
>&&
staggered_coupling
,
std
::
vector
<
std
::
unique_ptr
<
NumLib
::
ConvergenceCriterion
>>&&
global_coupling_conv_crit
,
std
::
map
<
std
::
string
,
int
>&&
local_coupling_processes
,
const
double
start_time
,
const
double
end_time
);
const
double
start_time
,
const
double
end_time
);
void
initialize
();
void
initialize
();
...
@@ -67,13 +65,6 @@ public:
...
@@ -67,13 +65,6 @@ public:
private
:
private
:
bool
preTsNonlinearSolvePostTs
(
double
const
t
,
double
const
dt
,
bool
preTsNonlinearSolvePostTs
(
double
const
t
,
double
const
dt
,
std
::
size_t
const
timesteps
);
std
::
size_t
const
timesteps
);
/**
* This function fills the vector of solutions of coupled processes of
* processes, _solutions_of_coupled_processes, and initializes the vector
* of solutions of the previous coupling iteration,
* _solutions_of_last_cpl_iteration.
*/
void
setCoupledSolutions
();
/**
/**
* \brief Member to solver non coupled systems of equations, which can be
* \brief Member to solver non coupled systems of equations, which can be
...
@@ -146,17 +137,6 @@ private:
...
@@ -146,17 +137,6 @@ private:
int
_repeating_times_of_rejected_step
=
0
;
int
_repeating_times_of_rejected_step
=
0
;
bool
_last_step_rejected
=
false
;
bool
_last_step_rejected
=
false
;
/// Maximum iterations of the global coupling.
std
::
unique_ptr
<
NumLib
::
StaggeredCoupling
>
_staggered_coupling
;
const
int
_global_coupling_max_iterations
;
/// Convergence criteria of processes for the global coupling iterations.
std
::
vector
<
std
::
unique_ptr
<
NumLib
::
ConvergenceCriterion
>>
_global_coupling_conv_crit
;
/// Processes that will be solved in a local iteration.
std
::
map
<
std
::
string
,
int
>
_local_coupling_processes
;
/// Solutions of the previous coupling iteration for the convergence
/// criteria of the coupling iteration.
std
::
vector
<
GlobalVector
*>
_solutions_of_last_cpl_iteration
;
};
};
}
// namespace ProcessLib
}
// namespace ProcessLib
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