Lupa

Iskanje po repozitoriju Pomoč

A- | A+ | Natisni
Iskalni niz: išči po
išči po
išči po
išči po
* po starem in bolonjskem študiju

Opcije:
  Ponastavi


11 - 20 / 40
Na začetekNa prejšnjo stran1234Na naslednjo stranNa konec
11.
12.
13.
14.
15.
16.
Three-pencil lattice on triangulations
Gašper Jaklič, Jernej Kozak, Marjetka Knez, Vito Vitrih, Emil Žagar, 2007, objavljeni znanstveni prispevek na konferenci

Opis: 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.
Ključne besede: numerical analysis, lattice, barycentric coordinates, triangulations, interpolation
Objavljeno v RUP: 03.04.2017; Ogledov: 2047; Prenosov: 84
URL Povezava na celotno besedilo

17.
Barycentric coordinates for Lagrange interpolation over lattices on a simplex
Gašper Jaklič, Jernej Kozak, Marjetka Knez, Vito Vitrih, Emil Žagar, 2008, objavljeni znanstveni prispevek na konferenci

Opis: 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.
Ključne besede: numerical analysis, lattice, barycentric coordinates, simplex, interpolation
Objavljeno v RUP: 03.04.2017; Ogledov: 2161; Prenosov: 138
URL Povezava na celotno besedilo

18.
On geometric Lagrange interpolation by quadratic parametric patches
Gašper Jaklič, Jernej Kozak, Marjetka Knez, Vito Vitrih, Emil Žagar, 2008, izvirni znanstveni članek

Opis: In the paper, the geometric Lagrange interpolation by quadratic parametric patches is considered. The freedom of parameterization is used to raise the number of interpolated points from the usual 6 up to 10, i.e., the number of points commonly interpolated by a cubic patch. At least asymptotically, the existence of a quadratic geometric interpolant is confirmed for data taken on a parametric surface with locally nonzero Gaussian curvature and interpolation points based upon a three-pencil lattice. Also, the asymptotic approximation order 4 is established.
Ključne besede: numerična analiza, interpolacija, aproksimacija, parametrična ploskev, numerical analysis, interpolation, approximation, parametric surface
Objavljeno v RUP: 03.04.2017; Ogledov: 2176; Prenosov: 138
URL Povezava na celotno besedilo

19.
Geometric Lagrange interpolation by planar cubic Pythagorean-hodograph curves
Gašper Jaklič, Jernej Kozak, Marjetka Knez, Vito Vitrih, Emil Žagar, 2008, izvirni znanstveni članek

Opis: In this paper, the geometric Lagrange interpolation of four points by planar cubic Pythagorean-hodograph (PH) curves is studied. It is shown that such an interpolatory curve exists provided that the data polygon, formed by the interpolation points, is convex, and satisfies an additional restriction on its angles. The approximation order is $4$. This gives rise to a conjecture that a PH curve of degree ▫$n$▫ can, under some natural restrictions on data points, interpolate up to ▫$n+1$▫ points.
Ključne besede: numerical analysis, planar curve, PH curve, geometric interpolation, Lagrange interpolation
Objavljeno v RUP: 03.04.2017; Ogledov: 2068; Prenosov: 131
URL Povezava na celotno besedilo

20.
Lattices on simplicial partitions
Gašper Jaklič, Jernej Kozak, Marjetka Knez, Vito Vitrih, Emil Žagar, 2010, objavljeni znanstveni prispevek na konferenci

Opis: 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.
Ključne besede: numerical analysis, lattice, barycentric coordinates, simplicial partition
Objavljeno v RUP: 03.04.2017; Ogledov: 2062; Prenosov: 135
URL Povezava na celotno besedilo

Iskanje izvedeno v 0.06 sek.
Na vrh
Logotipi partnerjev Univerza v Mariboru Univerza v Ljubljani Univerza na Primorskem Univerza v Novi Gorici