ezp
lightweight C++ wrapper for selected distributed solvers for linear systems
Loading...
Searching...
No Matches
band_solver.hpp
1
/*******************************************************************************
2
* Copyright (C) 2025-2026 Theodore Chang
3
*
4
* This program is free software: you can redistribute it and/or modify
5
* it under the terms of the GNU General Public License as published by
6
* the Free Software Foundation, either version 3 of the License, or
7
* (at your option) any later version.
8
*
9
* This program is distributed in the hope that it will be useful,
10
* but WITHOUT ANY WARRANTY; without even the implied warranty of
11
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12
* GNU General Public License for more details.
13
*
14
* You should have received a copy of the GNU General Public License
15
* along with this program. If not, see <http://www.gnu.org/licenses/>.
16
******************************************************************************/
17
18
#ifndef BAND_SOLVER_HPP
19
#define BAND_SOLVER_HPP
20
21
#include "abstract_solver.hpp"
22
23
namespace
ezp::detail {
24
template
<data_t DT, index_t IT, wrapper_t WT>
class
band_solver
:
public
abstract_solver
<DT, IT, WT> {
25
protected
:
26
blacs_context<IT>
ctx, trans_ctx;
27
28
template
<band_container_t CT>
auto
to_band(
CT
&&
custom
) {
29
if
constexpr
(
has_mem<CT>
)
return
band_mat<DT, IT>
{
custom
.n_rows,
custom
.n_cols,
custom
.kl,
custom
.ku,
custom
.mem()};
30
else
if
constexpr
(
has_memptr<CT>
)
return
band_mat<DT, IT>
{
custom
.n_rows,
custom
.n_cols,
custom
.kl,
custom
.ku,
custom
.memptr()};
31
else
if
constexpr
(
has_data_method<CT>
)
return
band_mat<DT, IT>
{
custom
.n_rows,
custom
.n_cols,
custom
.kl,
custom
.ku,
custom
.data()};
32
else
if
constexpr
(
has_iterator<CT>
)
return
band_mat<DT, IT>
{
custom
.n_rows,
custom
.n_cols,
custom
.kl,
custom
.ku, &(*
custom
.begin())};
33
else
static_assert
(
always_false_v<CT>
,
"invalid container type"
);
34
}
35
36
template
<band_symm_container_t CT>
auto
to_band_symm(
CT
&&
custom
) {
37
if
constexpr
(
has_mem<CT>
)
return
band_symm_mat<DT, IT>
{
custom
.n_rows,
custom
.n_cols,
custom
.klu,
custom
.mem()};
38
else
if
constexpr
(
has_memptr<CT>
)
return
band_symm_mat<DT, IT>
{
custom
.n_rows,
custom
.n_cols,
custom
.klu,
custom
.memptr()};
39
else
if
constexpr
(
has_data_method<CT>
)
return
band_symm_mat<DT, IT>
{
custom
.n_rows,
custom
.n_cols,
custom
.klu,
custom
.data()};
40
else
if
constexpr
(
has_iterator<CT>
)
return
band_symm_mat<DT, IT>
{
custom
.n_rows,
custom
.n_cols,
custom
.klu, &(*
custom
.begin())};
41
else
static_assert
(
always_false_v<CT>
,
"invalid container type"
);
42
}
43
44
public
:
45
explicit
band_solver
(
const
IT rows)
46
:
abstract_solver<DT, IT, WT>
()
47
, ctx(rows, 1,
'R'
)
48
, trans_ctx(1, rows,
'R'
) {}
49
};
50
}
// namespace ezp::detail
51
52
#endif
// BAND_SOLVER_HPP
ezp::detail::abstract_solver
Definition
abstract_solver.hpp:24
ezp::detail::band_solver
Definition
band_solver.hpp:24
pardiso
Solver for general sparse matrices.
ezp::has_data_method
Definition
traits.hpp:39
ezp::has_iterator
Definition
traits.hpp:41
ezp::has_mem
Definition
traits.hpp:37
ezp::has_memptr
Definition
traits.hpp:38
ezp
abstract
band_solver.hpp
Generated by
1.9.8