Thomas algorithm implementation. So much more easier than the distributed algorithm. It is intended to work only on a single rank so there is no MPI communication.
Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|
class(cuda_backend_t) | :: | self | ||||
class(field_t), | intent(inout) | :: | du | |||
class(field_t), | intent(inout) | :: | dv | |||
class(field_t), | intent(inout) | :: | dw | |||
class(field_t), | intent(in) | :: | u | |||
class(field_t), | intent(in) | :: | v | |||
class(field_t), | intent(in) | :: | w | |||
type(dirps_t), | intent(in) | :: | dirps |