𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Lattices on simplicial partitions

✍ Scribed by Gašper Jaklič; Jernej Kozak; Marjeta Krajnc; Vito Vitrih; Emil Žagar

Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
880 KB
Volume
233
Category
Article
ISSN
0377-0427

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper, (d + 1)-pencil lattices on simplicial partitions in 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 this fact leads to an efficient computer algorithm for the design of a lattice.

📜 SIMILAR VOLUMES

Lattices on simplicial partitions which
Lattices on simplicial partitions which are not simply connected
✍ Vito Vitrih 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 439 KB

In this paper, (d + 1)-pencil lattices on simplicial partitions in R d , which are not simply connected, are studied. It is shown, how the fact that a partition is not simply connected can be used to increase the flexibility of a lattice. A local modification algorithm is developed also to deal with

Simplicial elimination schemes, extremal
Simplicial elimination schemes, extremal lattices and maximal antichain lattices
✍ Michel Morvan; Lhouari Nourine 📂 Article 📅 1996 🏛 Springer Netherlands 🌐 English ⚖ 872 KB

We compared the clinical picture of sarcoidosis in patients diagnosed at Mjölbolsta hospital in Finland in 1955-1987 with those diagnosed in Sapporo in 1964-1988. The female:male ratios showed a slight female predominance. The mean age (SD) at diagnosis was 41.5 (13.0) years at Mjölbolsta and 30.0 (

Partitions of large Boolean lattices
Partitions of large Boolean lattices
✍ Zbigniew Lonc 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 482 KB

Let 2" be the ordered set obtained from the Boolean lattice 2" by deleting both the greatest and the least elements. Definef(n) to be the minimum number k such that there is a partition of 2" into k antichains of the same size except for at most one antichain of a smaller size. In the paper we exami

Algorithmic copositivity detection by si
Algorithmic copositivity detection by simplicial partition
✍ Stefan Bundfuss; Mirjam Dür 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 161 KB

We present new criteria for copositivity of a matrix, i.e., conditions which ensure that the quadratic form induced by the matrix is nonnegative over the nonnegative orthant. These criteria arise from the representation of the quadratic form in barycentric coordinates with respect to the standard si