Rashba polarization in HgCdTe inversion layers at large depletion charges

The Rashba effect in metal–insulator–semiconductor (MIS) structures based on zero-gap HgCdTe is investigated experimentally and theoretically over a wide doping range N_A–N_D=3×10¹⁵–3×10¹⁸ cm⁻³. Increase of doping enlarges the magnitude of the effect at the same 2D concentration and strengthens a gate-voltage dependence of the Rashba splitting. The results demonstrate values of Rashba polarization as high as P_R0.5 and a capability to control the Rashba effect strength at constant electron concentration.     

一种高速多通道光纤阵列光开关

为了对短时间大视场一维光强信息进行采集,采用编码转换技术和自聚焦透镜矩形阵列设计了光开关,用小口径电光晶体实现了大视场的测量.采用MOS管级联的高压同步电路,使得系统具有结构紧凑、性价比高、寿命长等优点.实验结果表明:开关选通时间100±5 ns,前后沿小于25 ns,消光比1 100∶1.     

Effects of Y incorporation in TaON gate dielectric on electrical performance of GaAs metal–oxide–semiconductor capacitor

In this study, GaAs metal–oxide–semiconductor (MOS) capacitors using Y‐incorporated TaON as gate dielectric have been investigated. Experimental results show that the sample with a Y/(Y + Ta) atomic ratio of 27.6% exhibits the best device characteristics: high k value (22.9), low interfacestate density (9.0 × 10¹¹ cm^–2 eV^–1), small flatband voltage (1.05 V), small frequency dispersion and low gate leakage current (1.3 × 10^–5A/cm² at V_fb + 1 V). These merits should be attributed to the complementary properties of Y₂O₃ and Ta₂O₅:Y can effectively passivate the large amount of oxygen vacancies in Ta₂O₅, while the positively‐charged oxygen vacancies in Ta₂O₅ are capable of neutralizing the effects of the negative oxide charges in Y₂O₃. This work demonstrates that an appropriate doping of Y content in TaON gate dielectric can effectively improve the electrical performance for GaAs MOS devices.

Capacitance–voltage characteristic of the GaAs MOS capacitor with TaYON gate dielectric (Y content = 27.6%) proposed in this work with the cross sectional structure and dielectric surface morphology as insets.     

On Bateman's method for second kind integral equations

Summary Under suitable conditions, we prove the convergence of the Bateman method for integral equations defined over bounded domains inR ^d ,d1. The proof makes use of Hilbert space methods, and requires the integral operator to be non-negative definite. For one-dimensional integral equations over finite intervals, estimated rates of convergence are obtained which depend on the smoothness of the kernel, but are independent of the inhomogeneous term. In particular, for aC kernel andn reasonably spaced Bateman points, the convergence is shown to be faster than any power of 1/n. Numerical calculations support this result.     

An asymptotic finite element method for improvement of solutions of boundary layer problems

Summary A scheme that uses singular perturbation theory to improve the performance of existing finite element methods is presented. The proposed scheme improves the error bounds of the standard Galerkin finite element scheme by a factor of O(ⁿ⁺¹) (where is the small parameter andn is the order of the asymptotic approximation). Numerical results for linear second order O.D.E.'s are given and are compared with several other schemes.     

Mixed finite element approximation of the vector potential

Summary We consider a mixed finite element approximation of the three dimensional vector potential, which plays an important rôle in the simulation of perfect fluids and in the calculation of rotational corrections to transonic potential flows. The central point of our approach is a saddlepoint formulation of the essential boundary conditions. In particular, this avoids the wellknown Babuka paradox when approximating smooth domains by polyhedrons. Using piecewise linear/piecewise constant elements for the vector potential/the boundary terms, we obtain optimal error estimates under minimal regularity assumptions for the solution of the continuous problem.     

Spline collocation for singular integro-differential equations over (0.1)

Summary This paper analyses the convergence of spline collocation methods for singular integro-differential equations over the interval (0.1). As trial functions we utilize smooth polynomial splines the degree of which coincides with the order of the equation. Depending on the choice of collocation points we obtain sufficient and even necessary conditions for the convergence in sobolev norms. We give asymptotic error estimates and some numerical results.     

The average a posteriori error of numerical methods

Summary The definition of the average error of numerical methods (by example of a quadrature formula to approximateS(f)= f d on a function classF) is difficult, because on many important setsF there is no natural probability measure in the sense of an equidistribution. We define the average a posteriori error of an approximation by an averaging process over the set of possible information, which is used by (in the example of a quadrature formula,N(F)={(f(a ₁), ...,f/fF} is the set of posible information). This approach has the practical advantage that the averaging process is related only to finite dimensional sets and uses only the usual Lebesgue measure. As an application of the theory I consider the numerical integration of functions of the classF={f:[0,1]/f(x)–f(y)||x–y|}. For arbitrary (fixed) knotsa _i we determine the optimal coefficientsc _i for the approximation and compute the resulting average error. The latter is minimal for the knots . (It is well known that the maximal error is minimal for the knotsa _i .) Then the adaptive methods for the same problem and methods for seeking the maximum of a Lipschitz function are considered. While adaptive methods are not better when considering the maximal error (this is valid for our examples as well as for many others) this is in general not the case with the average error.     

On the eigenvalue distribution of a class of preconditioning methods

Summary A class of preconditioning methods depending on a relaxation parameter is presented for the solution of large linear systems of equationAx=b, whereA is a symmetric positive definite matrix. The methods are based on an incomplete factorization of the matrixA and include both pointwise and blockwise factorization. We study the dependence of the rate of convergence of the preconditioned conjugate gradient method on the distribution of eigenvalues ofC ^–1 A, whereC is the preconditioning matrix. We also show graphic representations of the eigenvalues and present numerical tests of the methods.     

Finite element approximation on incompressible Navier-Stokes equations with slip boundary condition

Summary We consider a mixed finite element approximation of the stationary, incompressible Navier-Stokes equations with slip boundary condition, which plays an important rôle in the simulation of flows with free surfaces and incompressible viscous flows at high angles of attack and high Reynold's numbers. The central point is a saddle-point formulation of the boundary conditions which avoids the well-known Babuka paradox when approximating smooth domains by polyhedrons. We prove that for the new formulation one can use any stable mixed finite element for the Navier-Stokes equations with no-slip boundary condition provided suitable bubble functions on the boundary are added to the velocity space. We obtain optimal error estimates under minimal regularity assumptions for the solution of the continous problem. The techniques apply as well to the more general Navier boundary condition.