The determination of direct control algorithms activation moments using a real-time scheduling algorithm
We prove the discrete compactness property of the edge elements of any order on a class of anisotropically refined meshes on polyhedral domains. The meshes, made up of tetrahedra, have been introduced in [Th. Apel and S. Nicaise, Math. Meth. Appl. Sci. 21 (1998) 519–549]. They are appropriately graded near singular corners and edges of the polyhedron.
We prove the discrete compactness property of the edge elements of any order on a class of anisotropically refined meshes on polyhedral domains. The meshes, made up of tetrahedra, have been introduced in [Th. Apel and S. Nicaise, Math. Meth. Appl. Sci. 21 (1998) 519–549]. They are appropriately graded near singular corners and edges of the polyhedron.
This paper provides an equivalent characterization of the discrete maximum principle for Galerkin solutions of general linear elliptic problems. The characterization is formulated in terms of the discrete Green’s function and the elliptic projection of the boundary data. This general concept is applied to the analysis of the discrete maximum principle for the higher-order finite elements in one-dimension and to the lowest-order finite elements on simplices of arbitrary dimension. The paper surveys...
Recientemente, Nairn, Peters y Lutterkort han acotado la distancia entre una curva de Bézier y su polígono de control en términos de las diferencias entre los puntos de control. Mostramos cómo extender dichas cotas a muchos tipos de curvas utilizadas en el Diseño Geométrico.