Structure of luminous clouds near a sublimated hydrogen pellet

The spatial structure of a luminous cloud near a hydrogen pellet sublimated in a tokamak plasma is investigated experimentally. The luminous cloud has the form of a constant-intensity plateau extended along the magnetic field and is surrounded by an exponentially fading halo. The cross size of the plateau is determined by the boundary of the ionization region of atoms leaving the pellet surface. The plateau length is approximately determined by the balance between the pressures in the luminous cloud and the bulk plasma. Taking into account the structure described is important for the correct interpretation of the signals from alpha-particle diagnostics by charge-exchange neutral fluxes, because these signals depend on the characteristic dimensions of the cloud.     

Recyclization of Products Formed by Addition of 5-Hydrazino-2-phenyl-1,3-oxazoles Functionally Substituted in 4-Position to Aryl Isothiocyanates

Russian Journal of General Chemistry -     

Time discretizations for Maxwell‐Bloch equations

In this article we derive new time discretizations for the numerical simulation of Maxwell‐Bloch equations. These discretizations decouple the equations, thus leading to improved efficiency. This approach may be combined with the fulfilment of physical properties, such as positiveness properties, which are not accounted for by classical schemes. Our time discretizations are moreover proved to be nonlinearly stable. © 2003 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 19: 284–300, 2003.     

Determining radii of meromorphy via orthogonal polynomials on the unit circle

Using a convergence theorem for Fourier–Padé approximants constructed from orthogonal polynomials on the unit circle, we prove an analogue of Hadamard's theorem for determining the radius of m-meromorphy of a function analytic on the unit disk and apply this to the location of poles of the reciprocal of Szeg functions.     

On the summability of the formal solutions for some PDEs with irregular singularity

In this Note, we consider some classes of nonlinear partial differential equations with regular singularity with respect to t=0 and irregular one with respect to x=0. Our purpose is to establish a result which is similar to the k-summability property, known in the case of singular ordinary differential equations. We can prove that, except at most a countable set, the formal solution is Borel summable or k-summable with respect to x in all other directions. To cite this article: Z. Luo et al., C. R. Acad. Sci. Paris, Ser. I 336 (2003).     

A modified method of characteristics incorporating streamline diffusion

A hybrid finite-element method, combining ideas from a modified method of characteristics and the streamline diffusion method, delivers accurate solutions to the advection–diffusion equation. An error analysis for the case of tensorial diffusion shows that the lowest-order version of the scheme, which allows one to use a symmetric linear solvers at each time step, possesses first-order accuracy in time and space. Numerical experiments demonstrate the scheme's ability to model advection-dominated transport of solute plumes without distorting sharp fronts. © 1995 John Wiley & Sons, Inc.     

Piezooptical optical bistability

A glass fiber piezooptical optical bistability device is reported.Basing on pho-toelastic and strain effects of single-mode fiber,we have realized piezooptical modulation andperformed experiments of optical bistability.     

线性电压扫描下1VIIS器件瞬态的简单模型

本文用准平衡模型分析讨论了线性电压扫描下MIS器件的I/V瞬态.文中除了给出一般的处理方法以外，还给出了几种不同电压扫描率下I/Y特性的计算结果，并与已往的模型作了比较.     

A preconditioned domain decomposition algorithm for the solution of the elliptic Neumann problem

A new preconditioned conjugate gradient (PCG)-based domain decomposition method is given for the solution of linear equations arising in the finite element method applied to the elliptic Neumann problem. The novelty of the proposed method is in the recommended preconditioner which is constructed by using cyclic matrix. The resulting preconditioned algorithms are well suited to parallel computation.