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
Locked files
Build
Pipelines
Jobs
Pipeline schedules
Test cases
Artifacts
Deploy
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
Mojtaba Abdolkhani
ogs
Commits
0431783a
Commit
0431783a
authored
9 years ago
by
Christoph Lehmann
Committed by
Dmitrij Naumov
9 years ago
Browse files
Options
Downloads
Patches
Plain Diff
[MaL] LisLinearSolver adapted to new LisOption
parent
c6387c05
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
MathLib/LinAlg/Lis/LisLinearSolver.cpp
+52
-78
52 additions, 78 deletions
MathLib/LinAlg/Lis/LisLinearSolver.cpp
MathLib/LinAlg/Lis/LisLinearSolver.h
+1
-15
1 addition, 15 deletions
MathLib/LinAlg/Lis/LisLinearSolver.h
with
53 additions
and
93 deletions
MathLib/LinAlg/Lis/LisLinearSolver.cpp
+
52
−
78
View file @
0431783a
...
...
@@ -14,11 +14,6 @@
#include
"LisLinearSolver.h"
#include
<string>
#include
<sstream>
#ifdef _OPENMP
#include
<omp.h>
#endif
#include
"logog/include/logog.hpp"
#include
"LisCheck.h"
...
...
@@ -32,35 +27,12 @@ LisLinearSolver::LisLinearSolver(LisMatrix &A,
:
_A
(
A
)
{
if
(
option
)
setOption
(
*
option
);
}
{
_option
.
addOptions
(
*
option
);
void
LisLinearSolver
::
setOption
(
BaseLib
::
ConfigTree
const
&
option
)
{
boost
::
optional
<
BaseLib
::
ConfigTree
>
ptSolver
=
option
.
get_child
(
"LinearSolver"
);
if
(
!
ptSolver
)
return
;
boost
::
optional
<
std
::
string
>
solver_type
=
ptSolver
->
get_optional
<
std
::
string
>
(
"solver_type"
);
if
(
solver_type
)
{
_option
.
solver_type
=
_option
.
getSolverType
(
*
solver_type
);
}
boost
::
optional
<
std
::
string
>
precon_type
=
ptSolver
->
get_optional
<
std
::
string
>
(
"precon_type"
);
if
(
precon_type
)
{
_option
.
precon_type
=
_option
.
getPreconType
(
*
precon_type
);
}
boost
::
optional
<
std
::
string
>
matrix_type
=
ptSolver
->
get_optional
<
std
::
string
>
(
"matrix_type"
);
if
(
matrix_type
)
{
_option
.
matrix_type
=
_option
.
getMatrixType
(
*
matrix_type
);
}
boost
::
optional
<
double
>
error_tolerance
=
ptSolver
->
get_optional
<
double
>
(
"error_tolerance"
);
if
(
error_tolerance
)
{
_option
.
error_tolerance
=
*
error_tolerance
;
}
boost
::
optional
<
int
>
max_iteration_step
=
ptSolver
->
get_optional
<
int
>
(
"max_iteration_step"
);
if
(
max_iteration_step
)
{
_option
.
max_iterations
=
*
max_iteration_step
;
#ifndef NDEBUG
_option
.
printInfo
();
#endif
}
}
...
...
@@ -70,62 +42,64 @@ void LisLinearSolver::solve(LisVector &b, LisVector &x)
INFO
(
"------------------------------------------------------------------"
);
INFO
(
"*** LIS solver computation"
);
#ifdef _OPENMP
INFO
(
"-> max number of threads = %d"
,
omp_get_num_procs
());
INFO
(
"-> number of threads = %d"
,
omp_get_max_threads
());
#endif
// configure option
std
::
string
solver_options
;
if
(
_option
.
solver_precon_arg
.
empty
())
{
std
::
stringstream
ss
;
ss
<<
"-i "
<<
static_cast
<
int
>
(
_option
.
solver_type
);
ss
<<
" -p "
<<
static_cast
<
int
>
(
_option
.
precon_type
);
if
(
!
_option
.
extra_arg
.
empty
())
ss
<<
" "
<<
_option
.
extra_arg
;
solver_options
=
ss
.
str
();
}
else
{
solver_options
=
_option
.
solver_precon_arg
;
}
std
::
string
tol_option
;
{
std
::
stringstream
ss
;
ss
<<
"-tol "
<<
_option
.
error_tolerance
;
ss
<<
" -maxiter "
<<
_option
.
max_iterations
;
ss
<<
" -initx_zeros 0"
;
//0: use given x as initial guess, 1: x0=0
#ifdef _OPENMP
const
int
nthreads
=
omp_get_max_threads
();
ss
<<
" -omp_num_threads "
<<
nthreads
;
#endif
tol_option
=
ss
.
str
();
}
// Create solver
LIS_SOLVER
solver
;
int
ierr
=
lis_solver_create
(
&
solver
);
checkLisError
(
ierr
);
ierr
=
lis_solver_set_option
(
const_cast
<
char
*>
(
solver_options
.
c_str
()),
solver
);
checkLisError
(
ierr
);
ierr
=
lis_solver_set_option
(
const_cast
<
char
*>
(
tol_option
.
c_str
()),
solver
);
checkLisError
(
ierr
);
ierr
=
lis_solver_set_option
(
const_cast
<
char
*>
(
"-print mem"
),
solver
);
checkLisError
(
ierr
);
ierr
=
lis_solver_set_optionC
(
solver
);
checkLisError
(
ierr
);
{
std
::
string
opt
;
for
(
auto
const
&
it
:
_option
.
settings
)
{
opt
=
it
.
first
+
" "
+
it
.
second
;
ierr
=
lis_solver_set_option
(
const_cast
<
char
*>
(
opt
.
c_str
()),
solver
);
checkLisError
(
ierr
);
}
}
{
int
precon
;
ierr
=
lis_solver_get_precon
(
solver
,
&
precon
);
INFO
(
"-> precon: %i"
,
precon
);
}
{
int
slv
;
ierr
=
lis_solver_get_solver
(
solver
,
&
slv
);
INFO
(
"-> solver: %i"
,
slv
);
}
// solve
INFO
(
"-> solve"
);
ierr
=
lis_solve
(
_A
.
getRawMatrix
(),
b
.
getRawVector
(),
x
.
getRawVector
(),
solver
);
checkLisError
(
ierr
);
int
iter
=
0
;
double
resid
=
0.0
;
ierr
=
lis_solver_get_iter
(
solver
,
&
iter
);
checkLisError
(
ierr
);
ierr
=
lis_solver_get_residualnorm
(
solver
,
&
resid
);
checkLisError
(
ierr
);
INFO
(
"
\t
iteration: %d/%ld
\n
"
,
iter
,
_option
.
max_iterations
);
INFO
(
"
\t
residual: %e
\n
"
,
resid
);
{
int
iter
=
0
;
ierr
=
lis_solver_get_iter
(
solver
,
&
iter
);
checkLisError
(
ierr
);
std
::
string
max_iter
=
_option
.
settings
[
"-maxiter"
];
if
(
max_iter
.
empty
())
max_iter
=
"--"
;
INFO
(
"-> iteration: %d/%s"
,
iter
,
max_iter
.
c_str
());
}
{
double
resid
=
0.0
;
ierr
=
lis_solver_get_residualnorm
(
solver
,
&
resid
);
checkLisError
(
ierr
);
INFO
(
"-> residual: %g"
,
resid
);
}
{
double
time
,
itime
,
ptime
,
p_ctime
,
p_itime
;
ierr
=
lis_solver_get_timeex
(
solver
,
&
time
,
&
itime
,
&
ptime
,
&
p_ctime
,
&
p_itime
);
checkLisError
(
ierr
);
INFO
(
"-> time total (s): %g"
,
time
);
INFO
(
"-> time iterations (s): %g"
,
itime
);
INFO
(
"-> time preconditioning (s): %g"
,
ptime
);
INFO
(
"-> time precond. create (s): %g"
,
p_ctime
);
INFO
(
"-> time precond. iter (s): %g"
,
p_itime
);
}
// Clear solver
ierr
=
lis_solver_destroy
(
solver
);
...
...
This diff is collapsed.
Click to expand it.
MathLib/LinAlg/Lis/LisLinearSolver.h
+
1
−
15
View file @
0431783a
...
...
@@ -32,7 +32,7 @@ namespace MathLib
* \brief Linear solver using Lis (http://www.ssisc.org/lis/)
*
*/
class
LisLinearSolver
class
LisLinearSolver
final
{
public:
/**
...
...
@@ -47,26 +47,12 @@ public:
LisLinearSolver
(
LisMatrix
&
A
,
const
std
::
string
solver_name
=
""
,
BaseLib
::
ConfigTree
const
*
const
option
=
nullptr
);
virtual
~
LisLinearSolver
()
{}
/**
* configure linear solvers
* @param option
*/
void
setOption
(
BaseLib
::
ConfigTree
const
&
option
);
/**
* configure linear solvers
* @param option
*/
void
setOption
(
const
LisOption
&
option
)
{
_option
=
option
;
}
/**
* get linear solver options
* @return
*/
LisOption
&
getOption
()
{
return
_option
;
}
/**
* solve a given linear equations
*
...
...
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