首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 750 毫秒
1.
A multi-level spectral Galerkin method for the two-dimensional non-stationary Navier-Stokes equations is presented. The method proposed here is a multiscale method in which the fully nonlinear Navier-Stokes equations are solved only on a low-dimensional space subsequent approximations are generated on a succession of higher-dimensional spaces j=2, . . . ,J, by solving a linearized Navier-Stokes problem around the solution on the previous level. Error estimates depending on the kinematic viscosity 0<ν<1 are also presented for the J-level spectral Galerkin method. The optimal accuracy is achieved when We demonstrate theoretically that the J-level spectral Galerkin method is much more efficient than the standard one-level spectral Galerkin method on the highest-dimensional space . The work of this author was supported in part by the NSF of China 10371095, City University of Hong Kong Research Project 7001093 Hong Kong and the Research Grants Council of the Hong Kong Special Administrative Region, China (Project No. CityU 1084/02P)  相似文献   

2.
Summary In this paper, we develop a matrix framework to solve the problem of finding orthonormal rational function vectors with prescribed poles with respect to a certain discrete inner product that is defined by a set of data points and corresponding weight vectors wi,j. Our algorithm for solving the problem is recursive, and it is of complexity If all data points are real or lie on the unit circle, then the complexity is reduced by an order of magnitude.  相似文献   

3.
Summary We introduce a class of n×n structured matrices which includes three well-known classes of generalized companion matrices: tridiagonal plus rank-one matrices (comrade matrices), diagonal plus rank-one matrices and arrowhead matrices. Relying on the structure properties of , we show that if A then A=RQ , where A=QR is the QR decomposition of A. This allows one to implement the QR iteration for computing the eigenvalues and the eigenvectors of any A with O(n) arithmetic operations per iteration and with O(n) memory storage. This iteration, applied to generalized companion matrices, provides new O(n2) flops algorithms for computing polynomial zeros and for solving the associated (rational) secular equations. Numerical experiments confirm the effectiveness and the robustness of our approach.The results of this paper were presented at the Workshop on Nonlinear Approximations in Numerical Analysis, June 22 – 25, 2003, Moscow, Russia, at the Workshop on Operator Theory and Applications (IWOTA), June 24 – 27, 2003, Cagliari, Italy, at the Workshop on Numerical Linear Algebra at Universidad Carlos III in Leganes, June 16 – 17, 2003, Leganes, Spain, at the SIAM Conference on Applied Linear Algebra, July 15 – 19, 2003, Williamsburg, VA and in the Technical Report [8]. This work was partially supported by MIUR, grant number 2002014121, and by GNCS-INDAM. This work was supported by NSF Grant CCR 9732206 and PSC CUNY Awards 66406-0033 and 65393-0034.  相似文献   

4.
In this paper we investigate convergence of Landweber iteration in Hilbert scales for linear and nonlinear inverse problems. As opposed to the usual application of Hilbert scales in the framework of regularization methods, we focus here on the case s≤0, which (for Tikhonov regularization) corresponds to regularization in a weaker norm. In this case, the Hilbert scale operator L−2s appearing in the iteration acts as a preconditioner, which significantly reduces the number of iterations needed to match an appropriate stopping criterion. Additionally, we carry out our analysis under significantly relaxed conditions, i.e., we only require instead of which is the usual condition for regularization in Hilbert scales. The assumptions needed for our analysis are verified for several examples and numerical results are presented illustrating the theoretical ones. supported by the Austrian Science Foundation (FWF) under grant SFB/F013  相似文献   

5.
Summary This paper deals with an elliptic boundary value problem posed in the plane, with variable coefficients, but whose restriction to the exterior of a bounded domain reduces to a Helmholtz equation. We consider a mixed variational formulation in a bounded domain that contains the heterogeneous medium, coupled with a boundary integral method applied to the Helmholtz equation in . We utilize suitable auxiliary problems, duality arguments, and Fredholm alternative to show that the resulting formulation of the problem is well posed. Then, we define a corresponding Galerkin scheme by using rotated Raviart-Thomas subspaces and spectral elements (on the interface). We show that the discrete problem is uniquely solvable and convergent and prove optimal error estimates. Finally we illustrate our analysis with some results from computational experiments.  相似文献   

6.
Hybrid cross approximation of integral operators   总被引:2,自引:0,他引:2  
The efficient treatment of dense matrices arising, e.g., from the finite element discretisation of integral operators requires special compression techniques. In this article we use the -matrix representation that approximates the dense stiffness matrix in admissible blocks (corresponding to subdomains where the underlying kernel function is smooth) by low-rank matrices. The low-rank matrices are assembled by a new hybrid algorithm (HCA) that has the same proven convergence as standard interpolation but also the same efficiency as the (heuristic) adaptive cross approximation (ACA).  相似文献   

7.
Summary Residual-based a posteriori error estimates are derived within a unified setting for lowest-order conforming, nonconforming, and mixed finite element schemes. The various residuals are identified for all techniques and problems as the operator norm |||| of a linear functional of the formin the variable of a Sobolev space V. The main assumption is that the first-order finite element space is included in the kernel Ker of . As a consequence, any residual estimator that is a computable bound of |||| can be used within the proposed frame without further analysis for nonconforming or mixed FE schemes. Applications are given for the Laplace, Stokes, and Navier-Lamè equations.Supported by the DFG Research Center Matheon Mathematics for key technologies in Berlin.  相似文献   

8.
Summary In this paper, we introduce and analyze the interior penalty discontinuous Galerkin method for the numerical discretization of the indefinite time-harmonic Maxwell equations in the high-frequency regime. Based on suitable duality arguments, we derive a-priori error bounds in the energy norm and the L2-norm. In particular, the error in the energy norm is shown to converge with the optimal order (hmin{s,}) with respect to the mesh size h, the polynomial degree , and the regularity exponent s of the analytical solution. Under additional regularity assumptions, the L2-error is shown to converge with the optimal order (h+1). The theoretical results are confirmed in a series of numerical experiments.Supported by the EPSRC (Grant GR/R76615).Supported by the Swiss National Science Foundation under project 21-068126.02.Supported in part by the Natural Sciences and Engineering Council of Canada.  相似文献   

9.
The result after N steps of an implicit Runge-Kutta time discretization of an inhomogeneous linear parabolic differential equation is computed, up to accuracy ɛ, by solving only linear systems of equations. We derive, analyse, and numerically illustrate this fast algorithm.  相似文献   

10.
In this paper, we provide a suitable theory for the energy where μ is a Radon measure and Γ is the fundamental solution of a sub-Laplacian on a stratified group As a significant application, we prove the quasi-continuity of superharmonic functions related to . The proofs are elementary and mostly rely on the use of appropriate mean-value formulas and mean-integral operators relevant to the Potential Theory for .  相似文献   

11.
Summary. In [1], we have constructed a family of finite volume schemes on rectangular meshes for the p-laplacian and we proved error estimates in case the exact solution lies in W2,p. Actually, W2,p is not a natural space for solutions of the p-laplacian in the case p>2. Indeed, for general Lp data it can be shown that the solution only belongs to the Besov space In this paper, we prove Besov kind a priori estimates on the approximate solution for any data in Lp. We then obtain new error estimates for such solutions in the case of uniform meshes  相似文献   

12.
The initial boundary value problem is considered for the dynamic string equation . Its solution is found by means of an algorithm, the constituent parts of which are the Galerkin method, the modified Crank-Nicolson difference scheme used to perform approximation with respect to spatial and time variables, and also a Picard type iteration process for solving the system of nonlinear equations obtained by discretization. Errors of the three parts of the algorithm are estimated and, as a result, its total error estimate is obtained.  相似文献   

13.
In this paper we study the approximation power, the existence of a normalized B-basis and the structure of a degree-raising process for spaces of the formrequiring suitable assumptions on the functions u and v. The results about degree raising are detailed for special spaces of this form which have been recently introduced in the area of CAGD.  相似文献   

14.
In this paper, the second order boundary value problem −∇·((x,y)∇u)=f is discretized by the Finite Element Method using piecewise polynomial functions of degree p on a triangular mesh. On the reference element, we define integrated Jacobi polynomials as interior ansatz functions. If is a constant function on each triangle and each triangle has straight edges, we prove that the element stiffness matrix has not more than nonzero matrix entries. An application for preconditioning is given. Numerical examples show the advantages of the proposed basis.  相似文献   

15.
We describe the possible restrictions of the cotangent bundle to an elliptic curve . We apply this in positive characteristic to the computation of the Hilbert-Kunz function of a homogeneous R+-primary ideal in the graded section ring .  相似文献   

16.
Let A be an Archimedean vector lattice, let be its Dedekind completion and let B be a Dedekind complete vector lattice. If Ψ 0:A × AB is a positive orthosymmetric bimorphism, then there exists a positive bimorphism extension Ψ of Ψ 0 to × in B which is orthosymmetric. This leads to a new and short proof of the commutativity of the almost f-algebras multiplications.  相似文献   

17.
Summary. We develop a new algorithm for the fast evaluation of linear combinations of radial functions based on the recently developed fast Fourier transform at nonequispaced knots. For smooth kernels, e.g. the Gaussian, our algorithm requires arithmetic operations. In case of singular kernels an additional regularization procedure must be incorporated and the algorithm has the arithmetic complexity if either the points yj or the points xk are reasonably uniformly distributed. We prove error estimates to obtain clues about the choice of the involved parameters and present numerical examples for various singular and smooth kernels in two dimensions.Mathematics Subject Classification (2000): 65T40, 65T50, 65F30Revised version received December 3, 2003  相似文献   

18.
Let M be a two dimensional complex manifold, p ∈ M and a germ of holomorphic foliation of M at p. Let be a germ of an irreducible, possibly singular, curve at p in M which is a separatrix for . We prove that if the Camacho-Sad-Suwa index Ind then there exists another separatrix for at p. A similar result is proved for the existence of parabolic curves for germs of holomorphic diffeomorphisms near a curve of fixed points.  相似文献   

19.
Summary. Let be an analytic Jordan curve in the unit disk We regard the hyperbolic minimal energy problem where () denotes the set of all probability measures on . There exist several extremal point discretizations of *, among others introduced by M. Tsuji (Tsuji points) or by K. Menke (hyperbolic Menke points). In the present article, it is proven that hyperbolic Menke points approach the images of roots of unity under a conformal map from onto geometrically fast if the number of points tends to infinity. This establishes a conjecture of K. Menke. In particular, explicit bounds for the approximation error are given. Finally, an effective method for the numerical determination of * providing a geometrically shrinking error bound is presented.Mathematics Subject Classification (1991): 30C85, 30E10, 31C20The notation Menke points has been introduced by D. Gaier.  相似文献   

20.
Summary. We employ a data-sparse, recursive matrix representation, so-called -matrices, for the efficient treatment of discretized integral operators. We obtain this format using local tensor product interpolants of the kernel function and replacing high-order approximations with piecewise lower-order ones. The scheme has optimal, i.e., linear, complexity in the memory requirement and time for the matrix-vector multiplication. We present an error analysis for integral operators of order zero. In particular, we show that the optimal convergence (h) is retained for the classical double layer potential discretized with piecewise constant functions.Corrigendum This revised version was published online in February 2005 due to typesetting mistakes in the author correction process.  相似文献   

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

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