The theoretical basis of column chromatography in multicomponent separations. Part 2: Peak capacity. Column systems with good selectivity

The selectivity of a column system, S, defined by equation 28, includes a variation coefficient (β) of plate number with capacity ratio which has a large influence on the peak capacity, as shown in Fig. 18. Some typical chromatograms are given. In order to predict S for a column system from Kovat's Index, equations 40 and 41 are given to calculate the constant of the carbon number rule for squalane at different temperatures or for different stationary phases. The specific retention value of heptane on squalane at different temperatures can be calculated from equation 42. The nonpolarity index, defined by equation 43, was used to calculate the retention value of heptane on various stationary phases. In liquid chromatography, the order of elution may be reversed by changing the composition of the eluent on the same chemically bonded silica (manufactured in China). The linear relations between the log retention values of different kinds of solutes or of a single solute on the silicas of different surface areas when using the same eluent are given.     

Krylov subspaces and the analytic grade

Typical behaviour of the solution of a linear system of equations obtained iteratively by Krylov methods can be characterized by three stages. Initially the residual diminishes steadily; this is followed by stagnation and finally rapid convergence near the algebraic grade. This study examines this behaviour in terms of the concepts of approximately invariant subspace and what we have called the analytic grade of a Krylov sequence. It is shown how the small Ritz values play a vital role in the convergence and how this knowledge helps in the construction of an effective preconditioner. Copyright © 2004 John Wiley & Sons, Ltd.     

Orthogonal similarity transformation into block‐semiseparable matrices of semiseparability rank k

Very recently, an algorithm, which reduces any symmetric matrix into a semiseparable one of semi‐ separability rank 1 by similar orthogonality transformations, has been proposed by Vandebril, Van Barel and Mastronardi. Partial execution of this algorithm computes a semiseparable matrix whose eigenvalues are the Ritz‐values obtained by the Lanczos' process applied to the original matrix. Also a kind of nested subspace iteration is performed at each step. In this paper, we generalize the above results and propose an algorithm to reduce any symmetric matrix into a similar block‐semiseparable one of semiseparability rank k, with k ∈ ?, by orthogonal similarity transformations. Also in this case partial execution of the algorithm computes a block‐semiseparable matrix whose eigenvalues are the Ritz‐values obtained by the block‐Lanczos' process with k starting vectors, applied to the original matrix. Subspace iteration is performed at each step as well. Copyright © 2005 John Wiley & Sons, Ltd.     

Smallest singular value of random matrices and geometry of random polytopes

We study the behaviour of the smallest singular value of a rectangular random matrix, i.e., matrix whose entries are independent random variables satisfying some additional conditions. We prove a deviation inequality and show that such a matrix is a “good” isomorphism on its image. Then, we obtain asymptotically sharp estimates for volumes and other geometric parameters of random polytopes (absolutely convex hulls of rows of random matrices). All our results hold with high probability, that is, with probability exponentially (in dimension) close to 1.     

以权分担三个值的亚纯函数

该文处理了以权分担三个值的亚纯函数唯一性问题, 获得的结果改进了文献[1]的全部结果.     

Some research problems on the hadamard product and singular values of matrices

We pose some problems on the Hadamard product and singular values of matrices.     

防范道德风险的博弈分析和契约设计

运用不完全信息动态博弈的理论，建立了一个防范道德风险的博弈模型．给出了该博弈的精炼贝叶斯纳什均衡．在此基础上给出了基于最优博弈策略的契约的具体形式。而这种基于博弈论的契约可以克服有成本的状态验证模型(CSV)及经典激励理论中承诺的可信性问题。     

Critical Point Theorems and Applications to Differential Equations

This paper contains a generalization of the well-known Palais-Smale and Cerami compactness conditions. The compactness condition introduced is used to prove some general existence theorems for critical points. Some applications are given to differential equations.     

PROMETHEE-MD-2T method for project selection

Project selection is a real problem of multicriteria group decision making (MCGDM) where each decision maker expresses his/her preferences depending on the nature of the alternatives and on his/her own knowledge over them. Thus, information, as much quantitative as qualitative, coexists. The traditional methods of MCGDM developed for project selection usually discriminates in favour of quantitative information at the expense of qualitative information, and this is due to the capability to integrate this first type of information inside their procedure. In this article, two new multicriteria 2-tuple group decision methods called “Preference Ranking Organisation Method for Enrichment Evaluation Multi Decision maker 2-Tuple-I and II” (PROMETHEE-MD-2T-I and II) are presented. They are able to integrate inside their procedure both quantitative and qualitative information in an uncertain context. This has been performed by integrating a 2-tuple linguistic representation model dealing with non-homogeneous and imprecise information data made up by valued intervals, numerical and linguistic values into the aggregation operators of Promethee methods. Although they have been developed for project selection problems, these proposed methods can be applied to all kinds of decision-making problems with heterogeneous and multigranular information.     

Inequalities of Hadamard Type for r-Convex Functions in Carnot Groups

For a Carnot group G,we establish the relationship between extended mean values and r-convexfunctions which is introduced in this paper,which is a class of inequalities of Hadamard type for r-convexfunction on G.