On the usage of NURBS as interface representation in free‐surface flows

When simulating free‐surface flows using the finite element method, there are many cases where the governing equations require information which must be derived from the available discretized geometry. Examples are curvature or normal vectors. The accurate computation of this information directly from the finite element mesh often requires a high degree of refinement—which is not necessarily required to obtain an accurate flow solution. As a remedy and an option to be able to use coarser meshes, the representation of the free surface using non‐uniform rational B‐splines (NURBS) curves or surfaces is investigated in this work. The advantages of a NURBS parameterization in comparison with the standard approach are discussed. In addition, it is explored how the pressure jump resulting from surface tension effects can be handled using doubled interface nodes. Numerical examples include the computation of surface tension in a two‐phase flow as well as the computation of normal vectors as a basis for mesh deformation methods. For these examples, the improvement of the numerical solution compared with the standard approaches on identical meshes is shown. Copyright © 2011 John Wiley & Sons, Ltd.     

标量场与电磁场相互作用体系中的Gasimir效应

摘要本文用Feynmann路径积分方法,研究了一种U(1)规范场理论中的Casimir效应。在一圈图近似下,计算了带电标量场在两个平行的理想金属板之间的Casimir能,并对低维情况进行了讨论。     

The Perturbation of the Interface of the Two-dimensional Diffraction Problem and an Approximating Muskat Modal

ln this paper, a new transformation is found out to straighten the interface Γ_2 x = f(y), f ∈ C^{2+a}([0, a]), f_y|_y =0, δ < f < l-δ,δ > 0,δ,l=constants and a perturbation of the interface is considered for a two dimensional diffraction problem. And the existence, uniqueness and regularity of an appeoximating Muskat model are proved.     

The Sample Average Approximation Method Applied to Stochastic Routing Problems: A Computational Study

The sample average approximation (SAA) method is an approach for solving stochastic optimization problems by using Monte Carlo simulation. In this technique the expected objective function of the stochastic problem is approximated by a sample average estimate derived from a random sample. The resulting sample average approximating problem is then solved by deterministic optimization techniques. The process is repeated with different samples to obtain candidate solutions along with statistical estimates of their optimality gaps.We present a detailed computational study of the application of the SAA method to solve three classes of stochastic routing problems. These stochastic problems involve an extremely large number of scenarios and first-stage integer variables. For each of the three problem classes, we use decomposition and branch-and-cut to solve the approximating problem within the SAA scheme. Our computational results indicate that the proposed method is successful in solving problems with up to 2¹⁶⁹⁴ scenarios to within an estimated 1.0% of optimality. Furthermore, a surprising observation is that the number of optimality cuts required to solve the approximating problem to optimality does not significantly increase with the size of the sample. Therefore, the observed computation times needed to find optimal solutions to the approximating problems grow only linearly with the sample size. As a result, we are able to find provably near-optimal solutions to these difficult stochastic programs using only a moderate amount of computation time.     

Bivariate Free Knot Splines

We consider the least squares approximation of gridded 2D data by tensor product splines with free knots. The smoothing functional to be minimized—a generalization of the univariate Schoenberg functional—is chosen in such a way that the solution of the bivariate problem separates into the solution of a sequence of univariate problems in case of fixed knots. The resulting optimization problem is a constrained separable least squares problem with tensor product structure. Based on some ideas developed by the authors for the univariate case, an efficient method for solving the specially structured 2D problem is proposed, analyzed and tested on hand of some examples from the literature.     

Shape Optimization and Fictitious Domain Approach for Solving Free Boundary Problems of Bernoulli Type

This contribution deals with an efficient method for the numerical realization of the exterior and interior Bernoulli free boundary problems. It is based on a shape optimization approach. The state problems are solved by a fictitious domain solver using boundary Lagrange multipliers.     

Computing homotopic shortest paths in the plane

We address the problem of computing homotopic shortest paths in the presence of obstacles in the plane. Problems on homotopy of paths received attention very recently [Cabello et al., in: Proc. 18th Annu. ACM Sympos. Comput. Geom., 2002, pp. 160–169; Efrat et al., in: Proc. 10th Annu. European Sympos. Algorithms, 2002, pp. 411–423]. We present two output-sensitive algorithms, for simple paths and non-simple paths. The algorithm for simple paths improves the previous algorithm [Efrat et al., in: Proc. 10th Annu. European Sympos. Algorithms, 2002, pp. 411–423]. The algorithm for non-simple paths achieves O(log²n) time per output vertex which is an improvement by a factor of O(n/log²n) of the previous algorithm [Hershberger, Snoeyink, Comput. Geom. Theory Appl. 4 (1994) 63–98], where n is the number of obstacles. The running time has an overhead O(n²⁺) for any positive constant . In the case k<n²⁺, where k is the total size of the input and output, we improve the running to O((n+k+(nk)^2/3)log^O(1)n).     

Free, Isometric Circle Actions on Compact Symmetric Spaces

Let S=G/K be a strongly irreducible, simply connected, compact symmetric space and let be its group of isometries. We classify the symmetric spaces among these that admit free, isometric circle actions. The existence of such actions is important in constructing examples of manifolds with positive sectional curvature.     

Sets with two associative operations

In this paper we consider duplexes, which are sets with two associative binary operations. Dimonoids in the sense of Loday are examples of duplexes. The set of all permutations carries a structure of a duplex. Our main result asserts that it is a free duplex with an explicitly described set of generators. The proof uses a construction of the free duplex with one generator by planary trees.