A new well‐balanced Hermite weighted essentially non‐oscillatory scheme for shallow water equations

Hermite weighted essentially non‐oscillatory (HWENO) methods were introduced in the literature, in the context of Euler equations for gas dynamics, to obtain high‐order accuracy schemes characterized by high compactness (e.g. Qiu and Shu, J. Comput. Phys. 2003; 193 :115). For example, classical fifth‐order weighted essentially non‐oscillatory (WENO) reconstructions are based on a five‐cell stencil whereas the corresponding HWENO reconstructions are based on a narrower three‐cell stencil. The compactness of the schemes allows easier treatment of the boundary conditions and of the internal interfaces. To obtain this compactness in HWENO schemes both the conservative variables and their first derivatives are evolved in time, whereas in the original WENO schemes only the conservative variables are evolved. In this work, an HWENO method is applied for the first time to the shallow water equations (SWEs), including the source term due to the bottom slope, to obtain a fourth‐order accurate well‐balanced compact scheme. Time integration is performed by a strong stability preserving the Runge–Kutta method, which is a five‐step and fourth‐order accurate method. Besides the classical SWE, the non‐homogeneous equations describing the time and space evolution of the conservative variable derivatives are considered here. An original, well‐balanced treatment of the source term involved in such equations is developed and tested. Several standard one‐dimensional test cases are used to verify the high‐order accuracy, the C‐property and the good resolution properties of the model. Copyright © 2010 John Wiley & Sons, Ltd.     

Boundary value problems on weighted networks

We present here a systematic study of general boundary value problems on weighted networks that includes the variational formulation of such problems. In particular, we obtain the discrete version of the Dirichlet Principle and we apply it to the analysis of the inverse problem of identifying the conductivities of the network in a very general framework. Our approach is based on the development of an efficient vector calculus on weighted networks which mimetizes the calculus in the smooth case. The key tool is an adequate construction of the tangent space at each vertex. This allows us to consider discrete vector fields, inner products and general metrics. Then, we obtain discrete versions of derivative, gradient, divergence and Laplace-Beltrami operators, satisfying analogous properties to those verified by their continuous counterparts. On the other hand we develop the corresponding integral calculus that includes the discrete versions of the Integration by Parts technique and Green’s Identities. Finally, we apply our discrete vector calculus to analyze the consistency of difference schemes used to solve numerically a Robin boundary value problem in a square.     

无源高温超导磁浮轴承两种方案比较

无源磁浮轴承的优点是结构简单、造价低廉、无需有源控制。文中探讨了两种无源磁浮轴承的方案 ;对两种方案的悬浮力、悬浮品质因数、悬浮刚度与悬浮稳定性进行了讨论、计算、比较 ;并且讨论了两种方案的优缺点及应用。比较结果表明 ,方案 1更适合于小型的飞轮储能系统 ,方案 2较适合于大中型飞轮储能系统。     

On maximal actions and <Emphasis Type="Italic">w</Emphasis>-maximal actions of finite hypergroups

Sunder and Wildberger (J. Algebr. Comb. 18, 135–151, 2003) introduced the notion of actions of finite hypergroups, and studied maximal irreducible actions and *-actions. One of the main results of Sunder and Wildberger states that if a finite hypergroup K admits an irreducible action which is both a maximal action and a *-action, then K arises from an association scheme. In this paper we will first show that an irreducible maximal action must be a *-action, and hence improve Sunder and Wildberger’s result (Theorem 2.9). Another important type of actions is the so-called w-maximal actions. For a w-maximal action π:K→Aff (X), we will prove that π is faithful and |X|≥|K|, and |K| is the best possible lower bound of |X|. We will also discuss the strong connectivity of the digraphs induced by a w-maximal action.     

An improvement of discrete Tardos fingerprinting codes

It has been proven that the code lengths of Tardos’s collusion-secure fingerprinting codes are of theoretically minimal order with respect to the number of adversarial users (pirates). However, the code lengths can be further reduced as some preceding studies have revealed. In this article we improve a recent discrete variant of Tardos’s codes, and give a security proof of our codes under an assumption weaker than the original Marking Assumption. Our analysis shows that our codes have significantly shorter lengths than Tardos’s codes. For example, when c = 8, our code length is about 4.94% of Tardos’s code in a practical setting and about 4.62% in a certain limit case. Our code lengths for large c are asymptotically about 5.35% of Tardos’s codes. A part of this work was presented at 17th Applied Algebra, Algebraic Algorithms, and Error Correcting Codes (AAECC-17), Bangalore, India, December 16–20, 2007.     

Numerical approximations of one-dimensional linear conservation equations with discontinuous coefficients

Conservative linear equations arise in many areas of application, including continuum mechanics or high-frequency geometrical optics approximations. This kind of equation admits most of the time solutions which are only bounded measures in the space variable known as duality solutions. In this paper, we study the convergence of a class of finite-difference numerical schemes and introduce an appropriate concept of consistency with the continuous problem. Some basic examples including computational results are also supplied.

     

Improved versions of Tardos’ fingerprinting scheme

We study the Tardos’ probabilistic fingerprinting scheme and show that its codeword length may be shortened by a factor of approximately 4. We achieve this by retracing Tardos’ analysis of the scheme and extracting from it all constants that were arbitrarily selected. We replace those constants with parameters and derive a set of inequalities that those parameters must satisfy so that the desired security properties of the scheme still hold. Then we look for a solution of those inequalities in which the parameter that governs the codeword length is minimal. A further reduction in the codeword length is achieved by decoupling the error probability of falsely accusing innocent users from the error probability of missing all colluding pirates. Finally, we simulate the Tardos scheme and show that, in practice, one may use codewords that are shorter than those in the original Tardos scheme by a factor of at least 16.      

RCM‐TVD hybrid scheme for hyperbolic conservation laws

We describe a hybrid method for the solution of hyperbolic conservation laws. A third‐order total variation diminishing (TVD) finite difference scheme is conjugated with a random choice method (RCM) in a grid‐based adaptive way. An efficient multi‐resolution technique is used to detect the high gradient regions of the numerical solution in order to capture the shock with RCM while the smooth regions are computed with the more efficient TVD scheme. The hybrid scheme captures correctly the discontinuities of the solution and saves CPU time. Numerical experiments with one‐ and two‐dimensional problems are presented. Copyright © 2007 John Wiley & Sons, Ltd.     

Equations of Hurwitz schemes in the infinite Grassmannian

The main result proved in the paper is the computation of the explicit equations defining the Hurwitz schemes of coverings with punctures as subschemes of the Sato infinite Grassmannian. As an application, we characterize the existence of certain linear series on a smooth curve in terms of soliton equations. (© 2008 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)