For a function defined on a convex set in a Euclidean space, midpoint convexity is the property requiring that the value of the function at the midpoint of any line segment is not greater than the average of its values at the endpoints of the line segment. Midpoint convexity is a well-known characterization of ordinary convexity under very mild assumptions. For a function defined on the integer...

Midpoint subdivision generalizes the Lane-Riesenfeld algorithm for uniform tensor product splines and can also be applied to non regular meshes. For example, midpoint subdivision of degree 2 is a specific Doo-Sabin algorithm and midpoint subdivision of degree 3 is a specific Catmull-Clark algorithm. In 2001, Zorin and Schröder were able to prove C1-continuity for midpoint subdivision surfaces a...

Specific configurations of horizontal and vertical bending magnets are given that, when acting on the spin polarization vector of a particle beam, generate a group of 24 operators isomorphic to the group of rotational symmetries of a cube, known as the octahedral group. Some of these configurations have the feature of converting transversely polarized beams to longitudinally polarized beams (or...

In this paper, we introduce two generalizations of midpoint subdivision and analyze the smoothness of the resulting subdivision surfaces at regular and extraordinary points. The smoothing operators used in midpoint and mid-edge subdivision connect the midpoints of adjacent faces or of adjacent edges, respectively. An arbitrary combination of these two operators and the refinement operator that ...

The leapfrog method is popular because of its good stability when solving partial differential equations with oscillatory solutions. “It has the disadvantage that the solution at odd time steps tends to drift farther and farther from the solution for even time steps, so it is common to stop the integration every twenty time steps or so and reinitialize with the first order forward Euler method ...

The equivalent, second equivalent and (simply) modi®ed equations for the implicit midpoint rule are shown to be asymptotically equivalent in the sense that an asymptotic analysis of these equations with the time step size as small parameter yields exactly the same results; for linear problems with constant coecients, they are also equivalent to the original ®nite di€erence scheme. Straightforw...