258 research outputs found

    Fast Isogeometric Boundary Element Method based on Independent Field Approximation

    Full text link
    An isogeometric boundary element method for problems in elasticity is presented, which is based on an independent approximation for the geometry, traction and displacement field. This enables a flexible choice of refinement strategies, permits an efficient evaluation of geometry related information, a mixed collocation scheme which deals with discontinuous tractions along non-smooth boundaries and a significant reduction of the right hand side of the system of equations for common boundary conditions. All these benefits are achieved without any loss of accuracy compared to conventional isogeometric formulations. The system matrices are approximated by means of hierarchical matrices to reduce the computational complexity for large scale analysis. For the required geometrical bisection of the domain, a strategy for the evaluation of bounding boxes containing the supports of NURBS basis functions is presented. The versatility and accuracy of the proposed methodology is demonstrated by convergence studies showing optimal rates and real world examples in two and three dimensions.Comment: 32 pages, 27 figure

    Blending isogeometric analysis and local maximum entropy meshfree approximants

    Get PDF
    We present a method to blend local maximum entropy (LME) meshfree approximants and isogeometric analysis. The coupling strategy exploits the optimization program behind LME approximation, treats isogeometric and LME basis functions on an equal footing in the reproducibility constraints, but views the former as data in the constrained minimization. The resulting scheme exploits the best features and overcomes the main drawbacks of each of these approximants. Indeed, it preserves the high fidelity boundary representation (exact CAD geometry) of isogeometric analysis, out of reach for bare meshfree methods, and easily handles volume discretization and unstructured grids with possibly local refinement, while maintaining the smoothness and non-negativity of the basis functions. We implement the method with B-Splines in two dimensions, but the procedure carries over to higher spatial dimensions or to other non-negative approximants such as NURBS or subdivision schemes. The performance of the method is illustrated with the heat equation, and linear and nonlinear elasticity. The ability of the proposed method to impose directly essential boundary conditions in non-convex domains, and to deal with unstructured grids and local refinement in domains of complex geometry and topology is highlighted by the numerical examples

    X-FEM in isogeometric analysis for linear fracture mechanics

    Get PDF
    The extended finite element method (X-FEM) has proven to be an accurate, robust method for solving problems in fracture mechanics. X-FEM has typically been used with elements using linear basis functions, although some work has been performed using quadratics. In the current work, the X-FEM formulation is incorporated into isogeometric analysis to obtain solutions with higher order convergence rates for problems in linear fracture mechanics. In comparison with X-FEM with conventional finite elements of equal degree, the NURBS-based isogeometric analysis gives equal asymptotic convergence rates and equal accuracy with fewer degrees of freedom (DOF). Results for linear through quartic NURBS basis functions are presented for a multiplicity of one or a multiplicity equal the degree

    Wind field simulation with isogeometric analysis

    Get PDF
    [EN]For wind field simulation with isogeometric analysis, firstly it is necessary to generate a spline parameterization of the computational domain, which is an air layer above the terrain surface. This parameterization is created with the meccano method from a digital terrain model. The main steps of the meccano method for tetrahedral mesh generation were introduced in [1, 2]. Based on the volume parameterization obtained by the method, we can generate a mapping from the parametric T-mesh to the physical space [3, 4]. Then, this volumetric parameterization is used to generate a cubic spline representation of the physical domain for the application of isogeometric analysis. We consider a mass-consistent model [5] to compute the wind field simulation in the three-dimensional domain from wind measurements or a wind forecasted by a meteorological model (for example, WRF or HARMONIE). From these data, an interpolated wind field is constructed. The mass-consistent model obtains a new wind field approaching the interpolated one, but verifying the continuity equation (mass conservation) for constant density and the impermeabilitycondition on the terrain. This adjusting problem is solved by introducing a Lagrange multiplier, that is the solution of a Poisson problem. The resulting field is obtained from the interpolated one and the gradient of the Lagrange multiplier. It is well known that if we use classical Lagrange finite elements, the gradient of the numerical solution is discontinuous over the element boundary. The advantage of using isogeometric analysis with cubic polynomial basis functions [6, 7] is that we obtain a C2 continuity for the Lagrange multiplier in the whole domain. In consequence, the resulting wind field is better approximated. Applications of the proposed technique are presented.Ministerio de Economía y Competitividad del Gobierno de España; Fondos FEDER; CONACYT-SENE

    Efficient quadrature rules for subdivision surfaces in isogeometric analysis

    Get PDF
    We introduce a new approach to numerical quadrature on geometries defined by subdivision surfaces based on quad meshes in the context of isogeometric analysis. Starting with a sparse control mesh, the subdivision process generates a sequence of finer and finer quad meshes that in the limit defines a smooth subdivision surface, which can be of any manifold topology. Traditional approaches to quadrature on such surfaces rely on per-quad integration, which is inefficient and typically also inaccurate near vertices where other than four quads meet. Instead, we explore the space of possible groupings of quads and identify the optimal macro-quads in terms of the number of quadrature points needed. We show that macro-quads consisting of quads from one or several consecutive levels of subdivision considerably reduce the cost of numerical integration. Our rules possess a tensor product structure and the underlying univariate rules are Gaussian, i.e., they require the minimum possible number of integration points in both univariate directions. The optimal quad groupings differ depending on the particular application. For instance, computing surface areas, volumes, or solving the Laplace problem lead to different spline spaces with specific structures in terms of degree and continuity. We show that in most cases the optimal groupings are quad-strips consisting of (1Ă—n)(1\times n) quads, while in some cases a special macro-quad spanning more than one subdivision level offers the most economical integration. Additionally, we extend existing results on exact integration of subdivision splines. This allows us to validate our approach by computing surface areas and volumes with known exact values. We demonstrate on several examples that our quadratures use fewer quadrature points than traditional quadratures. We illustrate our approach to subdivision spline quadrature on the well-known Catmull-Clark scheme based on bicubic splines, but our ideas apply also to subdivision schemes of arbitrary bidegree, including non-uniform and hierarchical variants. Specifically, we address the problems of computing areas and volumes of Catmull-Clark subdivision surfaces, as well as solving the Laplace and Poisson PDEs defined over planar unstructured quadrilateral meshes in the context of isogeometric analysis
    • …
    corecore