Viscosity solutions of fully nonlinear parabolic systems

In this paper, we discuss the viscosity solutions of the weakly coupled systems of fully nonlinear second-order degenerate parabolic equations and their Cauchy-Dirichlet problem. We prove the existence, uniqueness and continuity of viscosity solution by combining Perron's method with the technique of coupled solutions. The results here generalize those in Proc. London Math. Soc. 63 (1991) 212-240 and Comm. Partial Differential Equations 16 (1991) 1095-1128.     

Linearisation and potential symmetries of certain systems of diffusion equations

We consider systems of two pure one-dimensional diffusion equations that have considerable interest in Soil Science and Mathematical Biology. We construct non-local symmetries for these systems. These are determined by expressing the equations in a partially and wholly conserved form, and then by performing a potential symmetry analysis on those systems that can be linearised. We give several examples of such systems, and in a specific case we show how linearising and hodograph-type mappings can lead to new solutions of the diffusion system.     

大型稀疏无约束最优化问题的行列修正算法

本文提出了一类适用于大型稀疏最优化问题的简单易行的行列修正算法，获得了新算法的局部超一性收敛性，大量的数值试验表明这是一个较为理想的修正算不。新算法同样可以用来求解大型对称性非线性方程组。     

Crossover from BCS-superconductivity to Bose-condensation

Starting from a model of free Fermions in two dimensions with an arbitrary strong effective interaction, we derive a Ginzburg-Landau theory describing the crossover from BCS-superconductivity to Bose-condensation. We find a smooth crossover from the standard BCS-limit to a Gross-Pitaevski type equation for the order parameter in a Bose superfluid. The mean field transition temperature exhibits a maximum at a coupling strength, where the behaviour crosses over from BCS to Bose like with corresponding values of 2 Δ₀/T_c ≈ 5 which are characteristic for high T_c superconductors.     

无严格互补松驰条件的序列线性方程组新算法

该文通过构造特殊形式的有效集来逼近KKT点处的有效集，给出了一个任意初始点下的序列线性方程组新算法，并证明了该算法在没有严格互补松驰条件的情况下具有全局收敛性和一步超线性收敛性。      

代数构造及在Ramsey理论中的应用

这篇文章在伽罗瓦域上的代数构造和关于一些特定类型图的Ramsey数之间建立了一个关系. 研究了关于伽罗瓦域上的代数构造的方程及方程组的解. 我们得到了一些关于二部图的Ramsey数的新的下界和上界.     

Reducing system of parameters and the Cohen-Macaulay property

Let R be a local ring and let (x ₁, …, x _r) be part of a system of parameters of a finitely generated R-module M, where r < dim_R M. We will show that if (y ₁, …, y _r) is part of a reducing system of parameters of M with (y ₁, …, y _r) M = (x ₁, …, x _r) M then (x ₁, …, x _r) is already reducing. Moreover, there is such a part of a reducing system of parameters of M iff for all primes P ε Supp M ∩ V _R(x ₁, …, x _r) with dim_R R/P = dim_R M − r the localization M _P of M at P is an r-dimensional Cohen-Macaulay module over R _P. Furthermore, we will show that M is a Cohen-Macaulay module iff y _d is a non zero divisor on M/(y ₁, …, y _d−1) M, where (y ₁, …, y _d) is a reducing system of parameters of M (d:= dim_R M).     

Single-server queues with spatially distributed arrivals

Consider a queueing system where customers arrive at a circle according to a homogeneous Poisson process. After choosing their positions on the circle, according to a uniform distribution, they wait for a single server who travels on the circle. The server's movement is modelled by a Brownian motion with drift. Whenever the server encounters a customer, he stops and serves this customer. The service times are independent, but arbitrarily distributed. The model generalizes the continuous cyclic polling system (the diffusion coefficient of the Brownian motion is zero in this case) and can be interpreted as a continuous version of a Markov polling system. Using Tweedie's lemma for positive recurrence of Markov chains with general state space, we show that the system is stable if and only if the traffic intensity is less than one. Moreover, we derive a stochastic decomposition result which leads to equilibrium equations for the stationary configuration of customers on the circle. Steady-state performance characteristics are determined, in particular the expected number of customers in the system as seen by a travelling server and at an arbitrary point in time.     

A Family of Fifth-Order Runge-Kutta Pairs

The construction of a Runge-Kutta pair of order with the minimal number of stages requires the solution of a nonlinear system of order conditions in unknowns. We define a new family of pairs which includes pairs using function evaluations per integration step as well as pairs which additionally use the first function evaluation from the next step. This is achieved by making use of Kutta's simplifying assumption on the original system of the order conditions, i.e., that all the internal nodes of a method contributing to the estimation of the endpoint solution provide, at these nodes, cost-free second-order approximations to the true solution of any differential equation. In both cases the solution of the resulting system of nonlinear equations is completely classified and described in terms of five free parameters. Optimal Runge-Kutta pairs with respect to minimized truncation error coefficients, maximal phase-lag order and various stability characteristics are presented. These pairs were selected under the assumption that they are used in Local Extrapolation Mode (the propagated solution of a problem is the one provided by the fifth-order formula of the pair). Numerical results obtained by testing the new pairs over a standard set of test problems suggest a significant improvement in efficiency when using a specific pair of the new family with minimized truncation error coefficients, instead of some other existing pairs.