Search

A concave finite element-boundary integral-multilevel fast multipole algorithm (FE-BI-MLFMA) is presented for scattering by a large body with nonuniform deep cavities. Different from the conventional FE-BI-MLFMA, the boundary integral equation in this concave FE-BI-MLFMA is established on a concave surface to reduce the region of the finite element method (FEM), which can significantly reduce the dispersion error from the FEM and improve the efficiency of FE-BI-MLFMA especially for nonuniform cavities. To eliminate the problem of slow convergence caused by concave surface, an efficient preconditioner based on the sparse approximate inverse (SAI) is constructed in this paper. Numerical performance of the constructed preconditioner based on the SAI is investigated in detail. Numerical experiments demonstrate the accuracy and efficiency of this SAI preconditioned concave FE-BI-MLFMA for nonuniform deep and large cavites. This SAI preconditioned concave FE-BI-MLFMA is parallelized to further improve its capability in this paper. An extremely big and deep nonuniform cavity has been calculated, demonstrating the great capability of this parallel concave FE-BI-MLFMA. [ABSTRACT FROM PUBLISHER]

In this paper, a two-level defect-correction Oseen iterative finite element method is presented for the stationary conduction–convection equations based on local Gauss integration. The method combines the defect-correction method, the two-level strategy, and the locally stabilized method. The stability and convergence of the proposed method are deduced. Finally, numerical examples verify the theoretical results of the proposed algorithm and show that it is highly efficient and reliable for the considered problem. [ABSTRACT FROM AUTHOR]

In this paper, a modified nonlinear Uzawa algorithm for solving symmetric saddle point problems is proposed, and also the convergence rate is analyzed. The results of numerical experiments are presented when we apply the algorithm to Stokes equations discretized by mixed finite elements. [ABSTRACT FROM AUTHOR]

This paper studies adaptive finite element methods (AFEMs), based on piecewise linear elements and newest vertex bisection, for solving second order elliptic equations with piecewise constant coefficients on a polygonal domain Ω⊂ℝ. The main contribution is to build algorithms that hold for a general right-hand side f∈ H( Ω). Prior work assumes almost exclusively that f∈ L( Ω). New data indicators based on local H norms are introduced, and then the AFEMs are based on a standard bulk chasing strategy (or Dörfler marking) combined with a procedure that adapts the mesh to reduce these new indicators. An analysis of our AFEM is given which establishes a contraction property and optimal convergence rates N with 0< s≤1/2. In contrast to previous work, it is shown that it is not necessary to assume a compatible decay s<1/2 of the data estimator, but rather that this is automatically guaranteed by the approximability assumptions on the solution by adaptive meshes, without further assumptions on f; the borderline case s=1/2 yields an additional factor log N. Computable surrogates for the data indicators are introduced and shown to also yield optimal convergence rates N with s≤1/2. [ABSTRACT FROM AUTHOR]

Abstract: In FEM simulations contact in conjunction with plastic material behaviour leads to highly nonlinear equations in the FEM algorithms. This causes problems in numerical convergence. FEM-software providers handle this problem by automatic contact damping or similar algorithms. In this paper a benchmark between four FEM-solvers is performed based on a model for ring compression tests. For all simulations identical physical as well as numerical influence parameters are used. The simulations have shown a significant divergence in the results depending on the used FEM-software. [Copyright &y& Elsevier]

This paper presents a finite-element dimension splitting algorithm (DSA) for a three-dimensional (3D) elliptic equation in a cubic domain. The main idea of DSA is that a 3D elliptic equation can be transformed into a series of two-dimensional (2D) elliptic equations in the X–Y plane along the Z-direction. The convergence speed of the DSA for a 3D elliptic equation depends mainly on the mesh scale of the Z-direction. P 2 finite-element discretization in the Z-direction for DSA is adopted to accelerate the convergence speed of DSA. The error estimates are given for DSA applying P 1 or P 2 finite-element discretization in the Z-direction. Finally, some numerical examples are presented. We apply the parallel solving technology to our numerical examples and obtain good parallel efficiency. These numerical experiments test and verify theoretical results. [ABSTRACT FROM PUBLISHER]

Abstract: In this paper, we analyze a FEM and two-grid FEM decoupling algorithms for elliptic problems on disjoint domains. First, we study the rate of convergence of the FEM and, in particular, we obtain a superconvergence result. Then with proposed algorithms, the solution of the multi-component domain problem (simple example — two disjoint rectangles) on a fine grid is reduced to the solution of the original problem on a much coarser grid together with solution of several problems (each on a single-component domain) on fine meshes. The advantage is the computational cost although the resulting solution still achieves asymptotically optimal accuracy. Numerical experiments demonstrate the efficiency of the algorithms. [Copyright &y& Elsevier]

The aim of this paper is to study a nonlinear stationary Stokes problem with mixed boundary conditions that describes the ice velocity and pressure fields of grounded glaciers under Glen's flow law. Using convex analysis arguments, we prove the existence and the uniqueness of a weak solution. A finite element method is applied with approximation spaces that satisfy the inf-sup condition, and a priori error estimates are established by using a quasinorm technique. Several algorithms including Newton's method are proposed to solve the nonlinearity of the Stokes problem and are proved to be convergent. Our results are supported by numerical convergence studies. [ABSTRACT FROM AUTHOR]

This paper presents a numerical method to simulate an incompressible fluid through an immersed porous interface. The interface is modeled by a surface measure term in the Navier-Stokes equations and it is characterized by a resistance parameter. This approach can be used, for example, to model valves or to simulate blood flood through an immersed stent. Starting from a monolithic formulation proposed recently, a fractional step algorithm is derived. The difficult point is that this formulation is singular when the resistance vanishes, which can be a serious issue in some applications. We show that an appropriate Nitsche treatment of the interface condition fixes this problem and ensures uniform energy stability in time for any nonnegative value of the resistance. The theoretical stability and convergence results are illustrated with numerical experiments. [ABSTRACT FROM AUTHOR]

Abstract: In this paper, we analyze the convergence and optimal complexity of the usual simple adaptive nonconforming finite element method by using Dörfler collective marking strategy. Based on several basic ingredients, such as the estimator reduction, quasi-orthogonality, local upper bound and so on, we eventually show the convergence of the adaptive algorithm by establishing the reduction of some total error and the quasi-optimal convergence rate. Our analysis does not need the relation between the nonconforming element and the mixed Raviart–Thomas element. The results of numerical experiments confirm that our adaptive algorithm is optimal. [Copyright &y& Elsevier]

Abstract: In this paper, we study the elliptic eigenvalue problem with the mixed boundary in a perforated domain. The higher-order asymptotic expansions of the eigenvalues and the eigenfunctions for the problem will be presented. We derive the rigorous justification of the convergence results. From this, a multiscale finite element method and some numerical examples are presented. [Copyright &y& Elsevier]

Within the framework of the finite element method, this paper presents new algorithms implementing implicit stress integration and consistent tangent matrix calculations for an elasto-plastic model with rotational hardening. The sub-stepping technique is used for both the numerical integration of the constitutive relations and determination of the consistent tangent matrix in order to overcome the convergence difficulty arising from the complexity of the elasto-plastic model with rotational hardening. The integration of the constitutive relations and the computation of the consistent tangent matrix are incorporated into a unique procedure. Numerical tests are carried out and discussed to demonstrate the global accuracy and stability of the presented algorithms. [ABSTRACT FROM AUTHOR]

We consider two-dimensional elliptic problems with discontinuous coefficients discretized by the finite element method on geometrically conforming nonmatching triangulations across the interface using the mortar technique. The resulting discrete problem is solved by a dual-primal FETI method. In this paper we introduce and analyze a preconditioner with a special scaling of coefficients and step parameters and establish convergence bounds. We show that the preconditioner is almost optimal with constants independent of the jumps of coefficients and step parameters. Extensive computational evidence is presented that illustrates an almost optimal convergence for a variety of situations (distribution of subregions, grid assignment, grid ratios, number of subregions) for both continuous and discontinuous problems. [ABSTRACT FROM AUTHOR]

In this paper, we attempt to give analysis of the covolume method for solving general self-adjoint elliptic problems. We first present some useful superconvergence results for the deviation between the solution of the covolume method and the solution of the induced finite element method, in the energy norm and maximum norm, respectively. With these results, we then reproduce the maximum norm estimates obtained by Chou and Li for the covolume method easily. Furthermore, based on the covolume method, we propose a high-accuracy algorithm for solving general self-adjoint elliptic problems. Compared with the original covolume method, the computation work of the new algorithm is increased slightly, but the approximate error is improved remarkably. Copyright © 2001 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]