| 27b6a85d | 21-Mar-2016 |
Stefano Zampini <stefano.zampini@gmail.com> |
PCBDDC: optimizations for the multilevel BDDC with benign subspace and CHEBYSHEV coarse solvers
Most of the times, the computation of the benign correction is not needed. Added benign_have_null, ben
PCBDDC: optimizations for the multilevel BDDC with benign subspace and CHEBYSHEV coarse solvers
Most of the times, the computation of the benign correction is not needed. Added benign_have_null, benign_need_correction, so that we can decide at command line to not compute the benign correction for Stokes
show more ...
|
| b3cdcd63 | 14-Mar-2016 |
Stefano Zampini <stefano.zampini@gmail.com> |
PCBDDC: optimize refinement of connected components
The previous code used a lot of memory constructing an ad-hoc csr information to refine the connected components Changed the way the connected com
PCBDDC: optimize refinement of connected components
The previous code used a lot of memory constructing an ad-hoc csr information to refine the connected components Changed the way the connected component are searched in PCBDDCComputeConnectedComponentsLocal: now the search is symmetric
show more ...
|
| 57de7509 | 10-Mar-2016 |
Stefano Zampini <stefano.zampini@gmail.com> |
PCBDDC: remove the horrible logic around the remap of the coarse problem
the code now is more readable, maintanable. In case of multilevel, it is also faster, since one shift is avoided. when the co
PCBDDC: remove the horrible logic around the remap of the coarse problem
the code now is more readable, maintanable. In case of multilevel, it is also faster, since one shift is avoided. when the coarse matrix has to be assembled, it still uses MatISSubassemble followed by MatISGetMPIXAIJ
fixed some bugs in MatISSubassemble and MatISGetSubassemblingPattern, with preliminary checks added
show more ...
|