<?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.upr.si/IzpisGradiva.php?id=7729"><dc:title>Lattices on simplicial partitions</dc:title><dc:creator>Jaklič,	Gašper	(Avtor)
	</dc:creator><dc:creator>Kozak,	Jernej	(Avtor)
	</dc:creator><dc:creator>Knez,	Marjetka	(Avtor)
	</dc:creator><dc:creator>Vitrih,	Vito	(Avtor)
	</dc:creator><dc:creator>Žagar,	Emil	(Avtor)
	</dc:creator><dc:subject>numerical analysis</dc:subject><dc:subject>lattice</dc:subject><dc:subject>barycentric coordinates</dc:subject><dc:subject>simplicial partition</dc:subject><dc:description>In this paper, a ▫$(d+1)$▫-pencil lattices on a simplex in ▫${\mathbb{R}}^d$▫ are studied. The barycentric approach naturally extends the lattice from a simplex to a simplicial partition, providing a continuous piecewise polynomial interpolant over the extended lattice. The number of degrees of freedom is equal to the number of vertices of the simplicial partition. The constructive proof of thisfact leads to an efficient computer algorithm for the design of a lattice.</dc:description><dc:date>2010</dc:date><dc:date>2016-04-08 16:46:42</dc:date><dc:type>Delo ni kategorizirano</dc:type><dc:identifier>7729</dc:identifier><dc:language>sl</dc:language></rdf:Description></rdf:RDF>
