节点文献
折线函数和集值函数的迭代与迭代根
Iteration and Iterative Roots for Polygonal Functions and Multifunctions
【作者】 李林;
【导师】 张伟年;
【作者基本信息】 四川大学 , 基础数学, 2007, 硕士
【摘要】 迭代是自然界中一个重要的现象。X-射线的透射、流体的渗流、生物体的生长、计算机的运行等过程都包含了迭代现象。在科学计算中,迭代也经常作为有效的工具解决近似问题。而在数学中,一切递推关系,从等差数列、等比数列到微分方程解的Picard逼近都是一个迭代过程。迭代所产生的动力系统刻划了事物运动的主要环节和发展趋势,通过迭代可以预测未来,也就是我们所关心的长期性和终极性状态。另一方面,我们也关心事物运动的全过程,尤其是各环节之间的联系,这就涉及到迭代的逆运算,即迭代根问题。通过这样的方式,我们可以将离散问题的各环节合理地连接起来,还原成完整的连续的衍变过程。迭代是一种十分复杂的非线性运算。对于映射n次迭代通式的计算,常用的方法有不动点法和共扼相似法,前者的运用需要事先断定映射迭代式的基本代数形式,而后者则需要找一个可逆的桥函数,因此在许多情况下计算迭代是非常困难的。在第二章我们讨论的是区间上一类折线函数的迭代。尽管折线函数是最简单的非线性函数,其迭代的规律十分复杂,函数值在迭代下可能交叉于不同的子区间。我们利用折点的运动轨道变化来探索迭代下折点数不增或有界的条件,并在若干情形下给出其n次迭代表达式。我们知道,不具有连续性的函数一般来说性质很糟,而具有上半连续及有限集值点的集值函数在一定程度上反映了第一类间断点函数的特性,因此研究集值函数的迭代也是很有意义的。集值分析作为建立非线性数学模型、解决非线性问题的数学理论和有力工具,它已经成为非线性分析的重要组成部分,在控制论和微分对策、数理经济学和决策论、生物数学、物理以及微分包含等众多领域都有着广泛的应用。集值点是集值函数之所以复杂的根本原因。集值点越少,问题相对越简单。如同对折线函数折点的研究一样,本文的第三章将研究一类具有上半连续且单集值点的集值函数的迭代,给出其在迭代下集值点个数不增的条件,并在此条件下给出一般的迭代表达式。在第三章的基础上,我们讨论这类集值函数的迭代根问题。2004年,W.Jarczyk和张伟年讨论了一类集值函数的2次迭代根,给出若干其迭代根不存在的充分条件。在第四章,我们继续给出一些他们没有给出的2次迭代根不存在的条件。另外,我们还证明了一类集值函数2次迭代根的存在条件。
【Abstract】 Iteration is an important phenomenon in nature. The penetration of X-ray, infiltration of liquid, growth of organism and application of computer are examples of iteration. In scientific computation, iteration is as an effective tool to deal with reckon problems. All recurrence relations from equal difference, equal ratios sequences to approximation by Picard are the course of iterating in mathematics. Iteration emerges dynamical system, which describe the main segments and tendency of development. By iterating, we can forecast future, that is long-time behavior and final statements which we were concerned. On the other hand, we also pay attention to its process, especially the relationship between all the segments, which refers to the reversal operation of iteration called iterative root, so that the discrete parts can be connected reasonably.Iteration is a complicated nonlinear operation. We usually use fixed point and conjugacy method to compute iteration. For fixed point method, we should know its iteration’s algebraic form first, and for conjugacy method, a bridge function must be found. Therefore, it is difficult to compute its general iteration in many cases. In chapter 2, we investigate the iteration of polygonal functions on intervals. Although polygonal function is a nonlinear mapping with elementary form, computing its iterates is not easy because the concerned different lines on distinct sub-intervals may interact each other in iteration. We will make use of the dynamics of vertices’ orbits to discuss the conditions under which the number of vertices either does not increase or has a bound under iteration. In some cases the explicit expressions of their general iteration are given.As we know, for a kind of functions without continuity, the property is usually no good enough, but upper semi-continuous multifunctions with finite set-valued points reflect the properties of first set functions which have finite disjoint points, so it is meaningful to consider multifunctions. Multivalued analysis as an effective method in building up and solving nonlinear mathematical models has become an important part in nonlinear analysis. It also has comprehensive applications in control theory, differential decision, economics, bio-mathematics, physics, differential inclusion and so on. The number of set-valued points increasing is the main reason for the complexity of iteration of multifunctions, the problem becomes easier as the reduction of set-valued points. As we discussed for polygonal functions, in chapter 3, we investigate the iteration of upper semi-continuous multifunctions with one set-valued point, giving conditions for the number of set-valued points not to increase under iteration, and the explicit expressions of their general iteration are given in the cases.Based on chapter 3, we continue to discuss the problem of its iterative roots. In 2004, W. Jarczyk and Weinian Zhang investigate the 2-th order iterative roots of a kind multifunctions and give some conditions of nonexistence. In chapter 4, we continue to find more possibilities of nonexistence. In addition, we also present the condition of existence for a kind of multifunctions.
【Key words】 iteration; iterative root; polygonal function; multifunction; upper semi-continuous;
- 【网络出版投稿人】 四川大学 【网络出版年期】2008年 05期
- 【分类号】O19
- 【被引频次】2
- 【下载频次】113