以结构思想为切入点把握向量的教学

向量是研究几何的一种基本工具 ,这种工具把几何结构转化为代数结构 ,实现几何代数化 .因此 ,在向量教学中 ,要让学生知道向量工具如何把几何结构转化为代数结构 ,利用结构思想分析问题、解决问题成为我们教学的关键问题 .为此 ,对这两方面作如下探讨 .1　几何结构转为代数结构 ,实现几何代数化几何历史的发展 ,大概经历了实验几何、综合推理几何、三角学和解析几何等四个阶段 .要使几何学实现根本转变 ,出路在于代数化 .综合几何发展到解析几何的过程 ,找到了几何问题解决通法 ,真正实现几何代数化 .用代数方法去研究几何问题是数学史上一…     

例说加强高等数学课程中的几何教学

分析了高等数学的课程内容与几何的关联,指出加强几何教学的意义和重要性.撷取高等数学教材中的一些题目为例,从几何角度加以具体分析,结合问题的几何意义给出相应解法,并与通常解法作比较,有更深刻和全面的认识,从几何方面揭示了问题的本质.     

组合几何(二) 结构问题

结构和构造是整个组合几何的核心,实际上组合几何主要讨论的就是以几何元素为某元素的集合的结构及其性质,一个有关组合几何的问题大都是在解决了结构问题之后才迎刃而解的。因此,深入地探讨一下结构问题是有必要的,而且对今后很多问题的讨论     

高等数学教学中应重视几何直观的作用

在高等数学中几何方法与分析方法是密不可分的,分析法使问题严谨而富有哲理性,几何方法使问题形象直观,所讨论问题的几何意义对寻求问题的解具有启发性和指导意义.本文通过具体实例阐明了这一点.     

聚焦空间几何中的非坐标向量方法

随着新课程标准的不断推进,空间想象能力和几何直观能力越来越受到人们的关注,空间向量作为研究空间几何的强有力工具,给空间几何问题的研究注入了新的生机和活力,开辟了很多解题的新途径、新方法、新思路,拓宽了高考对空间几何问题的命题的新空间．     

反比例函数问题的几何直观

对于几何题,人们有画图的习惯;而对于非几何题,人们往往不会从几何直观人手去思考问题的解决方法．图形可以使我们对已知条件与结论之间的关系有更明确、更形象的了解,使问题的解决更加简单明了．函数不仅仅和方程、不等式等代数内容联系紧密;同时借助于平面直角坐标系,也和三角形、四边形建立起了紧密的联系．而反比例函数中k的几何意义具有非常好的几何直观,由此展开的几何联想也就愈加丰富了．笔者将从k的几何意义出发,探索反比例函数问题中的几何直观,并从几何直观去寻求问题解决的思路．     

3D打印中的优化设计

3D打印技术的兴起在许多领域掀起了新的研究热点,《3D打印中的优化设计》应用课题针对几何处理领域中的许多相关问题做了系统性的研究,其中包括在3D打印中通过几何模型的结构优化以节省打印材料和打印时间的问题,三维几何模型保持特征的去噪和构建问题,以及三维几何模型的序贯重建和多余分支去除问题.相关问题中多涉及含有复杂约束的优化问题,以及压缩感知和稀疏优化问题.本文简要总结了上述问题的研究方法,并从几何优化的角度阐述了其中运筹学原理与方法的运用,表明了运筹学工具在相关领域研究中的重要性和有效性.     

中考动态几何题赏析

《全日制义务教育数学课程标准(实验稿)》设置了动态几何的教学内容,其基本要求是:“能描述实物或几何图形的变化和运动”,因此,动态几何成了中考的必考内容,各地中考试题几乎都有动态几何问题,并且多数是压轴题.本文选取了部分各地中考试题中比较典型的动态几何问题分“点动”、“线动”和“面动”三种类型进行解析,和广大读者一起欣赏中考中充满活力的动态几何问题.     

双曲空间中Veljan-Korchmaros型不等式及应用

本文研究了双曲空间Hn(K)中n维高维单形的几何不等式问题.利用距离几何的理论与方法,获得了涉及n维双曲单形体积,侧面积与棱长的几个几何不等式,这些几何不等式是双曲单形几何不等式的基础.     

试论射影几何对中学几何教学的指导意义

“当一个中学数学教师为什么一定要学习射影几何?”,“学了射影几何,对中学几何教学有哪些指导意义?”常常有人提出这样的问题。 和其他许多高等数学课程一样,射影几何     

A Riemannian variant of the Fletcher–Reeves conjugate gradient method for stochastic inverse eigenvalue problems with partial eigendata

In this paper, we focus on the stochastic inverse eigenvalue problem with partial eigendata of constructing a stochastic matrix from the prescribed partial eigendata. A Riemannian variant of the Fletcher–Reeves conjugate gradient method is proposed for solving a general unconstrained minimization problem on a Riemannian manifold, and the corresponding global convergence is established under some assumptions. Then, we reformulate the inverse problem as a nonlinear least squares problem over a matrix oblique manifold, and the application of the proposed geometric method to the nonlinear least squares problem is investigated. The proposed geometric method is also applied to the case of prescribed entries and the case of column stochastic matrix. Finally, some numerical tests are reported to illustrate that the proposed geometric method is effective for solving the inverse problem.     

Posynomial geometric programming as a special case of semi-infinite linear programming

This paper develops a wholly linear formulation of the posynomial geometric programming problem. It is shown that the primal geometric programming problem is equivalent to a semi-infinite linear program, and the dual problem is equivalent to a generalized linear program. Furthermore, the duality results that are available for the traditionally defined primal-dual pair are readily obtained from the duality theory for semi-infinite linear programs. It is also shown that two efficient algorithms (one primal based and the other dual based) for geometric programming actually operate on the semi-infinite linear program and its dual.     

Improved Results on Geometric Hitting Set Problems

We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of points that hit all geometric objects. The problem is known to be strongly NP-hard even for simple geometric objects like unit disks in the plane. Therefore, unless P = NP, it is not possible to get Fully Polynomial Time Approximation Algorithms (FPTAS) for such problems. We give the first PTAS for this problem when the geometric objects are half-spaces in ?³ and when they are an r-admissible set regions in the plane (this includes pseudo-disks as they are 2-admissible). Quite surprisingly, our algorithm is a very simple local-search algorithm which iterates over local improvements only.     

A General Alternative Procedure for Solving Negative Degree of Difficulty Problems in Geometric Programming

The degree of difficulty is an important concept in classical geometric programming theory. The dual problem is often infeasible when the degree of difficulty is negative and little has been published on this topic. In this paper, an alternative procedure is developed to find the optimal solution for the posynomial geometric programming problem with a negative degree of difficulty. First an equivalent problem was constructed with a positive degree of difficulty and the general posynomial geometric programming problem was solved using an original method previously developed by the authors. This method avoids the difficulty of non-differentiability of the dual objective function in the classical methods classified as dual. It also avoids the problem that appears when the feasible region for the dual problem is formed by an inconsistent system of linear equations.     

On a pursuit-evasion problem under a linear change of the pursuer resource

We study a pursuit-evasion problem in the case when an integral constraint is imposed on the pursuer control class which is a generalization of integral as well as geometric constraints and only a geometric constraint is imposed on the evader control class. We prove the theorem of alternative. The optimal pursuit problem is solved by a generalized parallel pursuit strategy, and lower bounds for the distance between the pursuer and the evader are established in the pursuit problem.     

一道习题的几何解法

从几何角度分析一道高等数学习题,指出所求的点的几何特征,给出了基于几何思想的解法.     

A STOCHASTIC REPRESENTATION FOR THE LEVEL SET EQUATIONS

ABSTRACT

A Feynman-Kac representation is proved for geometric partial differential equations. This representation is in terms of a stochastic target problem. In this problem the controller tries to steer a controlled process into a given target by judicial choices of controls. The sublevel sets of the unique level set solution of the geometric equation is shown to coincide with the reachability sets of the target problem whose target is the sublevel set of the final data.     

Posynomial Parametric Geometric Programming with Interval Valued Coefficient

The article presents solution procedure of geometric programming with imprecise coefficients. We have considered problems with imprecise data as a form of an interval in nature. Many authors have solved the imprecise problem by geometric programming technique in a different way. In this paper, we introduce parametric functional form of an interval number and then solve the problem by geometric programming technique. The advantage of the present approach is that we get optimal solution of the objective function directly without solving equivalent transformed problems. Numerical examples are presented to support of the proposed approach.     

两个同心旋转圆柱之间的两种流体的交界面几何形状问题

研究两个同心旋转圆柱之间的两种流体的交界面几何形状问题．利用张量分析工具,给出了忽略耗散能量影响下交界面几何形状是一种能量泛函的临界点,其对应的Euler-Lagrange方程是1个非线性椭圆边值问题．对于粘性引起的耗散能量不能忽略的情况下,同样给出了1个带有耗散能量的能量泛函,其临界点是交界面几何形状,相应的Euler-Lagrange方程也是1个二阶的非线性椭圆边值问题．这样,交界面几何形状问题转化为求解非线性椭圆边值问题．     

Optimal Mixed Batch Shipment Policy with Variable Safety Factor for the Single-Vendor Single-Buyer Production-Inventory System

This study investigates the production and inventory problem involving stochastic demand in a single-vendor single-buyer integrated system. The stochastic model is constructed and is controlled by both the reorder and shipping points with mixed geometric and equal batch shipment policy and variable safety factor. The minimum cost model is transformed into the maximum order quantity model. Consequently, the structure of mixed geometric and equal shipments can easily be obtained. The structure of the mixed geometric and equal shipments comprises number of batches, number of geometric shipments, and ratio of equal sized shipments to the size of the first shipment. The problem is solved using the proposed algorithm that determines the economic lot size, the structure of the mixed geometric and equal shipments, and the safety factor. An illustrative example demonstrates the effectiveness of the algorithmic procedures.