Decompositions of functions and Dirichlet problems in the unit disc

In this paper, we establish a decomposition theorem for polyharmonic functions and consider its applications to some Dirichlet problems in the unit disc. By the decomposition, we get the unique solution of the Dirichlet problem for polyharmonic functions (PHD problem) and give a unified expression for a class of kernel functions associated with the solution in the case of the unit disc introduced by Begehr, Du and Wang. In addition, we also discuss some quasi-Dirichlet problems for homogeneous mixed-partial differential equations of higher order. It is worthy to note that the decomposition theorem in the present paper is a natural extension of the Goursat decomposition theorem for biharmonic functions.     

SUBSTRUCTURE PRECONDITIONERS FOR NONCONFORMING PLATE ELEMENTS

1.IntroductionInthispaper,wegeneralizetheBPSalgorithm[1]tononconformingelementfproximationsofthebiharmonicequation.WeconstructapreconditionerforMor:elementbysubstructuringonthebasisofafunctiondecompositionfordiscretebibmonicfunctions.Thefunctiondecomposit…     

On Exact Results in the Finite Element Method

We prove that the finite element method for one-dimensional problems yields no discretization error at nodal points provided the shape functions are appropriately chosen. Then we consider a biharmonic problem with mixed boundary conditions and the weak solution u. We show that the Galerkin approximation of u based on the so-called biharmonic finite elements is independent of the values of u in the interior of any subelement.     

MRA contextual-recovery extension of smooth functions on manifolds

In a recent paper, the first author introduced an MRA (multi-resolution or multi-level approximation) approach to extend an earlier work of Chan and Shen on image inpainting, from isotropic diffusion to anisotropic diffusion and from bi-harmonic extension to multi-level lagged anisotropic diffusion extension. The objective of the present paper is to extend and generalize this work to nonstationary smooth function extension to meet the goal of inpainting missing image features, while matching the existing image content without apparent visual artifact. Our result is formulated as an MRA contextual-recovery extension for the completion of smooth functions on manifolds by deriving an error formula, from which sharp error estimates can be derived. A novel estimate for the biharmonic operator derived in this paper is a formulation of the error bound in terms the volume, as opposed to the diameter, of the image hole.     

On Schwarz's domain decomposition methods for elliptic boundary value problems

Summary. We study the additive and multiplicative Schwarz domain decomposition methods for elliptic boundary value problem of order 2 r based on an appropriate spline space of smoothness . The finite element method reduces an elliptic boundary value problem to a linear system of equations. It is well known that as the number of triangles in the underlying triangulation is increased, which is indispensable for increasing the accuracy of the approximate solution, the size and condition number of the linear system increases. The Schwarz domain decomposition methods will enable us to break the linear system into several linear subsystems of smaller size. We shall show in this paper that the approximate solutions from the multiplicative Schwarz domain decomposition method converge to the exact solution of the linear system geometrically. We also show that the additive Schwarz domain decomposition method yields a preconditioner for the preconditioned conjugate gradient method. We tested these methods for the biharmonic equation with Dirichlet boundary condition over an arbitrary polygonal domain using cubic spline functions over a quadrangulation of the given domain. The computer experiments agree with our theoretical results. Received December 28, 1995 / Revised version received November 17, 1998 / Published online September 24, 1999     

Polygonal interface problems for the biharmonic operator

We study some boundary value problems on two-dimensional polygonal topological networks, where on each face, the considered operator is the biharmonic operator. The transmission conditions we impose along the edges are inspired by the models introduced by H. Le Dret [13] and Destuynder and Nevers [9]. The boundary conditions on the external edges are the classical ones. This class of problem contains the boundary value problems for the biharmonic equation in a plane polygon (see [3, 11, 12, 18]). Conforming to the classical results cited above, we prove that the weak solution of our problem admits a decomposition into a regular part and a singular part, the latter being a linear combination of singular functions depending on the domain and the considered boundary value problem. Finally, we give the exact formula for the coefficients of these singularities.     

Triharmonic morphisms between Riemannian manifolds

Polyharmonic functions have been studied in various fields. There are maps between Riemannian manifolds called harmonic morphisms and biharmonic morphisms that preserve harmonic functions and biharmonic functions respectively. In this paper, we introduce the notion of k-polyharmonic morphisms as maps that preserves polyharmonic functions of order k. For k = 3, we obtain several characterizations of triharmonic morphisms. We also give some relationships among harmonic, biharmonic, and triharmonic morphisms, and a relationship between triharmonic morphisms and p-harmonic morphisms.     

A fast interface solver for the biharmonic Dirichlet problem on polygonal domains

Summary. In this paper we propose and analyze an efficient discretization scheme for the boundary reduction of the biharmonic Dirichlet problem on convex polygonal domains. We show that the biharmonic Dirichlet problem can be reduced to the solution of a harmonic Dirichlet problem and of an equation with a Poincaré-Steklov operator acting between subspaces of the trace spaces. We then propose a mixed FE discretization (by linear elements) of this equation which admits efficient preconditioning and matrix compression resulting in the complexity . Here is the number of degrees of freedom on the underlying boundary, is an error reduction factor, or for rectangular or polygonal boundaries, respectively. As a consequence an asymptotically optimal iterative interface solver for boundary reductions of the biharmonic Dirichlet problem on convex polygonal domains is derived. A numerical example confirms the theory. Received September 1, 1995 / Revised version received February 12, 1996     

THE BOUNDARY INTEGRO-DIFFERENTIAL EQUATIONS OFA BIHARMONIC BOUNDARY VALUE PROBLEM

1.IntroductionWeconsiderahomogeneousisotropicandlinearelasticKirchhoffplateunderlateralloaddistributedovertheplatefix[--t,t].ThedomainfiERZisboundedwiththesmoothboundaryr.Inthestaticequilibrium,weconsiderthefreetypeboundaryconditiononr.Thenthedeflectionusatisfiesthefollowingproblem:whereD~--E0h'.12(1--ac,isthebendingstiffnessoftheplatewithhbeingtheplatethicknessandEOandu(0相似文献   

Numerical solution of a second biharmonic boundary value problem

The second boundary value problem for the biharmonic equation is equivalent to the Dirichlet problems for two Poisson equations. Several finite difference approximations are defined to solve these Dirichlet problems and discretization error estimates are obtained. It is shown that the splitting of the biharmonic equation produces a numerically efficient procedure.     

Biharmonic Green Functions on Homogeneous Trees

The study of biharmonic functions under the ordinary (Euclidean) Laplace operator on the open unit disk \mathbbD{\mathbb{D}} in \mathbbC{\mathbb{C}} arises in connection with plate theory, and in particular, with the biharmonic Green functions which measure, subject to various boundary conditions, the deflection at one point due to a load placed at another point. A homogeneous tree T is widely considered as a discrete analogue of the unit disk endowed with the Poincaré metric. The usual Laplace operator on T corresponds to the hyperbolic Laplacian. In this work, we consider a bounded metric on T for which T is relatively compact and use it to define a flat Laplacian which plays the same role as the ordinary Laplace operator on \mathbbD{\mathbb{D}}. We then study the simply-supported and the clamped biharmonic Green functions with respect to both Laplacians.     

Local and parallel finite element method for solving the biharmonic eigenvalue problem of plate vibration

In this paper, we establish a new local and parallel finite element discrete scheme based on the shifted‐inverse power method for solving the biharmonic eigenvalue problem of plate vibration. We prove the local error estimation of finite element solution for the biharmonic equation/eigenvalue problem and prove the error estimation of approximate solution obtained by the local and parallel scheme. When the diameters of three grids satisfy H⁴ = ?(w²) = ?(h), the approximate solutions obtained by our schemes can achieve the asymptotically optimal accuracy. The numerical experiments show that the computational schemes proposed in this paper are effective to solve the biharmonic eigenvalue problem of plate vibration.     

Mortar Finite Volume Method with Adini Element for Biharmonic Problem

In this paper, we construct and analyse a mortar finite volume method for the discretization for the biharmonic problem in R2. This method is based on the mortar-type Adini nonconforming finite element spaces. The optimal order H2-seminorm error estimate between the exact solution and the mortar Adini finite volume solution of the biharmonic equation is established.     

Guaranteed lower eigenvalue bounds for the biharmonic equation

The computation of lower eigenvalue bounds for the biharmonic operator in the buckling of plates is vital for the safety assessment in structural mechanics and highly on demand for the separation of eigenvalues for the plate’s vibrations. This paper shows that the eigenvalue provided by the nonconforming Morley finite element analysis, which is perhaps a lower eigenvalue bound for the biharmonic eigenvalue in the asymptotic sense, is not always a lower bound. A fully-explicit error analysis of the Morley interpolation operator with all the multiplicative constants enables a computable guaranteed lower eigenvalue bound. This paper provides numerical computations of those lower eigenvalue bounds and studies applications for the vibration and the stability of a biharmonic plate with different lower-order terms.     

The FFTRR-based fast direct algorithms for complex inhomogeneous biharmonic problems with applications to incompressible flows

We develop analysis-based fast and accurate direct algorithms for several biharmonic problems in a unit disk derived directly from the Green’s functions of these problems and compare the numerical results with the “decomposition” algorithms (see Ghosh and Daripa, IMA J. Numer. Anal. 36(2), 824–850 [17]) in which the biharmonic problems are first decomposed into lower order problems, most often either into two Poisson problems or into two Poisson problems and a homogeneous biharmonic problem. One of the steps in the “decomposition algorithm” as discussed in Ghosh and Daripa (IMA J. Numer. Anal. 36(2), 824–850 [17]) for solving certain biharmonic problems uses the “direct algorithm” without which the problem can not be solved. Using classical Green’s function approach for these biharmonic problems, solutions of these problems are represented in terms of singular integrals in the complex z?plane (the physical plane) involving explicitly the boundary conditions. Analysis of these singular integrals using FFT and recursive relations (RR) in Fourier space leads to the development of these fast algorithms which are called FFTRR based algorithms. These algorithms do not need to do anything special to overcome coordinate singularity at the origin as often the case when solving these problems using finite difference methods in polar coordinates. These algorithms have some other desirable properties such as the ease of implementation and parallel in nature by construction. Moreover, these algorithms have O(logN) complexity per grid point where N ² is the total number of grid points and have very low constant behind this order estimate of the complexity. Performance of these algorithms is shown on several test problems. These algorithms are applied to solving viscous flow problems at low and moderate Reynolds numbers and numerical results are presented.     

Biharmonic extensions on trees without positive potentials

Let T be a tree rooted at e endowed with a nearest-neighbor transition probability that yields a recurrent random walk. We show that there exists a function K biharmonic off e whose Laplacian has potential theoretic importance and, in addition, has the following property: Any function f on T which is biharmonic outside a finite set has a representation, unique up to addition of a harmonic function, of the form f=βK+B+L, where β a constant, B is a biharmonic function on T, and L is a function, subject to certain normalization conditions, whose Laplacian is constant on all sectors sufficiently far from the root. We obtain a characterization of the functions biharmonic outside a finite set whose Laplacian has 0 flux similar to one that holds for a function biharmonic outside a compact set in Rn for n=2,3, and 4 proved by Bajunaid and Anandam. Moreover, we extend the definition of flux and, under certain restrictions on the tree, we characterize the functions biharmonic outside a finite set that have finite flux in this extended sense.     

Laguerre minimal surfaces,isotropic geometry and linear elasticity

Laguerre minimal (L-minimal) surfaces are the minimizers of the energy \(\int (H^2-K)/K d\!A\). They are a Laguerre geometric counterpart of Willmore surfaces, the minimizers of \(\int (H^2-K)d\!A\), which are known to be an entity of Möbius sphere geometry. The present paper provides a new and simple approach to L-minimal surfaces by showing that they appear as graphs of biharmonic functions in the isotropic model of Laguerre geometry. Therefore, L-minimal surfaces are equivalent to Airy stress surfaces of linear elasticity. In particular, there is a close relation between L-minimal surfaces of the spherical type, isotropic minimal surfaces (graphs of harmonic functions), and Euclidean minimal surfaces. This relation exhibits connections to geometrical optics. In this paper we also address and illustrate the computation of L-minimal surfaces via thin plate splines and numerical solutions of biharmonic equations. Finally, metric duality in isotropic space is used to derive an isotropic counterpart to L-minimal surfaces and certain Lie transforms of L-minimal surfaces in Euclidean space. The latter surfaces possess an optical interpretation as anticaustics of graph surfaces of biharmonic functions.     

Decoupled Mixed Element Methods for Fourth Order Elliptic Optimal Control Problems with Control Constraints

In this paper, we study the finite element methods for distributed optimal control problems governed by the biharmonic operator. Motivated from reducing the regularity of solution space, we use the decoupled mixed element method which was used to approximate the solution of biharmonic equation to solve the fourth order optimal control problems. Two finite element schemes, i.e., Lagrange conforming element combined with full control discretization and the nonconforming Crouzeix-Raviart element combined with variational control discretization, are used to discretize the decoupled optimal control system. The corresponding a priori error estimates are derived under appropriate norms which are then verified by extensive numerical experiments.     

A Decomposition Method for Some Biharmonic Problems

In this paper we consider two biharmonic problems [13] which will be conventionally indicated as "simply supported" and "clamped plate" problem. We construct a decomposition method [16], [19] related to the partition of the plate in two, or more, subdomains. We carry on the numerical treatment of the method first decoupling these fourth order problems into two second order problems, then discretizing these problems by mixed linear finite element and obtaining an algebraic system. Moreover, we present an iterative block algorithm for solving the foregoing system, which can be efficiently developed on parallel computers.In the end, we extend the method to the respective biharmonic variational inequalities [10].