数学问题解答

1999年9月号问题解答（解答由问题提供人给出）12if．求ig勺O”＋ig‘SO”＋tgc7o“的值．解设A—ig1o”一ig5o”＋ig7o“，B—tglo“ig7o“－tglootg500－ig5o”ig7o”，C—tglo”ig5o”ig700．首先，求出A、B、C的值．由ig3a的公式得，ig“a－3ig3atg“a－3tga＋ig3a—O，易见，a—－SO”、IOo、7O”是方程ig‘a－／3ig‘a－3tga＋H’－j—’、—－·—－”一”3一O的在正切函数tga的单调区间（－goo，gO肝内的三个不同的根，由韦达定理得：A一人，B—一A3，卜———”～3其次，令D，；一ig”Ic“＋（－ig5o“）’‘＋ig”7O（n…     

理科第25题别解

试题设圆满足：①截y轴所得弦长为ZF＠技工轴分成两段圆弧，其弧长的比为3：1．在满足条件①，②的所有固中，求协。到直线L：X一Zy一0的距离最小的目的方程．解法fib所求的团为（—一d）‘十（y—b）’一厂‘，由①，②易得rZ—a’＋1，／一Zb‘，消去厂得Zb’一a’＝1．可见，所求圆的圆心的轨迹为双曲线：2／一X‘一1上的点．设直线产周且与双曲线2／一X’一1相切，则可设I’的方程为C—Zy—C．显然d（（a，b），l）一d（l’，l）这里d（A，B）表A到B的距离．P与2／一X‘一1相切，则易求得C一士1．＄法2同解法1得显然要使d达最…     

不可压混流驱动问题的最小二乘混合元方法

1引言考虑多孔介质中两相不可压缩可混溶渗流驱动问题,它是由一组非线性耦合的椭园型压力方程和抛物型浓度方程组成：dVV。—一山人V什）gVV却）一q,VEn,（．1）＆,,。＿．、。。—一。x）＿＋u·grade－dlv（D（u）grade）一（1－c）q－,xEn,tEJ,（1．2）＆”－－’”””‘”－”””——－’——,、—’一其中a（）一a（x,c）一是（x）／卢（c）,J一［0,Ti,DcyR‘为水平油藏区域．方程式（1．l）一（1．2）中各物理量的意义如下：广为流体压力,c为流体的浓度,u为流体的Darer速度,叶为源汇项,／一—。x（q,O）,…     

极坐标系中旋转公式的几个应用

1问题的引入武汉市98年5月调考中有一道选择题：极坐标方程产一一百二二77一一了一二一一一一一二———、·””－‘／了十sino—COS5所确定的曲线是（）．（A）圆（B）抛物线（C）椭圆（D）双曲线学生在解答时采取了如下两种做法：其一是将极坐标方程化为直角坐标方程来判断，由原方程可得将两边平方后整理得：X’十ZXy十／一4X十4y一4一0．至此，由于这个方程超出了现行中学教材（必修本）的范围，学生无法判断方程表示什么曲线．少数学生据经验猜出了答案，理由是：含Xy项，故排除（A）；X’，／项系数相等，排除（＊）；X’，／…     

为何韦达定理不适用

题目已知圆x2＋y2=4与抛物线y2=ax（a＞0）相交于A、B两点，且IABI—2乃，求该抛物线的焦点坐标．解设A、B两点的坐标分别为：（11，yi），（xZ，yZ），由于题设条件中的圆和抛物线均关于2轴对称，故有2；一22＞0，y．—一yZ。＿．．I＿－．－－－－－－fu＿＿。＿M且Iyll—lyZI一一一J3，不妨取yi一J3，趴x＼yL4得x，＝1或x＝－1（一，将A点坐标（1，厄）代入y‘一。得。一3，rt抛物线的焦点坐标为（号，0）．’，”－”－””””’”””——””””4’一””笔者在课堂上讲完该解法后，让学生用韦达定理试试，立即有学生提出该…     

广义积分integral from n=0 to 1()((1n)~(k-1)t)/(1 t)dt与级数Sum from n=1 to ∞() ((-1)~(n-1))/n~k间的关系及计算

定理1设k是正整数，则有证明记由于易知又由于所以所以（6）式为在（8）中取、r—－1，有在（9）中作变换L—一X有＿＿、＿．l．＿＿、，＿I。〔h〔，＿＿＿rp（－1）＿。＿。L、，＿＿＿。。＿＿＿＿，＿。。定理1给出了广义积分l；：＝一体与级数西二个一之间的关系。下面的定理2将给出‘“““””“’””””“”JI＋t”’”””“‘“’””“““””“’””““”“”‘”“““计算级数Zirn／一的一个递推公式。它相9地将人X）展成余弦级数（14）式为一递推公式，继续递推并注意到八二I。。Snxdx一O，则（14）为在（16）式中…     

一个数列极限的多种计算方法

极限运算是高等数学中最重要的基本运算之一,而数列极限的计算是极限运算的基础．对于通项公式已知的数列,其权限一般可由四则运算法则求得,但对于通项公式未知的数列,其极限的运算就有一定的难度．例如数列是由下列各式下面用几种不同方法求解．一、代数方法由已知将以上诸式相加得：将（1）、（2）联立解之,得二、差分方程法由得二阶常系数线性差分方程其特征方程的根,于是差分方程通解为．将三、相似矩阵法fiLIU）递推见一AXn＿;一A’X。－。—…一A“－‘X;,得从一A”‘X;·方阵A的特征值八一1,人—－tr,其对应的特征…     

1998年普通高等学校招生全国统一考试数学(理工农医类)试题及解答

一、选择题：本大题共15小题；第（1）-（10）题每小题4分，第（11）-（15）团每小题5分，共的分．在每小题给出的四个选项中，只有一个项是符合题目要求的．（1）Sin600的值是（）（A）M（B）一5（C）M（D）一M（2函数v＝。L：（。＞回）的图象是（）．（3）曲线的极坐标方程尸一4sino化成直角坐标方程为（）．（A）（X—2）‘＋y‘一4（B）1’‘＋（y－2）’＝4（CXZ＋（y－I－2）一4（D）（x＋2）2＋y2＝4（4）两条直线All＋Bly＋CI＝0，A22＋BZy＋CZ＝0垂直的充要条件是（）．、AIA，一、—一（A）＝＝－－－－－－－－＝l…     

读者来信

数学通报1998年12期“关于求多元对称函数极值的一个磨光法”一文,理论上是正确的,但后文中的例2是错误的．文中将“－”号误为“＋”号．改正后,不能证明（。）式＞0,例如令a;、1,a。、l,a;学a。,a。－…－an二0,（。）式＜0,因之,不等式（2）（3）（以及其推广情形）根本不能用本文定理2加以证明．2不等式（3）是一个错误的不等式．例如令定理1证明中的“X1’‘’－—一（一二L一）”－’（X;二）”应改为（－——）‘－’（X;一旦）以上意见供参考．读者来信@续铁权     

利用微分方程解关于积分上限的函数方程

我们从《高等数学》上册里已经知道：若是内的连续函数，则积分些关于积分上限的函数方程，关键是要建立一些恰当的微分方程，然后再利用解微分方程的方法去解函数方程。这里需要注意的是：初始条件隐含在积分上限的函数方程中。例1设f（x）在[0，＋co）内连续，且会解由八x）在【0，＋co）内连续，从所给函数方程表达式可知，人工）可导。从而有；n，、。11＿l＿＿。，、一．．—。，一、－———。。。广（x）一月会·2到·2，有f（）ZC／”。又f（）一1，有Czl即f（）一e‘“。“—”“＼2一）—””“”—”一“—“”””“’n—。。…     

A method based on Rayleigh quotient gradient flow for extreme and interior eigenvalue problems

Recently, a continuous method has been proposed by Golub and Liao as an alternative way to solve the minimum and interior eigenvalue problems. According to their numerical results, their method seems promising. This article is an extension along this line. In this article, firstly, we convert an eigenvalue problem to an equivalent constrained optimization problem. Secondly, using the Karush-Kuhn-Tucker conditions of this equivalent optimization problem, we obtain a variant of the Rayleigh quotient gradient flow, which is formulated by a system of differential-algebraic equations. Thirdly, based on the Rayleigh quotient gradient flow, we give a practical numerical method for the minimum and interior eigenvalue problems. Finally, we also give some numerical experiments of our method, the Golub and Liao method, and EIGS (a Matlab implementation for computing eigenvalues using restarted Arnoldi’s method) for some typical eigenvalue problems. Our numerical experiments indicate that our method seems promising for most test problems.     

A subdivision collocation method for solving two point boundary value problems of order three

In this paper, we propose a method for the numerical solution of self adjoint singularly perturbed third order boundary value problems in which the highest order derivative is multiplied by a small parameter $\varepsilon$. In this method, first we introduce the derivatives of two scale relations satisfied by the subdivision schemes. After that we use these derivatives to construct the subdivision collocation method for the numerical solution of singularly perturbed boundary value problems. Convergence of the subdivision collocation method is also discussed. Numerical examples are presented to illustrate the proposed method.     

Parametric Quintic-Spline Approach to the Solution of a System of Fourth-Order Boundary-Value Problems

In this paper, we use parametric quintic splines to derive some consistency relations which are then used to develop a numerical method for computing the solution of a system of fourth-order boundary-value problems associated with obstacle, unilateral, and contact problems. It is known that a class of variational inequalities related to contact problems in elastostatics can be characterized by a sequence of variational inequations, which are solved using some numerical method. Numerical evidence is presented to show the applicability and superiority of the new method over other collocation, finite difference, and spline methods.     

A recurrence method for a special class of continuous time linear programming problems

This article studies a numerical solution method for a special class of continuous time linear programming problems denoted by (SP). We will present an efficient method for finding numerical solutions of (SP). The presented method is a discrete approximation algorithm, however, the main work of computing a numerical solution in our method is only to solve finite linear programming problems by using recurrence relations. By our constructive manner, we provide a computational procedure which would yield an error bound introduced by the numerical approximation. We also demonstrate that the searched approximate solutions weakly converge to an optimal solution. Some numerical examples are given to illustrate the provided procedure.     

Verified computation of solutions for obstacle problems with guaranteed L∞ error bound

In this paper, we consider a numerical enclosure method with guaranteed L^∞ error bound for the solutions of obstacle problems. Using the finite-element approximations and the explicit a priori error estimates for obstacle problems, we present an effective verification procedure that automatically generates on a computer a set which includes the exact solution. A particular emphasis is that our method needs no assumption of the existence of the solution of the original obstacle problems, but it follows as the result of computation itself. A numerical example for an obstacle problem is presented.     

Mobile and immobile gaseous transport: Embedded analytical solutions to finite volume methods

The motivation is driven by deposition processes based on chemical vapor problems. The underlying model problem is based on coupled transport–reaction equations with mobile and immobile areas. We deal with systems of ordinary and partial differential equations. Such equation systems are delicate to solve and we introduce a novel solver method, that takes into account ways to solve analytically parts of the transport and reaction equations. The main idea is to embed the analytical and semianalytical solutions, which can then be explicitly given to standard numerical schemes of higher order. The numerical scheme is based on flux‐based characteristic methods, which is a finite volume method. Such a method is an attractive alternative to the standard numerical schemes, which fully discretize the full equations. We instead reduce the computational time while embedding fast computable analytical parts. Here, we can accelerate the solver process, with a priori explicitly given solutions. We will focus on the derivation of the analytical solutions for general and special solutions of the characteristic methods that are embedded into a finite volume method. In the numerical examples, we illustrate the higher‐order method for different benchmark problems. Finally, the method is verified with realistic results. © 2011 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2012     

A noninterior point homotopy method for semi-infinite programming problems

In this paper, we present a new homotopy method which is a non-interior point homotopy method for solving semi-infinite programming problems. Under suitable assumptions, we prove that the method determines a smooth path from a given point. The new homotopy method generalizes the existing combined homotopy interior point method for semi-infinite programming problems to unbounded set, moreover, it is more convenient in that it enlarges the choice scope of the initial point. Some numerical examples are given to show its efficiency.     

Convergence and stability of a numerical method for micromagnetics

The convergence and stability of a numerical method, which applies a nonconforming finite element method and an artificial boundary method to a multi-atomic Young measure relaxation model, for micromagnetics are analyzed. By revealing some key properties of the solution sets of both the continuous and discrete problems, we show that our numerical method is stable, and the solution set of the continuous problem is well approximated by those of the discrete problems. The performance of our method is also illustrated by some numerical examples. The research was supported in part by the Major State Basic Research Projects (2005CB321701), NSFC projects (10431050, 10571006, 10528102 and 10871011) and RFDP of China.     

A new method for numerical differentiation based on direct and inverse problems of partial differential equations

In this paper, we mainly study a numerical differentiation problem which aims to approximate the second order derivative of a single variable function from its noise data. By transforming the problem into a combination of direct and inverse problems of partial differential equations (heat conduction equations), a new method that we call the PDEs-based numerical differentiation method is proposed. By means of the finite element method and the Tikhonov regularization, implementations of the proposed PDEs-based method are presented with a posterior strategy for choosing regularization parameters. Numerical results show that the PDEs-based numerical differentiation method is highly feasible and stable with respect to data noise.     

A PENALTY TECHNIQUE FOR NONLINEAR COMPLEMENTARITY PROBLEMS

1.IntroductionConsiderthefollowingnonlinearcomplementarityproblemsNCP(F)offindinganxER",suchthatwhereFisamappingfromR"intoitself.ItisanimportantformofthefollowingvariationalinequalityVI(F,X)offindinganxEX,suchthatwhereXCReisaclosedconvexset.WhenX=R7,(1.1)…