Search NASA⌕ Search

SEARCH · Search NASA

Results for “finite element problems”

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 253 records · Page 14

Application of the Finite Element Method to Rotary Wing Aeroelasticity

A finite element method for the spatial discretization of the dynamic equations of equilibrium governing rotary-wing aeroelastic problems is presented. Formulation of the finite element equations is based on weighted Galerkin residuals. This Galerkin finite element method reduces algebraic manipulative labor significantly, when compared to the application of the global Galerkin method in similar problems. The coupled flap-lag aeroelastic stability boundaries of hingeless helicopter rotor blades in hover are calculated. The linearized dynamic equations are reduced to the standard eigenvalue problem from which the aeroelastic stability boundaries are obtained. The convergence properties of the Galerkin finite element method are studied numerically by refining the discretization process. Results indicate that four or five elements suffice to capture the dynamics of the blade with the same accuracy as the global Galerkin method.

Straub, F. K.↗

Finite element modelling of buried structures

In many structures the final stress states are dependent on the sequence of construction or the stress states at various stages of construction are of interest. Such problems can be analyzed using finite element programs that have the capability of adding (birthing) elements to simulate the progress of construction. However, the usual procedure of assembling elements may lead to numerical instabilities or stress states that are unrealistic. Both problems are demonstrated in the analysis of a structure using the program ADINA. A technique which combines application of a preload with element birthing to overcome these problems is described and illustrated.

Playdon, D. K.↗

Towards and FVE-FAC Method for Determining Thermocapillary Effects on Weld Pool Shape

Several practical materials processes, e.g., welding, float-zone purification, and Czochralski crystal growth, involve a pool of molten metal with a free surface, with strong temperature gradients along the surface. In some cases, the resulting thermocapillary flow is vigorous enough to convect heat toward the edges of the pool, increasing the driving force in a sort of positive feedback. In this work we examine this mechanism and its effect on the solid-liquid interface through a model problem: a half space of pure substance with concentrated axisymmetric surface heating, where surface tension is strong enough to keep the liquid free surface flat. The numerical method proposed for this problem utilizes a finite volume element (FVE) discretization in cylindrical coordinates. Because of the axisymmetric nature of the model problem, the control volumes used are torroidal prisms, formed by taking a polygonal cross-section in the (r, z) plane and sweeping it completely around the z-axis. Conservation of energy (in the solid), and conservation of energy, momentum, and mass (in the liquid) are enforced globally by integrating these quantities and enforcing conservation over each control volume. Judicious application of the Divergence Theorem and Stokes' Theorem, combined with a Crank-Nicolson time-stepping scheme leads to an implicit algebraic system to be solved at each time step. It is known that near the boundary of the pool, that is, near the solid-liquid interface, the full conduction-convection solution will require extremely fine length scales to resolve the physical behavior of the system. Furthermore, this boundary moves as a function of time. Accordingly, we develop the foundation of an adaptive refinement scheme based on the principles of Fast Adaptive Composite Grid methods (FAC). Implementation of the method and numerical results will appear in a later report.

Canright, David↗

An error analysis of least-squares finite element method of velocity-pressure-vorticity formulation for Stokes problem

A theoretical proof of the optimal rate of convergence for the least-squares method is developed for the Stokes problem based on the velocity-pressure-vorticity formula. The 2D Stokes problem is analyzed to define the product space and its inner product, and the a priori estimates are derived to give the finite-element approximation. The least-squares method is found to converge at the optimal rate for equal-order interpolation.

Chang, Ching L.↗

Development of non-linear finite element computer code

Recent work has shown that the use of separable symmetric functions of the principal stretches can adequately describe the response of certain propellant materials and, further, that a data reduction scheme gives a convenient way of obtaining the values of the functions from experimental data. Based on representation of the energy, a computational scheme was developed that allows finite element analysis of boundary value problems of arbitrary shape and loading. The computational procedure was implemental in a three-dimensional finite element code, TEXLESP-S, which is documented herein.

Becker, E. B.↗

Solution of geometrically nonlinear statics problems by the p-version of the finite element method

This project is concerned with the possibility of using computers for the simulation of structural systems with the same degree of reliability as full scale physical experiments. Reliable numerical simulation will make it possible to reduce the costs of engineering and improve the quality of engineering decisions based on computed information. An error of idealization is an error between the actual physical quantities on which engineering decisions are based (e.g., maximum principal stress, first natural frequency, etc.) and the same data corresponding to the exact solution of the mathematical model. An error of discretization is an error between the quantities of interest corresponding to the exact and approximate solutions of a mathematical model. A high degree of reliability can be achieved in numerical simulation only if both the errors of idealization and errors of discretization can be shown to be small.

Szabo, Barna A.↗

Finite element method for optimal guidance of an advanced launch vehicle

A temporal finite element based on a mixed form of Hamilton's weak principle is summarized for optimal control problems. The resulting weak Hamiltonian finite element method is extended to allow for discontinuities in the states and/or discontinuities in the system equations. An extension of the formulation to allow for control inequality constraints is also presented. The formulation does not require element quadrature, and it produces a sparse system of nonlinear algebraic equations. To evaluate its feasibility for real-time guidance applications, this approach is applied to the trajectory optimization of a four-state, two-stage model with inequality constraints for an advanced launch vehicle. Numerical results for this model are presented and compared to results from a multiple-shooting code. The results show the accuracy and computational efficiency of the finite element method.

Hodges, Dewey H.↗

BUCKY instruction manual, version 3.3

The computer program BUCKY is a p-version finite element package for the solution of structural problems. The current version of BUCKY solves the 2-D plane stress, 3-D plane stress plasticity, 3-D axisymmetric, Mindlin and Kirchoff plate bending, and buckling problems. The p-version of the finite element method is a highly accurate version of the traditional finite element method. Example cases are presented to show the accuracy and application of BUCKY.

Smith, James P.↗

On nonlinear finite element analysis in single-, multi- and parallel-processors

Numerical solution of nonlinear equilibrium problems of structures by means of Newton-Raphson type iterations is reviewed. Each step of the iteration is shown to correspond to the solution of a linear problem, therefore the feasibility of the finite element method for nonlinear analysis is established. Organization and flow of data for various types of digital computers, such as single-processor/single-level memory, single-processor/two-level-memory, vector-processor/two-level-memory, and parallel-processors, with and without sub-structuring (i.e. partitioning) are given. The effect of the relative costs of computation, memory and data transfer on substructuring is shown. The idea of assigning comparable size substructures to parallel processors is exploited. Under Cholesky type factorization schemes, the efficiency of parallel processing is shown to decrease due to the occasional shared data, just as that due to the shared facilities.

Utku, S.↗

A new structural analysis/synthesis capability - ACCESS

The creation of an efficient automated capability for minimum weight design of structures is reported. The ACCESS 1 computer program combines finite element analysis techniques and mathematical programming algorithms using an innovative collection of approximation concepts. Design variable linking, constraint deletion techniques and approximate analysis methods are used to generate a sequence of small explicit mathematical programming problems which retain the essential features of the design problem. Organization of the finite element analysis is carefully matched to the design optimization task. The efficiency of the ACCESS 1 program is demonstrated by giving results for several example problems.

Schmit, L. A.↗

A Special Purpose Architecture for Finite Element Analysis

The analysis of aerospace structures by the finite element method consumes considerable computer time. The cost of this resource and the designer's desire to have rapid feedback concerning such questions as the effect of a change in loading of the structure or in a parameter of some structural material led to the design of a special purpose parallel computing system for finite element analysis. As a special purpose computer, the architecture of this finite element computer is closely tied to computational aspects of the particular problem. Various aspects of an MIMD array of microprocessors are related to the requirements of the class of finite element analysis problems which it is intended to solve.

Jordan, H. F.↗

An adaptive characteristic Petrov-Galerkin finite element method for convection-dominated linear and nonlinear parabolic problems in one space variable

The present adaptive FEM technique for convection-dominated problems is based on a Petrov-Galerkin scheme for spatial approximation, whose typical time-step employs test functions chosen to yield an approximate solution coinciding with the exact solutions at the finite element grid nodes. The derivation of truly local a posteriori error estimates is made possible by this procedure, which is also shown to be a very effective solver by the numerical examples presented.

Demkowicz, L.↗

Optimization of a Solver for Computational Materials and Structures Problems on NVIDIA Volta and AMD Instinct GPUs

The Scalable Implementation of Finite Elements by NASA (ScIFEN) is a software package developed to solve complex computational materials and structures problems using the finite element method (FEM). In this paper, we describe optimization techniques to speed up the linear solver computation that occurs within the ScIFEN application. We consider GPUs from two different vendors, NVIDIA and AMD as our target platforms for optimization and highlight differences in performance and optimization techniques. The NVIDIA GPU Volta V100 is used in the Summit system deployed at Oak Ridge National Laboratory, and the new exascale system, Frontier, will be using AMD Radeon Instinct GPU. We evaluated the performance of various optimization techniques on test matrices, ranging in size from100K to 4M, that are representative of ScIFEN applications. The linear solver computation is memory-bound on both GPUs. Our experiments show that on the NVIDIA GPU we obtained up to79%of the theoretical peak bandwidth, while the AMD GPU achieved 59%. Overall, the NVIDIA V100 GPU outperforms the AMD MI 25 GPU1. We observed an overall speedup of up to37X on an NVIDIA V100 compared to an Intel Skylake 12-coremachine. The solver for a 4M degree of freedom system took under 2.5 seconds.

Mohammad Zubair↗

Surface cracks in a plate of finite width under extension or bending

In this paper the problem of a finite plate containing collinear surface cracks is considered. The problem is solved by using the line spring model with plane elasticity and Reissner's plate theory. The main purpose of the study is to investigate the effect of interaction between two cracks or between cracks and stress-free plate boundaries on the stress intensity factors and to provide extensive numerical results which may be useful in applications. First, some sample results are obtained and are compared with the existing finite element results. Then the problem is solved for a single (internal) crack, two collinear cracks and two corner cracks for wide range of relative dimensions. Particularly in corner cracks the agreement with the finite element solution is surprisingly very good. The results are obtained for semielliptic and rectangular crack profiles which may, in practice, correspond to two limiting cases of the actual profile of a subcritically growing surface crack.

Erdogan, F.↗

Stability, accuracy, and efficiency of some underintegrated methods in finite element computations

In an attempt to increase computational efficiency in the numerical solution of highly nonlinear problems in solid and fluid mechanics, underintegrated finite element methods have been employed by many analysts. Underintegration refers to the use of a rule of an order lower than that required to integrate polynomial integrands exactly. The main drawback of this technique is related to the production of rank-deficient stiffness matrices, or equivalently an expanded kernel of the governing linear momentum operators. Such a development can introduce numerical instabilities. In order to overcome this difficulty, artificial stiffness or viscosity methods, or other stabilization methods have been proposed. One approach involves the elimination of spurious modes in a postprocessing operation. The present study is concerned with this a posteriori elimination method, taking into account the results which can be expected from it, and some of its possible extensions.

Jacquotte, O.-P.↗

Scalable Implementation of Finite Elements by NASA _ Implicit (ScIFEi)

Scalable Implementation of Finite Elements by NASA (ScIFEN) is a parallel finite element analysis code written in C++. ScIFEN is designed to provide scalable solutions to computational mechanics problems. It supports a variety of finite element types, nonlinear material models, and boundary conditions. This report provides an overview of ScIFEi (\Sci-Fi"), the implicit solid mechanics driver within ScIFEN. A description of ScIFEi's capabilities is provided, including an overview of the tools and features that accompany the software as well as a description of the input and output le formats. Results from several problems are included, demonstrating the efficiency and scalability of ScIFEi by comparing to finite element analysis using a commercial code.

Warner, James E.↗

Algebraic Multigrid by Smoothed Aggregation for Second and Fourth Order Elliptic Problems

Multigrid methods are very efficient iterative solvers for system of algebraic equations arising from finite element and finite difference discretization of elliptic boundary value problems. The main principle of multigrid methods is to complement the local exchange of information in point-wise iterative methods by a global one utilizing several related systems, called coarse levels, with a smaller number of variables. The coarse levels are often obtained as a hierarchy of discretizations with different characteristic meshsizes, but this requires that the discretization is controlled by the iterative method. To solve linear systems produced by existing finite element software, one needs to create an artificial hierarchy of coarse problems. The principal issue is then to obtain computational complexity and approximation properties similar to those for nested meshes, using only information in the matrix of the system and as little extra information as possible. Such algebraic multigrid method that uses the system matrix only was developed by Ruge. The prolongations were based on the matrix of the system by partial solution from given values at selected coarse points. The coarse grid points were selected so that each point would be interpolated to via so-called strong connections. Our approach is based on smoothed aggregation introduced recently by Vanek. First the set of nodes is decomposed into small mutually disjoint subsets. A tentative piecewise constant interpolation (in the discrete sense) is then defined on those subsets as piecewise constant for second order problems, and piecewise linear for fourth order problems. The prolongation operator is then obtained by smoothing the output of the tentative prolongation and coarse level operators are defined variationally.

Vanek, Petr↗