Search results

The purpose of this paper is to propose a parallel partition of unity method (PPUM) to solve the nonstationary Navier-Stokes equations.

This paper opted for the nonstationary Navier-Stokes equations by using the finite element method and the partition of unity method.

This paper provides one efficient parallel algorithm which reaches the same accuracy as the standard Galerkin method but saves a lot of computational time.

In this paper, a PPUM is proposed for nonstationary Navier-Stokes. At each time step, the authors only need to solve a series of independent local sub-problems in parallel instead of one global problem.

The aim of the paper is to achieve textbook multigrid efficiency for some flow problems.

The steady incompressible Euler equations are decoupled into elliptic and hyperbolic subsystems. Numerous classical FAS‐MG algorithms are implemented and tested for convergence. A full multigrid algorithm that costs less than 10 work units (WUs) is sufficient to reduce the algebraic error below the discretization error. A new algorithm “NUVMGP” is introduced. A two‐step iterative procedure is adopted. First, given the pressure gradient, the convection equations are solved on the computational grid for the velocity components by performing one Gauss‐Seidel iteration ordered in the flow direction. second, a linear multigrid (MG) cycle for Poisson's equation is performed to update pressure values.

It is found that algorithm “NUVMGP‐FMG” requires less than 6 WU to attain the target solution. The convergence rates are independent on both the mesh size and the approximation order.

Lexicographic Gauss‐Seidel using downstream ordering is a good solver for the advection terms and provides excellent smoothing rates for relaxation. But it is complicated to maintain downstream ordering in case the flow directions change with location.

Although the scope of this work is limited to rectangular domains, finite difference schemes, and incompressible Euler equation, the same approaches can be extended for other flow problems. However, such relatively simple problems may provide deep understanding of the ideal convergence behavior of MG and accumulate experience to detect unacceptable performance and regain the optimal one.

A two‐grid iterative method for 3D linear elasticity problems, discretized using quadratic tetrahedral elements is proposed. The conjugate‐gradient method is used as smoother. As compared to the conjugate‐gradient alone, it is shown, via numerical examples, that the method is much more efficient on the basis of computing time and memory allocation. The convergence property of the method is sensitive to the regularity of the problem.

This paper is the description of a new two‐grid algorithm to solve frictional contact problems. A regularized formulation is introduced and the discretized problem is solved using an internal non linear two‐grid technique coupled with a diagonal fixed point algorithm. Mathematical background is given, and superconvergence is obtained.

Presents an implementation of the algebraic multigrid method. It can work in two ways: as pure multigrid method and as a pre‐conditioner for the conjugate gradient method. Shows applications of the iterative solvers for problems in linear and non‐linear elasticity. Shows the range of possible applications with different examples with regular and non‐regular meshes and three‐dimensional problems.

The focus of this paper is on the efficient numerical computation of 3D electromagnetic field problems by using the finite element (FE) and multigrid (MG) methods. The magnetic vector potential is used as the field variable and the discretization is performed by Lagrange (nodal) as well as Ne´de´lec (edge) finite elements. The resulting system of equations is solved by applying a preconditioned conjugate gradient (PCG) method with an adapted algebraic multigrid (AMG) as well as an appropriate geometric MG preconditioner.

The purpose of this paper is to introduce efficient methods for solving the 2D biharmonic equation with Dirichlet boundary conditions of second kind. This equation describes the deflection of loaded plate with boundary conditions of simply supported plate kind. Also it can be derived from the calculus of variations combined with the variational principle of minimum potential energy. Because of existing fourth derivatives in this equation, introducing high‐order accurate methods need to use artificial points. Also solving the resulted linear system of equations suffers from slow convergence when iterative methods are used. This paper aims to introduce efficient methods to overcome these problems.

The paper considers several compact finite difference approximations that are derived on a nine‐point compact stencil using the values of the solution and its second derivatives as the unknowns. In these approximations there is no need to define special formulas near the boundaries and boundary conditions can be incorporated with these techniques. Several iterative linear systems solvers such as Krylov subspace and multigrid methods and their combination (with suitable preconditioner) have been developed to compare the efficiency of each method and to design powerful solvers.

The paper finds that the combination of compact finite difference schemes with multigrid method and Krylov iteration methods preconditioned by multigrid have excellent results for the second biharmonic equation, and that Krylov iteration methods preconditioned by multigrid are the most efficient methods.

The paper is of value in presenting, via some tables and figures, some numerical experiments which resulted from applying new methods on several test problems, and making comparison with conventional methods.

This paper discusses the robustness of the algebraic multigrid (AMG) method as well as geometric multigrid (GMG) method against mesh distortion in edge‐based finite element analysis.

Analyzes a simple magnetostatic problem, in which the model consists of a cubic iron and the surrounding air region. Prepares three meshes which have same number of elements to evaluate the robustness of multigrid against the distortion of mesh.

The AMG method is shown to be more robust against mesh distortion than the GMG method.

Shows that the AMG is more robust than the GMG. This result is of practical interest to the researchers in this field.

This paper presents new trends in parallel methods used to solve finite element matrix systems: standard iterative and direct solving methods first, and then domain decomposition methods. For example, the current status and properties of two prevailing programming environments (PVM and MPI) are finally given and compared when implemented together with a finite element time domain formulation.

This study aims to capture the effective behavior of double-diffusion problem, which arises from the combined heat and mass transfer in porous medium and develop the modified characteristics finite element method.

The proposed finite element method deals with the nonlinear term temporal term by modified characteristics method. Then, the authors compute the velocity, pressure, temperature and concentration using the decoupled technique. Finally, to show the efficiency of the method, the authors give some numerical examples.

From the numerical results, one can see that the method has a good accuracy, which shows that the method can simulate this Darcy–Brinkman problem well.

The originality lies in the fact that the proposed scheme is the first time for solving the Darcy–Brinkman problem, which is a more complicated model, and includes the velocity, pressure, temperature and concentration.