-plot(p_kernel, p_nodes, layout = (1, 2))</code></pre><p><img src="../kernel_custom.png" alt="Custom kernel"/></p><h2 id="Next-steps"><a class="docs-heading-anchor" href="#Next-steps">Next steps</a><a id="Next-steps-1"></a><a class="docs-heading-anchor-permalink" href="#Next-steps" title="Permalink"></a></h2><p>More examples regarding interpolation can be found in the <a href="https://github.com/JoshuaLampert/KernelInterpolation.jl/tree/main/examples/interpolation">examples</a> folder of the repository. Some easy possible tasks for further investigation are to try different kernels, more complicated sets of nodes, or different functions. When you try out to use more complex node sets, you might want to use the <code>merge</code> function to combine different <a href="../ref/#KernelInterpolation.NodeSet"><code>NodeSet</code></a>s. Note, however, that the interpolation problem might become ill-posed if the nodes are too close to each other. If there are at least twice the same nodes, the system matrix will become singular. In this case, you might want to filter out the duplicate nodes, e.g., by using <code>unique!</code>. For more information on kernel-based interpolation methods, we recommend the following references:</p><h2 id="References"><a class="docs-heading-anchor" href="#References">References</a><a id="References-1"></a><a class="docs-heading-anchor-permalink" href="#References" title="Permalink"></a></h2><section class="footnotes is-size-7"><ul><li class="footnote" id="footnote-Wendland2004"><a class="tag is-link" href="#citeref-Wendland2004">Wendland2004</a>Wendland (2004): Scattered Data Approximation, Cambridge University Press, <a href="https://doi.org/10.1017/CBO9780511617539">DOI: 10.1017/CBO9780511617539</a>.</li><li class="footnote" id="footnote-Fasshauer2007"><a class="tag is-link" href="#citeref-Fasshauer2007">Fasshauer2007</a>Fasshauer (2007): Meshfree Approximation Methods with Matlab, World Scientific, <a href="https://doi.org/10.1142/6437">DOI: 10.1142/6437</a>.</li></ul></section></article><nav class="docs-footer"><a class="docs-footer-prevpage" href="../nodesets/">« Sets of nodes</a><a class="docs-footer-nextpage" href="../pdes/">Solving PDEs by collocation »</a><div class="flexbox-break"></div><p class="footer-message">Powered by <a href="https://github.com/JuliaDocs/Documenter.jl">Documenter.jl</a> and the <a href="https://julialang.org/">Julia Programming Language</a>.</p></nav></div><div class="modal" id="documenter-settings"><div class="modal-background"></div><div class="modal-card"><header class="modal-card-head"><p class="modal-card-title">Settings</p><button class="delete"></button></header><section class="modal-card-body"><p><label class="label">Theme</label><div class="select"><select id="documenter-themepicker"><option value="auto">Automatic (OS)</option><option value="documenter-light">documenter-light</option><option value="documenter-dark">documenter-dark</option><option value="catppuccin-latte">catppuccin-latte</option><option value="catppuccin-frappe">catppuccin-frappe</option><option value="catppuccin-macchiato">catppuccin-macchiato</option><option value="catppuccin-mocha">catppuccin-mocha</option></select></div></p><hr/><p>This document was generated with <a href="https://github.com/JuliaDocs/Documenter.jl">Documenter.jl</a> version 1.8.0 on <span class="colophon-date" title="Friday 27 December 2024 13:32">Friday 27 December 2024</span>. Using Julia version 1.10.7.</p></section><footer class="modal-card-foot"></footer></div></div></div></body></html>
0 commit comments