共轭拟Fourie-Jacobi级数

讨论了共轭Fourie-Jacobi级数，对于α=β=1/2，给出精确的结果。     

牛曼─贝塞尔级数的共轭级数

本文讨论了牛曼─贝塞尔级数的共轭级数，建立了其部分和与相应的共轭Ｆｏｕｒｉｅｒ三角级数的部分和之间的关系，同时给出了两个收敛定理。     

共轭Fourier—Legendre级数

Muckenhoupt和Stein在[1]中给出共轭超球级数的定义,并讨论了广义的“共轭调和”函数.在本文中,我们给出共轭Fourier—Legendre级数的新定义,讨论了相应的共轭函数和等价收敛定理.     

牛曼-贝塞尔级数的共轭级数

本文讨论了牛曼-贝塞尔级数的共轭级数，建立了其部分和与相应的共轭Fourier三角级数的部分和之间的关系，同时结出了两个收敛定理。     

The Rate of Convergence for the Conjugate Series of Mixed Jacobi Series

The rate of convergence of the conjugate series of the mixed Jacobi series for continuous function of bounded vartation is given.     

共轭混合型Jacobi级数的收敛速度(英文)

对于有界变差的连续函数，本文给出了其共轭混合型Jacobi级数的收敛速度．     

有理Fourier级数在变差条件下的收敛性研究

本文把Fourier级数的一些经典结论推广到有理Fourier级数的情况下. 首先给出了有理Fourier级数和共轭有理Fourier级数在有界变差条件下的收敛速度估计. 利用此结论, 得到了类似于Fourier级数的Dirichlet-Jordan定理和W. H. Young定理. 最后, 证明了这两个定理在调和有界变差条件下也成立.     

共轭Neumann-Bessel级数的收敛速度

给出共轭Neumann-Bessel级数的核函数的渐近表达式，它的精度达到O（），然后利用这个表达式，讨论了该级数的收敛速度．     

借助Malvar-Coifman-Meyer共轭小波确定函数的跳跃值

以MCM共轭小波为基讨论了非周期函数跳跃值的确定.
证明了函数$f$在第1类间断点处的Lukacs型等式,
对满足弱光滑性假设的函数建立了几个不同类型的集中因子判别定理.     

Fourier级数部分和对ω-型单调函数的逼近

引入ω－型单调函数的概念，研究了Fourier级数部分和对其的逼近问题，推广了Mazhar(1991）的结果，减弱了Salem和Zygmund(1946）的结果的条件，使Salem和Zygmund的结论适用于更大的函数类。     

向量集值映射的共轭对偶

借助抽象算子将共轭映射的概念的到抽象空间,引入了集值映射的共轭映射和次梯度,据此讨论了集值映射共轭对偶的全局稳定性。     

Farkas-type results for inequality systems with composed convex functions via conjugate duality

We present some Farkas-type results for inequality systems involving finitely many functions. Therefore we use a conjugate duality approach applied to an optimization problem with a composed convex objective function and convex inequality constraints. Some recently obtained results are rediscovered as special cases of our main result.     

非线性规划的Ω共轭对偶理论

本文通过推广凸共轭函数和次梯度的概念,建立了非线性规划问题的一类对偶理论——Ω共轭对偶理论.研究结果表明,许多关于非线性最优化对偶性方面的结论都是本文的特殊情况.     

Further Applications of the Additive Min-type Coupling Function

Applying for the additive min-type coupling function $$ \varphi (x, w) = \mathop {\min }\limits_{1 \le i \le n} (x_1 + w_i )\quad (x = (x_i ), w = (w_i ) \in {\shadR}^n ) $$ the techniques from abstract convex analysis, developed in [I. Singer (1997). Abstract Convex Analysis . Wiley-Interscience, New York], we show that the conjugate of type Lau f L ( } ) of f with respect to } has the simple expression $ f^{L(\varphi )} (w) = - f( - w)\, (w \in {\shadR}^n ) $ if and only if f is increasing and upper semi-continuous. As a consequence, we obtain that for topical (i.e., increasing additively homogeneous) functions f the Fenchel-Moreau conjugate of f with respect to } and the conjugate of type Lau of f with respect to } coincide.     

ON CONJUGATE SYMPLECTICITY OF MULTI-STEP METHODS

1. Introduction.For an ordinary differential equationany compatible linear m-step difference scheme (for simplicity) denoted by LMSM):can be characterized by a step-transition operator G (also denoted by G"): Re - Resatisfyingwhere Gb stands for k-time composition of G: G o G' o G (refer to [1-4]).The operator G defined by (3) can be represented as a power series in T with firstterm equal to identity i. More preciselys it is shown[4] thatLemma A. If scheme (2) is Of order s, then the…     

Conjugate points in

An example of a geodesic in with conjugate points is given, thus providing an affirmative answer to a question of V.I. Arnold.

     

A fast and robust unconstrained optimization method requiring minimum storage

This paper describes a new unconstrained optimisation procedure employing conjugate directions and requiring only threen-dimensional vectors. The method has been tested for computational efficiency and stability on a large set of test functions and compared with numerical data of other major methods. Results show that the method possesses strong superiority over other existing conjugate gradient methods on all problems and can out-perform or is at least as efficient as quasi-Newton methods on many tested problems.