首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 171 毫秒
1.
Summary. In this paper we examine the convergence rates in an adaptive version of an orthonormalization method for approximating the conformal mapping of an annular region onto a circular annulus. In particular, we consider the case where has an analytic extension in compl() and, for this case, we determine optimal ray sequences of approximants that give the best possible geometric rate of uniform convergence. We also estimate the rate of uniform convergence in the case where the annular region has piecewise analytic boundary without cusps. In both cases we also give the corresponding rates for the approximations to the conformal module of . Received February 2, 1996  相似文献   

2.
Summary The functional analytic principle of alternating projections is used to construct an iterative method for numerical conformal mapping of the unit disc onto regions with smooth boundaries. The result is a simple method which requires in each iterative step only two complex Fourier transforms. Local convergence can be proved using a theorem of Ostrowski. Convergence is linear. The asymptotic convergence factor is equal to the spectral radius of a certain operator. A version with overrelaxation as well as a discretized version are discussed along the same lines. For regions which are close to the unit disc convergence is fast. For some familiar regions the convergence factors can be calculated explicitly. Finally, the method is compared with Theodorsen's.Dedicated to the memory of Peter Henrici  相似文献   

3.
Summary In this paper we present an algorithm for solving numerically the Stokes problem in the plane. The known algorithms are all based on certain discretization schemes for the analytic equations. In contrast to this recent work our algorithm uses an explicit analytic solution of a certain approximating problem, which can easily be solved numerically up to machine accuracy. On the one hand this analytic formula is based on a complex representation of all solutions of the Stokes differential equations, and on the other hand it is based on the conformal mapping of the given domain on the unit disc. Therefore, a central prerequisite of our corresponding program is a program for computing this conformal mapping.  相似文献   

4.
Summary. In this paper we study the relationship between the Hermann-Miyoshi and the Ciarlet-Raviart formulations of the first biharmonic problem. This study will be based on a decomposition principle which will leads us to a new convergence analysis explaining some discrepancies between numerical results obtained with the first formulation on certain meshes and some theoretical convergence results. Received May 24, 1994 / Revised version received August 11, 1995  相似文献   

5.
Summary In this paper we consider the following Newton-like methods for the solution of nonlinear equations. In each step of the Newton method the linear equations are solved approximatively by a projection method. We call this a Projective Newton method. For a fixed projection method the approximations often are the same as those of the Newton method applied to a nonlinear projection method. But the efficiency can be increased by adapting the accuracy of the projection method to the convergence of the approximations. We investigate the convergence and the order of convergence for these methods. The results are applied to some Projective Newton methods for nonlinear two point boundary value problems. Some numerical results indicate the efficiency of these methods.
  相似文献   

6.
Summary. In recent years, it has been shown that many modern iterative algorithms (multigrid schemes, multilevel preconditioners, domain decomposition methods etc.) for solving problems resulting from the discretization of PDEs can be interpreted as additive (Jacobi-like) or multiplicative (Gauss-Seidel-like) subspace correction methods. The key to their analysis is the study of certain metric properties of the underlying splitting of the discretization space into a sum of subspaces and the splitting of the variational problem on into auxiliary problems on these subspaces. In this paper, we propose a modification of the abstract convergence theory of the additive and multiplicative Schwarz methods, that makes the relation to traditional iteration methods more explicit. The analysis of the additive and multiplicative Schwarz iterations can be carried out in almost the same spirit as in the traditional block-matrix situation, making convergence proofs of multilevel and domain decomposition methods clearer, or, at least, more classical. In addition, we present a new bound for the convergence rate of the appropriately scaled multiplicative Schwarz method directly in terms of the condition number of the corresponding additive Schwarz operator. These results may be viewed as an appendix to the recent surveys [X], [Ys]. Received February 1, 1994 / Revised version received August 1, 1994  相似文献   

7.

A variant of the classical Koebe-logarithm osculation algorithm for conformal mapping is obtained by inserting a hyperbolic sine at an intermediate step. The modulus of convergence is calculated, and numerical experiments are reported, in particular in comparison with the method of Grassmann [E. Grassmann (1979). Numerical experiments with a method of successive approximation for conformal mapping. J. Applied Mathematics and Physics, 30, 873-884.]. Either procedure may work better, depending upon the domain. Further numerical examples show how the osculation method can be coupled to faster converging algorithms (which tend to work best for nearly-circular domains), thus making feasible computations which would not be accessible by either method alone.  相似文献   

8.
Approximation theoretic results are obtained for approximation using continuous piecewise polynomials of degree p on meshes of triangular and quadrilateral elements. Estimates for the rate of convergence in Sobolev spaces , are given. The results are applied to estimate the rate of convergence when the p-version finite element method is used to approximate the -Laplacian. It is shown that the rate of convergence of the p-version is always at least that of the h-version (measured in terms of number of degrees of freedom used). If the solution is very smooth then the p-version attains an exponential rate of convergence. If the solution has certain types of singularity, the rate of convergence of the p-version is twice that of the h-version. The analysis generalises the work of Babuska and others to the case . In addition, the approximation theoretic results find immediate application for some types of spectral and spectral element methods. Received August 2, 1995 / Revised version received January 26, 1998  相似文献   

9.
In classical complex analysis the Szegö kernel method provides an explicit way to construct conformal maps from a given simply-connected domain GC onto the unit disc. In this paper we revisit this method in the three-dimensional case. We investigate whether it is possible to construct three-dimensional mappings from some elementary domains into the three-dimensional unit ball by using the hypercomplex Szegö kernel. In the cases of rectangular domains, L-shaped domains, cylinders and the symmetric double-cone the proposed method leads surprisingly to qualitatively very good results. In the case of the cylinder we get even better results than those obtained by the hypercomplex Bergman method that was very recently proposed by several authors.We round off with also giving an explicit example of a domain, namely the T-piece, where the method does not lead to the desired result. This shows that one has to adapt the methods in accordance with different classes of domains.  相似文献   

10.
Summary We investigate several iterative methods for the numerical solution of Theodorsen's integral equation, the discretization of which is either based on trigonometric polynomials or function families with known attenuation factors. All our methods require simultaneous evaluations of a conjugate periodic function at each step and allow us to apply the fast Fourier transform for this. In particular, we discuss the nonlinear JOR iteration, the nonlinear SOR iteration, a nonlinear second order Euler iteration, the nonlinear Chebyshev semi-iterative method, and its cyclic variant. Under special symmetry conditions for the region to be mapped onto we establish local convergence in the case of discretization by trigonometric interpolation and give simple formulas for the optimal parameters (e.g., the underrelaxation factor) and the asymptotic convergence factor. Weaker related results for the general non-symmetric case are presented too. Practically, our methods extend the range of application of Theodorsen's method and improve its effectiveness strikingly.This work was partially supported by NRC (Canada) grant No. A8240 while, in 1976, the author was at the Dept. of Computer Science, University of British Columbia, Vancouver, B.C., Canada. It is part of a thesis submitted for Habilitation at ETH Zurich  相似文献   

11.
Summary This paper deals with some convergence/stability results concerning two numerical methods for solving the incompressible nonstationary Navier-Stokes equations. The algorithms are of a particular kind in what regards time discretization (more precisely, of the Peaceman-Rachford and the Strang type resp.), and have been obtained by modifying slightly the numerical treatment of the nonlinear terms in other schemes due to Glowinski et al. (1980). We first describe the full discretization of the homogeneous Dirichlet problem using a (general) external approximation of the spatial functional spaces involved (a particular and simple choice of such an approximation is the standardP 2-Lagrange finite element for the velocity field when the fluid is bidimensional). Then we establish and prove convergence and stability and make some comments on the numerical treatment of other (generally nonhomogeneous) boundary conditions. The theoretical results show that the schemes are (at least) conditionally stable and convergent, which justifies the success of Glowinski's methods.  相似文献   

12.
We consider the conformal mapping of ``strip-like' domains and derive a number of asymptotic results for computing the conformal modules of an associated class of quadrilaterals. These results are then used for the following two purposes: (a) to estimate the error of certain engineering formulas for measuring resistance values of integrated circuit networks; and (b) to compute the modules of complicated quadrilaterals of the type that occur frequently in engineering applications. April 17, 1997. Date revised: September 10, 1997.  相似文献   

13.
Summary This study is a continuation of a previous paper [4] in which the numerical results are given by using single precision arithmetic. In this paper, we show the numerical results which experess the sharper convergence properties than those of [4], by using double precision arithmetic.Dedicated to Prof. Masaya Yamaguti on the occasion of his 60th birthday  相似文献   

14.
Summary. With denoting the -th partial sum of ${\rm e}^{z}$, the exact rate of convergence of the zeros of the normalized partial sums, , to the Szeg\"o curve was recently studied by Carpenter et al. (1991), where is defined by Here, the above results are generalized to the convergence of the zeros and poles of certain sequences of normalized Pad\'{e} approximants to , where is the associated Pad\'{e} rational approximation to . Received February 2, 1994  相似文献   

15.
 By a metric mode of convergence to infinity in a regular Hausdorff space X, we mean a sequence of closed subsets of X with and , and a sequence (or net) in X is convergent to infinity with respect to provided for each contains eventually. Modulo a natural equivalence relation, these correspond to one-point extensions of the space with a countable base at the ideal point, and in the metrizable setting, they correspond to metric boundedness structures for the space. In this article, we study the interplay between these objects and certain continuous functions that may determine the metric mode of convergence to infinity, called forcing functions. Falling out of our results is a simple proof that each noncompact metrizable space admits uncountably many distinct metric uniformities. (Received 2 March 1999)  相似文献   

16.
Summary. Conformal maps from the exterior of the closed unit disk onto the exterior of ‘bratwurst’ shape sets in the complex plane are constructed. Using these maps, coefficients for the computation of the corresponding Faber polynomials are derived. A ‘bratwurst’ shape set is the result of deforming an ellipse with foci on the real axis, by conformally mapping the real axis onto the unit circle. Such sets are well suited to serve as inclusion sets for sets associated with a matrix, for example the spectrum, field of values or a pseudospectrum. Hence, the sets can be applied in the construction and analysis of a broad range of iterative methods for the solution of linear systems. The main advantage of the approach is that the conformal maps are derived from elementary transformations, allowing an easy computation of the associated transfinite diameter, asymptotic convergence factor and Faber polynomials. Numerical examples are given. Received October 7, 1998 / Revised version received March 15, 1999 / Published online April 20, 2000 –? Springer-Verlag 2000  相似文献   

17.
Summary Our aim is to determine the precise space of functions for which the trapezoidal rule converges with a prescribed rate as the number of nodes tends to infinity. Excluding or controlling odd functions in some way it is possible to establish a correspondence between the speed of convergence and regularity properties of the function to be integrated. In this way we characterize Sobolev spaces, certain spaces of infinitely differentiable functions, of functions holomorphic in a strip, of entire functions of order greater than 1 and of entire functions of exponential type by the speed of convergence.Dedicated to Professor G. Hämmerlin on the occasion of his 60th birthday  相似文献   

18.
Summary In this paper, we present a scheme of convergence analysis of trial free boundary methods for the two-dimensional filtration (or dam) problem. For the purpose we present a new variational principle of the filtration problem. This variational principle is defined on the set of admissible domains (candidates of the solution) in the dam. Under mild assumptions on the configuration of the dam, we may assume that all admissible domains are mapped from the unit disk by conformal mappings. Thus, proving convergence of trial free boundaries is reduced to proving convergence of the conformal mappings on the unit disk, and it is done using a method in the theory of minimal surfaces. Numerical examples are given.  相似文献   

19.
Almost Einstein manifolds are conformally Einstein up to a scale singularity, in general. This notion comes from conformal tractor calculus. In the current paper we discuss almost Einstein structures on closed Riemannian product manifolds and on 4-manifolds of cohomogeneity one. Explicit solutions are found by solving ordinary differential equations. In particular, we construct three families of closed 4-manifolds with almost Einstein structure corresponding to the boundary data of certain unimodular Lie groups. Two of these families are Bach-flat, but neither (globally) conformally Einstein nor half conformally flat. On products with a 2-sphere we find an exotic family of almost Einstein structures with hypersurface singularity as well.  相似文献   

20.
Summary Most boundary element methods for two-dimensional boundary value problems are based on point collocation on the boundary and the use of splines as trial functions. Here we present a unified asymptotic error analysis for even as well as for odd degree splines subordinate to uniform or smoothly graded meshes and prove asymptotic convergence of optimal order. The equations are collocated at the breakpoints for odd degree and the internodal midpoints for even degree splines. The crucial assumption for the generalized boundary integral and integro-differential operators is strong ellipticity. Our analysis is based on simple Fourier expansions. In particular, we extend results by J. Saranen and W.L. Wendland from constant to variable coefficient equations. Our results include the first convergence proof of midpoint collocation with piecewise constant functions, i.e., the panel method for solving systems of Cauchy singular integral equations.Dedicated to Prof. Dr. Dr. h.c. mult. Lothar Collatz on the occasion of his 75th birthdayThis work was begun at the Technische Hochschule Darmstadt where Professor Arnold was supported by a North Atlantic Treaty Organization Postdoctoral Fellowship. The work of Professor Arnold is supported by NSF grant BMS-8313247. The work of Professor Wendland was supported by the Stiftung Volkswagenwerk  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号