浅析多动点轨迹方程的求法

多动点轨迹方程的求法,是学生感到比较困难的问题.事实上一个轨迹命题中,不管有多少个动点,总可以分成两类,即主动点和从动点,从动点随主动点的运动而运动.主动点的轨迹方程往往为已知或者容易求出,而从动点的轨迹方程是待求的.下面介绍几种常用的多动点轨迹方程的求法.1 代入法在多动点轨迹问题中,如果主动点只有一个,其它动点都是从动点.此时,只要能找出主动点与从动点(待求的)之间的联系,并用从动点的坐标去表示主动点的坐标,然后代入主动点所满足的方程,化简整理即可.     

解析几何中对称问题的认识与探索

对称问题是高中数学的一个重要内容,也是平时学习的难点.它的运用非常广泛,不仅体现在数学知识上,有时还会渗透到物理应用中去.对称问题的题型主要体现在点关于点对称,直线关于点对称,点关于直线对称,直线关于直线对称,曲线关于点对称,曲线关于直线对称几个方面.下面我们举例说明.一、点关于点对称点关于点对称是大家比较常见的对称问题,也是最简单的对称问题.关于原点对称可以通过坐标系得出.关于一般点对称我们可采用中点公式求出对称点坐标.     

一道奥数题的新证及推广

在几何中证明三点共线,基本思路是先由两点确定一条直线,然后证明第三点具有直线上点的性质,从而第三点也在直线上.在圆锥曲线中证明三点共线,那条定直线一般都是极线.关于极点和极线,有以下的定理:定理1在给定配极变换下,ξ为点x的极线的充要条件是x是直线ξ的极点.定理2(配极原理)如果点x的极线通过点y,则点y的极线必通过点x.定理3二次曲线的内接完全四点形的对角三角形是曲线的自极三点形.关于二次曲线,可以有:定理4[2]点不在二次曲线上,若存在两条切线,则两切点的连线就是该点的极线;若不     

求解互补约束优化问题的乘子松弛法

利用互补问题的Lagrange函数, 给出了互补约束优化问题\,(MPCC)\,的一种新松弛问题. 在较弱的条件下, 新松弛问题满足线性独立约束规范. 在此基础上, 提出了求解互补约束优化问题的乘子松弛法. 在MPCC-LICQ条件下, 松弛问题稳定点的任何聚点都是MPCC的M-稳定点. 无需二阶必要条件, 只在ULSC条件下, 就可保证聚点是MPCC的B-稳定点. 另外, 给出了算法收敛于B-稳定点的新条件.     

最大内角不等于120°的三角形性质

<正>费马点以三角形各边为边长向形外作等边三角形,则三个等边三角形的外接圆共点.该点称为三角形的费马点.显然,最大内角小于120°的三角形的费马点在形内,最大内角大于120°的三角形的费马点在形外,最大内角等于120°的三角形的费马点是120°角的顶点.本文对最大内角等于120°的三角形不作介绍了     

求动点轨迹的方法与技巧

求动点轨迹的基本方法主要有以下几种 :1)直译法 .如果动点满足的条件是一些几何量的等量关系 ,则只需直接将动点的坐标代入 ,便可得到动点的轨迹方程 .2 )定义法 .如果动点的轨迹是某种确定的曲线 ,则可根据该曲线的定义建立其方程 .3)转移法 .如果动点P随着另一动点Q的运动而运动 ,且Q点在某一已知曲线上运动 ,那么只需将Q点的坐标用P点的坐标来表示 ,并代入已知曲线方程 ,便可得到P点的轨迹方程 .4 )交轨法 .如果动点P是某两条动曲线的交点 ,则可联立这两条曲线的方程 ,并消去其中的参数 ,便可得到P点的轨迹方程 .5 )参数法 .如果动…     

用平面上点表示的二次曲线的方程

本文得到了如下结论:只要给出平面直角坐标系5个互异且不在同一条直线上的点,就可以确定过这五个点的二次曲线的方程.当这些点满足条件的不同,就形成不同的曲线.当已知曲线的对称轴平行坐标轴时,确定曲线互异的点可以减少到4个,当曲线的类型已知时,确定曲线方程所需要互异的点的数目还可以减少到3个.     

三角形的九点二次曲线

在任意三角形内,三边中点,三高的垂足,以及连接顶点与垂心的三线段的中点,都在同一圆上,此圆即为三角形九点圆.三角形的九点圆是欧氏几何中著名的优美定理,被称为欧拉圆和费尔巴哈圆.本文试图把垂心改换为平面内的任意点,相应地把三条高线改换为过每个顶点各一条的共点直线组时,则将把三角形的九点圆有趣地推广为三角形的九点二次曲线.并具体讨论在不同的区域内得到的九点二次曲线.     

带未知多个变点的均值突变模型的多阶段估计

本文基于局部比较法,提出了带未知多个变点的均值突变模型中变点个数与变点位置的多步估计.首先估计出可能变点位置的报警区间序列;然后根据这些报警区间初步估计出变点个数及变点位置;最后对虚假变点进行删除确定最终变点个数及变点位置.理论结果表明:几乎必然的,当n充分大时,变点个数估计将严格等于变点个数真值,所得最终报警区间将严格包含变点真值;变点估计量具有强相合性.随机模拟结果表明,多步估计在不同条件下均能准确估计变点个数和变点位置.     

不等式约束优化全局收敛的滤子线性方程组算法

设计了求解不等式约束非线性规划问题的一种新的滤子序列线性方程组算法,该算法每步迭代由减小约束违反度和目标函数值两部分构成.利用约束函数在某个中介点线性化的方法产生搜索方向.每步迭代仅需求解两个线性方程组,计算量较小.在一般条件下,证明了算法产生的无穷迭代点列所有聚点都是可行点并且所有聚点都是所求解问题的KKT点.     

A REPRESENTATION FORMULA RELATED TO SCHR(O)DINGER OPERATORS

Schr(o)dinger operator is a central subject in the mathematical study of quantum mechanics.Consider the Schrodinger operator H = -△ V on R, where △ = d2/dx2 and the potential function V is real valued. In Fourier analysis, it is well-known that a square integrable function admits an expansion with exponentials as eigenfunctions of -△. A natural conjecture is that an L2 function admits a similar expansion in terms of "eigenfunctions" of H, a perturbation of the Laplacian (see [7], Ch. Ⅺ and the notes), under certain condition on V.     

CONTENTS OF VOLUME 30

正~~     

Instructions for contributions

正Applied Mathematics-A Journal of Chinese Universities,Series B(Appl.Math.J.Chinese Univ.,Ser.B)is a comprehensive applied mathematics journal jointly sponsored by Zhejiang University,China Society for Industrial and Applied Mathematics,and Springer-Verlag.It is a quarterly journal with     

Journal of Mathematical Research with Applications Guide for Authors

正Journal overview:Journal of Mathematical Research with Applications(JMRA),formerly Journal of Mathematical Research and Exposition(JMRE)created in 1981,one of the transactions of China Society for Industrial and Applied Mathematics,is a home for original research papers of the highest quality in all areas of mathematics with applications.The target audience comprises:pure and applied mathematicians,graduate students in broad fields of sciences and technology,scientists and engineers interested in mathematics.     

Staircase transportation problems with superadditive rewards and cumulative capacities

A cumulative-capacitated transportation problem is studied. The supply nodes and demand nodes are each chains. Shipments from a supply node to a demand node are possible only if the pair lies in a sublattice, or equivalently, in a staircase disjoint union of rectangles, of the product of the two chains. There are (lattice) superadditive upper bounds on the cumulative flows in all leading subrectangles of each rectangle. It is shown that there is a greatest cumulative flow formed by the natural generalization of the South-West Corner Rule that respects cumulative-flow capacities; it has maximum reward when the rewards are (lattice) superadditive; it is integer if the supplies, demands and capacities are integer; and it can be calculated myopically in linear time. The result is specialized to earlier work of Hoeffding (1940), Fréchet (1951), Lorentz (1953), Hoffman (1963) and Barnes and Hoffman (1985). Applications are given to extreme constrained bivariate distributions, optimal distribution with limited one-way product substitution and, generalizing results of Derman and Klein (1958), optimal sales with age-dependent rewards and capacities.To our friend, Philip Wolfe, with admiration and affection, on the occasion of his 65th birthday.Research was supported respectively by the IBM T.J. Watson and IBM Almaden Research Centers and is a minor revision of the IBM Research Report [6].     

Laminations minimales résiduellement à 2 bouts

Résumé On décrit toutes les feuilles des laminations minimales dont un ensemble résiduel de feuilles ont 2 bouts.      

Best approximation by downward sets with applications

We develop a theory of downward sets for a class of normed ordered spaces. We study best approximation in a normed ordered space X by elements of downward sets, and give necessary and sufficient conditions for any element of best approximation by a closed downward subset of X. We also characterize strictly downward subsets of X, and prove that a downward subset of X is strictly downward if and only if each its boundary point is Chebyshev. The results obtained are used for examination of some Chebyshev pairs （W,x）, where ∈ X and W is a closed downward subset of X     

Boundedness of multilinear operators on weighted herz type spaces

In this paper, the author establishes the boundedness of multilinear operators on weighted Herz spaces and Herz-type Hardy spaces. The author also obtains their weak estimates on endpoints. As a special case, the conclusions may lead to the weighted estimates for multilinear Calderon-Zygmund operators.     

THE EXACT CONVERGENCE RATE AT ZERO OF LAGRANGE INTERPOLATION POLYNOMIAL TO |x|α

In this paper we present a generalized quantitative version of a result due to M. Revers concerning the exact convergence rate at zero of Lagrange interpolation polynomial to f(x) = |x|α with on equally spaced nodes in [-1, 1].