ILU0Kernels.hpp
Go to the documentation of this file.
Definition: ILU0Kernels.hpp:24 void LUFactorizationSplit(T *reorderedLowerMat, int *lowerRowIndices, int *lowerColIndices, T *reorderedUpperMat, int *upperRowIndices, int *upperColIndices, T *diagonal, int *reorderedToNatural, int *naturalToReordered, int startIdx, int rowsInLevelSet, int threadBlockSize) Computes the ILU0 factorization in-place of a bcsr matrix stored in a split format (lower,... void solveUpperLevelSet(T *reorderedMat, int *rowIndices, int *colIndices, int *indexConversion, int startIdx, int rowsInLevelSet, T *v, int threadBlockSize) Perform a upper solve on certain rows in a matrix that can safely be computed in parallel. void solveLowerLevelSetSplit(T *reorderedLowerMat, int *rowIndices, int *colIndices, int *indexConversion, int startIdx, int rowsInLevelSet, const T *d, T *v, int threadBlockSize) Perform an lower solve on certain rows in a matrix that can safely be computed in parallel. void solveUpperLevelSetSplit(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 LUFactorization(T *reorderedMat, int *rowIndices, int *columnIndices, int *naturalToReordered, int *reorderedToNatual, size_t rowsInLevelSet, int startIdx, int threadBlockSize) Computes the ILU Factorization of the input bcsr matrix, which is stored in a reordered way.... void solveLowerLevelSet(T *reorderedMat, int *rowIndices, int *colIndices, int *indexConversion, int startIdx, int rowsInLevelSet, const T *d, T *v, int threadBlockSize) Perform a lower solve on certain rows in a matrix that can safely be computed in parallel. |