derivable and holomorphic

<!DOCTYPE html><html><head><meta charset="utf-8"><title>sqwswwEEEeUntitled Document</title><style></style></head><body>

<h3 id="-">复习提纲</h3> <blockquote> <ol> <li>stereographic projection (definition and the way to find a projecting point) </li> <li>calculate square root for a given complex number </li> <li>triangle inequality </li> <li>differentiation of a holomorphic function. (definition, Cauchy-Riemann equation, method to calculate a derivative for a given function , find a harmonic conjugate for a given real part) </li> <li>Maximal muduli theorem (proof is not required, just need know how to use it ) </li> <li>write a rational function into a sum of partial fractions </li> <li>linear transformation (cross ratio, the way to find a center of a circle decided by three points, how to decide if four points are on a same circle, symmetric points, reflection with respect to a circle, determine a linear transformation which can realize some transformations between circles)</li> </ol> </blockquote> <hr> <ul> <li>疑问:哪些函数连续,连续引申出来的性质有哪些?</li> <li>疑问:Prove fundamental theorem of algbra using maximum mudulii theorem</li> <li>疑问:extended complex plane: C ∪ {∞} |z|&gt;1/ε is the neiborhood of ∞</li> <li>Riemann sphere and stereographic projection.</li> </ul> <hr> <ul> <li><p>A function f is continous at piont Zo if all three of the following conditions satisfied: (虽然只是一个点,但是实际上却包含了邻域|Z-Zo|&lt;ζ)</p> <blockquote> <blockquote> <ol> <li>lim f(Z) exists</li> <li>f(Zo) exists</li> <li>lim f(Z) = f(Zo)</li> </ol> </blockquote> </blockquote> </li> <li><p>A function of complex variable is said to be continous in the region R if it is continous at each point in R.</p> <blockquote> <ol> <li>two functions are continous at a point,<blockquote> <ol> <li>their sum and product are also continous at that point</li> <li>their quotient is continous at any such point if the denomonator is not zero there.</li> <li>a polynomial is continous in the entire plane. </li> </ol> </blockquote> </li> </ol> </blockquote> </li> <li>theorem1:两个连续函数的复合仍然是连续的。</li> <li>theorem2; 如果f(Z) 在点Zo连续并且不为0,那么在该店的某个邻域有f(Z)≠0。</li> <li>theorem3: 如果f(Z)=u(x,y) + iv(x,y)中的分量函数u和v在点Zo=(xo,yo)连续,那么f也在该点连续。反之,也成立。</li> <li>theorem4:设R是一个有界闭区间,如果函数f在整个R上连续,那么存在一个非负实数M,使得<pre><code> |f(Z)|≤M 对R中所有的点Z成立,其中等号至少对一个点Z成立 </code></pre></li> </ul> <hr> <ul> <li>Derivatives:let f be a function whose domain of definition contains a neighborhood |Z-Zo|&lt;ε of a point Zo. The <strong>derivative</strong> of f at Zo is the limit <pre><code> f&#39;(Zo)=lim (f(Z)-f(Zo))/(Z-Zo) </code></pre>or defined as <pre><code> f&#39;(Zo)=lim (f(Zo+△Z)-f(Zo))/△Z </code></pre>and function f is said to be <strong>defferentiable</strong> at Zo when f&#39;(Zo) exist.</li> <li>复变函数有与实函数相似的求导性质。<pre><code> especially, F(Z)=g(f(Z)) has a derivative at Zo, and F&#39;(Zo)=g&#39;(f(Zo))f&#39;(Zo) </code></pre></li> <li>Cauchy-riemann equation; if function f(Z)=u(x,y)+v(x,y) is derivable at Zo, then<pre><code> f&#39;(Zo)=Ux(xo.yo)+iVx(xo,yo) f&#39;(Zo)=-iUy(xo,yo)+Vy(xo,yo) </code></pre>by the uniqueness of limits, both the equation provide neccessary conditions for existance of f&#39;(Zo)<pre><code> Ux(xo,yo)=Vy(xo,yo) and Uy(xo,yo)=-Vx(xo,yo) </code></pre></li> <li>theorem: 设 f(Z)=u(x,y) + iv(x,y) 并且f&#39;(Z) 在点Zo=xo+iyo存在,那么分量u和v的一届偏导数在点(xo,yo)存在,且在该店满足柯西-黎曼方程:<pre><code> Ux=Vy, Uy=-Vx 并且 f&#39;(Zo)=Ux+ iVx </code></pre></li> <li><p>Sufficient consitions for Differentiability; 设函数 f(Z)=u(x,y)+iv(x,y)在点Zo=xo+iyo 的某个ε邻域中处处有定义,并且</p> <blockquote> <ol> <li>分量u和v关于x和y的一阶偏导数在点Zo=xo+iyo的ε邻域内处处存在。</li> <li>这些一阶偏导数在点(xo,yo)连续且在点(xo,yo)满足柯西黎曼方程, 那么f&#39;(Zo)存在。</li> </ol> </blockquote> </li> <li><p>总结:</p> </li> </ul> <ol> <li>如果要在某一点dirivable抑或是differentiable,那么需要函数在这点周围有定义,并且分量关于x,y的一阶偏导也要存在并且在周围连续,这样还不能保证derivable,必须还要让这一点满足柯西黎曼方程。</li> <li>还有第二种方法判断,便是直接用derivative的定义去求函数在那一点的导数,但这种方法基本不可行,因为我们无法去验证它在每一个方向上的极限都相等。倒是这种方法适合证明导数的不存在。</li> <li>特殊函数,比如ponynomials可以直接用它本身的性质去求。</li> <li>至于holomorphic function的定义,如果说 &quot;holomorphic at a point Zo&quot;, means not just differentiable at Zo, but differentiable everywhere within some neighborhood of Zo in the complex plane. </li> </ol>

</body></html>

转载于:https://my.oschina.net/smartman/blog/330429

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
用C++编写程序,实现以下问题2、题目ID Codes(POJ1146) Time Limit: 1000MS Memory Limit: 10000K 描述: It is 2084 and the year of Big Brother has finally arrived, albeit a century late. In order to exercise greater control over its citizens and thereby to counter a chronic breakdown in law and order, the Government decides on a radical measure--all citizens are to have a tiny microcomputer surgically implanted in their left wrists. This computer will contains all sorts of personal information as well as a transmitter which will allow people's movements to be logged and monitored by a central computer. (A desirable side effect of this process is that it will shorten the dole queue for plastic surgeons.) An essential component of each computer will be a unique identification code, consisting of up to 50 characters drawn from the 26 lower case letters. The set of characters for any given code is chosen somewhat haphazardly. The complicated way in which the code is imprinted into the chip makes it much easier for the manufacturer to produce codes which are rearrangements of other codes than to produce new codes with a different selection of letters. Thus, once a set of letters has been chosen all possible codes derivable from it are used before changing the set. For example, suppose it is decided that a code will contain exactly 3 occurrences of a', 2 of b' and 1 of c', then three of the allowable 60 codes under these conditions are: abaabc abaacb ababac These three codes are listed from top to bottom in alphabetic order. Among all codes generated with this set of characters, these codes appear consecutively in this order. Write a program to assist in the issuing of these identification codes. Your program will accept a sequence of no more than 50 lower case letters (which may contain repeated characters) and print the successor code if one exists or the message No Successor' if the given code is the last in the sequence for that set of characters. 输入: Input will consist of a series of lines each containing a string representing a code. The entire file will be terminated by a line consisting of a single #. 输出: Output will consist of one line for each code read containing the successor code or the words 'No Successor'. 样例输入 abaacb cbbaa # 样例输出 ababac No Successor
05-22
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值