抽象函数证明中的巧妙“设”法

<正>例1已知函数y=f(x)的定义域为R,且对任意a,b∈R,都有f(a+b)=f(a)+f(b),且当x>0时,f(x)<0恒成立.(1)证明函数y=f(x)是R上的单调性;(2)讨论函数y=f(x)的奇偶性.思路一设元、凑已知.证明任取x_10)(设法为凑形),而f(a+b)=f(a)+f(b),∴f(x_2)-f(x_1)=f(x_1+t)-f(x_1)=f(x_1)+f(t)-f(x_1)=f(t).     

关于保凸Spline插值方法

§1.引言 本文讨论保凸插值方法和单调保凸插值问题.设a=x_0相似文献   

向量有理插值的一个行列式公式

<正> 设由不同实数组成的实数序列为x_0,x_1,x_2,…,对应的有限向量序列为(?)_0,(?)_1,(?)_2,…,其中(?)_i=(?)(x_1)∈D~d定义若向量有理函数(?)_n(x)=(?)(x)/q(x),其中(?)(x)是d 维多项式值向量,q(x)是实多项式,满足:     

具有共振的边值问题解的存在性

利用Mawhin的重合度理论,研究具有共振的n-阶m-点边值问题x~((n))(t)=f(t,x(t),x′(t),…,x~((n-1))(t)),t∈(0,1)x(0)=x(η),x′(0)=x″(0)=…=x~((n-2))(0)=0,x~((n-1))(1)=α_ix~((n-1))(ξ_i)解的存在性,其中n≥2,m≥3,f:[0,1]×R~n→R将有界集映为有界集,且当x(t)∈C~(n-1)[0,1]时,f(t,x(t),x′(t),…,x~((n-1))(t))∈L~1[0,1],0<ξ_1<ξ_2<…<ξ_(m-2)<1,0<η<1,α_i∈R.在这里并不要求f具有连续性.     

有限元求解一维奇异摄动问题

1 问题的引入 考虑边值问题 L_y≡-εy″+p(x)y′+q(x)y=f(x),x∈I≡(o,1), y(0)=y(1)=0, (1,1)其中ε是一常数,ε∈(0,1),p(x),q(x),f(x)是[0,1]上的光滑函数,且满足p(x)≥a_1>0,q(x)≥0,q(x)-(1/2)P′(x)≥a_2>0.以下用C和d表示一常数,仅依赖于p(x),q(x),f(x),与ε无关,在不同的地方它们可能代表不同的数. 引入双线性形式 B(u,v)=integral from n=0 to 1(εu′v′+pu′v +quv)dx,u,v∈H~1(I),及范数     

一类三阶有理差分方程的奇点集和解的渐近性

研究三阶有理差分方程x_(n+1)=ax_(n-1)+x_(n-1)x_n/bx_(n-2)+cx_n,n=0,1,2,...的奇点集和解{x_n}_(n=-2)~∞的渐近性,其中a,b,c∈R,初始值x_(-2),x_(-1),x_0∈R.由a,b,c的取值的不同,而得到解的不同的渐近性.     

一元不等式的方程解法

本文将根据方程f(x)=0实数根的分布情况,给出不等式f(x)>0的一种统一解法。这种解法的理论根据,是下面的定理设函数f(x)在区间〔a,b〕上连续且恒不等于零。如果存在a∈〔a,b〕,使f(α)>0,那么在〔a,b〕上恒有f(x)>0;如果存在α∈〔a,b〕,使f(α)<0,那么在〔a,b〕上恒有f(x)<0。证明先证定理的前半部分。若不然,设有β∈〔a,b〕,使f(β)≤0,但,(β)≠0,所以f(β)<0.根据连续函数的介值定理,必有α与β之间的数x。(当然有x。∈〔a,b〕),使f(x_0)=0。这和假设f(x)在〔a,b〕上恒不等于零相矛盾。这就证明了在〔a,b〕上恒有     

杭州大学一九八三年攻读硕士学位研究生入学考试试题

1.给定函数f∈C~2[a,b]和分划a=x_0相似文献   

整数集上四连贯n次多项式的构造

连贯、m (m∈ N,m≥ 3)连贯的定义见[1]或 [2 ].约定 :本文中表示数的字母均表整数 .定理　当an-i =p1 q1 ki-1 (pq1 p1 q) ki pqki 1 ,(i=0 ,1,… ,n- 1,n∈ N,n≥ 2 ,k-1 =k0 =0 )kn =± 1,pq1 - p1 q =± 1,a0 =p1 (q1 kn-1 qkn)时 ,多项式 f (x) =∑n-1i=0an-ixn-i a0 在整数集 Z上连贯 ,且 f(x) j (j =0 ,1)分别有因式px p1 ,qx q1 .证明　这是因为由题设可证得 :f(x) =(px p1 ) ∑n-1i=0(q1 ki qki 1 ) xn-i-1 ,f(x) 1=(qx q1 ) ∑n-1i=0(p1 ki pki 1 ) xn-i-1 .在定理中可选 :(1) kn=1,q1 =rp1 1,p …     

拉格朗日中值定理的一个证明

拉格朗日定理:设1) f(x)在区间[a,b]内有定义而且是连续的,2) 至少在开区间(a,b)内有有穷导数f′(x)存在。那么在a与b之间必能求得一点(?)(a相似文献   

解变分不等式问题的混合方法

By using Fukushima‘s differentiable merit function,Taji,Fukushima and Ibaraki have given a globally convergent modified Newton method for the strongly monotone variational inequality problem and proved their method to be quadratically convergent under certain assumptions in 1993. In this paper a hybrid method for the variational inequality problem under the assumptions that the mapping F is continuously differentiable and its Jacobian matrix F(x) is positive definite for all x∈S rather than strongly monotone and that the set S is nonempty, polyhedral,closed and convex is proposed. Armijo-type line search and trust region strategies as well as Fukushima‘s differentiable merit function are incorporated into the method. It is then shown that the method is well defined and globally convergent and that,under the same assumptions as those of Taji et al. ,the method reduces to the basic Newton method and hence the rate of convergence is quadratic. Computational experiences show the efficiency of the proposed method.     

A Smoothing Newton-Type Algorithm of Stronger Convergence for the Quadratically Constrained Convex Quadratic Programming

In this paper we propose a smoothing Newton-type algorithm for the problem of minimizing a convex quadratic function subject to finitely many convex quadratic inequality constraints. The algorithm is shown to converge globally and possess stronger local superlinear convergence. Preliminary numerical results are also reported. Mathematics Subject Classification (1991): 90C33, 65K10 This author’s work was also partially supported by the Scientific Research Foundation of Tianjin University for the Returned Overseas Chinese Scholars and the Scientific Research Foundation of Liu Hui Center for Applied Mathematics, Nankai University-Tianjin University.     

加快迭代收敛速度的两个命题

定义了单调收敛函数和交错收敛函数,并根据其收敛特点,提出并证明了加快其收敛速度的两个命题.算例表明其效果较好.     

Globally convergent algorithms for solving unconstrained optimization problems

New algorithms for solving unconstrained optimization problems are presented based on the idea of combining two types of descent directions: the direction of anti-gradient and either the Newton or quasi-Newton directions. The use of latter directions allows one to improve the convergence rate. Global and superlinear convergence properties of these algorithms are established. Numerical experiments using some unconstrained test problems are reported. Also, the proposed algorithms are compared with some existing similar methods using results of experiments. This comparison demonstrates the efficiency of the proposed combined methods.     

Comparison between the convergence rates of the Chebyshev method and the related (2,2)‐step methods

An optimal Chebyshev method for solving A x = b , where all the eigenvalues of the real and non‐symmetric matrix A are located in the open right half plane, is dependent on an optimal ellips∂Ω^* such that the spectrum of A is contrained in Ω^*, the closed interior of the ellipse. The relationship between the convergence rates of the Chebyshev method and the closely related (2,2)‐step iterative methods are studied. (2,2)‐step iterative methods are faster than an optimal Chebyshev method under certain conditions. A numerical example illustrates such an improvement of a (2,2)‐step iterative method. Copyright © 2000 John Wiley & Sons, Ltd.     

A BFGS algorithm for solving symmetric nonlinear equations

In this article, we propose a BFGS method for solving symmetric nonlinear equations. The presented method possesses some favourable properties: (a) the generated sequence of iterates is norm descent; (b) the generated sequence of the quasi-Newton matrix is positive definite and (c) this method possesses the global convergence and superlinear convergence. Numerical results show that the presented method is interesting.     

BROYDEN'S METHOD FOR SOLVING VARIATIONAL INEQUALITIES WITH GLOBAL AND SUPERLINEAR CONVERGENCE

1. IntroductionWe are concerned with the following variational inequality problem of finding amx E X such thatwhere f: R" - R" is assumed to be a continuously differentiable function, and X g R"is specified bywhere gi: R" -- R and h,-: R" - R are twice continuously differentiable functions.The variational inequality (1.1) is denoted by VI(X, f). An important special case ofVI(X, f) is the so--called nonlinear complementarity problem (NCP(f)) with X ~ R7 {x E R" I x 2 0}. Variational…     

关于多元非线性方程的Broyden方法

本文提出了求解多元非线性方程的Broyden方法，讨论了该方法的局部与半局部收敛性，并估计了其超线性收敛速度．数值实验表明，新方法是可行有效的，并且其计算效率高于方向Newton法和方向割线法．     

Smoothing Trust Region Methods for Nonlinear Complementarity Problems with P 0-Functions

By using the Fischer–Burmeister function to reformulate the nonlinear complementarity problem (NCP) as a system of semismooth equations and using Kanzow’s smooth approximation function to construct the smooth operator, we propose a smoothing trust region algorithm for solving the NCP with P ₀ functions. We prove that every accumulation point of the sequence generated by the algorithm is a solution of the NCP. Under a nonsingularity condition, local Q-superlinear/Q-quadratic convergence of the algorithm is established without the strict complementarity condition. This work was partially supported by the Research Grant Council of Hong Kong and the National Natural Science Foundation of China (Grant 10171030).     

Lower-dimensional linear complementarity problem approaches to the solution of a bi-obstacle problem

A globally convergent Broyden-like method for solving a bi-obstacle problem is proposed based on its equivalent lower-dimensional linear complementarity problem. A suitable line search technique is introduced here. The global and superlinear convergence of the method is verified under appropriate assumptions.