GO-空间乘积的子空间

数学家 N.Kemoto,T.Nogura,K.D.Sm ith和 Y .Yajim a 1996年证明了两个序数乘积的子空间的正规性、集体正规性、收缩性是等价的 .本文把这个命题进行了推广 ,得到了两个 GO -空间乘积的任意子空间的正规性、集体正规性、收缩性是等价的 .     

高考对导数考查的新视角

导数是研究函数性质的重要工具,又是高中数学与高等数学衔接最为紧密的内容,因此在高考中成为了命题的热点.导数是研究函数的工具,研究函数方面,核心是单调性,因为求极值、最值都要用到单调性.证明不等式要用单调性或最大值.研究方程零点和曲线交点时,要借助图像的走向,而走向还是用单调性.所以,高考复习时,要把单调性作为核心,把其他内容作为单调性的应用.     

滞后控制系统的完全能控性、毕竟能控性、最终能控性和拟能控性

讨论时滞控制系统的能控性 .指出与无时滞系统不同的是 ,该类系统的能控性与终点时刻有一定的关系 .由此给出一系列与终点时刻有关的能控性 ,即完全能控性、毕竟能控性、最终能控性等 ,并得到一些判定定理 .     

组模偏正则化及其应用

本文研究组模下偏正则最小化问题,证明了解的存在性,稀疏性.研究了零空间性质对最优解的刻画.仔细探讨了解的一种单调性,并应用这种单调性说明最优化问题的求解可以分解到各组中.最后给出了一个所证定理在地震反演的应用.     

边值系统的能控性与能观测性问题

把抽象系统的能控性和能观测性推广到由强连续双半群描述的抽象边值系统,给出了相应的边值系统能控性的充要条件,并研究了能观测性与能控性之间的对偶关系.最后作为例子,研究了双曲系统能控性.文中所得的结果可用于讨论现代物理系统中出现一类边值系统的能控性与能观测性问题.     

动力系统中紧的指数吸引集的存在性

本文研究了一般形式的无穷维动力系统.利用非紧性测度理论,当非紧性测度指数衰减时,获得了紧的指数吸引集的存在性条件.同时给出了易于验证非紧性测度指数衰减的方法.     

复发事件下一类加性乘性转移模型p阶矩指数稳定性北大核心CSCD

复发事件数据频繁的出现在纵向研究中,本文基于生物医学中的单类型复发事件数据,提出了一类加性乘性转移模型,该模型包含了一些重要的半参数模型.同时,模型允许协变量具有加性和乘性的影响,且加性影响随时间而变化.利用广义估计方程的思想,对模型中未知参数和非参数函数进行了估计,并证明了所得估计的相合性和渐近正态性.最后,用数值模拟的方法验证了所提估计的可行性.     

广义H-空间的理论及其应用*

本文给出了广义H-空间的完备性特征性质和紧性特征性质,同时也研究了这一空间的度量化定理.作为这些理论的应用.我们得到了Menger概率度量空间的完备性特征和紧性特征.给出了该空间的度量化函数的具体形式.     

正交空间填充设计的最新结果

正交性与空间填充性是计算机试验设计的两个重要性质.本文提出通用的旋转方法用以构造一类新的正交空间填充设计.这类设计既具有正交性,又有理想的空间填充性.此外,本文提出的构造方法简单易行,且生成的设计具有灵活的试验次数和水平数.生成的设计既可以是对称的,也可以是非对称的.相关理论支撑科学严谨.本文构造并给出许多新的具有理想的空间填充性的正交设计.旋转矩阵和差阵在构造中起到重要的作用.     

次正规子群与有限群的超可解性

通过Sylow子群的极大子群和次正规性,利用极小阶反例的方法,得出群p-幂零性和超可解性的结论.本文的创新改进之处在于结合Sylow子群的极大子群和次正规性,研究p-幂零性和超可解性的相关结论.     

On the accuracy of the projection computation of the collision integral

The accuracy of the projection method as applied to the computation of the collision integral is analyzed. It is shown that the method has an error of the second order of smallness with respect to the mesh size. An optimal method for choosing additional nodes that minimizes the computational error is found. The theoretical conclusions and the optimality of the method are confirmed in a series of numerical experiments.     

On the Convergence of the Cross-Entropy Method

The cross-entropy method is a relatively new method for combinatorial optimization. The idea of this method came from the simulation field and then was successfully applied to different combinatorial optimization problems. The method consists of an iterative stochastic procedure that makes use of the importance sampling technique. In this paper we prove the asymptotical convergence of some modifications of the cross-entropy method.     

On the regularizing properties of the GMRES method

Summary. The GMRES method is a popular iterative method for the solution of large linear systems of equations with a nonsymmetric nonsingular matrix. However, little is known about the behavior of this method when it is applied to the solution of nonsymmetric linear ill-posed problems with a right-hand side that is contaminated by errors. We show that when the associated error-free right-hand side lies in a finite-dimensional Krylov subspace, the GMRES method is a regularization method. The iterations are terminated by a stopping rule based on the discrepancy principle. Received November 10, 2000 / Revised version received April 11, 2001 / Published online October 17, 2001     

On the convergence of the UOBYQA method

We analyze the convergence properties of Powell's UOBYQA method. A distinguished feature of the method is its use of two trust region radii. We first study the convergence of the method when the objective function is quadratic. We then prove that it is globally convergent for general objective functions when the second trust region radius ρ converges to zero. This gives a justification for the use of ρ as a stopping criterion. Finally, we show that a variant of this method is superlinearly convergent when the objective function is strictly convex at the solution.     

On the cubic convergence of the Paardekooper method

We show a simple way how asymptotic convergence results can be conveyed from a simple Jacobi method to a block Jacobi method. Our pilot methods are the well known symmetric Jacobi method and the Paardekooper method for reducing a skew-symmetric matrix to the real Schur form. We show resemblance in the quadratic and cubic convergence estimates, but also discrepances in the asymptotic assumptions. By numerical tests we confirm that our asymptotic assumptions for the Paardekooper method are most general.     

The estimation of the strength of the heat source in the heat conduction problems

A general method is proposed to determine the strength of the heat source in the Fourier and non-Fourier heat conduction problems. A finite difference method, the concept of the future time and a modified Newton–Raphson method are adopted in the problem. The undetermined heat source at each time step is formulated as an unknown variable in a set of equations from the measured temperature and the calculated temperature. Then, an iterative process is used to solve the set of equations. No selected function is needed to represent the undetermined function in advance. Three examples are used to demonstrate the characteristics of the proposed method. The validity of the proposed method is confirmed by the numerical results. The results show that the proposed method is an accurate and stable method to determine the strength of the heat source in the inverse hyperbolic heat conduction problems. Furthermore, the result shows that more future times are needed in the hyperbolic equation than that of parabolic equation. Moreover, the robustness and the accuracy of the estimated results in the non-Fourier problem are not as well as those of the Fourier problem.     

Changing poles in the rational Lanczos method for the Hermitian eigenvalue problem

Applications such as the modal analysis of structures and acoustic cavities require a number of eigenvalues and eigenvectors of large‐scale Hermitian eigenvalue problems. The most popular method is probably the spectral transformation Lanczos method. An important disadvantage of this method is that a change of pole requires a complete restart. In this paper, we investigate the use of the rational Krylov method for this application. This method does not require a complete restart after a change of pole. It is shown that the change of pole can be considered as a change of Lanczos basis. The major conclusion of this paper is that the method is numerically stable when the poles are chosen in between clusters of the approximate eigenvalues. Copyright © 2001 John Wiley & Sons, Ltd.     

On the effect of numerical integration in the Galerkin boundary element method

Summary. We discuss the effect of cubature errors when using the Galerkin method for approximating the solution of Fredholm integral equations in three dimensions. The accuracy of the cubature method has to be chosen such that the error resulting from this further discretization does not increase the asymptotic discretization error. We will show that the asymptotic accuracy is not influenced provided that polynomials of a certain degree are integrated exactly by the cubature method. This is done by applying the Bramble-Hilbert Lemma to the boundary element method. Received May 24, 1995     

利用散射波远场模第P个傅立叶系数重建声波阻尼系数

阐述了利用声波散射远场模Fourier展开的第P个傅立叶系数（声散射远场模的不完全信息）,重建声阻抗系数的一种非线性最优化方法．并给出了该方法收敛性的证明,其数值例子说明这种方法的有效性和可行性．     

Analysis of a finite element method for the drift-diffusion semiconductor device equations: the multidimensional case

Summary. An explicit finite element method for numerically solving the drift-diffusion semiconductor device equations in two space dimensions is analyzed. The method is based on the use of a mixed finite element method for the approximation of the electric field and a discontinuous upwinding finite element method for the approximation of the electron and hole concentrations. The mixed method gives an approximate electric field in the precise form needed by the discontinuous method, which is trivially conservative and fully parallelizable. It is proven that the method produces uniformly bounded concentrations and electric fields and that it converges to the exact solution provided there is a convergent subsequence of the electron concentrations. Numerical simulations are presented that display the performance of the method and indicate the behavior of the solution. Received September 9, 1993 / Revised version received May 25, 1994