Imaginary quadratic function fields

In Bautista-Ancona and Diaz-Vargas (2006) [B-D] a characterization and complete listing is given of the imaginary quadratic extensions K of k(x), where k is a finite field, in which the ideal class group has exponent two and the infinite prime of k(x) ramifies. The objective of this work is to give a characterization and list of these kind of extensions but now considering the case in which the infinite prime of k(x) is inert in K. Thus, we get all the imaginary quadratic extensions of k(x), in which the ideal class group has exponent two.     

Subgrid-scale contributions to Lagrangian time correlations in isotropic turbulence

The application of large-eddy simulation （LES） to particle-laden turbulence raises such a fundamental question as whether the LES with a subgrid scale （SGS） model can correctly predict Lagrangian time correlations （LTCs）. Most of the currently existing SGS models are constructed based on the energy budget equations. Therefore, they are able to correctly predict energy spectra, but they may not ensure the correct prediction on the LTCs. Previous researches investigated the effect of the SGS modeling on the Eulerian time correlations. This paper is devoted to study the LTCs in LES. A direct numerical simulation （DNS） and the LES with a spectral eddy viscosity model are performed for isotropic turbulence and the LTCs are calculated using the passive vector method. Both a priori and a posteriori tests are carried out. It is observed that the subgrid;scale contributions to the LTCs cannot be simply ignored and the LES overpredicts the LTCs than the DNS. It is concluded from the straining hypothesis that an accurate prediction of enstrophy spectra is most critical to the prediction of the LTCs.     

The number of rooted Eulerian planar maps

In this paper we provide a solution of the functional equation unsolved in the paper, by the second author, "On functional equations arising from map enumerations" that appeared in Discrete Math, 123: 93-109 (1993). It is also the number of combinatorial distinct rooted general eulerian planar maps with the valency of root-vertex, the number of non-root vertices and non-root faces of the maps as three parameters. In particular, a result in the paper, by the same author, "On the number of eulerian planar map...     

Barbilian’s metrization procedure in the plane yields either Riemannian or Lagrange generalized metrics

In the present paper we answer two questions raised by Barbilian in 1960. First, we study how far can the hypothesis of Barbilian’s metrization procedure can be relaxed. Then, we prove that Barbilian’s metrization procedure in the plane generates either Riemannian metrics or Lagrance generalized metrics not reducible to Finslerian or Langrangian metrics.     

Comparison of Lagrangian bounds for one class of generalized assignment problems

Classical and modified Lagrangian bounds for the optimal value of optimization problems with a double decomposable structure are examined. For the class of generalized assignment problems, this property of constraints is used to design a Benders algorithm for solving the modified dual problem. Numerical results are presented that compare the quality of classical and modified bounds.     

Comparison of bundle and classical column generation

When a column generation approach is applied to decomposable mixed integer programming problems, it is standard to formulate and solve the master problem as a linear program. Seen in the dual space, this results in the algorithm known in the nonlinear programming community as the cutting-plane algorithm of Kelley and Cheney-Goldstein. However, more stable methods with better theoretical convergence rates are known and have been used as alternatives to this standard. One of them is the bundle method; our aim is to illustrate its differences with Kelley’s method. In the process we review alternative stabilization techniques used in column generation, comparing them from both primal and dual points of view. Numerical comparisons are presented for five applications: cutting stock (which includes bin packing), vertex coloring, capacitated vehicle routing, multi-item lot sizing, and traveling salesman. We also give a sketchy comparison with the volume algorithm. This research has been supported by Inria New Investigation Grant “Convex Optimization and Dantzig-Wolfe Decomposition”.     

Local exact Lagrangian controllability of the Burgers viscous equation

We study and give the definition of the exact Lagrangian controllability of the viscous Burgers equation and prove a local result. We give similar results for the heat equation in dimension 1.     

Augmented Lagrangian methods under the constant positive linear dependence constraint qualification

Two Augmented Lagrangian algorithms for solving KKT systems are introduced. The algorithms differ in the way in which penalty parameters are updated. Possibly infeasible accumulation points are characterized. It is proved that feasible limit points that satisfy the Constant Positive Linear Dependence constraint qualification are KKT solutions. Boundedness of the penalty parameters is proved under suitable assumptions. Numerical experiments are presented. The authors were supported by PRONEX - CNPq / FAPERJ E-26 / 171.164/2003 - APQ1, FAPESP (Grants 2001/04597-4, 2002/00094-0, 2003/09169-6, 2002/00832-1 and 2005/56773-1) and CNPq.     

An efficient ghost fluid method for compressible multifluids in Lagrangian coordinate

In this paper, we present an extended ghost fluid method (GFM) for computations of inviscid compressible multifluids in Lagrangian coordinate. That is, we capture the appropriate interface conditions by defining a fluid that has the velocity and the pressure of the real fluid at each point, but the entropy or the internal energy of some other fluid. Meanwhile, a single-fluid solver, CWENO-type central-upwind scheme, is developed in Lagrangian coordinate. The high resolution and the non-oscillatory quality of the scheme can be verified by solving several numerical experiments.     

High‐order 𝒞1 finite‐element interpolating schemes—Part I: Semi‐Lagrangian linear advection

This paper is devoted to the development of accurate high‐order interpolating schemes for semi‐Lagrangian advection. The characteristic‐Galerkin formulation is obtained by using a semi‐Lagrangian temporal discretization of the total derivative. The semi‐Lagrangian method requires high‐order interpolators for accuracy. A class of ??¹ finite‐element interpolating schemes is developed and two semi‐Lagrangian methods are considered by tracking the feet of the characteristic lines either from the interpolation or from the integration nodes. Numerical stability and analytical results quantifying the amount of artificial viscosity induced by the two methods are presented in the case of the one‐dimensional linear advection equation, based on the modified equation approach. Results of test problems to simulate the linear advection of a cosine hill illustrate the performance of the proposed approach. Copyright © 2007 John Wiley & Sons, Ltd.