Finite‐size corrections at the hard edge for the Laguerre β ensemble

A fundamental question in random matrix theory is to quantify the optimal rate of convergence to universal laws. We take up this problem for the Laguerre β ensemble, characterized by the Dyson parameter β, and the Laguerre weight , in the hard edge limit. The latter relates to the eigenvalues in the vicinity of the origin in the scaled variable . Previous work has established the corresponding functional form of various statistical quantities—for example, the distribution of the smallest eigenvalue, provided that . We show, using the theory of multidimensional hypergeometric functions based on Jack polynomials, that with the modified hard edge scaling , the rate of convergence to the limiting distribution is , which is optimal. In the case , general the explicit functional form of the distribution of the smallest eigenvalue at this order can be computed, as it can for and general . An iterative scheme is presented to numerically approximate the functional form for general .     

Transition‐Metal‐Free Trifluoromethylthiolation of N‐Heteroarenes

A general and efficient methodology for the direct transition metal free trifluoromethylthiolation of a broad range of biologically relevant N‐heteroarenes is reported employing abundant sodium chloride as the catalyst. This method is operationally simple, exhibits high functional group tolerance, and does not require protecting groups.     

Spectral estimates for saddle point matrices arising in weak constraint four‐dimensional variational data assimilation

We consider the large sparse symmetric linear systems of equations that arise in the solution of weak constraint four‐dimensional variational data assimilation, a method of high interest for numerical weather prediction. These systems can be written as saddle point systems with a 3 × 3 block structure but block eliminations can be performed to reduce them to saddle point systems with a 2 × 2 block structure, or further to symmetric positive definite systems. In this article, we analyse how sensitive the spectra of these matrices are to the number of observations of the underlying dynamical system. We also obtain bounds on the eigenvalues of the matrices. Numerical experiments are used to confirm the theoretical analysis and bounds.     

Negative compressibility property in hinging open-cell Kelvin structure

A new three-dimensional(3 D) cellular model based on hinging open-cell Kelvin structure is proposed for its negative compressibility property. It is shown that this model has adjustable compressibility and does exhibit negative compressibility for some certain conformations. And further study shows that the images of compressibility are symmetrical about the certain lines, which indicates that the mechanical properties of the model in the three axial directions are interchangeable and the model itself has a certain geometric symmetry. A comparison of the Kelvin model with its anisotropic form with the dodecahedron model shows that the Kelvin model has stronger negative compressibility property in all three directions.Therefore, a new and potential method to improve negative compressibility property can be derived by selecting the system type with lower symmetry and increasing the number of geometric parameters.     

Thermal gradient induced sidebranching in directional solidification

The polycrystalline perovskitelike manganese oxides La_1-xA_xMnO (A = Na, and K, ) have been fabricated by sol-gel technique. For all the compositions explored in this work, the average manganese oxidation state is practically constant, at for A = Na, and for A = K, respectively. A close relationship is confirmed to hold between the Curie temperature (T_c) and the bond distance of Mn-O. Results of magnetic measurements show that these materials can be utilized as suitable candidates for magnetic refrigerants with wide applied temperature span, for their significant entropy change and the easily tuned Curie temperature. Received: 12 September 1997 / Revised: 18 December 1997 / Accepted: 21 January 1998     

Efficient Collocation Schemes for Singular Boundary Value Problems

We discuss an error estimation procedure for the global error of collocation schemes applied to solve singular boundary value problems with a singularity of the first kind. This a posteriori estimate of the global error was proposed by Stetter in 1978 and is based on the idea of Defect Correction, originally due to Zadunaisky. Here, we present a new, carefully designed modification of this error estimate which not only results in less computational work but also appears to perform satisfactorily for singular problems. We give a full analytical justification for the asymptotical correctness of the error estimate when it is applied to a general nonlinear regular problem. For the singular case, we are presently only able to provide computational evidence for the full convergence order, the related analysis is still work in progress. This global estimate is the basis for a grid selection routine in which the grid is modified with the aim to equidistribute the global error. This procedure yields meshes suitable for an efficient numerical solution. Most importantly, we observe that the grid is refined in a way reflecting only the behavior of the solution and remains unaffected by the unsmooth direction field close to the singular point.     

Improving the rate of convergence of Newton methods on Banach spaces with a convergence structure and applications

In this note, we use inexact Newton-like methods to find solutions of nonlinear operator equations on Banach spaces with a convergence structure. Our technique involves the introduction of a generalized norm as an operator from a linear space into a partially ordered Banach space. In this way, the metric properties of the examined problem can be analyzed more precisely. Moreover, this approach allows us to derive from the same theorem, on the one hand, semilocal results of Kantorovich-type, and on the other hand, global results based on monotonicity considerations. By imposing very general Lipschitz-like conditions on the operators involved, on the one hand, we cover a wider range of problems, and on the other hand, by choosing our operators appropriately, we can find sharper error bounds on the distances involved than before. Furthermore, we show that special cases of our results reduce to the corresponding ones already in the literature. Finally, several examples are being provided where our results compare favorably with earlier ones.     

A semi-analytical numerical method for time-dependent radiative transfer problems in slab geometry with coherent isotropic scattering

We describe a semi-analytical numerical method for coherent isotropic scattering time-dependent radiative transfer problems in slab geometry. This numerical method is based on a combination of two classes of numerical methods: the spectral methods and the Laplace transform (LTS_N) methods applied to the radiative transfer equation in the discrete ordinates (S_N) formulation. The basic idea is to use the essence of the spectral methods and expand the intensity of radiation in a truncated series of Laguerre polynomials in the time variable and then solve recursively the resulting set of “time-independent” S_N problems by using the LTS_N method. We show some numerical experiments for a typical model problem.     

Yb3+掺杂KY(WO4)2激光晶体生长、结构与光谱分析

采用顶部籽晶提拉法(TSSG)生长出Yb:KY(WO₄)₂(Yb:KYW)激光晶体.对预烧后的原料及晶体进行了XRD分析，结果表明，分别在920℃和600℃预烧8h后的熔质和助熔剂基本上形成一相，抑止了实验中的挥发问题；所生长的晶体为β-Yb:KYW，计算其晶格常数为a=1.063nm，b=1.034nm，c=0.755nm，β=130.75°.测得不同厚度样品的吸收光谱，结果表明样品在933nm和981nm有较强的吸收峰，计算出主峰981nm的吸收截面σ关键词： Yb:KYW TSSG法 晶体结构 光谱参数     

An Improved Gradient Projection-based Decomposition Technique for Support Vector Machines

In this paper we propose some improvements to a recent decomposition technique for the large quadratic program arising in training support vector machines. As standard decomposition approaches, the technique we consider is based on the idea to optimize, at each iteration, a subset of the variables through the solution of a quadratic programming subproblem. The innovative features of this approach consist in using a very effective gradient projection method for the inner subproblems and a special rule for selecting the variables to be optimized at each step. These features allow to obtain promising performance by decomposing the problem into few large subproblems instead of many small subproblems as usually done by other decomposition schemes. We improve this technique by introducing a new inner solver and a simple strategy for reducing the computational cost of each iteration. We evaluate the effectiveness of these improvements by solving large-scale benchmark problems and by comparison with a widely used decomposition package.