Search NASA⌕ Search

SEARCH · Search NASA

Results for “Bounded 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.

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

At least 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Enabling attractive-repulsive potentials in binary-collision-approximation monte-carlo codes for ion-surface interactions

Abstract Binary Collision Approximation (BCA) codes for ion-material interactions, such as SRIM, Tridyn, F-TRIDYN, and SDtrimSP, have historically been limited to screened Coulomb potentials even at low energies due to the difficulty in numerically solving the Distance of Closest Approach (DOCA) problem for attractive-repulsive potentials. Techniques such as direct n-body simulation or modifications to Newton’s method are either prohibitively costly or not guaranteed to work for all potentials. Advanced rootfinding techniques, such as companion matrix solvers, offer a solution. For many attractive-repulsive potentials, however, a companion matrix cannot be used directly, because there is no way to put the associated functions into a monomial basis form. A complementary technique is proxy rootfinding—by finding the best-fit polynomial approximant of a function, the zeros of the approximant can be guaranteed to be close to the zeros of the function. Using the Chebyshev basis and grid offers additional guarantees with regards to the quality of the approximation, the speed of convergence, and the avoidance of Runge’s phenomenon. By finding Chebyshev interpolants and using the Chebyshev-Frobenius companion matrix, the zeros of any real function on a bounded domain can be found. Here we show that using an Adaptive Chebyshev Proxy Rootfinder with Automatic Subdivision (ACPRAS) with appropriate scaling functions, numerical issues presented by attractive-repulsive potentials, including those of scale, can be handled. Using these techniques, we show that it is possible to include any physically reasonable interatomic potential in a BCA code, and to guarantee correctness of the resulting scattering angle calculations.

Materials Science↗
DOE OSTI2021

A Parallel Cut-Cell Algorithm for the Free-Boundary Grad--Shafranov Problem

A parallel cut-cell algorithm is described to solve the free-boundary problem of the Grad--Shafranov equation. The algorithm reformulates the free-boundary problem in an irregular bounded domain and its important aspects include a searching algorithm for the magnetic axis and separatrix, a surface integral along the irregular boundary to determine the boundary values, an approach to optimize the coil current based on a targeting plasma shape, Picard iterations with Aitken's acceleration for the resulting nonlinear problem, and a Cartesian grid embedded boundary method to handle the complex geometry. Here the algorithm is implemented in parallel using a standard domain-decomposition approach and a good parallel scaling is observed. Numerical results verify the accuracy and efficiency of the free-boundary Grad--Shafranov solver.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Optimal Experimental Design for Inverse Problems in the Presence of Observation Correlations

Optimal experimental design (OED) is the general formalism of sensor placement and decisions on the data collection strategy for engineered or natural experiments. This problem is prevalent in many critical fields such as battery design, numerical weather prediction, geosciences, environmental and urban studies. State-of-the-art computational methods for experimental design do not accommodate correlation structure in observational errors produced by many expensive-to-operate devices such as X-ray machines, radars, and satellites. Discarding evident data correlations leads to biased results, higher expenses, and waste of valuable resources. We present a general formulation of the OED formalism for model-constrained large-scale Bayesian linear inverse problems, where measurement errors are generally correlated. The proposed approach utilizes the Hadamard product of matrices to formulate the weighted-likelihood, and is valid for both finite as well as infinite-dimensional Bayesian inverse problems. Extensive numerical experiments are carried out for empirical verification of the proposed approach using an advection-diffusion model, where the objective is to optimally place a small set of sensors, under a limited budget, to predict the concentration of a contaminant in a closed and bounded domain.

Correlated observations↗
DOE OSTI2025

Efficient Training of Deep Neural Operator Networks via Randomized Sampling

Neural operators (NOs) employ deep neural networks to learn the mappings between infinitedimensional function spaces. Deep operator network (DeepONet), a popular NO architecture, has demonstrated success in the real-time prediction of complex dynamics across various scientific and engineering applications. In this work, we introduce a random sampling technique to be adopted during the training of DeepONet, aimed at improving the generalization ability of the model, while significantly reducing the computational time. The proposed approach targets the trunk network of the DeepONet model that outputs the basis functions corresponding to the spatiotemporal locations of the bounded domain on which the physical system is defined. While constructing the loss function, DeepONet training traditionally considers a uniform grid of spatiotemporal points at which all the output functions are evaluated for each iteration. This approach leads to a larger batch size, resulting in poor generalization and increased memory demands, due to the limitations of the stochastic gradient descent (SGD) optimizer. The proposed random sampling over the inputs of the trunk net mitigates these challenges, improving generalization and reducing the memory requirements during training, resulting in significant computational gains. We validate our hypothesis through three benchmark examples, demonstrating substantial reductions in training time while achieving comparable or lower overall test errors relative to the traditional training approach. Our results indicate that incorporating randomization in the trunk network inputs during training enhances the efficiency and robustness of DeepONet, offering a promising avenue for improving the framework’s performance in modeling complex physical systems.

Karumuri, Sharmila [Department of Civil & Systems ↗
DOE OSTI2024

Learning Only on Boundaries: A Physics-Informed Neural Operator for Solving Parametric Partial Differential Equations in Complex Geometries

Recently, deep learning surrogates and neural operators have shown promise in solving partial differential equations (PDEs). However, they often require a large amount of training data and are limited to bounded domains. In this work, we present a novel physics-informed neural operator method to solve parameterized boundary value problems without labeled data. By reformulating the PDEs into boundary integral equations (BIEs), we can train the operator network solely on the boundary of the domain. This approach reduces the number of required sample points from $O(N^d)$ to $O(N^{d-1}$), where $d$ is the domain’s dimension, leading to a significant acceleration of the training process. Additionally, our method can handle unbounded problems, which are unattainable for existing physics-informed neural networks (PINNs) and neural operators. Finally, our numerical experiments show the effectiveness of parameterized complex geometries and unbounded problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Canonical Transformation of Potential Model Hamiltonian Mechanics to Geometrical Form I

Using the methods of symplectic geometry, we establish the existence of a canonical transformation from potential model Hamiltonians of standard form in a Euclidean space to an equivalent geometrical form on a manifold, where the corresponding motions are along geodesic curves. The advantage of this representation is that it admits the computation of geodesic deviation as a test for local stability, shown in recent previous studies to be a very effective criterion for the stability of the orbits generated by the potential model Hamiltonian. We describe here an algorithm for finding the generating function for the canonical transformation and describe some of the properties of this mapping under local diffeomorphisms. We give a convergence proof for this algorithm for the one-dimensional case, and provide a precise geometric formulation of geodesic deviation which relates the stability of the motion in the geometric form to that of the Hamiltonian standard form. We apply our methods to a simple one-dimensional harmonic oscillator and conclude with a discussion of the relation of bounded domains in the two representations for which Morse theory would be applicable.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS1985

Long-time asymptotics of a system for plasma diffusion

A system of parabolic nonlinear equations that describe the diffusion of a fully collisional plasma across a strong magnetic field is discussed. It is demonstrated that the solution to this system tends to a time asymptotic state which is of space-time separable form, theta(t)f(x). Furthermore, f(x) is independent of the initial conditions and theta(t) depends slightly on the initial conditions. The rate of decay of the temporal part is governed by a nonlinear eigenvalue problem. Since the equations are considered in a bounded domain we are able to analyze the effect of boundary conditions on the evolution of the system. Additional effects on radiation, heating, and particle injection can also be accounted for. Essential differences between the behavior of a fully-coupled system and a scalar equation are observed.

Rosenau, P.↗
NASA NTRS1986

Comparative efficiency of finite, boundary and hybrid element methods in elastostatics

The comparative computational efficiencies of the finite element (FEM), boundary element (BEM), and hybrid boundary element-finite element (HBFEM) analysis techniques are evaluated for representative bounded domain interior and unbounded domain exterior problems in elastostatics. Computational efficiency is carefully defined in this study as the computer time required to attain a specified level of solution accuracy. The study found the FEM superior to the BEM for the interior problem, while the reverse was true for the exterior problem. The hybrid analysis technique was found to be comparable or superior to both the FEM and BEM for both the interior and exterior problems.

Schwartz, C. W.↗
NASA NTRS1986

Research related to improved computer aided design software package

The comparative computational efficiencies of the finite element (FEM), boundary element (BEM), and hybrid boundary element-finite element (HVFEM) analysis techniques are evaluated for representative bounded domain interior and unbounded domain exterior problems in elastostatics. Computational efficiency is carefully defined in this study as the computer time required to attain a specified level of solution accuracy. The study found the FEM superior to the BEM for the interior problem, while the reverse was true for the exterior problem. The hybrid analysis technique was found to be comparable or superior to both the FEM and BEM for both the interior and exterior problems.

Walston, W. H., Jr.↗
NASA NTRS1987

A frequency-domain estimator for use in adaptive control systems

The paper presents a frequency-domain estimator which can identify both a nominal model of a plant as well as a frequency-domain bounding function on the modeling error associated with this nominal model. This estimator, which is called a robust estimator, can be used in conjunction with a robust control-law redesign algorithm to form a robust adaptive controller.

Lamaire, Richard O.↗
NASA NTRS1991

A frequency-domain estimator for use in adaptive control systems

This paper presents a frequency-domain estimator that can identify both a parametrized nominal model of a plant as well as a frequency-domain bounding function on the modeling error associated with this nominal model. This estimator, which we call a robust estimator, can be used in conjunction with a robust control-law redesign algorithm to form a robust adaptive controller.

Lamaire, Richard O.↗
NASA NTRS1993

Some climatological variables for TOGA-COARE domains - 1985-1990

Results are presented of the Tropical Oceans Global Atmosphere-Coupled Ocean Atmosphere Response Experiment (TOGA-COARE) conducted in the western Pacific, with particular attention given to the atmospheric component of the experiment. The climatological variables explored are the mean sea level pressure, precipitable water, sea surface-air temperature difference, zonal wind component at 200 mb and 10 m, vertical motion at 500 mb, and precipitation rates. The paper provides some of the large-scale flow patterns in which other circulation features reside. Results are presented for three of the TOGA-COARE domains bounded by the following: (1) the Upper Air Network, 30 deg N-30 deg S, 90 deg E-70 deg W; (2) the Large-Scale Array, 10 deg N-10 deg S, 140 deg E-180 deg; and (3) the Equatorial Synoptic Array, 5 deg N-5 deg S, 150 deg E-180 deg.

Vincent, Dayton G.↗
NASA NTRS1994

Investigation of finite element: ABC methods for electromagnetic field simulation

The mechanics of wave propagation in the presence of obstacles is of great interest in many branches of engineering and applied mathematics like electromagnetics, fluid dynamics, geophysics, seismology, etc. Such problems can be broadly classified into two categories: the bounded domain or the closed problem and the unbounded domain or the open problem. Analytical techniques have been derived for the simpler problems; however, the need to model complicated geometrical features, complex material coatings and fillings, and to adapt the model to changing design parameters have inevitably tilted the balance in favor of numerical techniques. The modeling of closed problems presents difficulties primarily in proper meshing of the interior region. However, problems in unbounded domains pose a unique challenge to computation, since the exterior region is inappropriate for direct implementation of numerical techniques. A large number of solutions have been proposed but only a few have stood the test of time and experiment. The goal of this thesis is to develop an efficient and reliable partial differential equation technique to model large three dimensional scattering problems in electromagnetics.

Chatterjee, A.↗
NASA NTRS1995

Multiresolution Representation Using Biorthogonal Multiwavelets

We generalize Harten's multiresolution representation to biorthogonal multiwavelets. Several variants are considered. For example, a given array of discrete point values is transformed to point values and derivatives or point 'values and cell averages'. Compact Hermite interpolation is used in the decomposition and reconstruction algorithm. The resulting basis functions that are symmetric or skewsymmetric, compact, and smooth with optimal order accuracy. Harten's approach has several advantages: the multiresolution scheme is inherently discrete, non-periodic boundary conditions are easy to implement, and the representation can be extended to unstructured grids in bounded domains. We demonstrate the compression features of the new mutliwavelets by application to variable scale piecewise smooth functions with jump discontinuities typical of numerical solutions of nonlinear hyperbolic conservation laws.

Warming, Robert F.↗
NASA NTRS2017

Strategies Toward Automation of Overset Structured Surface Grid Generation

An outline of a strategy for automation of overset structured surface grid generation on complex geometries is described. The starting point of the process consists of an unstructured surface triangulation representation of the geometry derived from a native CAD, STEP, or IGES definition, and a set of discretized surface curves that captures all geometric features of interest. The procedure for surface grid generation is decomposed into an algebraic meshing step, a hyperbolic meshing step, and a gap-filling step. This paper will focus primarily on the high-level plan with details on the algebraic step. The algorithmic procedure for the algebraic step involves analyzing the topology of the network of surface curves, distributing grid points appropriately on these curves, identifying domains bounded by four curves that can be meshed algebraically, concatenating the resulting grids into fewer patches, and extending appropriate boundaries of the concatenated grids to provide proper overlap. Results are presented for grids created on various aerospace vehicle components.

overset↗
NASA NTRS1984

Solitons in superfluid (He-3)-A - Bound states on domain walls

The effects of solitons on the spectrum of fermion excitations in superfluid (He-3)-A are investigated. It is found that there is a two-dimensional manifold of bound states with energies within the gap of the bulk superfluid. The bound-state spectrum lacks inversion symmetry parallel to the wall.

Ho, T. L.↗