You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: README.md
+1-1Lines changed: 1 addition & 1 deletion
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -11,7 +11,7 @@ The numerical discretization algorithm is develepod for two dimensional sufficie
11
11
12
12
[](https://colab.research.google.com/github/kk17m/kk17m/CUDA-Numerical-Discretization-On-a-Grid/blob/master/Numerical_Discretization_GLQ.ipynb)
13
13
14
-
* The nodes and weights are stored as list of lists using bidimensional arrays. The Legendre nodes (roots of the Legendre polynomials) in the interval (-1, 1) can be computed using mathematica nootbook [Nodes-weights-Gauss-Legendre.nb](Nodes-weights-Gauss-Legendre.nb).
14
+
* The nodes and weights are stored as list of lists using bidimensional arrays. The Legendre nodes (roots of the Legendre polynomials) in the interval (-1, 1) can be computed using mathematica nootbook [Nodes-weights-Gauss-Legendre.nb](Nodes-weights-Gauss-Legendre.nb) or other open source tools.
15
15
16
16
* The Thrust C++ tempelate libraries are used here for abstraction and performace.
0 commit comments