覆盖单位圆的序贯方法

本文应用数论方法解决一个实际中遇到的单位圆的覆盖问题。用单位圆上的均匀布点方法估计覆盖面积S的均值、方差及其分布函数,结果显示Beta分布可以较好的拟合S/π的分布。为了增大覆盖面积,推荐采用序贯方法安排随机圆,模拟结果显示序贯方法非常有效。本文还指出了序贯方法在加权单位圆的覆盖问题中效果也显著。     

Conformally natural extensions of continuous circle maps: II. The general case

We introduce a procedure for extending continuous circle maps in a conformally natural way to continuous maps from the closed disk, bounded by the circle to itself which generalizes Douady-Earle’s method of constructing conformally natural extensions of circle homeomorphisms. We also provide a criterion for the extensions to be surjective maps from the closed disk to itself.     

Solving singular convolution equations using the inverse Fast Fourier Transform

The inverse Fast Fourier Transform is a common procedure to solve a convolution equation provided the transfer function has no zeros on the unit circle. In our paper we generalize this method to the case of a singular convolution equation and prove that if the transfer function is a trigonometric polynomial with simple zeros on the unit circle, then this method can be extended.     

具有无界度的无限圆填充的刚性(英文)

刚性是圆填充理论的一个重要的性质.已经知道,平面上无限的有界度的圆填充的刚性可以用环绕数的方法来证明.本文应用环绕数和指标的技术,结合有限覆盖定理证明了几乎填满整个黎曼球面具有相同复形的无限无界度圆填充对M(o|¨)bius变换来说是等价的,也就是,一个圆填充是另一个圆填充在M(o|¨)bius变换下的像.这给出了无限无界度圆填充的刚性的一种新的证明.     

A geometrical construction of inverse points with respect to an ellipse

In this note, we introduce the inverse point respect to an ellipse, which generalizes the classical inversion in a circle. Specifically, we show a geometrical construction of inverse points with respect to an ellipse. For this, we extend the classical method to construct the inverse of a point respect to a circle.     

A DIRECT METHOD FOR THE UNIT CIRCLE PROBLEM

The unit circle problem is the problem of finding the number of eigenvalues of a non-Hermitian matrix inside and outside the unit circle . To reduce the cost of computing eigenvalues for the problem, a direct method, which is analogous to that given in [5], is proposed in this paper.     

Detection of the singularities of a complex function by numerical approximations of its Laurent coefficients

For several applications, it is important to know the location of the singularities of a complex function: just for example, the rightmost singularity of a Laplace Transform is related to the exponential order of its inverse function. We discuss a numerical method to approximate, within an input accuracy tolerance, a finite sequence of Laurent coefficients of a function by means of the Discrete Fourier Transform (DFT) of its samples along an input circle. The circle may also enclose some singularities, since the method works with the Laurent expansion. The DFT is computed by the FFT algorithm so that, from a computational point of view, the efficiency is guaranteed. The function samples may be obtained by solving a numerical problem such as, for example, a differential problem. We derive, as consequences of the method, some new outcomes able to detect those singularities which are close to the circle and to discover if the singularities are all external or internal to the circle so that the Laurent expansion reduces to its regular or singular part, respectively. Other singularities may be located by means of a repeated application of the method, as well as an analytic continuation. Some examples and results, obtained by a first implementation, are reported.     

Guided discovery of the nine-point circle theorem and its proof

The nine-point circle theorem is one of the most beautiful and surprising theorems in Euclidean geometry. It establishes an existence of a circle passing through nine points, all of which are related to a single triangle. This paper describes a set of instructional activities that can help students discover the nine-point circle theorem through investigation in a dynamic geometry environment, and consequently prove it using a method of guided discovery. The paper concludes with a variety of suggestions for the ways in which the whole set of activities can be implemented in geometry classrooms.     

On parametric polynomial circle approximation

In the paper, the uniform approximation of a circle arc (or a whole circle) by a parametric polynomial curve is considered. The approximant is obtained in a closed form. It depends on a parameter that should satisfy a particular equation, and it takes only a couple of tangent method steps to compute it. For low degree curves, the parameter is provided exactly. The distance between a circle arc and its approximant asymptotically decreases faster than exponentially as a function of polynomial degree. Additionally, it is shown that the approximant could be applied for a fast evaluation of trigonometric functions too.     

极限圆型Hamilton算子乘积的自伴性

本文讨论了极限圆型Hamilton算子乘积的自伴性,利用Calkin方法及奇异Hamilton系统自伴扩张的一般构造理论,给出了在极限圆型时判定Hamilton算子乘积自伴的一个充要条件.     

A criterion for the convergence of the Gauss-Seidel method

The solution of linear equations by iterative methods requires for convergence that the absolute magnitudes of all the eigenvalues of the iteration matrix should be less than unity. The test for convergence however is often difficult to apply because of the computation required. In this paper a method for determining the convergence of the Gauss-Seidel iteration is proposed. The method involves the numerical integration of initial value differential equations in the complex plane around the unit circle. The Gauss-Seidel method converges if the number of roots inside the unit circle is equal to the order of the iteration matrix.     

Variational principles for branched circle patterns

We are concerned with variational principles for branched circle patterns. We use critical point theory to establish existence and uniqueness. Furthermore, we apply the Ricci flow method to give an approximation scheme which converges exponentially to the branched circle pattern metric.     

Circle measurements in ancient China

This paper discusses the method of Liu Hui (3rd century) for evaluating the ratio of the circumference of a circle to its diameter, now known as π. A translation of Liu's method is given in the Appendix. Also examined are the values for π given by Zu Chongzhi (429–500) and unsurpassed for a millenium. Although the method used by Zu is not extant, it is almost certain that the applied Liu's method. With the help of an electronic computer, a table of computations adhering to Liu's method is given to show the derivation of Zu's results. The paper concludes with a survey of circle measurements in China.     

Zero location by Hermitian forms: The singular case

The Schur-Cohn criterion for the number of zeros of a polynomial inside and outside the unit disc fails if the polynomial has a pair of conjugate zeros or a zero on the unit circle: the corresponding quadratic form is singular. Recently the authors have shown [5] that the classical Schur-Cohn criterion may be deduced from a simple algebraic identity; this yields not only a very simple proof but also a substantial generalization. The method produces a whole family of quadratic forms which may be used for testing the zeros. In the present paper the same algebraic identity is used to show that singularity of these quadratic forms is always due to the presence of pairs of conjugate zeros or zeros on the unit circle. There is a method for ascertaining zero distribution in the singular case by differentiation; we give a derivation of this test on the basis of our matrix-theoritic treatment. The second section deals with the same problem in the case of a general circle or half plane.     

Numerical solution for exterior problems

Summary We solve the Helmholtz equation in an exterior domain in the plane. A perfect absorption condition is introduced on a circle which contains the obstacle. This boundary condition is given explicitly by Bessel functions. We use a finite element method in the bounded domain. An explicit formula is used to compute the solution out of the circle. We give an error estimate and we present relevant numerical results.     

代数方程在任意圆外根的个数

从复变函数论知,复多项式f(u)=sum from l=0 to n (a_1u~(n-1))在u=u_0点的Taylor展开式是u的恒等式:     

G-stability is equivalent toA-stability

In 1975 the author showed that a norm (Liapunov function) can be constructed for the stability and error analysis of a linear multistep method (and the related one-leg method) for the solution of stiff non-linear systems, provided that the system satisfies a monotonicity condition and the method possesses a property calledG-stability.In this paper it is shown thatG-stability is equivalent toA-stability. More generally, a Liapunov function exists if the stability region of the method contains a circle (half-plane), provided that the system satisfies a monotonicity condition related to this circle (half-plane). In the general case this condition depends on the stepsize.     

Algebraic methods and arithmetic filtering for exact predicates on circle arcs

The purpose of this paper is to present a new method to design exact geometric predicates in algorithms dealing with curved objects such as circular arcs. We focus on the comparison of the abscissae of two intersection points of circle arcs, which is known to be a difficult predicate involved in the computation of arrangements of circle arcs. We present an algorithm for deciding the x-order of intersections from the signs of the coefficients of a polynomial, obtained by a general approach based on resultants. This method allows the use of efficient arithmetic and filtering techniques leading to fast implementation as shown by the experimental results.     

Sums of nine almost equal prime cubes

We prove that each sufficiently large odd integer N can be written as sum of the form N = p1^3 ＋p2^3 ＋... ＋p9^3 with [pj - （N/9）^1/31 ≤ N^（1/3）-θ, where pj, j = 1,2,...,9, are primes and θ = （1/51） -ε.     

单位圆到任意曲线保角变换的近似计算方法

本文讨论了将单位圆内部映射成由任意曲线(包括任意曲线割缝)边界围成的单连通域内部或外部的保角变换问题.以多边形逼近单连通域的边界,采用Schwartz-Christoffel积分建立单位圆与该多边形的映射函数.给出了确定Schwartz-Christoffel积分中未知参数的数值计算方法.