Gauss point mass lumping schemes for Maxwell's equations

Finite element and finite difference methods for approximating the Maxwell system propagate numerical waves with slightly incorrect velocities, and this results in phase error in the computed solution. Indeed this error limits the type of problem that can be solved, because phase error accumulates during the computation and eventually destroys the solution. Here we propose a family of mass-lumped finite element schemes using edge elements. We emphasize in particular linear elements that are equivalent to the standard Yee FDTD scheme, and cubic elements that have superior phase accuracy. We prove theorems that allow us to perform a dispersion analysis of the two common families of edge elements on rectilinear grids. A result of this analysis is to provide some justification for the choice of the particular family we use. We also provide a limited selection of numerical results that show the efficiency of our scheme. © 1998 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 14: 63–88, 1998     

Improved probabilistic point estimation schemes for uncertainty analysis

The probabilistic point estimation (PPE) methods replace the probability distribution of the random parameters of a model with a finite number of discrete points in sample space selected in such a way to preserve limit probabilistic information of involved random parameters. Most PPE methods developed thus far match the distribution of random parameters up to the third statistical moment and, in general, could provide reasonable accurate estimation only for the first two statistical moments of model output. This study proposes two optimization-based point selection schemes for the PPE methods to enhance the accuracy of higher-order statistical moments estimation for model output. Several test models of varying degrees of complexity and nonlinearity are used to examine the performance of the proposed point selection schemes. The results indicate that the proposed point selection schemes provide significantly more accurate estimation of model output uncertainty features than the existing schemes.     

Closest point of the cut locus to submanifold

This paper deals with some of the matching and non-matching properties of two minimal geodesics from a cut point, which is not a focal point, to the points of the submanifold. Closest cut point to the submanifold has been obtained under some additional assumptions.     

Local structure theorems for smooth maps of formal schemes

We continue our study on infinitesimal lifting properties of maps between locally noetherian formal schemes started in [L. Alonso Tarrío, A. Jeremías López, M. Pérez Rodríguez, Infinitesimal lifting and Jacobi criterion for smoothness on formal schemes, Comm. Alg. 35 (2007) 1341-1367]. In this paper, we focus on some properties which arise specifically in the formal context. In this vein, we make a detailed study of the relationship between the infinitesimal lifting properties of a morphism of formal schemes and those of the corresponding maps of usual schemes associated to the directed systems that define the corresponding formal schemes. Among our main results, we obtain the characterization of completion morphisms as pseudo-closed immersions that are flat. Also, the local structure of smooth and étale morphisms between locally noetherian formal schemes is described: the former factors locally as a completion morphism followed by a smooth adic morphism and the latter as a completion morphism followed by an étale adic morphism.     

Pure strategy Nash equilibrium points and the Lefschetz fixed point theorem

A pure strategy Nash equilibrium point existence theorem is established for a class ofn-person games with possibly nonacyclic (e.g. disconnected) strategy sets. The principal tool used in the proof is a Lefschetz fixed point theorem for multivalued maps, due to Eilenberg and Montgomery, which extends their better known. Eilenberg-Montgomery fixed point theorem (EMT) [Eilenberg/Montgomery, Theorem 1, p. 215] to nonacyclic spaces. Special cases of the existence theorem are also discussed.     

Pivoting rules and redundancy schemes in extreme point enumeration

We give an overview over how problems connected to degeneracy have been attacked in the literature in connection with extreme point enumeration in a convex polyhedron. We treat both the question of unique pivots and how to attach only one basis to each extreme point.Work supported by The Norwegian Fisheries Research Council and The Norwegian Research Council for Science and the Humanities.     

A classification of the weighting schemes in reference point procedures for multiobjective programming

The reference point-based methods form one of the most widely used class of interactive procedures for multiobjective programming problems. The achievement scalarizing functions used to determine the solutions at each iteration usually include weights. In this paper, we have analysed nine weighting schemes from the preferential point of view, that is, examining their performance in terms of which reference values are given more importance and why. As a result, we have carried out a systematic classification of the schemes attending to their preferential meaning. This way, we distinguish pure normalizing schemes from others where the weights have a preferential interpretation. This preferential behaviour can be either designed (thus, predetermined) by the method, or decided by the decision maker. Besides, several figures have been used to illustrate the way each scheme works. This paper enables the potential users to choose the most appropriate scheme for each case.     

Coherent measures and the existence of smooth Lyapunov 1-forms for flows

Let a smooth vector field V on a smooth closed manifold M be given and let Z⊂M be an isolated invariant set for the flow of V. In this situation, we give a necessary and sufficient condition for the existence of a Lyapunov 1-form for (V,Z) in terms of the relative asymptotic cycles associated with certain invariant measures of the flow.     

Peak point theorems for uniform algebras on smooth manifolds

It was once conjectured that if A is a uniform algebra on its maximal ideal space X, and if each point of X is a peak point for A, then A = C(X). This peak point conjecture was disproved by Brian Cole in 1968. However, Anderson and Izzo showed that the peak point conjecture does hold for uniform algebras generated by smooth functions on smooth two-manifolds with boundary. The corresponding assertion for smooth three-manifolds is false, but Anderson, Izzo, and Wermer established a peak point theorem for polynomial approximation on real-analytic three-manifolds with boundary. Here we establish a more general peak point theorem for real-analytic three-manifolds with boundary analogous to the two-dimensional result. We also show that if A is a counterexample to the peak point conjecture generated by smooth functions on a manifold of arbitrary dimension, then the essential set for A has empty interior.     

The sum of the Betti numbers of smooth Hilbert schemes

Journal of Algebraic Combinatorics - Recently, Skjelnes and Smith classified which Hilbert schemes on projective space are smooth in terms of integer partitions $$\lambda = (\lambda _1,\ldots...     

Arithmetic families of smooth surfaces and equisingularity of embedded schemes

This article deals with the foundations of a theory of equisingularity for families of zero-dimensional sheaves of ideals on smooth algebraic surfaces, in the arithmetic context, i.e., where one works with schemes defined over Dedekind rings. Here, different equisingularity conditions are analyzed and compared, based on one of the following requirements: 1) each member of the the family has the same desingularization tree, 2) the family admits a simultaneous desingularization, 3) a naturally associated family of curves is equisingular. Similar conditions had been investigated, in the context of Complex Local Analytic Geometry, by J. J. Risler. Received: 17 November 1997 / Revised version: 19 April 1999     

Universal bounds on the selfaveraging of random diffraction measures

 We consider diffraction at random point scatterers on general discrete point sets in ℝ^ν, restricted to a finite volume. We allow for random amplitudes and random dislocations of the scatterers. We investigate the speed of convergence of the random scattering measures applied to an observable towards its mean, when the finite volume tends to infinity. We give an explicit universal large deviation upper bound that is exponential in the number of scatterers. The rate is given in terms of a universal function that depends on the point set only through the minimal distance between points, and on the observable only through a suitable Sobolev-norm. Our proof uses a cluster expansion and also provides a central limit theorem. Received: 10 October 2001 / Revised version: 26 January 2003 / Published online: 15 April 2003 Work supported by the DFG Mathematics Subject Classification (2000): 78A45, 82B44, 60F10, 82B20 Key words or phrases: Diffraction theory – Random scatterers – Random point sets – Quasicrystals – Large deviations – Cluster expansions