DILUKernels.hpp
Go to the documentation of this file.
Definition: DILUKernels.hpp:28 void computeDiluDiagonalSplit(T *reorderedLowerMat, int *lowerRowIndices, int *lowerColIndices, T *reorderedUpperMat, int *upperRowIndices, int *upperColIndices, T *diagonal, int *reorderedToNatural, int *naturalToReordered, int startIdx, int rowsInLevelSet, T *dInv, int threadBlockSize) Computes the ILU0 of the diagonal elements of the split reordered matrix and stores it in a reordered... void solveUpperLevelSetSplit(T *reorderedUpperMat, int *rowIndices, int *colIndices, int *indexConversion, int startIdx, int rowsInLevelSet, const T *dInv, T *v, int threadBlockSize) Perform an upper solve on certain rows in a matrix that can safely be computed in parallel. void solveUpperLevelSet(T *reorderedMat, int *rowIndices, int *colIndices, int *indexConversion, int startIdx, int rowsInLevelSet, const T *dInv, T *v, int threadBlockSize) Perform an upper solve on certain rows in a matrix that can safely be computed in parallel. void solveLowerLevelSet(T *reorderedMat, int *rowIndices, int *colIndices, int *indexConversion, int startIdx, int rowsInLevelSet, const T *dInv, const T *d, T *v, int threadBlockSize) Perform a lower solve on certain rows in a matrix that can safely be computed in parallel. void computeDiluDiagonal(T *reorderedMat, int *rowIndices, int *colIndices, int *reorderedToNatural, int *naturalToReordered, int startIdx, int rowsInLevelSet, T *dInv, int threadBlockSize) Computes the ILU0 of the diagonal elements of the reordered matrix and stores it in a reordered vecto... void solveLowerLevelSetSplit(T *reorderedUpperMat, int *rowIndices, int *colIndices, int *indexConversion, int startIdx, int rowsInLevelSet, const T *dInv, const T *d, T *v, int threadBlockSize) Perform a lower solve on certain rows in a matrix that can safely be computed in parallel. |