非饱和土壤水流问题基于POD 方法的降阶有限体积元格式及外推算法实现

利用特征投影分解(proper orthogonal decomposition, 简记为POD) 方法对非饱和土壤水流问题的经典有限体积元格式做降阶处理, 建立一种具有足够高精度维数较低的降阶有限体积元格式, 并给出这种降阶有限体积元解的误差估计和外推算法的实现, 最后用数值例子说明数值结果与理论结果是相吻合的. 进一步表明了基于POD 方法的降阶有限体积元格式对求解非饱和土壤水流问题数值解是可靠和有效的.     

集值均衡问题近似Benson真有效解的非线性刻画

在一般的数学模型中,由于要忽略一些次要因素,所建的模型往往是近似的,且对数学模型利用数值算法所求得的解大多是近似解。另一方面,在可行集非紧的情况下,精确解的解集往往是空集,而在较弱的条件下近似解集可以是非空的。在Hausdorff局部凸拓扑线性空间中分别研究了无约束和带约束集值均衡问题近似Benson真有效解。在没有任何凸性假设下,利用非线性泛函分别建立了最优性条件。     

Development of a multi‐scale ocean model by using particle Laplacian method for anisotropic mass transfer

The direct injection of CO₂ into the deep ocean is one of the feasible ways for the mitigation of the global warming, although there is a concern about its environmental impact near the injection point. To minimize its biological impact, it is necessary to make CO₂ disperse as quickly as possible, and it is said that injection with a pipe towed by a moving ship is effective for this purpose. Because the injection ship moves over a spatial scale of O(10²km), a mesoscale model is necessary to analyse the dispersion of CO₂. At the same time, since it is important to investigate high CO₂ concentration near the injection point, a small‐scale model is also required. Therefore, in this study, a numerical model was developed to analyse CO₂ dispersion in the deep ocean by using a fixed mesoscale and a moving small‐scale grid systems, the latter of which is nested and moves in the former along the trajectory of the moving ship. To overcome the artificial diffusion of mass concentration at the interface of the two different grid systems and to keep its spatial accuracy almost the same as that in the small‐scale, a particle Laplacian method was adopted and newly modified for anisotropic diffusion in the ocean. Copyright © 2010 John Wiley & Sons, Ltd.     

The Bounded Axiom A Forcing Axiom

We introduce the Bounded Axiom A Forcing Axiom (BAAFA). It turns out that it is equiconsistent with the existence of a regular ∑₂‐correct cardinal and hence also equiconsistent with BPFA. Furthermore we show that, if consistent, it does not imply the Bounded Proper Forcing Axiom (BPFA) (© 2010 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Oscillatory Behaviour of Solutions of Two-Dimensional Differential Systems with Deviated Arguments

Sufficient conditions are established for the oscillation of proper solutions of the system

Transfer Operators and State Spaces for Discrete Multidimensional Linear Systems

This paper treats multidimensional discrete input-output systems from the constructive point of view. We adapt and improve recursive algorithms, derived earlier by E. Zerz and the second author from standard Gröbner basis algorithms, for the solution of the canonical Cauchy problem for linear systems of partial difference equations with constant coefficients on the lattices N = ^r1 × ^r2. These recursive algorithms, in turn, furnish four other solution methods for the initial value problem, namely by transfer operators, by canonical Kalman global state equations, by parametrizations of controllable systems and, for systems with proper transfer matrix and left bounded input signals, by convolution with the transfer matrix. In the 2D-case N = ² the last method was studied by S. Zampieri. Minimally embedded systems are studied and give rise to especially simple Kalman equations. The latter also imply a useful characterization of the characteristic or polar variety of the system by eigenvalue spectra. For N = ^r we define reachability of a system and prove that controllability implies reachability, but not conversely. Moreover we solve, in full generality, the modelling problem which was introduced and partially solved by F. Pauer and S. Zampieri. Various algorithms have been implemented by the first author in axiom, and examples are demonstrated by means of computer generated pictures. Related work on state space representations has been done by the Padovian and Groningian system theory schools.     

New facts

We use ``iterated square sequences' to show that there is an -definable partition such that if is an inner model not containing :

(a)

For some is stationary.

(b)

For each there is a generic extension of in which does not exist and is non-stationary.

This result is then applied to show that if is an inner model without , then some sentence not true in can be forced over .

     

Extending the Balas-Yu bounds on the number of maximal independent sets in graphs to hypergraphs and lattices

A result of Balas and Yu (1989) states that the number of maximal independent sets of a graph G is at most ^p+1, where is the number of pairs of vertices in G at distance 2, and p is the cardinality of a maximum induced matching in G. In this paper, we give an analogue of this result for hypergraphs and, more generally, for subsets of vectors in the product of n lattices =₁××_n, where the notion of an induced matching in G is replaced by a certain binary tree each internal node of which is mapped into . We show that our bounds may be nearly sharp for arbitrarily large hypergraphs and lattices. As an application, we prove that the number of maximal infeasible vectors x=₁××_n for a system of polymatroid inequalities does not exceed max{Q,^logt/c(2Q,)}, where is the number of minimal feasible vectors for the system, , , and c(,) is the unique positive root of the equation 2^c(^c/log–1)=1. This bound is nearly sharp for the Boolean case ={0,1}ⁿ, and it allows for the efficient generation of all minimal feasible sets to a given system of polymatroid inequalities with quasi-polynomially bounded right-hand sides . This research was supported by the National Science Foundation (Grant IIS-0118635), and by the Office of Naval Research (Grant N00014-92-J-1375). The second and third authors are also grateful for the partial support by DIMACS, the National Science Foundation's Center for Discrete Mathematics and Theoretical Computer Science.Mathematics Subject Classification (2000):20E28, 20G40, 20C20     

On bifurcation points of a complex polynomial

Let be a polynomial of degree . Assume that the set there is a sequence s.t. and is finite. We prove that the set of generalized critical values of (hence in particular the set of bifurcation points of ) has at most points. Moreover, We also compute the set effectively.

     

Proper actions on cohomology manifolds

Essential results about actions of compact Lie groups on connected manifolds are generalized to proper actions of arbitrary groups on connected cohomology manifolds. Slices are replaced by certain fiber bundle structures on orbit neighborhoods. The group dimension is shown to be effectively finite. The orbits of maximal dimension form a dense open connected subset. If some orbit has codimension at most , then the group is effectively a Lie group.