自由群的直积的检验元素的注记

本文研究了自由群的直积的检验元素,通过对直积的自同态的分解,得到了直积中的元素为检验元素的充分必要条件,改进了O'neill和Turner的结果.此外,构造了两类具体的检验元素.     

乘方的指数与其幂的位数的关系

为了探究乘方的指数与其幂的位数的关系,定义了几个有关的新概念,并且证明了两个关于乘方以及进制进位的定理,由此建立起关于乘方以及进制进位的理论体系,其中包括进位理论中判定乘方的指数与其幂的位数是否存在周期规律的判别法,以及进位规律的求解法和四条相关的性质.     

Lindelf的工作与Chaplygin的工作的互补性

运用Vakonomic模型导出Lindel f方程 ,表明Lindel f的工作与Vakonomic模型相吻合 ;运用Chetaev模型导出Chaplygin方程 ,表明Chaplygin的工作与Chetaev模型相吻合·　在此基础上 ,通过改进Chaplygin方程和Lindel f方程的表示形式 ,实现了从Lindel f方程向Chaplygin方程的合理过渡和从Chaplygin方程向Lindel f方程的合理的过渡·　最后 ,给出一个典型实例·　结果表明 ,正如Vako nomic模型与Chetaev模型是互补的一样 ,Lindel f的工作与Chaplygin的工作也是互补的·     

一元二次方程根的判别式的应用

<正>一元二次方程根的判别式是初中数学的重要内容,本文以近年中考中所考查的题型为例,归纳整理如下,供同仁们参考.一、求待定字母的取值范围(1)已知方程根的情况,求待定字母的取值范围例1若关于x的方程(k-1)x2+2(k)^(1/2)x+1=0有两个不相等的实数根.求k的獉獉取值范围.析解由题意"方程有两个不相等的实数獉獉根"可知:该方程是一元二次方程,且Δ>0,即     

树的最大特征值的上界的一个注记

设T是一个树,V是T的顶点集．记dv是υ∈V的度,△是T的最大顶点度．设υ∈V且dw=1．记k=ew+1,这里ew是w的excentricity．设δj′= max{dυ:dist(υ,w)=j},j=1,2,…,k-2,我们证明和这里μ1(T)和λ1(T)分别是T的Laplacian矩阵和邻接矩阵的最大特征值．特别地,记δo′=2．     

计算Hamilton矩阵特征值的一个稳定的有效的保结构的算法

提出了一个稳定的有效的保结构的计算Hamilton矩阵特征值和特征不变子空间的算法,该算法是由SR算法改进变形而得到的。在该算法中,提出了两个策略,一个叫做消失稳策略,另一个称为预处理技术。在消失稳策略中,通过求解减比方程和回溯彻底克服了Bunser Gerstner和Mehrmann提出的SR算法的严重失稳和中断现象的发生,两种策略的实施的代价都非常低。数值算例展示了该算法比其它求解Hamilton矩阵特征问题的算法更有效和可靠。     

函数的商的不定积分

本文给出了函数的商的不定积分公式,揭示了该公式的应用方法.     

多维的一般的BBM-Burgers方程解的逐点估计

研究R~n中一般的BBM-Burgers方程解的渐进行为.运用Green函数法和Fourier分析方法得到了在非零常状态u~*附近小扰动解的逐点估计,作为一个推论,又得到了L~p(R~n)(1≤p∞)空间解的最佳的衰减估计.     

有趣的圆的膨胀和收缩

向平静的湖面投入一颗石子,形成水波纹,这水波纹构成以投入点为圆心的一族同心圆,给我们以点膨胀为圆的最好形象.反之如图1,⊙O的半径OA=r,让⊙O的半径逐渐缩小,形成一族同心圆,当⊙O的半径r趋近于零时,⊙O收缩为一点O,因此,把点看成半径长为零的圆.     

抛物线上的点列构成的多边形的面积问题

引理设Pn,Pn＋d,Pn＋2d,…,Pn＋（k-1）d是抛物线y=ax^2＋vx＋c（a,b,c为常数,a≠0）上的点列（注：本文用只表示函数图象上横坐标为t的点）,则k边形Pn＋dPn＋2d…Pn＋（k-1）d的面积S与n无关（即与点列的起始位置无关）,     

A hybrid method for inverse cavity scattering problem for shape

In this paper, we give a hybrid method to numerically solve the inverse open cavity scattering problem for cavity shape, given the scattered solution on the opening of the cavity. This method is a hybrid between an iterative method and an integral equations method for solving the Cauchy problem. The idea of this hybrid method is simple, the operation is easy, and the computation cost is small. Numerical experiments show the feasibility of this method, even for cases with noise.     

对流扩散方程的有限体积-有限元方法的误差估计

本文结合有限体积方法和有限元方法处理非线性对流扩散问题,非线性对流项利用有限体积方法处理,扩散项利用有限元方法离散,并给近似解的误差估计。     

Asymptotic Initial-Value Method for Singularly-Perturbed Boundary-Value Problems for Second-Order Ordinary Differential Equations

A computational method is presented to solve a class of nonturning-point singularly-perturbed two-point boundary-value problems for second-order ordinary differential equations with a small parameter multiplying the highest derivative, subject to Dirichlet-type boundary conditions. In this method, first we construct a zeroth order asymptotic expansion for the solution of the given boundary-value problem. Then, this problem is integrated to get an equivalent initial-value problem for first-order ordinary differential equations. This initial-value problem is solved by either a classical method or a fitted operator method after approximating some of the terms in the differential equations by using the zeroth order asymptotic expansion. This method is effective and easy to implement. An error estimate is derived for the numerical solution. Examples are given to illustrate the method.     

Sixteenth-order method for nonlinear equations

Modification of Newton’s method with higher-order convergence is presented. The modification of Newton’s method is based on King’s fourth-order method. The new method requires three-step per iteration. Analysis of convergence demonstrates that the order of convergence is 16. Some numerical examples illustrate that the algorithm is more efficient and performs better than classical Newton’s method and other methods.     

鞍点问题的修正对称超松弛迭代算法

为了提高求解鞍点问题的迭代算法的速度,通过设置合适的加速变量,对修正超松弛迭代算法（简记作MSOR-like算法）和广义对称超松弛迭代算法（简记作GSSOR-like算法）进行了修正,给出了修正对称超松弛迭代算法,即MSSOR-like （modified symmetric successiveover-relaxation）算法,并研究了该算法收敛的充分必要条件.最后,通过数值例子表明,选择合适的参数后,新算法的迭代速度和迭代次数均优于MSOR-like （modified successive overrelaxation）和GSSOR-like （generalized symmetric successive over-relaxation）算法,因此,它是一种较好的解决鞍点问题的算法.     

Cardinal functions for Legendre pseudo-spectral method for solving the integro-differential equations

In this article, we present a new numerical method to solve the integro-differential equations (IDEs). The proposed method uses the Legendre cardinal functions to express the approximate solution as a finite series. In our method the operational matrix of derivatives is used to reduce IDEs to a system of algebraic equations. To demonstrate the validity and applicability of the proposed method, we present some numerical examples. We compare the obtained numerical results from the proposed method with some other methods. The results show that the proposed algorithm is of high accuracy, more simple and effective.     

Multiplicative Extrapolation Method for Constructing Higher Order Schemes for Ordinary Differential Equations

IntroductionWhenweconstructahigherorderschemeforsystemsofordinarydifferentialequations:y,=f(y)(1)(wherey=y(x),andxisavariable),weoftenusethe"Tayorseriesexpanding"method,butsometimesthismethodisverytediouswhenitisaPpliedtogethigherorderschemes.Thereisanothermethod:Lieseries,itisthemethodweuseinthispaPer.J.Dragt,F,Neri,andStaulySteinberghavedonealotofworkindevelopingthismethod.Fordetails,onecanreferto[4,6,8].WejustaPplythismethodtoourproblem,anddonotneedtocomputeouttheexacttermsofthe"Lieser…     

Algorithms for the CMRH method for dense linear systems

The CMRH (Changing Minimal Residual method based on the Hessenberg process) method is a Krylov subspace method for solving large linear systems with non-symmetric coefficient matrices. CMRH generates a (non orthogonal) basis of the Krylov subspace through the Hessenberg process, and minimizes a quasi-residual norm. On dense matrices, the CMRH method is less expensive and requires less storage than other Krylov methods. In this work, we describe Matlab codes for the best of these implementations. Fortran codes for sequential and parallel implementations are also presented.     

An efficient method for solving difference systems for elliptic differential equations

A method for solving systems of linear algebraic equations arising in connection with the approximation of boundary value problems for elliptic partial differential equations is proposed. This method belongs to the class of conjugate directions method applied to a preliminary transformed system of equations. A model example is used to explain the idea underlying this method and to investigate it. Results of numerical experiments that confirm the method’s efficiency are discussed.     

Linearized ridge-path method for function minimization

A modification based on a linearization of a ridge-path optimization method is presented. The linearized ridge-path method is a nongradient, conjugate direction method which converges quadratically in half the number of search directions required for Powell's method of conjugate directions. The ridge-path method and its modification are compared with some basic algorithms, namely, univariate method, steepest descent method, Powell's conjugate direction method, conjugate gradient method, and variable-metric method. The assessment indicates that the ridge-path method, with modifications, could present a promising technique for optimization.This work was in partial fulfillment of the requirements for the MS degree of the first author at Cairo University, Cairo, Egypt. The authors would like to acknowledge the helpful and constructive suggestions of the reviewer.