数学问题解答

1999年2月号问题解答（解答由问题提供人给出）1176已知x1,x2,…,xn是n个正数,t=x1x2…Xn,且满足求X1,X2,…,Xn的值．解由题设得所以,若X1≠1,则由（1）得（t＋n－1）（t＋n－2）…（t＋1）t＝（n＋1）显然,方程（2）有解t=2,而函数y=（t＋n-1）（t＋n－2）…（t＋1）t在（O,＋）上是增函数,所以t=2也是（2）的唯一正解．将t=2代入题没条件得x1=x2=…=Xn右X1=1,因X2,X3,…,Xn都是正数,故由题设条件易得X2=X3=…=Xu=1.综上所述得X1=X2=…=Xn=1或X1=X2=…=Xn1177设a1,a2,…,anER－,且s＞t＞O．试证：（al’…     

具无限时滞的积分微分方程的周期解的存在性、唯一性及稳定性

1引言考虑如下的Volterra积分微分方程其中t∈R，x∈Rn；A（t），C（t，s），C（t-S）都是n×n连续函数矩阵；f：R→Rn连续．关于方程（1．1）及（1．2）的周期解的存在性问题，已有不少研究工作[1-4]，例如[1]研究了当n＝1时方程（1．1）的周期解的存在性问题．得到了如下结果：定理A[1]如果下列条件满足：（i）A（t＋T），f（t＋T）=f（t），C（t＋T，s＋T）＝C（t；s）对t，s∈R成立，其中T＞0是常数．（ii）方程（1．1）具有“衰退记忆”．（iii）存在着常数K＞1及μ＞0使得A（t）＋K∫t-∞|C（t，s）|ds＜－μ则方程（1．1）…     

Newton方程周期解存在性的构造性证明

本文在条件n2≤α（t）≤gx（t，x）≤b（t）≤（n＋1）2下，构造性地证明了Newton方程x″（t）十g（t，x（t））＝0的2π－周期解的存在唯一性，证明过程同时提供了一种数值计算周期解的方法．     

大型稀疏线性互补问题的行作用法

且引言考虑线性互补问题＊＊P（q，M）：求X二（X；，x。，…，x。厂E”使得x＞O，训x）E＊x＋g＞o，／U（X）一O（1）其中M一（m；。）为nXn矩阵（不必对称），q一切，q。，…，q。）rER“为给定常向量．通常情况下已有求解LCP（q，M）的若干著名算法［‘－’j．本文提出求解LCP（q，M）的一种新算法一行作用法，方法具有如下特点：（i）每次迭代只需n个简单的投影运算，每次投影只涉及矩阵M的一行；（n）生成新的迭代点x‘“‘时只利用前次迭代点／；（iii）对矩阵M不实施任何整体运算．因而适合于求解大型（巨型）稀疏问题，且…     

问题与征解

问题1(供题者:北京大学杨家忠)设x 1,x 2,…,x n,…依次为方程2020 tan x=2021x的所有正根,试计算级数∑+∞n=11 x 2 n的值.问题2(供题者:南京大学梅加强)设f为(-∞,+∞)上的连续函数,如果对每一个x,均有lim h→01 h 3∫h-h f(x+t)t d t=0.证明:f为常值函数.     

积分integral from (1/x~n 1)dx的计算

对于积分当n较小时，好计算，但当n较大时，例如n=6、7等，很难计算．现在利用橡模佛定理、欧拉公式和一些基本方法求出它的原函数，并举例说明其应用．被积函数由律模佛定理可知：方程Xn＋1=0的解为其中．因此有的计算由（1）可得又根据欧拉公式1．3化简由于方程X”＋1一0的根具有共轭性，故有若n为偶数，则上式为若n为奇数，则上式为2计算实例当n较大时，运用上述公式非常简单，现举两个例子说明．。．．。＿l‘l例呈求I＝＝＝－dXJ。x‘＋1解n二7，可列表如下：［＊。」8表示X21时＊。的值减去X一0时＊。的值，［用z亦同．例2求入。一…     

东南大学高等数学试题(150分钟)

一、填空题（每小题3分,共18分）2．设函数由方程确定,则3．曲线与x轴所围图形的面积可用定积分表示为5设f（x）=xe2x则函数f(n)（x）的极小值点为6数列{Xn}收敛的充分必要条件是二、选择题（单项选择,每小题4分,共16分）1．设若f在X=0处可导,则2已知曲线在点p有公共切线,则常数A与点p的坐标分别为3．方程在区间内的实根个数为4设f（X）可微,若定积分的值与工无关,则f（x）等于（A）cex（B）ce－xC）ce2x（D）ce－2x（c为任意常数）三、（每小题6分,共30分）1、计算积分3、计算定积分3．计算定积分4计算积分5设f（x）在x＝0的…     

直线参数方程的应用

如图1所示,经过点尸。(二。,夕。)、倾角是0的直线l的参数方程可写为:为0,如用直角坐标法证相当复杂(略)现用参数法证之. 证:设割线尸。B的参数方程为:(工乌丫)方于矛二xo+t .eosG二yo十tsf”0劣夕产.嘴‘ 、刀产 4 了叮、 rx=戈。十t一eo￡0 几夕==夕。+t·‘ine(t是参数)· 、此方程中参数t的系数的平方和为1.具有这种特征的直线参数方图1(才是参数)将(4)代入(l)并整理得:·t“+2(二。·eoso+r·s￡no)图2程,称为直线参数方程的标准式. 直线参数方程标准式中的参数t的几何意义是表示直线上的定点尸。(二。,y。)到动点尸(二,夕)的有向距离…     

一道常微分方程解的商榷

黄文纲在《中国科学》文[1]中，讨论常微分方程：之X=X’=0的稳定性，给出方程的解：现将其解简化为：此时持解形式：代入方程（1），应有等式：但等式（5）不成立。即文［1］所给方程（1）的解（2）有误。现利用文［2］，给出方程（1）的解。在方程（1）中，此时，户一Zt一万，q—t’则＿、H＿。，＿，、A。…．＿＿．现设函数B（t）一千（A为常数），则现取B（t）＝Al，则（豆）通解为：一道常微分方程解的商榷@赵临龙$陕西安康师专@雷春来$陕西安康师专[1]黄文纲.方程x(t)=p(t)x(t) q(t)x(t)=0的稳定性。中国科学(A).1986(4):359～36…     

与中学老师谈微积分（2）——函数的差商

1函数的差商 1．1差分和差商的概念 设f（x）在区间I上有定义．为了研究f（x）的变化规律，需要考虑它在I中两点u和v处的函数值的差f（v）-f（u），称f（v）-f（u）为函数f（x）在两点u和v的差分．如果记h=v-u，此差分可以写成f（u＋h）-f（u）的形式．     

A class of difference ABS-type algorithms for a nonlinear system of equations

In this paper we give a class of algorithms for solving nonlinear algebraic equations using difference approximations of derivatives. The class is a modification of the original ABS class with the advantage of requiring less function evaluations. Special cases include the methods of Brown and Brent and the discretized Newton method, which is formulated in a way requiring fewer function evaluations per iteration.     

解非线性方程组的一类算法

§1.引言 求解线性方程组 a_i~Tx=b_i,i=1,2,…,n,(1.1)其中a_1,a_2,…,a_n线性无关. 设y~((1))为初值,U~((1))为任意非奇异n阶矩阵,我们用如下方法求解方程组(1.1). 先考虑前k-1个方程组成的亚定方程组 a_i~Tx=b_i,i=1,2,…,k-1.设{U~((k))}={a_1,a_2,…,a_(k-1)},这里{U~((k))}表示由U~((k))的列组成的子空间.显然,rank(U~((k)))=n-b+1.若y~((k))是相应的亚定方程的一个特解,则将其看作方程组     

分数阶Burgers方程的有限元计算(英文)

建立了一维和二维分数阶Burgers方程的有限元格式.时间分数阶导数使用L1方法离散,空间方向使用有限元方法离散.通过选择合适的基函数,将离散后的方程转化成一个非线性代数方程组,并应用牛顿迭代方法求解.数值实验显示出了方法的有效性.     

On the Convergence of the Brent Method

1.IntroductionItiswellknownthattheBrentmethodforsolvingsystemsofnonlinearequati0nsistosolvethefo1lowingsystem:bymaldnguseoftheorthogonaltriangulaxfaCtoriz8tion.SupP0sethatwehaveanaPprokimationx(k)tox*,asoluti0nof(1.1).Thenthek-thiterativeprocedurecanbedescribedasfollows[1]:wherehk/Oisthedifferencestepcorrespondingtotheindexk(wewilldiscussthechoicesofhkinSecti0n4)-Constructanorthogonalmatrix(usuallybytheHouseholdtransf0rmation)Step4.Ifj相似文献   

二维椭圆型方程反问题中优化算法的比较

近年来，决定椭圆型方程系数反问题在地磁、地球物理、冶金和生物等实际问题上有着广泛的应用．本文讨论了二维的决定椭圆型方程系数反问题的数值求解方法．由误差平方和最小原则，这个反问题可化为一个变分问题，并进一步离散化为一个最优化问题，其目标函数依赖于要决定的方程系数．本文着重考察非线性共轭梯度法在此最优化问题数值计算中的表现，并与拟牛顿法作为对比．为了提高算法的效率我们适当选择加快收敛速度的预处理矩阵．同时还考察了线搜索方法的不同对优化算法的影响．数值实验的结果表明，非线性共轭梯度法在这类大规模优化问题中相对于拟牛顿法更有效．     

Euler Discretization and Inexact Restoration for Optimal Control

A computational technique for unconstrained optimal control problems is presented. First, an Euler discretization is carried out to obtain a finite-dimensional approximation of the continuous-time (infinite-dimensional) problem. Then, an inexact restoration (IR) method due to Birgin and Martínez is applied to the discretized problem to find an approximate solution. Convergence of the technique to a solution of the continuous-time problem is facilitated by the convergence of the IR method and the convergence of the discrete (approximate) solution as finer subdivisions are taken. The technique is numerically demonstrated by means of a problem involving the van der Pol system; comprehensive comparisons are made with the Newton and projected Newton methods.     

An improved inexact Newton method

For unconstrained optimization, an inexact Newton algorithm is proposed recently, in which the preconditioned conjugate gradient method is applied to solve the Newton equations. In this paper, we improve this algorithm by efficiently using automatic differentiation and establish a new inexact Newton algorithm. Based on the efficiency coefficient defined by Brent, a theoretical efficiency ratio of the new algorithm to the old algorithm is introduced. It has been shown that this ratio is greater than 1, which implies that the new algorithm is always more efficient than the old one. Furthermore, this improvement is significant at least for some cases. This theoretical conclusion is supported by numerical experiments.      

Two‐step Newton‐type methods for solving inverse eigenvalue problems

In this paper, we apply the two‐step Newton method to solve inverse eigenvalue problems, including exact Newton, Newton‐like, and inexact Newton‐like versions. Our results show that both two‐step Newton and two‐step Newton‐like methods converge cubically, and the two‐step inexact Newton‐like method is super quadratically convergent. Numerical implementations demonstrate the effectiveness of new algorithms.     

Numerical simulation of fluid-structure interaction problems on hybrid meshes with algebraic multigrid methods

Fluid-structure interaction problems arise in many fields of application such as flows around elastic structures and blood flow in arteries. The method presented in this paper for solving such a problem is based on a reduction to an equation at the interface, involving the so-called Steklov-Poincaré operators. This interface equation is solved by a Newton iteration, for which directional derivatives involving shape derivatives with respect to the interface perturbation have to be evaluated appropriately. One step of the Newton iteration requires the solution of several decoupled linear sub-problems in the structure and the fluid domains. These sub-problems are spatially discretized by a finite element method on hybrid meshes. For the time discretization, implicit first-order methods are used for both sub-problems. The discretized equations are solved by algebraic multigrid methods.     

TWO-GRID CHARACTERISTIC FINITE VOLUME METHODS FOR NONLINEAR PARABOLIC PROBLEMS＊

In this work, two-grid characteristic finite volume schemes for the nonlinear parabolic problem are considered. In our algorithms, the diffusion term is discretized by the finite volume method, while the temporal differentiation and advection terms are treated by the characteristic scheme. Under some conditions about the coefficients and exact solution, optimal error estimates for the numerical solution are obtained. Furthermore, the two- grid characteristic finite volume methods involve solving a nonlinear equation on coarse mesh with mesh size H, a large linear problem for the Oseen two-grid characteristic finite volume method on a fine mesh with mesh size h = O（H2） or a large linear problem for the Newton two-grid characteristic finite volume method on a fine mesh with mesh size h = 0（I log hll/2H3）. These methods we studied provide the same convergence rate as that of the characteristic finite volume method, which involves solving one large nonlinear problem on a fine mesh with mesh size h. Some numerical results are presented to demonstrate the efficiency of the proposed methods.