The discrete plateau problem: Convergence results

We solve the problem of finding and justifying an optimal fully discrete finite element procedure for approximating minimal, including unstable, surfaces. In a previous paper we introduced the general framework and some preliminary estimates, developed the algorithm and give the numerical results. In this paper we prove the convergence estimate.

     

A third-order mixed finite-element method for the numerical solution of the biharmonic problem

This paper is devoted to the introduction of a mixed finite element for the solution of the biharmonic problem. We prove optimal rate of convergence for the element. The mixed approach allows the simultaneous approximation of both displacement and tensor of its second derivatives.     

On the numerical solution of the linear complementarity problem

The well-known linear complementarity problem with definite matrices is considered. It is proposed to solve it using a global optimization algorithm in which one of the basic stages is a special local search. The proposed global search algorithm is tested using a variety of randomly generated problems; a detailed analysis of the computational experiment is given.     

On the numerical solution of a boundary integral equation for the exterior Neumann problem on domains with corners

The authors propose a “modified” Nyström method to approximate the solution of a boundary integral equation connected with the exterior Neumann problem for Laplace's equation on planar domains with corners. They prove the convergence and the stability of the method and show some numerical tests.     

-estimate for the discrete Plateau Problem

In this paper we prove the convergence rates for a fully discrete finite element procedure for approximating minimal, possibly unstable, surfaces.

Originally this problem was studied by G. Dziuk and J. Hutchinson. First they provided convergence rates in the and norms for the boundary integral method. Subsequently they obtained the convergence estimates using a fully discrete finite element method. We use the latter framework for our investigation.

     

On the Vykhandu-Levin iterative method for numerical solution of nonlinear systems

An iterative method for the solution of systems of nonlinear equations initiated by Vykhandu and investigated by Levin is discussed. It is shown that there is a flaw in the proof of Levin that the method is third-order convergent. Moreover, it is proved that the correct order of the method is only two.     

On the numerical approach of the enthalpy method for the Stefan problem

In this article an error bound is derived for a piecewise linear finite element approximation of an enthalpy formulation of the Stefan problem; we have analyzed a semidiscrete Galerkin approximation and completely discrete scheme based on the backward Euler method and a linearized scheme is given and its convergence is also proved. A second‐order error estimates are derived for the Crank‐Nicolson Galerkin method. In the second part, a new class of finite difference schemes is proposed. Our approach is to introduce a new variable and transform the given equation into an equivalent system of equations. Then, we prove that the difference scheme is second order convergent. © 2004 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2004     

Numerical solution of singularly perturbed convection-diffusion problem using parameter uniform B-spline collocation method

This paper is concerned with a numerical scheme to solve a singularly perturbed convection-diffusion problem. The solution of this problem exhibits the boundary layer on the right-hand side of the domain due to the presence of singular perturbation parameter ε. The scheme involves B-spline collocation method and appropriate piecewise-uniform Shishkin mesh. Bounds are established for the derivative of the analytical solution. Moreover, the present method is boundary layer resolving as well as second-order uniformly convergent in the maximum norm. A comprehensive analysis has been given to prove the uniform convergence with respect to singular perturbation parameter. Several numerical examples are also given to demonstrate the efficiency of B-spline collocation method and to validate the theoretical aspects.     

Lower-dimensional linear complementarity problem approaches to the solution of a bi-obstacle problem

A globally convergent Broyden-like method for solving a bi-obstacle problem is proposed based on its equivalent lower-dimensional linear complementarity problem. A suitable line search technique is introduced here. The global and superlinear convergence of the method is verified under appropriate assumptions.     

A numerical solution of the elasticity problem of settled of the wronkler ground with variable coefficients

In this paper, we have given numerical solution of the elasticity problem of settled on the wronkler ground with variable coefficient. The approximation solution of boundary value problem which is pertinent to this has been converted to integral equations, and then by using the successive approximation methods, has been reached. In addition to this, the approximation solution of the problem was put into Padé series form. We applied these methods to an example which is the elasticity problem of unit length homogeny beam, which is a special form of boundary value problem. First we calculate the successive approximation of the given boundary value problem then transform it into Padé series form, which give an arbitrary order for solving differential equation numerically.     

Finiteness of the set of solutions of Plateau's problem for polygonal boundary curves

It is proved that for a simple, closed, extreme polygon  Γ⊂R³$\Gamma \subset {\mathbb{R}}^3$ every immersed, stable minimal surface spanning Γ is an isolated point of the set of all minimal surfaces spanning Γ   w.r.t. the C⁰$C^0$-topology. Since the subset of immersed, stable minimal surfaces spanning Γ is shown to be closed in the compact set of all minimal surfaces spanning Γ, this proves in particular that Γ can bound only finitely many immersed, stable minimal surfaces.     

The discrete Douglas problem: convergence results

We solve the problem of finding and justifying an optimal fullydiscrete finite-element procedure for approximating annulus-like,possibly unstable, minimal surfaces. In a previous paper weintroduced the general framework, obtained some preliminaryestimates, developed the ideas used for the algorithm, and gavenumerical results. In this paper we prove convergence estimates.     

Divergence-free finite elements for the numerical solution of a hydroelastic vibration problem

In this paper, we analyze a divergence-free finite element method to solve a fluid–structure interaction spectral problem in the three-dimensional case. The unknowns of the resulting formulation are the fluid and solid displacements and the fluid pressure on the interface separating both media. The resulting mixed eigenvalue problem is approximated by using appropriate basis of the divergence-free lowest order Raviart–Thomas elements for the fluid, piecewise linear elements for the solid and piecewise constant elements for the interface pressure. It is proved that eigenvalues and eigenfunctions are correctly approximated and some numerical results are reported in order to assess the performance of the method.     

On solution strategies to Saint-Venant problem

Different solution strategies to the relaxed Saint-Venant problem are presented and comparatively discussed from a mechanical and computational point of view. Three approaches are considered; namely, the displacement approach, the mixed approach, and the modified potential stress approach. The different solution strategies lead to the formulation of two-dimensional Neumann and Dirichlet boundary-value problems. Several solution strategies are discussed in general, namely, the series approach, the reformulation of the boundary-value problems for the Laplace's equations as integral boundary equations, and the finite-element approach. In particular, the signatures of the finite-element weak solutions—the computational costs, the convergence, the accuracy—are discussed considering elastic cylinders whose cross sections are represented by piece-wise smooth domains.     

Existence of a positive solution of a fourth-order boundary value problem

In this paper, the existence of a positive solution of the boundary value problem of the following fourth-order nonlinear differential equation:

is discussed.     

On a differential-algebraic problem

The method of quasilinearization is a procedure for obtaining approximate solutions of differential equations. In this paper, this technique is applied to a differential-algebraic problem. Under some natural assumptions, monotone sequences converge quadratically to a unique solution of our problem.     

The discrete Plateau Problem: Algorithm and numerics

We solve the problem of finding and justifying an optimal fully discrete finite element procedure for approximating minimal, including unstable, surfaces. In this paper we introduce the general framework and some preliminary estimates, develop the algorithm, and give the numerical results. In a subsequent paper we prove the convergence estimate. The algorithmic procedure is to find stationary points for the Dirichlet energy within the class of discrete harmonic maps from the discrete unit disc such that the boundary nodes are constrained to lie on a prescribed boundary curve. An integral normalisation condition is imposed, corresponding to the usual three point condition. Optimal convergence results are demonstrated numerically and theoretically for nondegenerate minimal surfaces, and the necessity for nondegeneracy is shown numerically.

     

A numerical solution of the constrained weighted energy problem

A numerical algorithm is presented to solve the constrained weighted energy problem from potential theory. As one of the possible applications of this algorithm, we study the convergence properties of the rational Lanczos iteration method for the symmetric eigenvalue problem. The constrained weighted energy problem characterizes the region containing those eigenvalues that are well approximated by the Ritz values. The region depends on the distribution of the eigenvalues, on the distribution of the poles, and on the ratio between the size of the matrix and the number of iterations. Our algorithm gives the possibility of finding the boundary of this region in an effective way.We give numerical examples for different distributions of poles and eigenvalues and compare the results of our algorithm with the convergence behavior of the explicitly performed rational Lanczos algorithm.