SEARCH · Search NASA

Results for “Dirichlet domains”

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.

SourceResearch connectionFrom yearThrough year

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

At least 37 records · Page 2

All sources NASA NTRS DOE OSTI

NASA NTRS2002

Elliptic Grid Generation of Spiral-Bevel Pinion Gear Typical of OH-58 Helicopter Transmission

This paper discusses the source term treatment in the numerical solution of elliptic partial differential equations for an interior grid generation problem in generalized curvilinear coordinates. The geometry considered is that of a planar cross-section of a generic spiral-bevel gear tooth typical of a pinion in the OH-58 helicopter transmission. The source terms used are appropriate for an interior grid domain where all the boundaries are prescribed via a combination of Dirichlet and Neumann boundary conditions. New constraints based on the Green's Theorem are derived which uniquely determine the coefficients in the source terms. These constraints are designed for boundary clustered grids where gradients in physical quantities need to be resolved adequately. However, it is seen that the present formulation works satisfactorily for mild clustering also. Thus, a fully automated elliptic grid generation technique is made possible where there is no need for a parametric study of these parameters since the new relations fix these free parameters uniquely.

Kaul, Upender K.↗

NASA NTRS1989

An Eigenvalue Analysis of finite-difference approximations for hyperbolic IBVPs

The eigenvalue spectrum associated with a linear finite-difference approximation plays a crucial role in the stability analysis and in the actual computational performance of the discrete approximation. The eigenvalue spectrum associated with the Lax-Wendroff scheme applied to a model hyperbolic equation was investigated. For an initial-boundary-value problem (IBVP) on a finite domain, the eigenvalue or normal mode analysis is analytically intractable. A study of auxiliary problems (Dirichlet and quarter-plane) leads to asymptotic estimates of the eigenvalue spectrum and to an identification of individual modes as either benign or unstable. The asymptotic analysis establishes an intuitive as well as quantitative connection between the algebraic tests in the theory of Gustafsson, Kreiss, and Sundstrom and Lax-Richtmyer L(sub 2) stability on a finite domain.

Warming, Robert F.↗

NASA NTRS1990

An eigenvalue analysis of finite-difference approximations for hyperbolic IBVPs

Warming, Robert F.↗

DOE OSTI2025

Explicit block encodings of boundary value problems for many-body elliptic operators

Simulation of physical systems is one of the most promising use cases of future digital quantum computers. In this work we systematically analyze the quantum circuit complexities of block encoding the discretized elliptic operators that arise extensively in numerical simulations for partial differential equations, including high-dimensional instances for many-body simulations. When restricted to rectangular domains with separable boundary conditions, we provide explicit circuits to block encode the many-body Laplacian with separable periodic, Dirichlet, Neumann, and Robin boundary conditions, using standard discretization techniques from low-order finite difference methods. To obtain high-precision, we introduce a scheme based on periodic extensions to solve Dirichlet and Neumann boundary value problems using a high-order finite difference method, with only a constant increase in total circuit depth and subnormalization factor. We then present a scheme to implement block encodings of differential operators acting on more arbitrary domains, inspired by Cartesian immersed boundary methods. We then block encode the many-body convective operator, which describes interacting particles experiencing a force generated by a pair-wise potential given as an inverse power law of the interparticle distance. This work provides concrete recipes that are readily translated into quantum circuits, with depth logarithmic in the total Hilbert space dimension, that block encode operators arising broadly in applications involving the quantum simulation of quantum and classical many-body mechanics.

Kharazi, Tyler [University of California, Berkeley↗

DOE OSTI2025

Image-Driven Hybrid Structural Analysis Based on Continuum Point Cloud Method with Boundary Capturing Technique

Conventional approaches for the structural health monitoring of infrastructures often rely on physical sensors or targets attached to structural members, which require considerable preparation, maintenance, and operational effort, including continuous on-site adjustments. This paper presents an image-driven hybrid structural analysis technique that combines digital image processing (DIP) and regression analysis with a continuum point cloud method (CPCM) built on a particle-based strong formulation. Polynomial regressions capture the boundary shape change due to the structural loading and precisely identify the edge and corner coordinates of the deformed structure. The captured edge profiles are transformed into essential boundary conditions. This allows the construction of a strongly formulated boundary value problem (BVP), classified as the Dirichlet problem. Capturing boundary conditions from the digital image is novel, although a similar approach was applied to the point cloud data. It was shown that the CPCM is more efficient in this hybrid simulation framework than the weak-form-based numerical schemes. Unlike the finite element method (FEM), it can avoid aligning boundary nodes with regression points. A three-point bending test of a rubber beam was simulated to validate the developed technique. The simulation results were benchmarked against numerical results by ANSYS and various relevant numerical schemes. The technique can effectively solve the Dirichlet-type BVP, yielding accurate deformation, stress, and strain values across the entire problem domain when employing a linear strain model and increasing the number of CPCM nodes. In addition, comparative analysis with conventional displacement tracking techniques verifies the developed technique’s robustness. The proposed technique effectively circumvents the inherent limitations of traditional monitoring methods resulting from the reliance on physical gauges or target markers so that a robust and non-contact solution for remote structural health monitoring in real-scale infrastructures can be provided, even in unfavorable experimental environments.

Chemistry↗

DOE OSTI2025

A Domain-Decomposed A-ϕ Formulation Based on Lagrange Multipliers for Low-Frequency Problems

A domain-decomposed A-ϕ formulation based on Lagrange multipliers is proposed to simulate low-frequency elec- tromagnetic problems. This method partitions the computational domain into smaller subdomains, allowing each subdomain to be independently formulated using Lagrange multipliers as Dirichlet boundary conditions, while ensuring continuity of the fields across the interfaces. A mixed finite element method, utilizing both vector and scalar basis functions, is employed to discretize the formulation, resulting in a global system to be solved. The proposed method is validated using TEAM Problem 7 at 50 Hz, demonstrating its effectiveness in handling complex geometries and addressing the low-frequency breakdown issues commonly encountered in traditional finite element methods.

Hossain, Amzad↗

DOE OSTI2020

Nonoverlapping Localized Exponential Time Differencing Methods for Diffusion Problems

In this paper, we propose nonoverlapping localized exponential time differencing (ETD) methods for diffusion problems. The model time-dependent diffusion equation is first reformulated on subdomains based on the nonoverlapping domain decomposition, in which Neumann boundary conditions are imposed on the interfaces for the subdomain problems and Dirichlet type conditions are enforced to form a space-time interface problem. After spatial discretization by standard central finite differences and temporal integration with the first or second order ETD methods, the fully discrete interface problem is obtained. Such an interface problem is then solved iteratively either at each time step or over the whole time interval: the former involves the solution of stationary problems in each subdomain at each iteration while the latter involves the solution of time-dependent subdomain problems at each iteration. For both approaches, we prove that localized ETD solutions conserve mass exactly and converge in time to the exact space semidiscrete solution. Numerical experiments in two dimensions are also presented to illustrate the performance of the proposed methods.

Mass conservation↗

NASA NTRS1998

Bounded Error Schemes for the Wave Equation on Complex Domains

This paper considers the application of the method of boundary penalty terms ("SAT") to the numerical solution of the wave equation on complex shapes with Dirichlet boundary conditions. A theory is developed, in a semi-discrete setting, that allows the use of a Cartesian grid on complex geometries, yet maintains the order of accuracy with only a linear temporal error-bound. A numerical example, involving the solution of Maxwell's equations inside a 2-D circular wave-guide demonstrates the efficacy of this method in comparison to others (e.g. the staggered Yee scheme) - we achieve a decrease of two orders of magnitude in the level of the L2-error.

Abarbanel, Saul↗

DOE OSTI2020

The second-generation Shifted Boundary Method and its numerical analysis

Recently, the Shifted Boundary Method (SBM) was proposed within the class of unfitted (or immersed, or embedded) finite element methods. By reformulating the original boundary value problem over a surrogate (approximate) computational domain, the SBM avoids integration over cut cells and the associated problematic issues regarding numerical stability and matrix conditioning. Accuracy is maintained by modifying the original boundary conditions using Taylor expansions. Hence the name of the method, that shifts the location and values of the boundary conditions. In this article, we present enhanced variational SBM formulations for the Poisson and Stokes problems with improved flexibility and robustness. These simplified variational forms allow to relax some of the assumptions required by the mathematical proofs of stability and convergence of earlier implementations. First, we show that these new SBM implementations can be proved asymptotically stable and convergent even without the rather restrictive assumption that the inner product between the normals to the true and surrogate boundaries is positive. Second, we show that it is not necessary to introduce a stabilization term involving the tangential derivatives of the solution at Dirichlet boundaries, therefore avoiding the calibration of an additional stabilization parameter. Finally, we prove enhanced L 2 -estimates without the cumbersome assumption – of earlier proofs – that the surrogate domain is convex. Instead we rely on a conventional assumption that the boundary of the true domain is smooth, which can also be replaced by requiring convexity of the true domain. The aforementioned improvements open the way to a more general and efficient implementation of the Shifted Boundary Method, particularly in complex three-dimensional geometries. We complement these theoretical developments with numerical experiments in two and three dimensions.

42 ENGINEERING↗

NASA NTRS1993

Implementation of ADI: Schemes on MIMD parallel computers

In order to simulate the effects of the impingement of hot exhaust jets of High Performance Aircraft on landing surfaces a multi-disciplinary computation coupling flow dynamics to heat conduction in the runway needs to be carried out. Such simulations, which are essentially unsteady, require very large computational power in order to be completed within a reasonable time frame of the order of an hour. Such power can be furnished by the latest generation of massively parallel computers. These remove the bottleneck of ever more congested data paths to one or a few highly specialized central processing units (CPU's) by having many off-the-shelf CPU's work independently on their own data, and exchange information only when needed. During the past year the first phase of this project was completed, in which the optimal strategy for mapping an ADI-algorithm for the three dimensional unsteady heat equation to a MIMD parallel computer was identified. This was done by implementing and comparing three different domain decomposition techniques that define the tasks for the CPU's in the parallel machine. These implementations were done for a Cartesian grid and Dirichlet boundary conditions. The most promising technique was then used to implement the heat equation solver on a general curvilinear grid with a suite of nontrivial boundary conditions. Finally, this technique was also used to implement the Scalar Penta-diagonal (SP) benchmark, which was taken from the NAS Parallel Benchmarks report. All implementations were done in the programming language C on the Intel iPSC/860 computer.

Vanderwijngaart, Rob F.↗

DOE OSTI2022

Physics‐Informed Machine Learning Method for Large‐Scale Data Assimilation Problems

Abstract We develop a physics‐informed machine learning approach for large‐scale data assimilation and parameter estimation and apply it for estimating transmissivity and hydraulic head in the two‐dimensional steady‐state subsurface flow model of the Hanford Site given synthetic measurements of said variables. In our approach, we extend the physics‐informed conditional Karhunen‐Loéve expansion (PICKLE) method to modeling subsurface flow with unknown flux (Neumann) and varying head (time‐dependent Dirichlet) boundary conditions. We demonstrate that the PICKLE method is comparable in accuracy with the standard maximum a posteriori (MAP) method, but is significantly faster than MAP for large‐scale problems. Both methods use a mesh to discretize the computational domain. In MAP, the parameters and states are discretized on the mesh; therefore, the size of the MAP parameter estimation problem directly depends on the mesh size. In PICKLE, the mesh is used to evaluate the residuals of the governing equation, while the parameters and states are approximated by the truncated conditional Karhunen‐Loéve expansions with the number of parameters controlled by the smoothness of the parameter and state fields, and not by the mesh size. For a considered example, we demonstrate that the computational cost of PICKLE increases near linearly (as N 1.15 ) with the number of grid nodes N , while that of MAP increases much faster (as N 3.28 ). We also show that once trained for one set of Dirichlet boundary conditions (i.e., one river stage), the PICKLE method provides accurate estimates of the hydraulic head for any value of the Dirichlet boundary conditions (i.e., for any river stage).

97 MATHEMATICS AND COMPUTING↗

NASA NTRS2014

High-Order Implicit-Explicit Multi-Block Time-stepping Method for Hyperbolic PDEs

This work seeks to explore and improve the current time-stepping schemes used in computational fluid dynamics (CFD) in order to reduce overall computational time. A high-order scheme has been developed using a combination of implicit and explicit (IMEX) time-stepping Runge-Kutta (RK) schemes which increases numerical stability with respect to the time step size, resulting in decreased computational time. The IMEX scheme alone does not yield the desired increase in numerical stability, but when used in conjunction with an overlapping partitioned (multi-block) domain significant increase in stability is observed. To show this, the Overlapping-Partition IMEX (OP IMEX) scheme is applied to both one-dimensional (1D) and two-dimensional (2D) problems, the nonlinear viscous Burger's equation and 2D advection equation, respectively. The method uses two different summation by parts (SBP) derivative approximations, second-order and fourth-order accurate. The Dirichlet boundary conditions are imposed using the Simultaneous Approximation Term (SAT) penalty method. The 6-stage additive Runge-Kutta IMEX time integration schemes are fourth-order accurate in time. An increase in numerical stability 65 times greater than the fully explicit scheme is demonstrated to be achievable with the OP IMEX method applied to 1D Burger's equation. Results from the 2D, purely convective, advection equation show stability increases on the order of 10 times the explicit scheme using the OP IMEX method. Also, the domain partitioning method in this work shows potential for breaking the computational domain into manageable sizes such that implicit solutions for full three-dimensional CFD simulations can be computed using direct solving methods rather than the standard iterative methods currently used.

Nielsen, Tanner B.↗

DOE OSTI2023

A sharp interface Lagrangian-Eulerian method for flexible-body fluid-structure interaction

This paper introduces a sharp-interface approach to simulating fluid-structure interaction (FSI) involving flexible bodies described by general nonlinear material models and across a broad range of mass density ratios. This new flexible-body immersed Lagrangian-Eulerian (ILE) scheme extends our prior work on integrating partitioned and immersed approaches to rigid-body FSI. Our numerical approach incorporates the geometrical and domain solution flexibility of the immersed boundary (IB) method with an accuracy comparable to body-fitted approaches that sharply resolve flows and stresses up to the fluid-structure interface. Unlike many IB methods, our ILE formulation uses distinct momentum equations for the fluid and solid subregions with a Dirichlet-Neumann coupling strategy that connects fluid and solid subproblems through simple interface conditions. As in earlier work, we use approximate Lagrange multiplier forces to treat the kinematic interface conditions along the fluid-structure interface. This penalty approach simplifies the linear solvers needed by our formulation by introducing two representations of the fluid-structure interface, one that moves with the fluid and another that moves with the structure, that are connected by stiff springs. This approach also enables the use of multi-rate time stepping, which allows us to use different time step sizes for the fluid and structure subproblems. Our fluid solver relies on an immersed interface method (IIM) for discrete surfaces to impose stress jump conditions along complex interfaces while enabling the use of fast structured-grid solvers for the incompressible Navier-Stokes equations. The dynamics of the volumetric structural mesh are determined using a standard finite element approach to large-deformation nonlinear elasticity via a nearly incompressible solid mechanics formulation. This formulation also readily accommodates compressible structures with a constant total volume, and it can handle fully compressible solid structures for cases in which at least part of the solid boundary does not contact the incompressible fluid. Selected grid convergence studies demonstrate second-order convergence in volume conservation and in the pointwise discrepancies between corresponding positions of the two interface representations as well as between first and second-order convergence in the structural displacements. The time stepping scheme is also demonstrated to yield second-order convergence. To assess and validate the robustness and accuracy of the new algorithm, comparisons are made with computational and experimental FSI benchmarks. Test cases include both smooth and sharp geometries in various flow conditions. Furthermore, we also demonstrate the capabilities of this methodology by applying it to model the transport and capture of a geometrically realistic, deformable blood clot in an inferior vena cava filter.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2023

Sensitivity analysis of a layered piezoelectric system using ZFEM

The complex variable finite element method (ZFEM) is a numerical technique which aims to find the partial derivatives of the independent variables with respect to variation in dependent parameters declared in the physics. This is done by combining the complex Taylor series expansion within the weak formulation of the governing equation in a coupled system of linear equations forming a complex valued block matrix given by the Cauchy–Riemann matrix representation. In this work, two-dimensional linear first-order elements have been implemented in ZFEM to predict the design derivatives of the mechanical displacement field and the voltage potential field for a layered piezoelectric system in a steady-state study with Dirichlet boundary condition applied at the top and bottom edges of the geometry. This approach allows the standard FEM solution to quantify the sensitivity of the mechanical displacement and voltage potential fields with respect to small variations in the material properties through the information obtained from the computation of the derivatives. The domain is formed by a layered body with PZT-4 and PZT-5 stacked together. For result verification, the numerical solution obtained with ZFEM was compared to results from a commercial FEM package and the solution from the imaginary part was compared to the exact solution of a well-known benchmark problem. In conclusion, comparison of the results showed good agreement for both the real and imaginary parts of the solution and the largest sensitivities were found in PZT-5 specifically in C 13 , C 33 , and ε 33 .

42 ENGINEERING↗

NASA NTRS2021

Topic Modeling Tool for PeTaL (Periodic Table of Life)

A topic modeling tool is constructed for the purpose of providing insights from biology to the engineer within the framework of PeTaL (Periodic Table of Life). The machine learning text mining tools–latent Dirichlet allocation (LDA) and nonnegative matrix factorization (NMF) with Kullback-Leibler (KL) divergence—are used to provide topic clusters to the user. Topic clusters are the underlying themes of a paper. For the text modeling problem, NMF-KL is the equivalent of probabilistic latent semantic analysis. Both LDA and NMF-KL are top-performing modeling tools. These tools are used to identify biological specimens relevant to the user. Various organisms solve a particular survival problem in nature differently. The topic clusters allow people without domain expertise to find these cross-topic themes in the body of documents and then branch out and examine papers whose target organisms solve the engineer’s problem. Abstracts from the Journal of Experimental Biology were used as input for the clustering tool in addition to a curated set of articles for validation. The tool is able to accept alternate input sources.

Machine learning↗

NASA NTRS2016

Topic Modeling of NASA Space System Problem Reports: Research in Practice

Problem reports at NASA are similar to bug reports: they capture defects found during test, post-launch operational anomalies, and document the investigation and corrective action of the issue. These artifacts are a rich source of lessons learned for NASA, but are expensive to analyze since problem reports are comprised primarily of natural language text. We apply topic modeling to a corpus of NASA problem reports to extract trends in testing and operational failures. We collected 16,669 problem reports from six NASA space flight missions and applied Latent Dirichlet Allocation topic modeling to the document corpus. We analyze the most popular topics within and across missions, and how popular topics changed over the lifetime of a mission. We find that hardware material and flight software issues are common during the integration and testing phase, while ground station software and equipment issues are more common during the operations phase. We identify a number of challenges in topic modeling for trend analysis: 1) that the process of selecting the topic modeling parameters lacks definitive guidance, 2) defining semantically-meaningful topic labels requires nontrivial effort and domain expertise, 3) topic models derived from the combined corpus of the six missions were biased toward the larger missions, and 4) topics must be semantically distinct as well as cohesive to be useful. Nonetheless,topic modeling can identify problem themes within missions and across mission lifetimes, providing useful feedback to engineers and project managers.

Data Mining↗

DOE OSTI2021

Computing Edge States without Hard Truncation

We present a numerical method which accurately computes the discrete spectrum and associated bound states of semi-infinite Hamiltonians which model electronic “edge” states localized at boundaries of one- and two-dimensional crystalline materials. The problem is nontrivial since arbitrarily large finite “hard” (Dirichlet) truncations of the Hamiltonian in the infinite bulk direction tend to produce spurious bound states partially supported at the truncation. Our method, which overcomes this difficulty, is to compute the Green's function of the semi-infinite Hamiltonian by imposing an appropriate boundary condition in the bulk direction; then, the spectral data is recovered via Riesz projection. We demonstrate our method's effectiveness by studies of edge states at a graphene zig-zag edge in the presence of defects modeled both by a discrete tight-binding model and a continuum PDE model under finite difference discretization. Our method may also be used to study states localized at domain wall-type edges in one- and two-dimensional materials where the edge Hamiltonian is infinite in both directions; we demonstrate this for the case of a tight-binding model of distinct honeycomb structures joined along a zig-zag edge. Here, we expect our method to be useful for designing novel devices based on precise wave-guiding by edge states.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2021

Discrete Green’s functions and spectral graph theory for computationally efficient thermal modeling

Here, this work concerns solutions of the heat equation with the spectral graph method, for which the temperature is defined at discrete points in the domain and the spatial relationship among the points is described by a graph. The heat equation on the graph is solved using matrix techniques involving the eigenvectors and eigenvalues of the Laplacian matrix. The spectral graph approach precludes the computationally intensive meshing and numerous time-integration steps of the finite element method. In the present work, the spectral graph method is extended to include heat loss at the boundaries with a generalized boundary condition, and physics-based edge weights are introduced which simplify the calibration process. From this approach a discrete Green’s function is defined which allows for solutions under a variety of heating conditions including: space-varying initial conditions; time-and-space varying internal heating; and, time-and-space-varying heating at boundaries of type 1 (Dirichlet), type 2 (Neumann) and type 3 (Robin). Results are provided for benchmark heat transfer problems in one spatial dimension and in three spatial dimensions, and verification is provided by comparison with exact analytical solutions and finite difference solutions. The spectral graph method converges within 0.4% error of the analytical solution. The practical utility of the approach is demonstrated by thermal simulation of a multilayer additive manufacturing process. The spectral graph results are compared to experimentally-obtained temperature data for two metal parts, with error less than 5% of the experimental measurements, with computation time less than one minute on a desktop computer.

36 MATERIALS SCIENCE↗