An algorithm for the minimax weber problem

The paper presents an algorithm for finding the weighted absolute center of a given set of points in the Euclidean plane.The algorithm is a specialized implementation of the method of feasible directions.The presentation includes a proof of convergence as well as computational experience.     

蓖麻油黏度与表面张力系数的关系研究

分别利用落球法和拉脱法测量了蓖麻油在不同温度下的黏度和表面张力系数;根据最速下降法,编制自动调参程序FIT,通过拟合实验测量数据,得到了描述蓖麻油黏度与表面张力系数关系的经验公式.     

An algorithm for computed tomography image reconstruction from limited-view projections

<正>With the development of the compressive sensing theory,the image reconstruction from the projections viewed in limited angles is one of the hot problems in the research of computed tomography technology.This paper develops an iterative algorithm for image reconstruction,which can fit most cases.This method gives an image reconstruction flow with the difference image vector,which is based on the concept that the difference image vector between the reconstructed and the reference image is sparse enough.Then the l_2-norm minimization method is used to reconstruct the difference vector to recover the image for flat subjects in limited angles.The algorithm has been tested with a thin planar phantom and a real object in limited-view projection data.Moreover,all the studies showed the satisfactory results in accuracy at a rather high reconstruction speed.     

New results on the peak algebra

The peak algebra is a unital subalgebra of the symmetric group algebra, linearly spanned by sums of permutations with a common set of peaks. By exploiting the combinatorics of sparse subsets of [n−1] (and of certain classes of compositions of n called almost-odd and thin), we construct three new linear bases of . We discuss two peak analogs of the first Eulerian idempotent and construct a basis of semi-idempotent elements for the peak algebra. We use these bases to describe the Jacobson radical of and to characterize the elements of in terms of the canonical action of the symmetric groups on the tensor algebra of a vector space. We define a chain of ideals of , j = 0,..., , such that is the linear span of sums of permutations with a common set of interior peaks and is the peak algebra. We extend the above results to , generalizing results of Schocker (the case j = 0). Aguiar supported in part by NSF grant DMS-0302423 Orellana supported in part by the Wilson Foundation     

A New Gradient Method with an Optimal Stepsize Property

The gradient method for the symmetric positive definite linear system is as follows

Electronic transitions of fluorene, dibenzofuran, carbazole, and dibenzothiophene: From the onset of absorption to the ionization threshold

A comparative study of the electronic transitions of fluorene and its hetero-analogues dibenzofuran, carbazole, and dibenzothiophene was performed in a wide energy range. Gas phase, crystal phase, and linear dichroism electronic transmittance spectra were measured with synchrotron radiation. Electronic transitions to excited singlet states were predicted with time-dependent density functional theory, TD-B3LYP/6-31+G(d,p). Based on the experimental and theoretical results, symmetry assignments of electronic transitions in the vacuum and near-UV region are suggested. The correspondence between excited states in these molecules, similarities, and differences between their electronic spectra are discussed.     

求解低秩矩阵填充的改进的交替最速下降法

矩阵填充是指利用矩阵的低秩特性而由部分观测元素恢复出原矩阵,在推荐系统、信号处理、医学成像、机器学习等领域有着广泛的应用。采用精确线搜索的交替最速下降法由于每次迭代计算量小因而对大规模问题的求解非常有效。本文在其基础上采用分离地精确线搜索,可使得每次迭代下降更多但计算量相同,从而可望进一步提高计算效率。本文分析了新算法的收敛性。数值结果也表明所提出的算法更加有效。     

有一致降指数的算子

本文讨论了有拓扑一致降指数的算子的可交换拟幂零摄动:举出反例说明有拓扑一致降指数的算子在可交换拟幂零摄动下是不稳定的;得到有拓扑一致降指数的算子和它的可交换拟幂零摄动的超值域与超核之间的关系;利用这些关系,证明了左(右)Drazin可逆算子在可交换幂零摄动下是稳定的.最后还讨论了Banach空间上B-正则类BR_i(1≤i≤13)中算子的R_i型Kato分解与R_i型超Kato分解.     

四阶微分方程Hermite有限元的预处理共轭梯度法

对一类四阶微分方程两点边值问题的Hermite有限元方法进行了研究.首先讨论了该方程通常意义下的Galerkin有限元离散,考虑到有限元离散得到的线性方程组的对称正定性,文中采用了预处理最速下降法和共轭梯度方法求解线性方程组,通过选择不同的预处理器,使得求解该方程组的迭代次数有了很大的改观.