We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 4d80631 commit bf86e29Copy full SHA for bf86e29
docs/src/pdes.md
@@ -45,7 +45,7 @@ In the simplest case, we use the same linear combination (neglecting polynomial
45
u(x) = \sum_{j = 1}^N c_jK(x, x_j),
46
```
47
48
-where $K$ is the kernel function. This approach is also non as non-symmetric collocation or Kansa's method. By enforcing the
+where $K$ is the kernel function. This approach is also known as non-symmetric collocation or Kansa's method. By enforcing the
49
conditions $\mathcal{L}u(x_i) = f(x_i)$ for $i = 1,\ldots,N_I$ and $\mathcal{B}u(x_i) = g(x_i)$ for $i = N_I + 1,\ldots,N$ we
50
obtain a linear system of equations for the coefficients $c_i$, which can be written as
51
0 commit comments