求解非对称线性方程组的QMRGCGS方法

1 引言 求解非对称线性方程组Ax=b的双共轭梯度方法(BCG)[3]和它的变形共轭梯度平方方法(CGS)[6]都有典型的不规则收敛行为,后来Freund和Nachtigal提出一种BCG类方法,即拟极小剩余方法(QMR)[7],用来补救BCG方法的收敛性并且产生了光滑的收敛曲线。然而,象BCG方法一样,QMR方法要用到系数矩阵A及其转置A~T与向量的乘积,为了解决这一问题,Freund提出TFQMR方法,此方法具有拟极小剩余性,同时不需用到A~T与向量的乘积。     

A new property of Bernstein-Kantorovi? operators

In the present paper, we prove that the Bernstein-Kantorovič operators have the ability of preserving translation property in both C and L^p norms. Supported (in part) by the NSFC(10471130,10371024) of PRC and the Natural Science Foundation (Y604003) of Zhejiang Province.     

A fully linear-time approximation algorithm for grammar-based compression

A linear-time approximation algorithm for the grammar-based compression is presented. This is an optimization problem to minimize the size of a context-free grammar deriving a given string. For each string of length n, the algorithm guarantees approximation ratio without suffix tree construction.     

An approximation property of harmonic functions in Lipschitz domains and some of its consequences

An extension of an inequality of J. B. Garnett (1979), with improvements by B. E. J. Dahlberg (1980), on an approximation property of harmonic functions is proved. The weighted inequality proved here was suggested by the work of J. Pipher (1993) and it implies an extension of a result of S. Y. A. Chang, J. Wilson and T. Wolff (1985) and C. Sweezy (1991) on exponential square integrability of the boundary values of solutions to second-order linear differential equations in divergence form. This implies a solution of a problem left open by R. Bañuelos and C. N. Moore (1989) on sharp estimates for the area integral of harmonic functions in Lipschitz domains.

     

Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width

The Multicut problem can be defined as: given a graph G and a collection of pairs of distinct vertices {s_i,t_i} of G, find a minimum set of edges of G whose removal disconnects each s_i from the corresponding t_i. Multicut is known to be NP-hard and Max SNP-hard even when the input graph is restricted to being a tree. The main result of the paper is a polynomial-time approximation scheme (PTAS) for Multicut in unweighted graphs with bounded degree and bounded tree-width. That is, for any ε>0, we present a polynomial-time (1+ε)-approximation algorithm. In the particular case when the input is a bounded-degree tree, we have a linear-time implementation of the algorithm. We also provide some hardness results: we prove that Multicut is still NP-hard for binary trees and that it is Max SNP-hard if we drop any of the three conditions (unweighted, bounded-degree, bounded tree-width). Finally we show that some of these results extend to the vertex version of Multicut and to a directed version of Multicut.     

On the stationary Lp-approximation power to derivatives by radial basis function interpolation

In this paper, we consider approximation to derivatives of a function by using radial basis function interpolation. Most of well-known theories for this problem provide error analysis in terms of the so-called native space, say C_φ. However, if a basis function φ is smooth, the space C_φ is extremely small. Thus, the purpose of this study is to extend this result to functions in the homogenous Sobolev space.     

Enhancement of Overall Photovoltaic Efficiency by Changing the Position of the Attaching Group -RSO3- on the Hemicyanine Dye Molecules

A new photoresponsive D-π-A dye, mPS, has been designed and synthesized.Compared to the parent dye PS, IPCE values in the region from 400 nm to 560 nm was greatly improved upon changing the attaching group from the p- position to the o- position of the π-conjugation bridge. A solar cell based on mPS generated a remarkably high overall yield η of 5.4% under irradiation of 80.0 mW cm^-2 white light from a Xe lamp, Compared with PS, the overall yield η increased by 64%.     

正系数多项式倒数逼近的点态和整体估计

利用Ditzian-Totik光滑模对于[0,1]上定义的非角连续函数f(x)，且f(x)≠0，文中证明存在正系数多项式Pn(x)及常数C，使得|f9x)-1/Pn(x)|≤Cωψ^λ（f,n^-1/2(ψ(x) 1/√n)^1-λ)。当λ＝1时，上述结果导出已有的整体估计，而当0≤λ＜1时，得到倒数逼近一个新的点态局部估计。     

Thiol–norbornene materials: Approaches to develop high Tg thiol–ene polymers

The ability to prepare high T_g low shrinkage thiol–ene materials is attractive for applications such as coatings and dental restoratives. However, thiol and nonacrylated vinyl materials typically consist of a flexible backbone, limiting the utility of these polymers. Hence, it is of importance to synthesize and investigate thiol and vinyl materials of varying backbone chemistry and stiffness. Here, we investigate the effect of backbone chemistry and functionality of norbornene resins on polymerization kinetics and glass transition temperature (T_g) for several thiol–norbornene materials. Results indicate that T_gs as high as 94 °C are achievable in thiol–norbornene resins of appropriately controlled chemistry. Furthermore, both the backbone chemistry and the norbornene moiety are important factors in the development of high T_g materials. In particular, as much as a 70 °C increase in T_g was observed in a norbornene–thiol specimen when compared with a sample prepared using allyl ether monomer of analogous backbone chemistry. © 2007 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 45: 5686–5696, 2007     

A Galois Connection

The connection presented in this paper mirror-links two metamathematical structures, the finitary closure operators, and the compact consistency properties, in such a way that a specification of one structure induces a provably equivalent specification of the other. Mathematics Subject Classification (2000): Primary 06A15, Secondary 28E10 03B22