Lupa

Search the repository Help

A- | A+ | Print
Query: search in
search in
search in
search in
* old and bologna study programme

Options:
  Reset


1 - 3 / 3
First pagePrevious page1Next pageLast page
1.
Three-pencil lattice on triangulations
Gašper Jaklič, Jernej Kozak, Marjetka Knez, Vito Vitrih, Emil Žagar, 2007, published scientific conference contribution

Abstract: In this paper, three-pencil lattices on triangulations are studied. The explicit representation of a lattice, based upon barycentric coordinates, enables us to construct lattice points in a simple and numerically stable way. Further, this representation carries over to triangulations in a natural way. The construction is based upon group action of S 3 on triangle vertices, and it is shown that the number of degrees of freedom is equal to the number of vertices of the triangulation.
Keywords: numerical analysis, lattice, barycentric coordinates, triangulations, interpolation
Published in RUP: 03.04.2017; Views: 2200; Downloads: 84
URL Link to full text

2.
Barycentric coordinates for Lagrange interpolation over lattices on a simplex
Gašper Jaklič, Jernej Kozak, Marjetka Knez, Vito Vitrih, Emil Žagar, 2008, published scientific conference contribution

Abstract: In this paper, a ▫$(d+1)$▫-pencil lattice on a simplex in ▫${\mathbb{R}}^d$▫ is studied. The lattice points are explicitly given in barycentric coordinates. This enables the construction and the efficient evaluation of the Lagrange interpolating polynomial over a lattice on a simplex. Also, the barycentric representation, based on shape parameters, turns out to be appropriate for the lattice extension from a simplex to a simplicial partition.
Keywords: numerical analysis, lattice, barycentric coordinates, simplex, interpolation
Published in RUP: 03.04.2017; Views: 2326; Downloads: 139
URL Link to full text

3.
Lattices on simplicial partitions
Gašper Jaklič, Jernej Kozak, Marjetka Knez, Vito Vitrih, Emil Žagar, 2010, published scientific conference contribution

Abstract: 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.
Keywords: numerical analysis, lattice, barycentric coordinates, simplicial partition
Published in RUP: 03.04.2017; Views: 2233; Downloads: 135
URL Link to full text

Search done in 0 sec.
Back to top
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica