Highly accurate numerical computation of implicitly defined volumes using the Laplace-Beltrami operator

This paper introduces a novel method for the efficient and accurate computation of the volume of a domain whose boundary is given by an orientable hypersurface which is implicitly given as the iso-contour of a sufficiently smooth level-set function. After spatial discretization, local approximation of the hypersurface and application of the Gaussian divergence theorem, the volume integrals are transformed to surface integrals. Application of the surface divergence theorem allows for a further reduction to line integrals which are advantageous for numerical quadrature. We discuss the theoretical foundations and provide details of the numerical algorithm. Finally, we present numerical results for convex and non-convex hypersurfaces embedded in cuboidal domains, showing both high accuracy and thrid- to fourth-order convergence in space.Comment: 25 pages, 17 figures, 3 table

An elegant operational matrix based on harmonic numbers: Effective solutions for linear and nonlinear fourth-order two point boundary value problems

This paper analyzes the solution of fourth-order linear and nonlinear two point boundary value problems. The suggested method is quite innovative and it is completely different from all previous methods used for solving such kind of boundary value problems. The method is based on employing an elegant operational matrix of derivatives expressed in terms of the well-known harmonic numbers. Two algorithms are presented and implemented for obtaining new approximate solutions of linear and nonlinear fourth-order boundary value problems. The two algorithms rely on employing the new introduced operational matrix for reducing the differential equations with their boundary conditions to systems of linear or nonlinear algebraic equations which can be efficiently solved by suitable solvers. For this purpose, the two spectral methods namely, Petrov-Galerkin and collocation methods are applied. Some illustrative examples are considered aiming to ascertain the wide applicability, validity, and efficiency of the two proposed algorithms. The obtained numerical results are satisfactory and the approximate solutions are very close to the analytical solutions and they are more accurate than those obtained by some other existing techniques in literature

Meshless Local Petrov-Galerkin (MLPG) Method with Orthogonal Polynomials for Euler-Bernoulli Beam Problems

In this paper, the feasibility of orthogonal polynomials in the meshless local Petrov Galerkin method (MLPG) method is studied. The orthogonal polynomials, Chebyshev and Legendre polynomials, are used in this MLPG method as trial functions. The test functions used were power functions with smooth derivatives at their ends. The performance of these methods is studied by applying these methods to Euler-Bernoulli beam problems. The MLPG-Galerkin and Legendre methods passed all the patch tests for simple beam problems. Next the formulations are tested on complex beam problems such as beams with partial loadings and continuous beam problems. Problems with load discontinuities and additional supports require special attention. Near discontinuities, judicious choice of number of nodes and nodal placements are needed to obtain accurate deflections, slopes, moments and shear forces. As polynomial functions are used, the large number of nodes can create a transformation matrix that is ill-conditioned, resulting in problems with the inversion of the matrix. The conditioning worsens as the number of nodes are increased beyond 20. Quadruple precision was needed for models to obtain accurate solutions. Even with quadruple precision the accuracy of the method suffers as the number of nodes is increased beyond 20. This appears to be a drawback of the MLPG-Chebyshev and MLPG-Legendre methods