An efficient numerical scheme for precise time integration of a diffusion-dissolution/precipitation chemical system

A numerical scheme based on an operator splitting method and a dense output event location algorithm is proposed to integrate a diffusion-dissolution/precipitation chemical initial-boundary value problem with jumping nonlinearities. The numerical analysis of the scheme is carried out and it is proved to be of order 2 in time. This global order estimate is illustrated numerically on a test case.

     

Solution of large‐scale weighted least‐squares problems

A sequence of least‐squares problems of the form min_y∥G^1/2(A^T y?h)∥₂, where G is an n×n positive‐definite diagonal weight matrix, and A an m×n (m?n) sparse matrix with some dense columns; has many applications in linear programming, electrical networks, elliptic boundary value problems, and structural analysis. We suggest low‐rank correction preconditioners for such problems, and a mixed solver (a combination of a direct solver and an iterative solver). The numerical results show that our technique for selecting the low‐rank correction matrix is very effective. Copyright © 2002 John Wiley & Sons, Ltd.     

Approximate Inverse Preconditioners for Some Large Dense Random Electrostatic Interaction Matrices

A sparse mesh-neighbour based approximate inverse preconditioner is proposed for a type of dense matrices whose entries come from the evaluation of a slowly decaying free space Green’s function at randomly placed points in a unit cell. By approximating distant potential fields originating at closely spaced sources in a certain way, the preconditioner is given properties similar to, or better than, those of a standard least squares approximate inverse preconditioner while its setup cost is only that of a diagonal block approximate inverse preconditioner. Numerical experiments on iterative solutions of linear systems with up to four million unknowns illustrate how the new preconditioner drastically outperforms standard approximate inverse preconditioners of otherwise similar construction, and especially so when the preconditioners are very sparse. AMS subject classification (2000) 65F10, 65R20, 65F35, 78A30     

广义Sierpinski集

本文考察了包括平面上的各种广义 Cantor集 ,Sierpinski集和包括某些连续不可微曲线在内的广义 Sierpinski集 .由相似变换 ,导出了它们的级数表达式 ,并利用它和字符串空间的对应关系 ,计算出它们的Hausdorff维数     

Transport of Neutrally Buoyant and Dense Variably Sized Colloids in a Two-Dimensional Fracture with Anisotropic Aperture

The transport of monodisperse as well as polydisperse colloid suspensions in a two-dimensional, water saturated fracture with spatially variable and anisotropic aperture is investigated with a particle tracking model. Both neutrally buoyant and dense colloid suspensions are considered. Although flow and transport in fractured subsurface formations have been studied extensively by numerous investigators, the transport of dense, polydisperse colloid suspensions in a fracture with spatially variable and anisotropic aperture has not been previously explored. Simulated snapshots and breakthrough curves of ensemble averages of several realizations of a log-normally distributed aperture field show that polydisperse colloids exhibit greater spreading than monodisperse colloids, and dense colloids show greater retardation than neutrally buoyant colloids. Moreover, it is demonstrated that aperture anisotropy oriented along the flow direction substantially increases colloid spreading; whereas, aperture anisotropy oriented transverse to the flow direction retards colloid movement.     

可压稠密气固两相流动过程的模拟计算

基于稠密气体分子运动论和颗粒动理学,建立可压稠密气固两相流动模型。采用梯度模拟来考虑气相可压缩性对气相湍流的影响。模拟计算表明气固两相射流速度沿轴向和径向减小,颗粒浓度下降。气固两相射流具有高的颗粒温度,呈现强烈的气固两相湍流流动特性。     

Nowhere zero 4‐flow in regular matroids

Jensen and Toft 8 conjectured that every 2‐edge‐connected graph without a K₅‐minor has a nowhere zero 4‐flow. Walton and Welsh 19 proved that if a coloopless regular matroid M does not have a minor in {M(K_3,3), M*(K₅)}, then M admits a nowhere zero 4‐flow. In this note, we prove that if a coloopless regular matroid M does not have a minor in {M(K₅), M*(K₅)}, then M admits a nowhere zero 4‐flow. Our result implies the Jensen and Toft conjecture. © 2005 Wiley Periodicals, Inc. J Graph Theory     

Solid codes and the uniform density of fd-domains

By means of further investigation of solid codes,the problem“Is every fd-domain uni- formly dense”proposed by Yuqi Guo,C.M.Reis and G.Thierrin in 1988 is solved in this paper.     

RECURSIVE BAIRE CLASSIFICATION AND SPEEDABLE FUNCTIONS

Using recursive variants of Baire notions of nowhere dense and meagre sets we study the topological size of speedable and infinitely often speedable functions in a machine-independent framework. We show that the set of speedable functions is not “small” whereas the set of infinitely often speedable functions is “large”. In this way we offer partial answers to a question in [4].