The maximal Fejér operator on real Hardy spaces

We prove that the maximal Fej'er operator is not bounded on the real Hardy spaces H ¹, which may be considered over and . We also draw corollaries for the corresponding Hardy spaces over ² and ². This revised version was published online in August 2006 with corrections to the Cover Date.     

Conjugate Gradient Methods with Armijo-type Line Searches

Abstract Two Armijo-type line searches are proposed in this paper for nonlinear conjugate gradient methods.Under these line searches, global convergence results are established for several famous conjugate gradientmethods, including the Fletcher-Reeves method, the Polak-Ribiere-Polyak method, and the conjugate descentmethod.     

Remote Construction of Chiral Vicinal Tertiary and Quaternary Centers by Catalytic Asymmetric 1,6‐Conjugate Addition of Prochiral Carbon Nucleophiles to Cyclic Dienones

An unprecedented remote construction of chiral vicinal tertiary and quaternary centers by a catalytic asymmetric 1,6‐conjugate addition of prochiral carbon nucleophiles to cyclic dienones has been developed. Both 5H‐oxazol‐4‐ones and 2‐oxindoles were found to be very efficient carbon nucleophiles in this reaction at a remote position, giving products with excellent enantio‐ and diastereoselectivities (up to 99 % ee and >19:1 d.r. for 5H‐oxazol‐4‐ones and up to 97 % ee and >19:1 d.r. for 2‐oxindoles).     

A note on the efficiency of the conjugate gradient method for a class of time‐dependent problems

We discuss the efficiency of the conjugate gradient (CG) method for solving a sequence of linear systems; Auⁿ⁺¹ = uⁿ, where A is assumed to be sparse, symmetric, and positive definite. We show that under certain conditions the Krylov subspace, which is generated when solving the first linear system Au¹ = u⁰, contains the solutions {uⁿ} for subsequent time steps. The solutions of these equations can therefore be computed by a straightforward projection of the right‐hand side onto the already computed Krylov subspace. Our theoretical considerations are illustrated by numerical experiments that compare this method with the order‐optimal scheme obtained by applying the multigrid method as a preconditioner for the CG‐method at each time step. Copyright © 2007 John Wiley & Sons, Ltd.     

Synthesis of functionalized analogs of pyochelin, a siderophore of Pseudomonas aeruginosa and Burkholderia cepacia

Using an improved synthesis of pyochelin, a siderophore common to several pathogenic Pseudomonas species, three functionalized pyochelin analogs were efficiently synthesized starting from appropriate 2-hydroxybenzonitriles.     

多元统计分析中一类矩阵迹函数最小化问题的有效算法

研究来源于多元统计分析中的一类矩阵迹函数最小化问题minc+tr(AX)+∑mj=1tr(BjXCjXT),s.t.XTX = Ip,其中C为常数,A∈Rpxn(n ≥ p),Bj∈Rnxn,Cj∈Rpxp为给定系数矩阵.数值实验表明已有的Majorization算法虽可行,但收敛速度缓慢且精度不高.本文从黎曼流形的角...     

体上右线性方程组的反问题

设Ｆ，Ｋ，Ω分别表示一个任意的体、一个具有对合反自同构的体和一个实四元数体，Ｆ^ｎ表示Ｆ上的ｎ维右向量空间．本文推广和改进了实线性方程组的反问题及一系列结果，解决了Ｆ上右线性方程组更具一般性的反问题（简称ＩＰＳ）：给定ｂ∈Ｆ^s和α_ｉ∈Ｆ^ｎ（ｉ＝１，…，ｍ≤ｎ）满足ｒａｎｋ［α₁，…，α_m］＝ｍ，求所有的ｓ×ｎ矩阵Ａ使Ａα_ｉ＝ｂ（ｉ＝１，…，ｍ）．当ｓ＝ｎ时