No abstract uploaded!

No abstract uploaded!

The spectral order on$R$^{$n$}induces a natural partial ordering on the manifold $\mathcal{H}_{n}$ of monic hyperbolic polynomials of degree$n$. We show that all differential operators of Laguerre–Pólya type preserve the spectral order. We also establish a global monotony property for infinite families of deformations of these operators parametrized by the space ℓ^{∞}of real bounded sequences. As a consequence, we deduce that the monoid $\mathcal{A}^{\prime}$ of linear operators that preserve averages of zero sets and hyperbolicity consists only of differential operators of Laguerre–Pólya type which are both extensive and isotonic. In particular, these results imply that any hyperbolic polynomial is the global minimum of its $\mathcal{A}^{\prime}$ -orbit and that Appell polynomials are characterized by a global minimum property with respect to the spectral order.

A finite element method for computing viscous incompressible flows based on the gauge formulation introduced in [Weinan E, Liu J-G. Gauge method for viscous incompressible flows. Journal of Computational Physics (submitted)] is presented. This formulation replaces the pressure by a gauge variable. This new gauge variable is a numerical tool and differs from the standard gauge variable that arises from decomposing a compressible velocity field. It has the advantage that an additional boundary condition can be assigned to the gauge variable, thus eliminating the issue of a pressure boundary condition associated with the original primitive variable formulation. The computational task is then reduced to solving standard heat and Poisson equations, which are approximated by straightforward, piecewise linear (or higher-order) finite elements. This method can achieve high-order accuracy at a cost comparable with that of solving standard heat and Poisson equations. It is naturally adapted to complex geometry and it is much simpler than traditional finite element methods for incompressible flows. Several numerical examples on both structured and unstructured grids are presented. Copyright

In this paper, we consider a class of optimization problems of minimizing a (at least) twice continuously dierentiable function (probably nonconvex) f(x) : Rn ! R over a product of multiple balls/spheres constraints. Upon rescaling the balls/spheres, we cast without loss of generality such class of minimization problems in the following form: (BCOP) 8>< >: min x2Rn f(x) s:t: ci(x) := kx[i]k2 􀀀 1 = 0; i 2 E; ci(x) := kx[i]k2 􀀀 1  0; i 2 I; where E = f1; 2; : : : ;m1g, I = fm1 + 1;m1 + 2; : : : ;mg, x[i] 2 Rpi , x = (xT [1]; xT [2]; : : : ; xT [m])T , n = Pm i=1 pi, and k
k stands for the `2 vector norm. Here, we introduce the notation x[i] 2 Rpi to represent the ith subvector of x 2 Rn and formulate the product of multiple ball/sphere constraints as a set of equality and inequality constraints. To simplify subsequent presentation, we call the above programming the ball/sphere constrained optimization problem (BCOP). We emphasize that this problem does not allow overlap among the variables x[i] and therefore the constraints are separable. However, these variables x[i] may be linked together through the objective function f(x).