<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
		<id>http://e6.ijs.si/medusa/wiki/api.php?action=feedcontributions&amp;user=ARogan&amp;feedformat=atom</id>
		<title>Medusa: Coordinate Free Mehless Method implementation - User contributions [en]</title>
		<link rel="self" type="application/atom+xml" href="http://e6.ijs.si/medusa/wiki/api.php?action=feedcontributions&amp;user=ARogan&amp;feedformat=atom"/>
		<link rel="alternate" type="text/html" href="http://e6.ijs.si/medusa/wiki/index.php/Special:Contributions/ARogan"/>
		<updated>2026-04-15T04:47:27Z</updated>
		<subtitle>User contributions</subtitle>
		<generator>MediaWiki 1.27.1</generator>

	<entry>
		<id>http://e6.ijs.si/medusa/wiki/index.php?title=Meshless_FDM&amp;diff=3660</id>
		<title>Meshless FDM</title>
		<link rel="alternate" type="text/html" href="http://e6.ijs.si/medusa/wiki/index.php?title=Meshless_FDM&amp;diff=3660"/>
				<updated>2024-03-13T12:36:27Z</updated>
		
		<summary type="html">&lt;p&gt;ARogan: Upload figures&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;lt;span id=&amp;quot;introduction&amp;quot;&amp;gt;&amp;lt;/span&amp;gt;&lt;br /&gt;
= Introduction =&lt;br /&gt;
&lt;br /&gt;
Consider Poisson equation in unit square with Dirichlet boundary conditions, i.e.&lt;br /&gt;
&lt;br /&gt;
\begin{align*}&lt;br /&gt;
\Delta u = f \; \text{in } \Omega = [0, 1]^2, \quad u = 0 \; \text{on } \partial \Omega.&lt;br /&gt;
\end{align*}&lt;br /&gt;
&lt;br /&gt;
Let $f(x,y) = -2\pi^2\sin(\pi x)\sin(\pi y)$, which gives the simple analytical solution $u(x,y) = \sin(\pi x)\sin(\pi y)$. We compare errors of:&lt;br /&gt;
&lt;br /&gt;
# the known RBF-FD approach, and&lt;br /&gt;
# meshless FDM with 5-point and 9-point stencils (explained in detail below)&lt;br /&gt;
&lt;br /&gt;
&amp;lt;span id=&amp;quot;meshless-fdm&amp;quot;&amp;gt;&amp;lt;/span&amp;gt;&lt;br /&gt;
= Meshless FDM =&lt;br /&gt;
&lt;br /&gt;
Ordinary FDM (finite difference method) uses a uniform grid for the domain – the spacing between the nodes is constant in each spatial direction –, and the derivative operators are (usually) approximated using central finite difference stencils. In the specific case of Poisson equation, we can discretize the 2D Laplace operator using the 5-point stencil which gives second-order accuracy, or the 9-point stencil which gives fourth-order accuracy (assuming that $u$ can be well approximated by a Taylor expansion). Given grid spacing $h$, the 5-point stencil is&lt;br /&gt;
&lt;br /&gt;
\begin{align*}&lt;br /&gt;
\Delta u(x, y) \approx \frac{1}{h^2} \cdot \bigl( - 4u(x,y) + u(x+h,y) + u(x,y+h) + u(x-h,y) + u(x, y-h) \bigr),&lt;br /&gt;
\end{align*}&lt;br /&gt;
&lt;br /&gt;
and the 9-point stencil is&lt;br /&gt;
&lt;br /&gt;
\begin{align*}&lt;br /&gt;
\Delta u(x, y) \approx \frac{1}{h^2} \cdot \Bigl( &amp;amp;- 5u(x,y) + \frac{4}{3} \cdot \left[ u(x+h,y) + u(x,y+h) + u(x-h,y) + u(x, y-h) \right] \\ &amp;amp;-\frac{1}{12} \cdot \left[ u(x+2h,y) + u(x,y+2h) + u(x-2h,y) + u(x, y-2h) \right] \Bigr).&lt;br /&gt;
\end{align*}&lt;br /&gt;
&lt;br /&gt;
A key point of this approach is that all of the nodes we use in the approximation are part of the grid.&lt;br /&gt;
&lt;br /&gt;
Meshless methods do not assume a uniformly discretized domain and thus we cannot directly apply FDM. Taking a node $(x, y)$, it is unlikely that any of $(x+h,y), (x,y+h), \dots$ are in the discretization. Our approach to meshless FDM uses the usual FDM stencils by utilizing interpolation for the unknown grid nodes, as explained below.&lt;br /&gt;
&lt;br /&gt;
Consider an arbitrary node $p = (x,y)$ from a meshless domain. To approximate a differential operator at this point, we first decide on the appropriate FDM stencil. Suppose that the stencil uses values in points $q_1, \dots, q_M$. For the 5-point stencil from before we have&lt;br /&gt;
&lt;br /&gt;
\begin{align*}&lt;br /&gt;
&amp;amp;q_1 = p, \; q_2 = p + (h, 0),\; q_3 = p + (0, h),\; q_4 = p + (-h, 0),\; q_5 = p + (0, -h), \\&lt;br /&gt;
&amp;amp;\Delta u(x, y) \approx \frac{1}{h^2} \cdot \bigl( - 4u(q_1) + u(q_2) + u(q_3) + u(q_4) + u(q_5) \bigr).&lt;br /&gt;
\end{align*}&lt;br /&gt;
&lt;br /&gt;
As these points&amp;lt;ref&amp;gt;Apart from the central point of the stencil, $q_1$&amp;lt;/ref&amp;gt; are not present in the domain, we perform RBF-FD interpolation for points $q_1, \dots, q_M$. The interpolation uses $n$ closest nodes to $p$, called the ''support'' of node $p$. With this, we can express $u(q_i)$ as a linear combination of $u(p_1), u(p_2), \dots, u(p_n)$, where $p_1, p_2, \dots, p_n$ are the support of $p$, and use the usual construction of the linear system for FDM.&lt;br /&gt;
&lt;br /&gt;
To conclude, both the known RBF-FD approach and our meshless FDM approach work with nodes $p_i$ and values $u(p_i)$ at these nodes. We use the support of each node to either utilize the known approach or interpolate to FDM stencil nodes.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;span id=&amp;quot;domain-generation&amp;quot;&amp;gt;&amp;lt;/span&amp;gt;&lt;br /&gt;
= Domain generation =&lt;br /&gt;
&lt;br /&gt;
To obtain an irregular domain, we start with a unit square with a grid discretization of step $h$. We continue by creating a new domain, copying the boundary nodes, and repeating for each internal node $p_i = (x, y)$:&lt;br /&gt;
&lt;br /&gt;
# Sample $a$ and $b$ from a uniform real distribution on $[-1, 1]$ (e.g. using a fixed seed for reproducability)&lt;br /&gt;
# Let $\tilde{x} = x + a \cdot Rh$ and $\tilde{y} = y + b \cdot Rh$ (where $R$ is an irregularization parameter)&lt;br /&gt;
# Add $\tilde{p_i} = (\tilde{x}, \tilde{y})$ as an interior node to the new domain&lt;br /&gt;
&lt;br /&gt;
An example of this is shown in figure [[#fig_domain|1]]. Using parameter $R = 0.3$ results in a nicely irregularized domain, where nodes are visibly not aligned on a grid, while still having enough distance between each other.&lt;br /&gt;
&lt;br /&gt;
'''Note:''' we could have used a fill algorithm to generate the domain.&lt;br /&gt;
&lt;br /&gt;
[[File:domain_h0.01_R0.3.png|1200px]]&lt;br /&gt;
&lt;br /&gt;
&amp;lt;span id=&amp;quot;parameters&amp;quot;&amp;gt;&amp;lt;/span&amp;gt;&lt;br /&gt;
= Parameters =&lt;br /&gt;
&lt;br /&gt;
So far we mentioned parameters $h$ and $R$, which are used for domain generation.&lt;br /&gt;
&lt;br /&gt;
'''Observe:''' using $h$ as the finite difference stencil step size might not be desirable – we wanted to test behavior for a variety of step sizes, and our $h$ is specific to our discretization process. From now on, let $\delta$ denote the step size for FDM stencils. In a general case, we would need to somehow decide on a value for $\delta$. Note that this could be per-node (e.g. calculate $\delta$ from the support) or a global value (e.g. calculate some statistic of the discretization).&lt;br /&gt;
&lt;br /&gt;
We defined globally $\delta = \sigma \cdot h$ and conducted testing for various values of $\sigma &amp;gt; 0$, although stopping at not much more than $1$.&lt;br /&gt;
&lt;br /&gt;
We used the same approximation engine for both the RBF-FD approach and the meshless FDM approach, namely a RBFFD engine with polyharmonic radial basis functions of order $3$ and monomial augmentation of order $m \in \{2, 4, 6\}$. Both methods used the same set of support nodes, however, in the FDM approach we used two interpolation techniques:&lt;br /&gt;
&lt;br /&gt;
# &amp;amp;quot;Simple&amp;amp;quot;: use the support nodes of the central node in the stencil for all of the nodes in the stencil (the approach used in the results section unless mentioned otherwise)&lt;br /&gt;
# &amp;amp;quot;Advanced&amp;amp;quot;: find the support (closest $n$ nodes) for each node from the stencil separately (computationally more expensive).&lt;br /&gt;
&lt;br /&gt;
'''Note:''' we chose support size in line with guidelines from the paper &amp;amp;quot;Monomial augmentation guidelines for RBF-FD from accuracy vs. computational time perspective&amp;amp;quot; (Mitja Jančič, Jure Slak, Gregor Kosec – 2021). Using lower support sizes yielded worse results.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;span id=&amp;quot;results&amp;quot;&amp;gt;&amp;lt;/span&amp;gt;&lt;br /&gt;
= Results =&lt;br /&gt;
&lt;br /&gt;
We compared the relative error of both approaches w.r.t. the analytical solution. Using different values of $\sigma$ we found that the error is lowest either near $\sigma \approx 1$ either near $\sigma \approx 0$. The $\sigma$ parameter affects only the meshless FDM approach.&lt;br /&gt;
&lt;br /&gt;
We started with the 5-point stencil. With second order monomials, the meshless FDM approach gives better results than RBF-FD, especially in the region around $\sigma \approx 1$. Using higher-order monomials without increasing the FDM stencil size results in worse behavior compared to RBF-RD, although the results are still better than for $m=2$. We think that the higher error when using $m=4$ or larger comes from the fact that the 5-point stencil has an error proportional to the fourth derivative $u^{(4)} \cdot h^2$, and using $m=4$ or larger introduces this error. We see that the error matches RBF-FD at very low $\sigma$ values, but we incur great numerical errors by lowering it further and further to zero, as can be seen in figure [[#fig_5point|2]].&lt;br /&gt;
&lt;br /&gt;
Continuing with the 9-point stencil in figure [[#fig_9point|3]], we see a considerable improvement. The meshless FDM method works better than RBF-FD even for fourth order monomials, also around $\sigma \approx 1$. Increasing monomial augmentation to sixth order or higher has a similar effect as before. This tells us that if we want to perform better than the known RBF-FD approach we need to properly match the FDM stencil size and the order of monomial augmentation.&lt;br /&gt;
&lt;br /&gt;
Both interpolation techniques perform similarly well. We tried this for both the 5-point and the 9-point FDM stencil, see figure [[#fig_interpolation|4]]. For the 5-point stencil, the minimum of the error is slightly lower using the advanced technique, while the opposite holds for the 9-point stencil.&lt;br /&gt;
&lt;br /&gt;
Increasing $\sigma$ much more than $1$ causes the error to grow quickly as evident in figure [[#fig_larger_sigma|5]]. Interestingly, the maximum of the error keeps decreasing for a while. Starting around $\sigma \approx 1.9$ the computation takes much longer as the linear system solver reaches the maximum number of iterations.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;gallery&amp;gt;&lt;br /&gt;
File:poisson_error_max_h0.01_R0.3_m12_s2_mode2.png&lt;br /&gt;
File:poisson_error_max_h0.01_R0.3_m30_s4_mode2.png&lt;br /&gt;
File:poisson_error_max_h0.01_R0.3_m30_s4_mode2_zoom.png&lt;br /&gt;
File:poisson_error_max_h0.01_R0.3_m56_s6_mode2.png&lt;br /&gt;
&amp;lt;/gallery&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;gallery&amp;gt;&lt;br /&gt;
File:poisson_error_max_h0.01_R0.3_m12_s2_mode4.png&lt;br /&gt;
File:poisson_error_max_h0.01_R0.3_m30_s4_mode4.png&lt;br /&gt;
File:poisson_error_max_h0.01_R0.3_m56_s6_mode4.png&lt;br /&gt;
File:poisson_error_max_h0.01_R0.3_m90_s8_mode4.png&lt;br /&gt;
&amp;lt;/gallery&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;gallery&amp;gt;&lt;br /&gt;
File:poisson_error_max_h0.01_R0.3_m12_s2_mode2.png&lt;br /&gt;
File:poisson_error_max_h0.01_R0.3_m12_s2_mode3.png&lt;br /&gt;
File:poisson_error_max_h0.01_R0.3_m30_s4_mode4.png&lt;br /&gt;
File:poisson_error_max_h0.01_R0.3_m30_s4_mode5.png&lt;br /&gt;
&amp;lt;/gallery&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;gallery&amp;gt;&lt;br /&gt;
File:poisson_error_mode2_far.png&lt;br /&gt;
File:poisson_error_mode4_far.png&lt;br /&gt;
File:poisson_error_max_h0.01_R0.3_m30_s4_mode4.png&lt;br /&gt;
File:poisson_error_max_h0.01_R0.3_m30_s4_mode5.png&lt;br /&gt;
&amp;lt;/gallery&amp;gt;&lt;/div&gt;</summary>
		<author><name>ARogan</name></author>	</entry>

	<entry>
		<id>http://e6.ijs.si/medusa/wiki/index.php?title=File:Poisson_error_mode4_far.png&amp;diff=3658</id>
		<title>File:Poisson error mode4 far.png</title>
		<link rel="alternate" type="text/html" href="http://e6.ijs.si/medusa/wiki/index.php?title=File:Poisson_error_mode4_far.png&amp;diff=3658"/>
				<updated>2024-03-13T12:28:09Z</updated>
		
		<summary type="html">&lt;p&gt;ARogan: File uploaded with MsUpload&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;File uploaded with MsUpload&lt;/div&gt;</summary>
		<author><name>ARogan</name></author>	</entry>

	<entry>
		<id>http://e6.ijs.si/medusa/wiki/index.php?title=File:Domain_h0.01_R0.3.png&amp;diff=3659</id>
		<title>File:Domain h0.01 R0.3.png</title>
		<link rel="alternate" type="text/html" href="http://e6.ijs.si/medusa/wiki/index.php?title=File:Domain_h0.01_R0.3.png&amp;diff=3659"/>
				<updated>2024-03-13T12:28:09Z</updated>
		
		<summary type="html">&lt;p&gt;ARogan: File uploaded with MsUpload&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;File uploaded with MsUpload&lt;/div&gt;</summary>
		<author><name>ARogan</name></author>	</entry>

	<entry>
		<id>http://e6.ijs.si/medusa/wiki/index.php?title=File:Poisson_error_max_h0.01_R0.3_m90_s8_mode4.png&amp;diff=3656</id>
		<title>File:Poisson error max h0.01 R0.3 m90 s8 mode4.png</title>
		<link rel="alternate" type="text/html" href="http://e6.ijs.si/medusa/wiki/index.php?title=File:Poisson_error_max_h0.01_R0.3_m90_s8_mode4.png&amp;diff=3656"/>
				<updated>2024-03-13T12:28:08Z</updated>
		
		<summary type="html">&lt;p&gt;ARogan: File uploaded with MsUpload&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;File uploaded with MsUpload&lt;/div&gt;</summary>
		<author><name>ARogan</name></author>	</entry>

	<entry>
		<id>http://e6.ijs.si/medusa/wiki/index.php?title=File:Poisson_error_mode2_far.png&amp;diff=3657</id>
		<title>File:Poisson error mode2 far.png</title>
		<link rel="alternate" type="text/html" href="http://e6.ijs.si/medusa/wiki/index.php?title=File:Poisson_error_mode2_far.png&amp;diff=3657"/>
				<updated>2024-03-13T12:28:08Z</updated>
		
		<summary type="html">&lt;p&gt;ARogan: File uploaded with MsUpload&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;File uploaded with MsUpload&lt;/div&gt;</summary>
		<author><name>ARogan</name></author>	</entry>

	<entry>
		<id>http://e6.ijs.si/medusa/wiki/index.php?title=File:Poisson_error_max_h0.01_R0.3_m30_s4_mode5.png&amp;diff=3653</id>
		<title>File:Poisson error max h0.01 R0.3 m30 s4 mode5.png</title>
		<link rel="alternate" type="text/html" href="http://e6.ijs.si/medusa/wiki/index.php?title=File:Poisson_error_max_h0.01_R0.3_m30_s4_mode5.png&amp;diff=3653"/>
				<updated>2024-03-13T12:28:07Z</updated>
		
		<summary type="html">&lt;p&gt;ARogan: File uploaded with MsUpload&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;File uploaded with MsUpload&lt;/div&gt;</summary>
		<author><name>ARogan</name></author>	</entry>

	<entry>
		<id>http://e6.ijs.si/medusa/wiki/index.php?title=File:Poisson_error_max_h0.01_R0.3_m56_s6_mode2.png&amp;diff=3654</id>
		<title>File:Poisson error max h0.01 R0.3 m56 s6 mode2.png</title>
		<link rel="alternate" type="text/html" href="http://e6.ijs.si/medusa/wiki/index.php?title=File:Poisson_error_max_h0.01_R0.3_m56_s6_mode2.png&amp;diff=3654"/>
				<updated>2024-03-13T12:28:07Z</updated>
		
		<summary type="html">&lt;p&gt;ARogan: File uploaded with MsUpload&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;File uploaded with MsUpload&lt;/div&gt;</summary>
		<author><name>ARogan</name></author>	</entry>

	<entry>
		<id>http://e6.ijs.si/medusa/wiki/index.php?title=File:Poisson_error_max_h0.01_R0.3_m56_s6_mode4.png&amp;diff=3655</id>
		<title>File:Poisson error max h0.01 R0.3 m56 s6 mode4.png</title>
		<link rel="alternate" type="text/html" href="http://e6.ijs.si/medusa/wiki/index.php?title=File:Poisson_error_max_h0.01_R0.3_m56_s6_mode4.png&amp;diff=3655"/>
				<updated>2024-03-13T12:28:07Z</updated>
		
		<summary type="html">&lt;p&gt;ARogan: File uploaded with MsUpload&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;File uploaded with MsUpload&lt;/div&gt;</summary>
		<author><name>ARogan</name></author>	</entry>

	<entry>
		<id>http://e6.ijs.si/medusa/wiki/index.php?title=File:Poisson_error_max_h0.01_R0.3_m30_s4_mode4.png&amp;diff=3652</id>
		<title>File:Poisson error max h0.01 R0.3 m30 s4 mode4.png</title>
		<link rel="alternate" type="text/html" href="http://e6.ijs.si/medusa/wiki/index.php?title=File:Poisson_error_max_h0.01_R0.3_m30_s4_mode4.png&amp;diff=3652"/>
				<updated>2024-03-13T12:28:06Z</updated>
		
		<summary type="html">&lt;p&gt;ARogan: File uploaded with MsUpload&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;File uploaded with MsUpload&lt;/div&gt;</summary>
		<author><name>ARogan</name></author>	</entry>

	<entry>
		<id>http://e6.ijs.si/medusa/wiki/index.php?title=File:Poisson_error_max_h0.01_R0.3_m30_s4_mode2.png&amp;diff=3650</id>
		<title>File:Poisson error max h0.01 R0.3 m30 s4 mode2.png</title>
		<link rel="alternate" type="text/html" href="http://e6.ijs.si/medusa/wiki/index.php?title=File:Poisson_error_max_h0.01_R0.3_m30_s4_mode2.png&amp;diff=3650"/>
				<updated>2024-03-13T12:28:06Z</updated>
		
		<summary type="html">&lt;p&gt;ARogan: File uploaded with MsUpload&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;File uploaded with MsUpload&lt;/div&gt;</summary>
		<author><name>ARogan</name></author>	</entry>

	<entry>
		<id>http://e6.ijs.si/medusa/wiki/index.php?title=File:Poisson_error_max_h0.01_R0.3_m30_s4_mode2_zoom.png&amp;diff=3651</id>
		<title>File:Poisson error max h0.01 R0.3 m30 s4 mode2 zoom.png</title>
		<link rel="alternate" type="text/html" href="http://e6.ijs.si/medusa/wiki/index.php?title=File:Poisson_error_max_h0.01_R0.3_m30_s4_mode2_zoom.png&amp;diff=3651"/>
				<updated>2024-03-13T12:28:06Z</updated>
		
		<summary type="html">&lt;p&gt;ARogan: File uploaded with MsUpload&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;File uploaded with MsUpload&lt;/div&gt;</summary>
		<author><name>ARogan</name></author>	</entry>

	<entry>
		<id>http://e6.ijs.si/medusa/wiki/index.php?title=File:Poisson_error_max_h0.01_R0.3_m12_s2_mode3.png&amp;diff=3648</id>
		<title>File:Poisson error max h0.01 R0.3 m12 s2 mode3.png</title>
		<link rel="alternate" type="text/html" href="http://e6.ijs.si/medusa/wiki/index.php?title=File:Poisson_error_max_h0.01_R0.3_m12_s2_mode3.png&amp;diff=3648"/>
				<updated>2024-03-13T12:28:05Z</updated>
		
		<summary type="html">&lt;p&gt;ARogan: File uploaded with MsUpload&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;File uploaded with MsUpload&lt;/div&gt;</summary>
		<author><name>ARogan</name></author>	</entry>

	<entry>
		<id>http://e6.ijs.si/medusa/wiki/index.php?title=File:Poisson_error_max_h0.01_R0.3_m12_s2_mode4.png&amp;diff=3649</id>
		<title>File:Poisson error max h0.01 R0.3 m12 s2 mode4.png</title>
		<link rel="alternate" type="text/html" href="http://e6.ijs.si/medusa/wiki/index.php?title=File:Poisson_error_max_h0.01_R0.3_m12_s2_mode4.png&amp;diff=3649"/>
				<updated>2024-03-13T12:28:05Z</updated>
		
		<summary type="html">&lt;p&gt;ARogan: File uploaded with MsUpload&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;File uploaded with MsUpload&lt;/div&gt;</summary>
		<author><name>ARogan</name></author>	</entry>

	<entry>
		<id>http://e6.ijs.si/medusa/wiki/index.php?title=File:Poisson_error_max_h0.01_R0.3_m12_s2_mode2.png&amp;diff=3647</id>
		<title>File:Poisson error max h0.01 R0.3 m12 s2 mode2.png</title>
		<link rel="alternate" type="text/html" href="http://e6.ijs.si/medusa/wiki/index.php?title=File:Poisson_error_max_h0.01_R0.3_m12_s2_mode2.png&amp;diff=3647"/>
				<updated>2024-03-13T12:28:04Z</updated>
		
		<summary type="html">&lt;p&gt;ARogan: File uploaded with MsUpload&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;File uploaded with MsUpload&lt;/div&gt;</summary>
		<author><name>ARogan</name></author>	</entry>

	<entry>
		<id>http://e6.ijs.si/medusa/wiki/index.php?title=Meshless_FDM&amp;diff=3646</id>
		<title>Meshless FDM</title>
		<link rel="alternate" type="text/html" href="http://e6.ijs.si/medusa/wiki/index.php?title=Meshless_FDM&amp;diff=3646"/>
				<updated>2024-03-13T12:22:00Z</updated>
		
		<summary type="html">&lt;p&gt;ARogan: Meshless FDM text only&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;lt;span id=&amp;quot;introduction&amp;quot;&amp;gt;&amp;lt;/span&amp;gt;&lt;br /&gt;
= Introduction =&lt;br /&gt;
&lt;br /&gt;
Consider Poisson equation in unit square with Dirichlet boundary conditions, i.e.&lt;br /&gt;
&lt;br /&gt;
\begin{align*}&lt;br /&gt;
\Delta u = f \; \text{in } \Omega = [0, 1]^2, \quad u = 0 \; \text{on } \partial \Omega.&lt;br /&gt;
\end{align*}&lt;br /&gt;
&lt;br /&gt;
Let $f(x,y) = -2\pi^2\sin(\pi x)\sin(\pi y)$, which gives the simple analytical solution $u(x,y) = \sin(\pi x)\sin(\pi y)$. We compare errors of:&lt;br /&gt;
&lt;br /&gt;
# the known RBF-FD approach, and&lt;br /&gt;
# meshless FDM with 5-point and 9-point stencils (explained in detail below)&lt;br /&gt;
&lt;br /&gt;
&amp;lt;span id=&amp;quot;meshless-fdm&amp;quot;&amp;gt;&amp;lt;/span&amp;gt;&lt;br /&gt;
= Meshless FDM =&lt;br /&gt;
&lt;br /&gt;
Ordinary FDM (finite difference method) uses a uniform grid for the domain – the spacing between the nodes is constant in each spatial direction –, and the derivative operators are (usually) approximated using central finite difference stencils. In the specific case of Poisson equation, we can discretize the 2D Laplace operator using the 5-point stencil which gives second-order accuracy, or the 9-point stencil which gives fourth-order accuracy (assuming that $u$ can be well approximated by a Taylor expansion). Given grid spacing $h$, the 5-point stencil is&lt;br /&gt;
&lt;br /&gt;
\begin{align*}&lt;br /&gt;
\Delta u(x, y) \approx \frac{1}{h^2} \cdot \bigl( - 4u(x,y) + u(x+h,y) + u(x,y+h) + u(x-h,y) + u(x, y-h) \bigr),&lt;br /&gt;
\end{align*}&lt;br /&gt;
&lt;br /&gt;
and the 9-point stencil is&lt;br /&gt;
&lt;br /&gt;
\begin{align*}&lt;br /&gt;
\Delta u(x, y) \approx \frac{1}{h^2} \cdot \Bigl( &amp;amp;- 5u(x,y) + \frac{4}{3} \cdot \left[ u(x+h,y) + u(x,y+h) + u(x-h,y) + u(x, y-h) \right] \\ &amp;amp;-\frac{1}{12} \cdot \left[ u(x+2h,y) + u(x,y+2h) + u(x-2h,y) + u(x, y-2h) \right] \Bigr).&lt;br /&gt;
\end{align*}&lt;br /&gt;
&lt;br /&gt;
A key point of this approach is that all of the nodes we use in the approximation are part of the grid.&lt;br /&gt;
&lt;br /&gt;
Meshless methods do not assume a uniformly discretized domain and thus we cannot directly apply FDM. Taking a node $(x, y)$, it is unlikely that any of $(x+h,y), (x,y+h), \dots$ are in the discretization. Our approach to meshless FDM uses the usual FDM stencils by utilizing interpolation for the unknown grid nodes, as explained below.&lt;br /&gt;
&lt;br /&gt;
Consider an arbitrary node $p = (x,y)$ from a meshless domain. To approximate a differential operator at this point, we first decide on the appropriate FDM stencil. Suppose that the stencil uses values in points $q_1, \dots, q_M$. For the 5-point stencil from before we have&lt;br /&gt;
&lt;br /&gt;
\begin{align*}&lt;br /&gt;
&amp;amp;q_1 = p, \; q_2 = p + (h, 0),\; q_3 = p + (0, h),\; q_4 = p + (-h, 0),\; q_5 = p + (0, -h), \\&lt;br /&gt;
&amp;amp;\Delta u(x, y) \approx \frac{1}{h^2} \cdot \bigl( - 4u(q_1) + u(q_2) + u(q_3) + u(q_4) + u(q_5) \bigr).&lt;br /&gt;
\end{align*}&lt;br /&gt;
&lt;br /&gt;
As these points&amp;lt;ref&amp;gt;Apart from the central point of the stencil, $q_1$&amp;lt;/ref&amp;gt; are not present in the domain, we perform RBF-FD interpolation for points $q_1, \dots, q_M$. The interpolation uses $n$ closest nodes to $p$, called the ''support'' of node $p$. With this, we can express $u(q_i)$ as a linear combination of $u(p_1), u(p_2), \dots, u(p_n)$, where $p_1, p_2, \dots, p_n$ are the support of $p$, and use the usual construction of the linear system for FDM.&lt;br /&gt;
&lt;br /&gt;
To conclude, both the known RBF-FD approach and our meshless FDM approach work with nodes $p_i$ and values $u(p_i)$ at these nodes. We use the support of each node to either utilize the known approach or interpolate to FDM stencil nodes.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;span id=&amp;quot;domain-generation&amp;quot;&amp;gt;&amp;lt;/span&amp;gt;&lt;br /&gt;
= Domain generation =&lt;br /&gt;
&lt;br /&gt;
To obtain an irregular domain, we start with a unit square with a grid discretization of step $h$. We continue by creating a new domain, copying the boundary nodes, and repeating for each internal node $p_i = (x, y)$:&lt;br /&gt;
&lt;br /&gt;
# Sample $a$ and $b$ from a uniform real distribution on $[-1, 1]$ (e.g. using a fixed seed for reproducability)&lt;br /&gt;
# Let $\tilde{x} = x + a \cdot Rh$ and $\tilde{y} = y + b \cdot Rh$ (where $R$ is an irregularization parameter)&lt;br /&gt;
# Add $\tilde{p_i} = (\tilde{x}, \tilde{y})$ as an interior node to the new domain&lt;br /&gt;
&lt;br /&gt;
An example of this is shown in figure [[#fig_domain|1]]. Using parameter $R = 0.3$ results in a nicely irregularized domain, where nodes are visibly not aligned on a grid, while still having enough distance between each other.&lt;br /&gt;
&lt;br /&gt;
'''Note:''' we could have used a fill algorithm to generate the domain.&lt;br /&gt;
&lt;br /&gt;
[[File:domain_h0.01_R0.3.png]]&lt;br /&gt;
&lt;br /&gt;
&amp;lt;span id=&amp;quot;parameters&amp;quot;&amp;gt;&amp;lt;/span&amp;gt;&lt;br /&gt;
= Parameters =&lt;br /&gt;
&lt;br /&gt;
So far we mentioned parameters $h$ and $R$, which are used for domain generation.&lt;br /&gt;
&lt;br /&gt;
'''Observe:''' using $h$ as the finite difference stencil step size might not be desirable – we wanted to test behavior for a variety of step sizes, and our $h$ is specific to our discretization process. From now on, let $\delta$ denote the step size for FDM stencils. In a general case, we would need to somehow decide on a value for $\delta$. Note that this could be per-node (e.g. calculate $\delta$ from the support) or a global value (e.g. calculate some statistic of the discretization).&lt;br /&gt;
&lt;br /&gt;
We defined globally $\delta = \sigma \cdot h$ and conducted testing for various values of $\sigma &amp;gt; 0$, although stopping at not much more than $1$.&lt;br /&gt;
&lt;br /&gt;
We used the same approximation engine for both the RBF-FD approach and the meshless FDM approach, namely a RBFFD engine with polyharmonic radial basis functions of order $3$ and monomial augmentation of order $m \in \{2, 4, 6\}$. Both methods used the same set of support nodes, however, in the FDM approach we used two interpolation techniques:&lt;br /&gt;
&lt;br /&gt;
# &amp;amp;quot;Simple&amp;amp;quot;: use the support nodes of the central node in the stencil for all of the nodes in the stencil (the approach used in the results section unless mentioned otherwise)&lt;br /&gt;
# &amp;amp;quot;Advanced&amp;amp;quot;: find the support (closest $n$ nodes) for each node from the stencil separately (computationally more expensive).&lt;br /&gt;
&lt;br /&gt;
'''Note:''' we chose support size in line with guidelines from the paper &amp;amp;quot;Monomial augmentation guidelines for RBF-FD from accuracy vs. computational time perspective&amp;amp;quot; (Mitja Jančič, Jure Slak, Gregor Kosec – 2021). Using lower support sizes yielded worse results.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;span id=&amp;quot;results&amp;quot;&amp;gt;&amp;lt;/span&amp;gt;&lt;br /&gt;
= Results =&lt;br /&gt;
&lt;br /&gt;
We compared the relative error of both approaches w.r.t. the analytical solution. Using different values of $\sigma$ we found that the error is lowest either near $\sigma \approx 1$ either near $\sigma \approx 0$. The $\sigma$ parameter affects only the meshless FDM approach.&lt;br /&gt;
&lt;br /&gt;
We started with the 5-point stencil. With second order monomials, the meshless FDM approach gives better results than RBF-FD, especially in the region around $\sigma \approx 1$. Using higher-order monomials without increasing the FDM stencil size results in worse behavior compared to RBF-RD, although the results are still better than for $m=2$. We think that the higher error when using $m=4$ or larger comes from the fact that the 5-point stencil has an error proportional to the fourth derivative $u^{(4)} \cdot h^2$, and using $m=4$ or larger introduces this error. We see that the error matches RBF-FD at very low $\sigma$ values, but we incur great numerical errors by lowering it further and further to zero, as can be seen in figure [[#fig_5point|2]].&lt;br /&gt;
&lt;br /&gt;
Continuing with the 9-point stencil in figure [[#fig_9point|3]], we see a considerable improvement. The meshless FDM method works better than RBF-FD even for fourth order monomials, also around $\sigma \approx 1$. Increasing monomial augmentation to sixth order or higher has a similar effect as before. This tells us that if we want to perform better than the known RBF-FD approach we need to properly match the FDM stencil size and the order of monomial augmentation.&lt;br /&gt;
&lt;br /&gt;
Both interpolation techniques perform similarly well. We tried this for both the 5-point and the 9-point FDM stencil, see figure [[#fig_interpolation|4]]. For the 5-point stencil, the minimum of the error is slightly lower using the advanced technique, while the opposite holds for the 9-point stencil.&lt;br /&gt;
&lt;br /&gt;
Increasing $\sigma$ much more than $1$ causes the error to grow quickly as evident in figure [[#fig_larger_sigma|5]]. Interestingly, the maximum of the error keeps decreasing for a while. Starting around $\sigma \approx 1.9$ the computation takes much longer as the linear system solver reaches the maximum number of iterations.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/div&amp;gt;&lt;/div&gt;</summary>
		<author><name>ARogan</name></author>	</entry>

	<entry>
		<id>http://e6.ijs.si/medusa/wiki/index.php?title=Medusa&amp;diff=3645</id>
		<title>Medusa</title>
		<link rel="alternate" type="text/html" href="http://e6.ijs.si/medusa/wiki/index.php?title=Medusa&amp;diff=3645"/>
				<updated>2024-03-12T12:55:42Z</updated>
		
		<summary type="html">&lt;p&gt;ARogan: Added &amp;quot;Meshless FDM&amp;quot; to discussions&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;lt;!--__NOTITLE__--&amp;gt;&lt;br /&gt;
'''Welcome to the Medusa wiki. To visit the main website, go to [http://e6.ijs.si/medusa/ http://e6.ijs.si/medusa/].'''&lt;br /&gt;
&lt;br /&gt;
In [http://e6.ijs.si/ParallelAndDistributedSystems/ Parallel and Distributed Systems Laboratory] we are working on a C++ library that is first and foremost focused on tools for solving Partial Differential Equations by meshless methods. The basic idea is to create generic codes for tools that are needed for solving not only PDEs but many other problems, e.g. Moving Least Squares approximation, $k$-d tree, domain generation engines, etc.&lt;br /&gt;
We call this open source meshless project [http://e6.ijs.si/medusa/ Medusa: Coordinate Free Meshless Method implementation (MM)].&lt;br /&gt;
&lt;br /&gt;
Technical details about code and examples  can be found on our [http://e6.ijs.si/medusa/docs/ documentation page] and [https://gitlab.com/e62Lab/medusa Gitlab repository]. [[File:C.png|100px||link=https://gitlab.com/e62Lab/medusa|alt=Alt text|code]] [[File:doxygen.png|100px|link=http://e6.ijs.si/medusa/docs/|alt=Alt text|Documentation page]]&lt;br /&gt;
&lt;br /&gt;
This wiki site is meant for more relaxed discussions about general principles, possible and already implemented applications, preliminary analyses, etc.&lt;br /&gt;
Note, that there are many grammatical mistakes, typos, stupid sentences, etc. This wiki is meant for quick information exchange and therefore we do not invest a lot of energy into styling :).  &lt;br /&gt;
&lt;br /&gt;
== Documentation ==&lt;br /&gt;
* [https://gitlab.com/e62Lab/medusa Code on Gitlab]&lt;br /&gt;
* [[How to build | Installation and building]]&lt;br /&gt;
* [[Including this library in your project | Including this library in your project]]&lt;br /&gt;
* [[Testing | Running tests]]&lt;br /&gt;
* [http://e6.ijs.si/medusa/docs/ Technical documentation]&lt;br /&gt;
* [[Coding style | Coding style]]&lt;br /&gt;
* [[Wiki editing guide | Wiki editing and backup guide]]&lt;br /&gt;
&lt;br /&gt;
== Building blocks ==&lt;br /&gt;
Medusa is modular coordinate-free parallel implementation of a numerical framework designed, but not limited to, for solving PDEs. In this section we present main modules of the library that can be also used as a standalone tools. &lt;br /&gt;
* [[Positioning of computational nodes]] &lt;br /&gt;
* [[Relaxation of the nodal distribution]]&lt;br /&gt;
* [[Refinement of the nodal distribution]]&lt;br /&gt;
* [[k-d tree|''k''-d tree and other spatial search structures]] &lt;br /&gt;
* [[Solving system | Solving linear system - including over and underdetermined systems]]&lt;br /&gt;
* [[Weighted Least Squares (WLS)]]&lt;br /&gt;
* [[Computation of shape functions]]&lt;br /&gt;
* [[Radial basis function-generated finite differences (RBF-FD)]]&lt;br /&gt;
* [[Ghost nodes (theory)]]&lt;br /&gt;
* [[Integrators for time stepping]]&lt;br /&gt;
&lt;br /&gt;
== Examples ==&lt;br /&gt;
In this section we present exact examples. Each of the below solutions can be found also in in the repository under examples. More explanation about the physical background and solution procedure can be found in following sections.&lt;br /&gt;
* [[Philosophy of examples and how to run them]]&lt;br /&gt;
* [[Poisson's equation]]&lt;br /&gt;
* [[Heat equation]]&lt;br /&gt;
* [[Linear elasticity]]&lt;br /&gt;
* [[Complex-valued problems]]&lt;br /&gt;
* [[Coupled domains]]&lt;br /&gt;
* [[Parametric domains | Parametric domains &amp;amp;ndash; Curved surface with variable density]]&lt;br /&gt;
* [[NURBS domains | Domains modeled with non-uniform rational basis splines (NURBS)]]&lt;br /&gt;
* [[Determining the interior of the domain by oversampling the boundary]]&lt;br /&gt;
* [[Computer-aided design - Importing IGES and STEP files]]&lt;br /&gt;
* [[Realistic 3D models|Working with 3D surface mesh models ]]&lt;br /&gt;
* [[customization | Operator customization]]&lt;br /&gt;
* [[Ghost nodes]]&lt;br /&gt;
* [[Electromagnetic scattering]]&lt;br /&gt;
* [[Schrödinger equation]]&lt;br /&gt;
* [[Wave equation]]&lt;br /&gt;
* [[Cahn-Hilliard equation]]&lt;br /&gt;
* [[Fluid mechanics]]&lt;br /&gt;
* [[Solid Mechanics | Solid mechanics]]&lt;br /&gt;
&lt;br /&gt;
== Discussions / Applications ==&lt;br /&gt;
This section is meant for general discussion about the physical background of the examples, the solution procedures, various applications, etc. Note, that code snippets presented in discussion might not reflect the actual state of Medusa.  &lt;br /&gt;
* [[Convection Diffusion equation | Convection Diffusion equation]]&lt;br /&gt;
* [[Adaptivity|H-adaptivity]]&lt;br /&gt;
* [[Hp-adaptivity]]&lt;br /&gt;
* [[Solid Mechanics]]&lt;br /&gt;
** [[Point contact]]&lt;br /&gt;
** [[Hertzian contact]]&lt;br /&gt;
** [[Cantilever beam]]&lt;br /&gt;
** [[Fretting fatigue case]]&lt;br /&gt;
** [[Plasticity]]&lt;br /&gt;
* [[Fluid Mechanics]]&lt;br /&gt;
** [[Lid driven cavity]]&lt;br /&gt;
** [[Burgers' equation]]&lt;br /&gt;
** [[de Vahl Davis natural convection test]]&lt;br /&gt;
** [[Natural convection in 3D irregular domain]]&lt;br /&gt;
** [[Natural convection from heated cylinder]]&lt;br /&gt;
** [[Natural convection between concentric cylinders]]&lt;br /&gt;
** [[Non-Newtonian fluid]]&lt;br /&gt;
* [[Computational electromagnetics]]&lt;br /&gt;
** [[Triple dielectric step in 1D]]&lt;br /&gt;
** [[Scattering from an infinite cylinder]]&lt;br /&gt;
** [[Point source near an anisotropic lens]]&lt;br /&gt;
* Other applications&lt;br /&gt;
** [[Attenuation due to liquid water content in the atmosphere|Attenuation of a satellite communication]]&lt;br /&gt;
** [[Heart rate variability detection]]&lt;br /&gt;
** [[Bioheat equation]]&lt;br /&gt;
* [[Meshless FDM]]&lt;br /&gt;
&lt;br /&gt;
== Performance analyses ==&lt;br /&gt;
* [[Execution on Intel® Xeon Phi™ co-processor]]&lt;br /&gt;
* [[1D MLSM and FDM comparison]]&lt;br /&gt;
* [[:File:tech_report.pdf|Execution overheads due to clumsy types::technical report]] [[File:pdf-file.gif]]&lt;br /&gt;
* [[Solving sparse systems]]&lt;br /&gt;
* [[Eigen paralelization]]&lt;br /&gt;
&lt;br /&gt;
== Last changes ==&lt;br /&gt;
&amp;lt;news unique=1 limit = 5&amp;gt;&lt;br /&gt;
*{{{timeanddate}}} :: {{{title}}} &lt;br /&gt;
&lt;br /&gt;
&amp;lt;/news&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Miscellaneous ==&lt;br /&gt;
* FAQ  - [[Frequently asked questions]]. &lt;br /&gt;
* [[List of wiki contributors]]&lt;br /&gt;
* List of library contributors: [http://e6.ijs.si/medusa/about#about-contributors See the official website]&lt;br /&gt;
&lt;br /&gt;
== References ==&lt;br /&gt;
&lt;br /&gt;
For all related papers including conference contributions, monographs and book chapters check https://e6.ijs.si/ParallelAndDistributedSystems/publications/&lt;br /&gt;
&lt;br /&gt;
{{Box-round|title= Selected papers |&lt;br /&gt;
&lt;br /&gt;
[https://e6.ijs.si/ParallelAndDistributedSystems/publications/153678339.pdf M. Jančič, G. Kosec; Strong form mesh‑free hp‑adaptive solution of linear elasticity problem, Engineering with computers, vol. 39, 2023 [DOI: 10.1007/s00366-023-01843-6]]&lt;br /&gt;
&lt;br /&gt;
[https://e6.ijs.si/ParallelAndDistributedSystems/publications/98533123.pdf M. Depolli, J. Slak, G. Kosec; Parallel domain discretization algorithm for RBF-FD and other meshless numerical methods for solving PDEs, Computers &amp;amp; Structures, 2022 [DOI: 10.1016/j.compstruc.2022.106773]]&lt;br /&gt;
&lt;br /&gt;
[https://e6.ijs.si/ParallelAndDistributedSystems/publications/69777155.pdf J. Slak, G. Kosec; Medusa : A C++ library for solving PDEs using strong form mesh-free methods, ACM transactions on mathematical software, vol. 47, 2021 [DOI: 10.1145/3450966]]&lt;br /&gt;
&lt;br /&gt;
[https://e6.ijs.si/ParallelAndDistributedSystems/publications/56730115.pdf U. Duh, G. Kosec, J. Slak; Fast variable density node generation on parametric surfaces with application to mesh-free methods, SIAM journal on scientific computing, vol. 43, 2021 [DOI: 10.1137/20M1325642]]&lt;br /&gt;
&lt;br /&gt;
[https://e6.ijs.si/ParallelAndDistributedSystems/publications/52715011.pdf M. Jančič, J. Slak, G. Kosec; Monomial augmentation guidelines for RBF-FD from accuracy versus computational time perspective, Journal of scientific computing, vol. 87, 2021 [DOI: 10.1007/s10915-020-01401-y]&lt;br /&gt;
&lt;br /&gt;
[https://e6.ijs.si/ParallelAndDistributedSystems/publications/32782887.pdf J. Slak, G. Kosec; On generation of node distributions for meshless PDE discretizations, SIAM journal on scientific computing, vol. 41, 2019 [DOI: 10.1137/18M1231456]&lt;br /&gt;
&lt;br /&gt;
[https://e6.ijs.si/ParallelAndDistributedSystems/publications/32424999.pdf G. Kosec, J. Slak, M. Depolli, R. Trobec, K. Pereira, S. Tomar, T. Jacquemin, S. Bordas, M. Wahab; Weak and strong from meshless methods for linear elastic problem under fretting contact conditions, Tribology international, vol. 138, 2019]&lt;br /&gt;
&lt;br /&gt;
[https://e6.ijs.si/ParallelAndDistributedSystems/publications/32230439.pdf J. Slak, G. Kosec; Adaptive radial basis function-generated finite differences method for contact problems, International journal for numerical methods in engineering, vol. 119, 2019 [DOI: 10.1002/nme.6067]]&lt;br /&gt;
&lt;br /&gt;
[https://e6.ijs.si/ParallelAndDistributedSystems/publications/32388135.pdf M. Maksić, V. Djurica, A. Souvent, J. Slak, M. Depolli, G. Kosec; Cooling of overhead power lines due to the natural convection, International journal of electrical power &amp;amp; energy systems, 2019]&lt;br /&gt;
&lt;br /&gt;
[https://e6.ijs.si/ParallelAndDistributedSystems/publications/31107623.pdf J. Slak, G. Kosec; Refined meshless local strong form solution of Cauchy-Navier equation on an irregular domain, Engineering analysis with boundary elements, vol. 100, 2019]&lt;br /&gt;
&lt;br /&gt;
[https://e6.ijs.si/ParallelAndDistributedSystems/publications/29639719.pdf M. Depolli, G. Kosec; Assessment of differential evolution for multi-objective optimization in a natural convection problem solved by a local meshless method, Engineering optimization, 2017, vol. 49, no. 4, pp. 675-692]&lt;br /&gt;
&lt;br /&gt;
[https://e6.ijs.si/ParallelAndDistributedSystems/publications/29512743.pdf G. Kosec; A local numerical solution of a fluid-flow problem on an irregular domain, Advances in engineering software, vol. 120, 2018 [DOI: 10.1016/j.advengsoft.2016.05.010]]&lt;br /&gt;
&lt;br /&gt;
[https://e6.ijs.si/ParallelAndDistributedSystems/publications/27912487.pdf G. Kosec, R. Trobec; Simulation of semiconductor devices with a local numerical approach, Engineering analysis with boundary elements, 2015 [DOI: 10.1016/j.enganabound.2014.07.013]]&lt;br /&gt;
&lt;br /&gt;
[https://e6.ijs.si/ParallelAndDistributedSystems/publications/3218939.pdf G. Kosec, B. Šarler; Simulation of macrosegregation with mesosegregates in binary metallic casts by a meshless method, Engineering analysis with boundary elements]&lt;br /&gt;
&lt;br /&gt;
[http://comms.ijs.si/~gkosec/data/papers/27339815.pdf G. Kosec, M. Depolli, A. Rashkovska, R. Trobec; Super linear speedup in a local parallel meshless solution of thermo-fluid problem, Computers &amp;amp; Structures, vol. 133, 2014]&lt;br /&gt;
&lt;br /&gt;
[http://comms.ijs.si/~gkosec/data/papers/26785063.pdf G. Kosec, P. Zinterhof; Local strong form meshless method on multiple Graphics Processing Units, Computer modeling in engineering &amp;amp; sciences, vol. 91, 2013]&lt;br /&gt;
&lt;br /&gt;
[https://e6.ijs.si/ParallelAndDistributedSystems/publications/2599419.pdf G. Kosec, B. Šarler; Solution of a low Prandtl number natural convection benchmark by a local meshless method, International journal of numerical methods for heat &amp;amp; fluid flow]&lt;br /&gt;
&lt;br /&gt;
[http://comms.ijs.si/~gkosec/data/papers/EABE2499.pdf R. Trobec, G. Kosec, M. Šterk, B. Šarler; Comparison of local weak and strong form meshless methods for 2-D diffusion equation, Engineering analysis with boundary elements, vol. 36, 2012]&lt;br /&gt;
&lt;br /&gt;
[https://e6.ijs.si/ParallelAndDistributedSystems/publications/1905659.pdf G. Kosec, M. Založnik, B. Šarler, H. Combeau; A meshless approach towards solution of macrosegregation phenomena, Computers, materials &amp;amp; continua : CMC, vol. 22, 2011 ]&lt;br /&gt;
&lt;br /&gt;
[https://e6.ijs.si/ParallelAndDistributedSystems/publications/992507.pdf G. Kosec, B. Šarler; Solution of thermo-fluid problems by collocation with local pressure correction, International journal of numerical methods for heat &amp;amp; fluid flow, vol.18, 2008]&lt;br /&gt;
&lt;br /&gt;
R. Trobec, G. Kosec; Parallel scientific computing : theory, algorithms, and applications of mesh based and meshless methods, 2015&lt;br /&gt;
&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
==Related pages==&lt;br /&gt;
* http://e6.ijs.si/ParallelAndDistributedSystems/products/medusa/&lt;/div&gt;</summary>
		<author><name>ARogan</name></author>	</entry>

	</feed>