<?xml version="1.0"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:dc="http://purl.org/dc/elements/1.1/"><rdf:Description rdf:about="https://repozitorij.uni-lj.si/IzpisGradiva.php?id=121511"><dc:title>Adaptive RBF-FD method</dc:title><dc:creator>Slak,	Jure	(Avtor)
	</dc:creator><dc:creator>Kosec,	Gregor	(Mentor)
	</dc:creator><dc:subject>meshfree methods</dc:subject><dc:subject>meshless methods</dc:subject><dc:subject>radial basis functions</dc:subject><dc:subject>partial differential equations</dc:subject><dc:subject>adaptivity</dc:subject><dc:subject>refinement</dc:subject><dc:subject>node generation</dc:subject><dc:subject>finite differences</dc:subject><dc:subject>scattered data</dc:subject><dc:description>Radial-basis-function-generated finite differences (RBF-FD) is a method for solving partial differential equations (PDEs), which is developed into a fully automatic adaptive method during the course of this work. RBF-FD is a strong form meshless method, which means that it does not require a mesh of the problem domain, but uses only a set of nodes as the basis for the discretization. A large part of this PhD is dedicated to algorithms for meshless node generation. A new algorithm for construction of variable density meshless discretizations in arbitrary spatial dimensions is developed. It can generate points in the interior and on the boundary, has provable minimal spacing requirements, can generate $N$ points in $O(N\log N)$ time and the resulting node sets are compatible with RBF-FD. This algorithm is used as the basis of a newly proposed $h$-adaptive procedure for elliptic problems. The behavior of the procedure is analyzed on classical 2D and 3D adaptive Poisson problems. Furthermore, several contact problems from linear elasticity are solved, demonstrating successful adaptive derefinement and refinement, with the densest parts of the discretization being more than a million times denser than the coarsest. Finally, the software developed for this work and broader research is presented and published online as an open source library for solving PDEs with strong form methods.</dc:description><dc:date>2020</dc:date><dc:date>2020-10-13 11:31:32</dc:date><dc:type>Doktorsko delo/naloga</dc:type><dc:identifier>121511</dc:identifier><dc:language>sl</dc:language></rdf:Description></rdf:RDF>
