-
Notifications
You must be signed in to change notification settings - Fork 17
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
make use of python-mumps package
- Loading branch information
Showing
15 changed files
with
295 additions
and
1,147 deletions.
There are no files selected for viewing
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
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
This file was deleted.
Oops, something went wrong.
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,18 @@ | ||
from ..wrappers import WrapDirect | ||
from scipy.sparse.linalg import spsolve, splu | ||
|
||
Solver = WrapDirect(spsolve, factorize=False, name="Solver") | ||
SolverLU = WrapDirect(splu, factorize=True, name="SolverLU") | ||
|
||
__all__ = ["Solver", "SolverLU"] | ||
try: | ||
from .pardiso import Pardiso | ||
__all__ += ["Pardiso"] | ||
except ImportError: | ||
pass | ||
|
||
try: | ||
from .mumps import Mumps | ||
__all__ += ["Mumps"] | ||
except ImportError: | ||
pass |
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,79 @@ | ||
from pymatsolver.solvers import Base | ||
from mumps import Context | ||
|
||
class Mumps(Base): | ||
""" | ||
Mumps solver | ||
""" | ||
|
||
_factored = False | ||
_transposed = False | ||
ordering = '' | ||
|
||
def __init__(self, A, context=None, **kwargs): | ||
self.set_kwargs(**kwargs) | ||
if context is None: | ||
self.solver = Context() | ||
self._analyzed = False | ||
self._set_A(A) | ||
else: | ||
self.solver = context | ||
self.A = A | ||
|
||
def _set_A(self, A): | ||
self.solver.set_matrix( | ||
A, | ||
symmetric=self.is_symmetric, | ||
# positive_definite=self.is_positive_definite # doesn't (yet) support setting positive definiteness | ||
) | ||
|
||
@property | ||
def ordering(self): | ||
return getattr(self, '_ordering', "metis") | ||
|
||
@ordering.setter | ||
def ordering(self, value): | ||
self._ordering = value | ||
|
||
@property | ||
def _factored(self): | ||
return self.solver.factored | ||
|
||
@property | ||
def transpose(self): | ||
trans_obect = Mumps( | ||
self.A, | ||
self.solver, | ||
is_symmetric=self.is_symmetric, | ||
is_positive_definite=self.is_positive_definite, | ||
ordering=self.ordering, | ||
) | ||
trans_obect._transposed = not self._transposed | ||
|
||
return trans_obect | ||
|
||
T = transpose | ||
|
||
def factor(self, A=None): | ||
reuse_analysis = False | ||
if A is not None: | ||
self._set_A(A) | ||
self.A = A | ||
# if it was previously factored then re-use the analysis. | ||
reuse_analysis = self._factored | ||
if not self._factored: | ||
pivot_tol = 0.0 if self.is_positive_definite else 0.01 | ||
self.solver.factor( | ||
ordering=self.ordering, reuse_analysis=reuse_analysis, pivot_tol=pivot_tol | ||
) | ||
|
||
def _solveM(self, rhs): | ||
self.factor() | ||
if self._transposed: | ||
self.solver.mumps_instance.icntl[9] = 0 | ||
else: | ||
self.solver.mumps_instance.icntl[9] = 1 | ||
sol = self.solver.solve(rhs) | ||
return sol | ||
|
||
_solve1 = _solveM |
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,91 @@ | ||
from pymatsolver.solvers import Base | ||
from pydiso.mkl_solver import MKLPardisoSolver | ||
from pydiso.mkl_solver import set_mkl_pardiso_threads, get_mkl_pardiso_max_threads | ||
|
||
class Pardiso(Base): | ||
""" | ||
Pardiso Solver | ||
https://github.com/simpeg/pydiso | ||
documentation:: | ||
http://www.pardiso-project.org/ | ||
""" | ||
|
||
_factored = False | ||
|
||
def __init__(self, A, **kwargs): | ||
self.A = A | ||
self.set_kwargs(**kwargs) | ||
self.solver = MKLPardisoSolver( | ||
self.A, | ||
matrix_type=self._matrixType(), | ||
factor=False | ||
) | ||
|
||
def _matrixType(self): | ||
""" | ||
Set basic matrix type: | ||
Real:: | ||
1: structurally symmetric | ||
2: symmetric positive definite | ||
-2: symmetric indefinite | ||
11: nonsymmetric | ||
Complex:: | ||
6: symmetric | ||
4: hermitian positive definite | ||
-4: hermitian indefinite | ||
3: structurally symmetric | ||
13: nonsymmetric | ||
""" | ||
if self.is_real: | ||
if self.is_symmetric: | ||
if self.is_positive_definite: | ||
return 2 | ||
else: | ||
return -2 | ||
else: | ||
return 11 | ||
else: | ||
if self.is_symmetric: | ||
return 6 | ||
elif self.is_hermitian: | ||
if self.is_positive_definite: | ||
return 4 | ||
else: | ||
return -4 | ||
else: | ||
return 13 | ||
|
||
def factor(self, A=None): | ||
if A is not None: | ||
self._factored = False | ||
self.A = A | ||
if not self._factored: | ||
self.solver.refactor(self.A) | ||
self._factored = True | ||
def _solveM(self, rhs): | ||
self.factor() | ||
sol = self.solver.solve(rhs) | ||
return sol | ||
|
||
@property | ||
def n_threads(self): | ||
""" | ||
Number of threads to use for the Pardiso solver routine. This property | ||
is global to all Pardiso solver objects for a single python process. | ||
""" | ||
return get_mkl_pardiso_max_threads() | ||
|
||
@n_threads.setter | ||
def n_threads(self, n_threads): | ||
set_mkl_pardiso_threads(n_threads) | ||
|
||
_solve1 = _solveM |
Oops, something went wrong.