复微分方程组的代数解

本文研究了一类复微分方程组的代数解的存在问题.利用最大模原理和Nevanlinna值分布理论,得到了一个结论,推广和改进了一些文献的结果,例子表明结论精确.     

Comparison of multigrid algorithms for high‐order continuous finite element discretizations

We present a comparison of different multigrid approaches for the solution of systems arising from high‐order continuous finite element discretizations of elliptic partial differential equations on complex geometries. We consider the pointwise Jacobi, the Chebyshev‐accelerated Jacobi, and the symmetric successive over‐relaxation smoothers, as well as elementwise block Jacobi smoothing. Three approaches for the multigrid hierarchy are compared: (1) high‐order h‐multigrid, which uses high‐order interpolation and restriction between geometrically coarsened meshes; (2) p‐multigrid, in which the polynomial order is reduced while the mesh remains unchanged, and the interpolation and restriction incorporate the different‐order basis functions; and (3) a first‐order approximation multigrid preconditioner constructed using the nodes of the high‐order discretization. This latter approach is often combined with algebraic multigrid for the low‐order operator and is attractive for high‐order discretizations on unstructured meshes, where geometric coarsening is difficult. Based on a simple performance model, we compare the computational cost of the different approaches. Using scalar test problems in two and three dimensions with constant and varying coefficients, we compare the performance of the different multigrid approaches for polynomial orders up to 16. Overall, both h‐multigrid and p‐multigrid work well; the first‐order approximation is less efficient. For constant coefficients, all smoothers work well. For variable coefficients, Chebyshev and symmetric successive over‐relaxation smoothing outperform Jacobi smoothing. While all of the tested methods converge in a mesh‐independent number of iterations, none of them behaves completely independent of the polynomial order. When multigrid is used as a preconditioner in a Krylov method, the iteration number decreases significantly compared with using multigrid as a solver. Copyright © 2015 John Wiley & Sons, Ltd.     

Analysis of an aggregation‐based algebraic two‐grid method for a rotated anisotropic diffusion problem

A two‐grid convergence analysis based on the paper [Algebraic analysis of aggregation‐based multigrid, by A. Napov and Y. Notay, Numer. Lin. Alg. Appl. 18 (2011), pp. 539–564] is derived for various aggregation schemes applied to a finite element discretization of a rotated anisotropic diffusion equation. As expected, it is shown that the best aggregation scheme is one in which aggregates are aligned with the anisotropy. In practice, however, this is not what automatic aggregation procedures do. We suggest approaches for determining appropriate aggregates based on eigenvectors associated with small eigenvalues of a block splitting matrix or based on minimizing a quantity related to the spectral radius of the iteration matrix. Copyright © 2015 John Wiley & Sons, Ltd.     

Three‐Phase Barker Arrays

A 3‐phase Barker array is a matrix of third roots of unity for which all out‐of‐phase aperiodic autocorrelations have magnitude 0 or 1. The only known truly two‐dimensional 3‐phase Barker arrays have size 2 × 2 or 3 × 3. We use a mixture of combinatorial arguments and algebraic number theory to establish severe restrictions on the size of a 3‐phase Barker array when at least one of its dimensions is divisible by 3. In particular, there exists a double‐exponentially growing arithmetic function T such that no 3‐phase Barker array of size with exists for all . For example, , , and . When both dimensions are divisible by 3, the existence problem is settled completely: if a 3‐phase Barker array of size exists, then .     

Aligning retention time shifts in HPLC three‐dimensional spectra by icoshift approach combined with data arrangement methods and the release of a graphical user interface

High‐performance liquid chromatography coupled with photodiode array detection has been extensively applied in many fields and the peaks among the analyzed samples can be shifted due to the variations of instrumental and experimental conditions. In multivariate analysis, retention time alignment is an important pretreatment step. Hence, the shifted peaks in high‐performance liquid chromatography coupled with photodiode array detection three‐dimensional spectra should be aligned for further analysis. Being motivated by this purpose, the interval correlated shifting method combined with the proposed data arrangement methods are recommended and employed on high‐performance liquid chromatography coupled with photodiode array detection data as a demonstration. We validate the alignment performance of the proposed method through comparison the consistency of the retention time before and after alignment. The obtained results demonstrated that the proposed method is capable of successful aligning the employed data. Additionally, the interval correlated shifting method combined with the data arrangement modes is implemented in an easy‐to‐use graphical user interface environment and so can be operated easily by users not familiar with programming languages.     

Experimental line broadening and line shift coefficients of the acetylene ν1 + ν3 band pressurized by hydrogen and deuterium and comparison with calculations

Theoretical and experimental values have been determined for the pressure broadening of the ν₁ + ν₃ band of acetylene by hydrogen and deuterium at 195 K, and experimental values of the pressure shifts have been determined. Theoretical values have been calculated on the basis of a recent potential energy surface using the close coupling scheme. We discuss the detailed contribution of the various rotational angular momenta of the perturbing gas and the ortho and para contribution to the total pressure broadening cross-sections. We give routes to circumvent the computational cost of such calculations. Experimental values have been measured using a tunable diode laser spectrometer assuming a Voigt line shape. These pressure broadening parameters are compared with measurements performed recently at room temperature and with present measurements performed at 195 K in the ν₁ + ν₃ band of acetylene. A satisfactory agreement is obtained with the present results and available ones at 295 K.     

基于代数滑移模型的光催化反应器内催化剂颗粒分布特性研究

针对光催化制氢反应器内液固两相流的特点,运用代数滑移模型,对反应器内的催化剂颗粒-水两相流动进行了数值模拟。采用分块的结构化网格,并运用多重网格方法进行求解。通过与前人实验中压力梯度结果的比较,对模型进行了验证,并最终得到了反应器内催化剂颗粒的典型分布及相应的类型图。     

Terahertz optical asymmetric demultiplexer based tree-net architecture for all-optical conversion scheme from binary to its other 2n radix based form

To exploit the parallelism of optics in data processing,a suitable number system and an efficient encoding/decoding scheme for handling the data are very essential.In the field of optical computing and parallel information processing,several number systems like binary,quaternary,octal,hexadecimal,etc.have been used for different arithmetic and algebraic operations.Here,we have proposed an all-optical conversion scheme from its binary to its other 2n radix based form with the help of terahertz optical asymmetric demultiplexer (TOAD) based tree-net architecture.     

Fuzzy半群中的Fuzzy理想

本文先引入Ｆｕｚｚｙ半群中Ｆｕｚｚｙ理想的概念，进而讨论它们的一些代数性质，推广了前人的一些结果。     

The ABC Conjecture Implies Vojta's Height Inequality for Curves

Following Elkies (Internat. Math. Res. Notices7 (1991) 99-109) and Bombieri (Roth's theorem and the abc-conjecture, preprint, ETH Zürich, 1994), we show that the ABC conjecture implies the one-dimensional case of Vojta's height inequality. The main geometric tool is the construction of a Belyǐ function. We take care to make explicit the effectivity of the result: we show that an effective version of the ABC conjecture would imply an effective version of Roth's theorem, as well as giving an (in principle) explicit bound on the height of rational points on an algebraic curve of genus at least two.