Search NASA⌕ Search

SEARCH · Search NASA

Results for “conforming virtual element”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2019

The conforming virtual element method for polyharmonic problems

Here, we exploit the capability of virtual element methods in accommodating approximation spaces featuring high-order continuity to numerically approximate differential problems of the form $(–Δ)^pu = f , p ≥ 1$. More specifically, we develop and analyze the conforming virtual element method for the numerical approximation of polyharmonic boundary value problems, and prove an abstract result that states the convergence of the method in suitable norms.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Design and convergence analysis of the conforming virtual element method for polyharmonic problems

In the recent years, there has been a tremendous interest to numerical methods that approximate partial differential equations (PDEs) on computational meshes with arbitrarily-shaped polygonal/polyhedral (polytopal, for short) elements. A nonexhaustive list of such methods include the Mimetic Finite Difference method [4, 9, 21, 24, 28, 33, 35, 62, 64–67], the Polygonal Finite Element Method [68, 73, 74], the polygonal Discontinuous Galerkin Finite Element Methods [5, 7, 8, 10, 13–15, 18, 36, 38, 39, 41, 50], the Hybridizable Discontinuous Galerkin and Hybrid High-Order Methods [46–48, 51], the Gradient Discretization method [49, 53, 54], the Finite Volume Method [52], and the BEM-based FEM [71]. An alternative approach that also proved to be very successful is provided by the Virtual Element method (VEM), which was originally proposed in [19] for the numerical treatment of second-order elliptic problems [43, 44], and readily extended to linear and nonlinear elasticity [22, 25, 56], plate bending problems [37], Cahn-Hilliard equation [3], Stokes equations [2], Laplace-Beltrami equation [55], Darcy-Brinkam equation [76], discrete topology optimization problems [6], fracture networks problems [29], eigenvalue problems [59, 75]. The mixed virtual element formulation was proposed in [20, 34]; the nonconforming Virtual element formulations was proposed for second-order elliptic problems in [16], and later extended to general advection-reaction-diffusion problems, Stokes equation, the biharmonic problems, the iegenvalue problem, and the Schrodinger equation in [11, 30, 42, 45, 58, 80]. The p- and hp-version of the VEM were developed in [26, 27] and efficient multigrid methods for the resulting linear system of equations in [12]. A posteriori error estimates can be found in [40].

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Arbitrary Order Virtual Element Methods for High‐Order Phase‐Field Modeling of Dynamic Fracture

ABSTRACT Accurate modeling of fracture nucleation and propagation in brittle and ductile materials subjected to dynamic loading is important in predicting material damage and failure under extreme conditions. Phase‐field fracture models have garnered a lot of attention in recent years due to their success in representing damage and fracture processes in a wide class of materials and under a variety of loading conditions. Second‐order phase‐field fracture models are by far the most popular among researchers (and increasingly, among practitioners), but fourth‐order models have started to gain broader acceptance since their more recent introduction. The exact solution corresponding to these high‐order phase‐field fracture models has higher regularity. Thus, numerical solutions of the model equations can achieve improved accuracy and higher spatial convergence rates. In this work, we develop a virtual element framework for the high‐order phase‐field model of dynamic fracture. The virtual element method (VEM) can be regarded as a generalization of the classical finite element method. In addition to many other desirable characteristics, the VEM allows computing on polytopal meshes. Here, we use ‐conforming virtual elements and the generalized‐ time integration method for the momentum balance equation, and adopt ‐conforming virtual elements for the high‐order phase‐field equation. We verify our virtual element framework using classical quasi‐static benchmark problems and demonstrate its capabilities with the aid of numerical simulations of dynamic fracture in brittle materials.

42 ENGINEERING↗
DOE OSTI2024

The eXtended virtual element method for elliptic problems with weakly singular solutions

This paper introduces a novel eXtended virtual element method, an extension of the conforming virtual element method. The X-VEM is formulated by incorporating appropriate enrichment functions in the local spaces. The method is designed to handle highly generic enrichment functions, including singularities arising from fractured domains. By achieving consistency on the enrichment space, the method is proven to achieve arbitrary approximation orders even in the presence of singular solutions. The paper includes a complete convergence analysis under general assumptions on mesh regularity, and numerical experiments validating the method’s accuracy on various mesh families, demonstrating optimal convergence rates in the L 2 - and H 1 - norms on fractured or L-shaped domains.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

The virtual element method for eigenvalue problems with potential terms on polytopic meshes

In this work, we extend the conforming virtual element method (VEM) to the numerical resolution of eigenvalue problems with potential terms on a polytopic mesh. An important application is that of the Schrödinger equation with a pseudopotential term. This model is a fundamental element in the numerical resolution of more complex problems from the Density Functional Theory. The VEM is based on the construction of the discrete bilinear forms of the variational formulation through certain polynomial projection operators that are directly computable from the degrees of freedom. The method shows a great flexibility with respect to the meshes and provides a correct spectral approximation with optimal convergence rates. This point is discussed from both the theoretical and the numerical viewpoint. The performance of the method is numerically investigated by solving the quantum harmonic oscillator problem with the harmonic potential and a singular eigenvalue problem with zero potential for the first eigenvalues.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

The virtual element method for linear elastodynamics models: Design, analysis, and implementation

We design the conforming virtual element method for the numerical simulation of two dimensional time-dependent elastodynamics problems. We investigate the performance of the method both theoretically and numerically. We prove the stability and the convergence of the semi-discrete approximation in the energy norm and derive optimal error estimates. We also show the convergence in the L 2 norm. The performance of the virtual element method is assessed on a set of different computational meshes, including non-convex cells up to order four in the h-refinement setting. Exponential convergence is also experimentally seen in the p-refinement setting.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

The arbitrary‐order virtual element method for linear elastodynamics models: convergence, stability and dispersion‐dissipation analysis

Abstract We design the conforming virtual element method for the numerical approximation of the two‐dimensional elastodynamics problem. We prove stability and convergence of the semidiscrete approximation and derive optimal error estimates under h ‐ and p ‐refinement in both the energy and the L 2 norms. The performance of the proposed virtual element method is assessed on a set of different computational meshes, including nonconvex cells up to order four in the h ‐refinement setting. Exponential convergence is also experimentally observed under p ‐refinement. Finally, we present a dispersion‐dissipation analysis for both the semidiscrete and fully discrete schemes, showing that polygonal meshes behave as classical simplicial/quadrilateral grids in terms of dispersion‐dissipation properties.

Antonietti, Paola F.↗
DOE OSTI2020

The arbitrary-order virtual element method for linear elastodynamics models. Convergence, stability and dispersion-dissipation analysis.

We design the conforming virtual element method for the numerical approximation of the two dimensional elastodynamics problem. We prove stability and convergence of the semi-discrete approximation and derive optimal error estimates under $\textit{h}$-refinement in both the energy and the $L^2$ norms, and optimal error estimates under $\textit{p}$-refinement in the energy norm. The performance of the proposed virtual element method is assessed on a set of different computational meshes, including non-convex cells up to order four in the h-refinement setting. Exponential convergence is also experimentally observed under p-refinement. Finally, we present a dispersion-dissipation analysis for both the semi-discrete and fully-discrete schemes, showing that polygonal meshes behave as classical simplicial/quadrilateral grids in terms of dispersion-dissipation properties.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

A guide to the design of the virtual element methods for second- and fourth-order partial differential equations

Here we discuss the design and implementation details of two conforming virtual element methods for the numerical approximation of two partial differential equations that emerge in phase-field modeling of fracture propagation in elastic material. The two partial differential equations are: (i) a linear hyperbolic equation describing the momentum balance and (ii) a fourth-order elliptic equation modeling the damage of the material. Inspired by, we develop a new conforming VEM for the discretization of the two equations, which is implementation-friendly, i.e., different terms can be implemented by exploiting a single projection operator. We use C 0 and C 1 virtual elements for the second-and fourth-order partial differential equation, respectively. For both equations, we review the formulation of the virtual element approximation and discuss the details pertaining the implementation.

42 ENGINEERING↗
DOE OSTI2019

The nonconforming Virtual Element Method for eigenvalue problems

In this work, we analyse the nonconforming Virtual Element Method (VEM) for the approximation of elliptic eigenvalue problems. The nonconforming VEM allows to treat in the same formulation the two- and three-dimensional case. We present two possible formulations of the discrete problem, derived respectively by the nonstabilized and stabilized approximation of the $L^2$-inner product, and we study the convergence properties of the corresponding discrete eigenvalue problem. The proposed schemes provide a correct approximation of the spectrum, in particular we prove optimal-order error estimates for the eigenfunctions and the usual double order of convergence of the eigenvalues. Finally we show a large set of numerical tests supporting the theoretical results, including a comparison with the conforming Virtual Element choice.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

A $C^1$-Conforming Arbitrary-Order Two-Dimensional Virtual Element Method for the Fourth-Order Phase-Field Equation

We present a two-dimensional conforming virtual element method for the fourth-order phase-field equation. Our proposed numerical approach to the solution of this high-order phase-field (HOPF) equation relies on the design of an arbitrary-order accurate, virtual element space with $C^1$ global regularity. Such regularity is guaranteed by taking the values of the virtual element functions and their full gradient at the mesh vertices as degrees of freedom. Attaining high-order accuracy requires also edge polynomial moments of the trace of the virtual element functions and their normal derivatives. In this work, we detail the scheme construction, and prove its convergence by deriving error estimates in different norms. A set of representative test cases allows us to assess the behavior of the method.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

A virtual element generalization on polygonal meshes of the Scott-Vogelius finite element method for the 2-D Stokes problem

The virtual element method (VEM) is a Galerkin approximation method that extends the finite element method to polytopal meshes. In this paper, we present a conforming formulation that generalizes the Scott-Vogelius finite element method (FEM) for the numerical approximation of the Stokes problem to polygonal meshes in the framework of the virtual element method. In particular, we consider a straightforward application of the virtual element approximation space for scalar elliptic problems to the vector case and approximate the pressure variable through discontinuous polynomials. We assess the effectiveness of the numerical approximation by investigating the convergence on a manufactured solution problem and a set of representative polygonal meshes. We numerically show that this formulation is convergent with optimal convergence rates except for the lowest-order case on triangular and square meshes where the method coincides with the P 1 - P 0 Scott-Vogelius scheme, which is well-known to be unstable.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

A virtual element generalization on polygonal meshes of the Scott-Vogelius finite element method for the 2-D Stokes problem

The Virtual Element Method (VEM) is a Galerkin approximation method that extends the Finite Element Method (FEM) to polytopal meshes. In this paper, we present a conforming formulation that generalizes the Scott-Vogelius finite element method for the numerical approximation of the Stokes problem to polygonal meshes in the framework of the virtual element method. In particular, we consider a straightforward application of the virtual element approximation space for scalar elliptic problems to the vector case and approximate the pressure variable through discontinuous polynomials. We assess the effectiveness of the numerical approximation by investigating the convergence on a manufactured solution problem and a set of representative polygonal meshes. Finally, we numerically show that this formulation is convergent with optimal convergence rates except for the lowest-order case on triangular meshes, where the method coincides with the $\mathbb{P}_1$ – $\mathbb{P}_0$ Scott-Vogelius scheme, and on square meshes, which are situations that are well-known to be unstable.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Determination of the mutual orientation between proton CSA tensors mediated through band-selective 1 H– 1 H recoupling under fast MAS

We report the mutual orientation of nuclear spin interaction tensors provides critical information on the conformation and arrangement of molecules in chemicals, materials, and biological systems at an atomic level. Proton is a ubiquitous and important element in a variety of substances, and its NMR is highly sensitive due to their virtually 100% natural abundance and large gyromagnetic ratio. Nevertheless, the measurement of mutual orientation between the 1 H CSA tensors has remained largely untouched in the past due to strong 1 H– 1 H homonuclear interactions in a dense network of protons. In this study, we have developed a proton-detected 3D 1 H CSA/ 1 H CSA/ 1 H CS correlation method that utilizes three techniques to manage homonuclear interactions, namely fast magic-angle spinning, windowless C-symmetry-based CSA recoupling (windowless-ROCSA), and a band-selective 1 H– 1 H polarization transfer. The asymmetric 1 H CSA/ 1 H CSA correlated powder patterns produced by the C-symmetry-based methods are highly sensitive to the sign and asymmetry parameter of the 1 H CSA, and the Euler angle β as compared to the symmetric pattern obtained by the existing γ-encoded R-symmetry-based CSA/CSA correlation methods and allows a larger spectral area for data fitting. These features are beneficial for determining the mutual orientation between the nuclear spin interaction tensors with improved accuracy.

1H CSA↗
NASA NTRSDate not supplied

Improved Benchmarking of Cohesive Elements in Abaqus Standard for Predicting Disbond and Delamination in Composite Structures

Traditional approaches for aircraft certification require the assumption of an initial flaw condition, either represented as barely visible impact damage (BVID) or through inclusion of a Teflon insert to serve as surrogate damage. Based on the initial composite damage state, the structure must be shown to demonstrate structural durability and damage tolerance (DaDT) according to the following criteria: a. Damage displays no detrimental growth under cyclic loading b. The structure is able to sustain design limit load (DLL) Currently, the only available manner for validating structural performance is through test. Since damage can occur over a wide variety of areas within a structure, this approach has proven to be increasingly expensive and time consuming for composite airframes and acreage structure within the design-test-certification building block. A further complicating factor is the requirement to accurately capture the most critical damage morphologies as a starting condition. To understand the severity of the damage, it is either required to experimentally determine the most critical areas at tremendous expense or rely on legacy data of similar structural testing, which limits design space expansion. A preferred solution is to use advanced analysis to provide improved understanding of load margins for critical locations based on a wide variety of potential starting damage conditions. The standard industry approach for DaDT certification adheres to the use of the traditional virtual crack closure technique (VCCT) method. VCCT is generally a preferred method because it conforms to the current certification principles of damage from a known flaw, and when used correctly, can be effective at predicting delamination propagation under static and cyclic loading. The VCCT method requires the inclusion of an initial flaw in the finite element (FE) model requiring a-priori knowledge of the flaw location. This in turn requires a plethora of analysis cases to be examined to cover a reasonable span of potential damage states. Additionally, the VCCT approach requires node-to-node connectivity rendering it incompatible with the best practices and approaches for using continuum damage mechanics (CDM) based progressive damage and failure analysis (PDFA) tools within a typical FE solver. Alternatives to VCCT have emerged in the form of cohesive elements which utilize the cohesive zone model (CZM). Unlike VCCT which models linear elastic fracture mechanics, cohesive elements couples continuum and fracture based responses through the use of bilinear traction separation laws. These laws are defined based on a penalty stiffness, a cohesive strength, and a strain energy release rate. The approach can be mesh regularized with native cohesive elements within many FE solvers such as Abaqus and LS-DYNA. In Phase I of the NASA Advanced Composites Consortium (ACC) post-buckled stiffened panel with BVID, Strength and Life [1], the performance of cohesive elements were benchmarked in comparison to VCCT and LEFM solutions and showed good agreement using Abaqus explicit [2]. To realize savings on current and future programs, it is still necessary to close technical gaps related to the use of cohesive elements with Abaqus Standard. Within a program environment, standard finite element analysis is the preferred analytical capability for quasi-static loading as it eliminates uncertainty due to oscillatory behavior commonly seen with explicit analysis. This oscillatory behavior creates difficulties in writing margins of safety based on the analysis. The use of negative tangent stiffness material models complicates convergence which typically requires the use of numerical controls such as viscous damping to overcome. To date, there has not been a comprehensive study on how to establish best practices for cohesive element convergence for predictive capability within the Abaqus implicit solver. In pursuit of these goals, under the NASA ACC program, several numerical benchmark problems were proposed including pure mode I (double cantilevered beam – DCB), pure mode II (end notch flexure – ENF), and symmetric/unsymmetric evolving mixed mode (single leg bend – SLB). This paper focuses on the use of cohesive elements to model the delamination through the use of CZM. Specifically, finite element models for the DCB, ENF, symmetric SLB, and unsymmetric SLB, are developed and various solution controls for convergence are studied to develop a best practice. Once the best practice has been developed, the predictive capability of the objective CZM model is used to analyze the hat pull-off strength of a standard hat stiffened configuration under various loading conditions.

Abaqus↗
NASA NTRS1990

Highly parallel sparse Cholesky factorization

Several fine grained parallel algorithms were developed and compared to compute the Cholesky factorization of a sparse matrix. The experimental implementations are on the Connection Machine, a distributed memory SIMD machine whose programming model conceptually supplies one processor per data element. In contrast to special purpose algorithms in which the matrix structure conforms to the connection structure of the machine, the focus is on matrices with arbitrary sparsity structure. The most promising algorithm is one whose inner loop performs several dense factorizations simultaneously on a 2-D grid of processors. Virtually any massively parallel dense factorization algorithm can be used as the key subroutine. The sparse code attains execution rates comparable to those of the dense subroutine. Although at present architectural limitations prevent the dense factorization from realizing its potential efficiency, it is concluded that a regular data parallel architecture can be used efficiently to solve arbitrarily structured sparse problems. A performance model is also presented and it is used to analyze the algorithms.

Gilbert, John R.↗