首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
A combined grid method for solving the Dirichlet problem for the Laplace equation in a rectangular parallelepiped is proposed. At the grid points that are at the distance equal to the grid size from the boundary, the 6-point averaging operator is used. At the other grid points, the 26-point averaging operator is used. It is assumed that the boundary values have the third derivatives satisfying the Lipschitz condition on the faces; on the edges, they are continuous and their second derivatives satisfy the compatibility condition implied by the Laplace equation. The uniform convergence of the grid solution with the fourth order with respect to the grid size is proved  相似文献   

2.
A modified combined grid method is proposed for solving the Dirichlet problem for the Laplace equation on a rectangular parallelepiped. The six-point averaging operator is applied at next-to-the-boundary grid points, while the 18-point averaging operator is used instead of the 26-point one at the remaining grid points. Assuming that the boundary values given on the faces have fourth derivatives satisfying the Hölder condition, the boundary values on the edges are continuous, and their second derivatives obey a matching condition implied by the Laplace equation, the grid solution is proved to converge uniformly with the fourth order with respect to the mesh size.  相似文献   

3.
We found an explicit form of eigenfunctions and eigenvalues of the difference Laplace operator on a seven-point nonorthogonal pattern of a rectangular grid for the second boundary-value problem. Estimates for maximal and minimal eigenvalues are found. Dispersion properties of an explicit difference scheme are studied for the two-dimensional wave equation. The scheme uses an approximation of the Laplace operator on a seven-point pattern.  相似文献   

4.
The Dirichlet problem for Laplace’s equation in a rectangular parallelepiped is solved by applying the grid method. A 14-point averaging operator is used to specify the grid equations on the entire grid introduced in the parallelepiped. Given boundary values that are continuous on the parallelepiped edges and have first derivatives satisfying the Lipschitz condition on each parallelepiped face, the resulting discrete solution of the Dirichlet problem converges uniformly and quadratically with respect to the mesh size. Assuming that the boundary values on the faces have fourth derivatives satisfying the Hölder condition and the second derivatives on the edges obey an additional compatibility condition implied by Laplace’s equation, the discrete solution has uniform and quartic convergence with respect to the mesh size. The convergence of the method is also analyzed in certain cases when the boundary values are of intermediate smoothness.  相似文献   

5.
A T-mesh is basically a rectangular grid that allows T-junctions. Recently, Deng etal introduced splines over T-meshes, which are generalizations of T-splines invented by Sederberg etal, and proposed a dimension formula based on the B-net method. In this paper, we derive an equivalent dimension formula in a different form with the smoothing cofactor method.  相似文献   

6.
The aim of the present paper is to carry on the research of Czédli in determining the maximum number of rectangular islands on a rectangular grid. We estimate the maximum of the number of triangular islands on a triangular grid.   相似文献   

7.
Series expansions are obtained for a rich subset of eigenvalues and eigenfunctions of an operator that arises in the study of rectangular membranes: the operator is the 2-D Laplacian with restorative force term and Dirichlet boundary conditions. Expansions are extracted by considering the restorative force term as a linear perturbation of the Laplacian; errors of truncation for these expansions are estimated. Theriteria defining the subset of eigenvalues and eigenfunctions that can

be studied depends only on the size and linearity of the perturbation. The results are valid for almost all rectangular domains.  相似文献   

8.
Approximation properties of divergence-free vector fields by global and local solenoidal bases are studied. A comparison between interpolants generated with radial kernels and multivariate polynomials is presented. Numerical results show higher rates of convergence for derivatives of the vector field being approximated in directions enforced by the divergence operator when a rectangular grid is used. We also compute the growth of Lebesgue constants for uniform and clustered nodes and study the flat limit of divergence-free interpolants based on radial kernels. Numerical results are presented for two- and three-dimensional vector fields.  相似文献   

9.
Efficient multilevel preconditioners are developed and analyzed for the quadrature finite element Galerkin approximation of the biharmonic Dirichlet problem. The quadrature scheme is formulated using the Bogner–Fox–Schmit rectangular element and the product two‐point Gaussian quadrature. The proposed additive and multiplicative preconditioners are uniformly spectrally equivalent to the operator of the quadrature scheme. The preconditioners are implemented by optimal algorithms, and they are used to accelerate convergence of the preconditioned conjugate gradient method. Numerical results are presented demonstrating efficiency of the preconditioners. © 2005 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2006  相似文献   

10.
We consider finite difference approximations of solutions of inverse Sturm‐Liouville problems in bounded intervals. Using three‐point finite difference schemes, we discretize the equations on so‐called optimal grids constructed as follows: For a staggered grid with 2 k points, we ask that the finite difference operator (a k × k Jacobi matrix) and the Sturm‐Liouville differential operator share the k lowest eigenvalues and the values of the orthonormal eigenfunctions at one end of the interval. This requirement determines uniquely the entries in the Jacobi matrix, which are grid cell averages of the coefficients in the continuum problem. If these coefficients are known, we can find the grid, which we call optimal because it gives, by design, a finite difference operator with a prescribed spectral measure. We focus attention on the inverse problem, where neither the coefficients nor the grid are known. A key question in inversion is how to parametrize the coefficients, i.e., how to choose the grid. It is clear that, to be successful, this grid must be close to the optimal one, which is unknown. Fortunately, as we show here, the grid dependence on the unknown coefficients is weak, so the inversion can be done on a precomputed grid for an a priori guess of the unknown coefficients. This observation leads to a simple yet efficient inversion algorithm, which gives coefficients that converge pointwise to the true solution as the number k of data points tends to infinity. The cornerstone of our convergence proof is showing that optimal grids provide an implicit, natural regularization of the inverse problem, by giving reconstructions with uniformly bounded total variation. The analysis is based on a novel, explicit perturbation analysis of Lanczos recursions and on a discrete Gel'fand‐Levitan formulation. © 2005 Wiley Periodicals, Inc.  相似文献   

11.
The existence and uniqueness of a classical solution to the nonlocal boundary value problem for Poisson’s operator on a two-dimensional rectangular domain is proved in detail by applying the contraction mapping principle.  相似文献   

12.
A Hamiltonian path of a graph is a simple path which visits each vertex of the graph exactly once. The Hamiltonian path problem is to determine whether a graph contains a Hamiltonian path. A graph is called Hamiltonian connected if there exists a Hamiltonian path between any two distinct vertices. In this paper, we will study the Hamiltonian connectivity of rectangular supergrid graphs. Supergrid graphs were first introduced by us and include grid graphs and triangular grid graphs as subgraphs. The Hamiltonian path problem for grid graphs and triangular grid graphs was known to be NP-complete. Recently, we have proved that the Hamiltonian path problem for supergrid graphs is also NP-complete. The Hamiltonian paths on supergrid graphs can be applied to compute the stitching traces of computer sewing machines. Rectangular supergrid graphs form a popular subclass of supergrid graphs, and they have strong structure. In this paper, we provide a constructive proof to show that rectangular supergrid graphs are Hamiltonian connected except one trivial forbidden condition. Based on the constructive proof, we present a linear-time algorithm to construct a longest path between any two given vertices in a rectangular supergrid graph.  相似文献   

13.
非线性Lipschitz算子的Lipschitz对偶算子及其应用   总被引:3,自引:0,他引:3  
彭济根  徐宗本 《数学学报》2002,45(3):469-480
在文山中我们对非线性Lipschitz算子定义了其Lipschitz对偶算子,并证明了任意非线性Lipschitz算子的Lipschitz对偶算子是一个定义在Lipschitz对偶空间上的有界线性算子.本文还进一步证明:设C为 Banach空间 X的闭子集,C*L为C的 Lipschitz对偶空间,U为 C*L上的有界线性算子,则当且仅当 U为 w*-w*连续的同态变换时,存在Lipschitz连续算子T,使U为T的Lipschitz对偶算子.这一结论的理论意义在于:它表明一个非线性Lipschitz算子的可逆性问题可转化为有界线性算子的可逆性问题.作为应用,通过引入一个新概念──PX-对偶算子,在一般框架下给出了非线性算子半群的生成定理.  相似文献   

14.
谱表示     
李炳仁 《数学学报》1979,22(2):146-155
<正> Stone M.对Hilbert空间中一个具有简单谱的自伴算子建立了谱表示定理,即有实轴上的有限Borel测度μ,使得同构于L~2(μ),同时变A为乘以自变量λ的算子.Jauch等([2])讨论了一列交换的自伴算子完全集谱表示定理,但要求一个关于测度绝对连续性的假定.此外,依据约化理论([3])可知,如果A是可分Hilbert空间的自伴  相似文献   

15.
An explicit computation is made for a Laplace-Beltrami type operator for Jack polynomials. As applications we obtain: combinatorial formula, determinantal formula and raising operator formula for Jack polynomials, as well as an iterative formula for the Littlewood-Richardson coefficients. One special case of our results implies Mimachi-Yamada’s result on Jack polynomials of rectangular shapes.  相似文献   

16.
Two-dimensional supersonic laminar ideal gas flows past a regular flat lattice of identical circular cylinders lying in a plane perpendicular to the free-stream velocity are numerically simulated. The flows are computed by applying a multiblock numerical technique with local boundary-fitted curvilinear grids that have finite regions overlapping the global rectangular grid covering the entire computational domain. Viscous boundary layers are resolved on the local grids by applying the Navier–Stokes equations, while the aerodynamic interference of shock wave structures occurring between the lattice elements is described by the Euler equations. In the overlapping grid regions, the functions are interpolated to the grid interfaces. The regimes of supersonic lattice flow are classified. The parameter ranges in which the steady flow around the lattice is not unique are detected, and the mechanisms of hysteresis phenomena are examined.  相似文献   

17.
In this paper a method is presented for fitting, in the least-squares sense, a bivariate cubic spline function to values of a dependent variable, specified at points on a rectangular grid in the plane of the independent variables. Products of B-splines are used to represent the bicubic splines. The coefficients in this representation are determined by solving a set of one-dimensional least-squares problems.  相似文献   

18.
A novel two-stage difference method is proposed for solving the Dirichlet problem for the Laplace equation on a rectangular parallelepiped. At the first stage, approximate values of the sum of the pure fourth derivatives of the desired solution are sought on a cubic grid. At the second stage, the system of difference equations approximating the Dirichlet problem is corrected by introducing the quantities determined at the first stage. The difference equations at the first and second stages are formulated using the simplest six-point averaging operator. Under the assumptions that the given boundary values are six times differentiable at the faces of the parallelepiped, those derivatives satisfy the Hölder condition, and the boundary values are continuous at the edges and their second derivatives satisfy a matching condition implied by the Laplace equation, it is proved that the difference solution to the Dirichlet problem converges uniformly as O(h 4lnh ?1), where h is the mesh size.  相似文献   

19.
A stationary convection-diffusion problem with a small parameter multiplying the highest derivative is considered. The problem is discretized on a uniform rectangular grid by the central-difference scheme. A new class of two-step iterative methods for solving this problem is proposed and investigated. The convergence of the methods is proved, optimal iterative methods are chosen, and the rate of convergence is estimated. Numerical results are presented that show the high efficiency of the methods.  相似文献   

20.
We solve a boundary value problem for a first-order partial differential equation in a rectangular domain with a fractional discretely distributed differentiation operator. The fractional differentiation is given by Dzhrbashyan–Nersesyan operators. We construct a representation of the solution and prove existence and uniqueness theorems. The results remain valid for the corresponding equations with Riemann–Liouville and Caputo derivatives. In terms of parameters defining the fractional differential operator, we derive necessary and sufficient conditions for the solvability of the problem.  相似文献   

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

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