Lattices on simplicial partitions
نویسندگان
چکیده
In this paper, (d + 1)-pencil lattices on simplicial partitions in Rd 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.
منابع مشابه
Lattices on simplicial partitions which are not simply connected
In this paper, (d + 1)-pencil lattices on simplicial partitions in Rd, 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 slight partition topology changes that may appear afterwards a lattice has already been constructed.
متن کاملSimplicial Lipschitz optimization without the Lipschitz constant
In this paper we propose a new simplicial partition-based deterministic algorithm for global optimization of Lipschitz-continuous functions without requiring any knowledge of the Lipschitz constant. Our algorithm is motivated by the well-known Direct algorithm which evaluates the objective function on a set of points that tries to cover the most promising subregions of the feasible region. Almo...
متن کاملGeometric Aspects of the Simplicial Discretization of Maxwell’s Equations
Aspects of the geometric discretization of electromagnetic fields on simplicial lattices are considered. First, the convenience of the use of exterior differential forms to represent the field quantities through their natural role as duals (cochains) of the geometric constituents of the lattice (chains = nodes, edges, faces, volumes) is briefly reviewed. Then, the use of the barycentric subdivi...
متن کاملOrder Complexes of Noncomplemented Lattices Are Nonevasive
We reprove and generalize in a combinatorial way the result of A. Björner, [Bj81, Theorem 3.3], that order complexes of noncomplemented lattices are contractible, namely by showing that these simplicial complexes are in fact nonevasive, in particular collapsible.
متن کاملA Polyhedral Model of Partitions with Bounded Differences and a Bijective Proof of a Theorem of Andrews, Beck, and Robbins
The main result of this paper is a bijective proof showing that the generating function for partitions with bounded differences between largest and smallest part is a rational function. This result is similar to the closely related case of partitions with fixed differences between largest and smallest parts which has recently been studied through analytic methods by Andrews, Beck, and Robbins. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Computational Applied Mathematics
دوره 233 شماره
صفحات -
تاریخ انتشار 2010