An approach to numerical solution of multipoint boundary-value problems

An approach is proposed to solving multipoint boundary-value problems for linear differential equation of w-th order, based on reduction to two-point boundary-value problems. The two-point problems are solved by the stable discrete orthogonalization method. Some numerical examples are considered.Translated from Vychislitel'naya i Prikladnaya Matematika, No. 58, pp. 36–45, 1986.     

A Parabolic Spline on a Nonuniform Grid

We obtain estimates for errors of interpolation on a nonuniform grid for a parabolic nonperiodic spline of defect 1.     

一种新的奇偶非线性相干态及其量子统计性质

定义了一种新的奇偶非线性相干态即算符B2[B=af(N)]的两个正交归一本征态,利用数值计算方法研究了它们的量子统计性质.结果表明,与通常的奇偶相干态不同,在参数|β|变化的某些范围内,只有偶非线性相干态可以存在压缩效应,而振幅平方压缩和反聚束效应在这两个态中均可以呈现 关键词： 新的奇偶非线性相干态 压缩 振幅平方压缩 反聚束效应     

Elasticity in nanocrystalline Nd2Fe14B+αFe magnetic composites

The dynamic Young modulus (E) of magnetic Nd₂Fe₁₄B+αFe nanocomposites is investigated with mechanical spectroscopy techniques (vibrating reed configuration, f≈1.5 kHz <10⁻⁶). Reduced values of E are obtained (88–152 GPa) as compared with that predicted by the rule of mixtures for the composite (164 GPa). Three contributions to this reduction are briefly discussed: a large volume fraction of the specimen with grain boundary like structure; internal pores, resulting from the high cooling rate during processing (10⁶ K/min) and magneto-mechanical effects. Even when porosity is identified as the principal cause of modulus reduction, magnetic effects are also detected.     

无限维s空间内无条件发散级数的Dvoretzky—Hanani定理

本文推广了Ｄｖｏｒｅｔｚｋｙ－Ｈａｎａｎｉ定理于无限维Ｓ空间。     

中立双曲型时滞偏微分方程解振动的充要条件

本文讨论一类线性中立双曲型时滞微分方程解的振动性质，获得了其一切解振动的充要条件．     

原生质体诱变选育去甲基金霉素高产菌

采用紫外线、同平板梯度浓度亚硝基肌，纯铜蒸气激光诱变去甲基金霉素生产菌金霉素链霉菌的原生质体，结果表明原生质体对各种诱变剂的敏感性较高.正变幅度较大.原生质体经紫外线、同平板梯度浓度亚硝墓肌复合诱变后，筛选到一菌株，重新制备原生体，经激光诱变，选育出高产菌株S. A. HU02，去甲基金霉素效价从2831u/ml提高到4337u/ml，提高了53. 2，经多次传代产量性状非常稳定.     

On alternativep-center problems

LetG=(V, E) be an undirected connected graph with positive edge lengths. The vertexp-center problem is to find the optimal location ofp centers so that the maximum distance to a vertex from its nearest center is minimized, where the centers may be placed at the vertices. Kariv and Hakimi have shown that this problem is NP-hard. We will consider two modifications of this problem in which each center may be located in one of two predetermined vertices. We will show the NP-completeness of their recognition versions.     

Book reviews

Ohne Zusammenfassung

---

Book reviews