Search NASA⌕ Search

SEARCH · Search NASA

Results for “Partially explicit”

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 307 records · Page 17

Analysis of Issues for Project Scheduling by Multiple, Dispersed Schedulers (distributed Scheduling) and Requirements for Manual Protocols and Computer-based Support

Although computerized operations have significant gains realized in many areas, one area, scheduling, has enjoyed few benefits from automation. The traditional methods of industrial engineering and operations research have not proven robust enough to handle the complexities associated with the scheduling of realistic problems. To address this need, NASA has developed the computer-aided scheduling system (COMPASS), a sophisticated, interactive scheduling tool that is in wide-spread use within NASA and the contractor community. Therefore, COMPASS provides no explicit support for the large class of problems in which several people, perhaps at various locations, build separate schedules that share a common pool of resources. This research examines the issue of distributing scheduling, as applied to application domains characterized by the partial ordering of tasks, limited resources, and time restrictions. The focus of this research is on identifying issues related to distributed scheduling, locating applicable problem domains within NASA, and suggesting areas for ongoing research. The issues that this research identifies are goals, rescheduling requirements, database support, the need for communication and coordination among individual schedulers, the potential for expert system support for scheduling, and the possibility of integrating artificially intelligent schedulers into a network of human schedulers.

Richards, Stephen F.↗

Data-driven operator inference for nonintrusive projection-based model reduction

We presenta a nonintrusive projection-based model reduction method for full models based on time-dependent partial differential equations. Projection-based model reduction constructs the operators of a reduced model by projecting the equations of the full model onto a reduced space. Traditionally, this projection is intrusive, which means that the full-model operators are required either explicitly in an assembled form or implicitly through a routine that returns the action of the operators on a given vector; however, in many situations the full model is given as a black box that computes trajectories of the full-model states and outputs for given initial conditions and inputs, but does not provide the full-model operators. Our nonintrusive operator inference approach infers approximations of the reduced operators from the initial conditions, inputs, trajectories of the states, and outputs of the full model, without requiring the full-model operators. Our operator inference is applicable to full models that are linear in the state or have a low-order polynomial nonlinear term. The inferred operators are the solution of a least-squares problem and converge, with sufficient state trajectory data, in the Frobenius norm to the reduced operators that would be obtained via an intrusive projection of the full-model operators. Our numerical results reflect operator inference on a linear climate model and on a tubular reactor model with a polynomial nonlinear term of third order.

42 ENGINEERING↗

Closeout Report of BNL LDRD 23-050 A Second EIC Detector: Physics Case and Conceptual Design

This document is the closeout report for LDRD 23-050, a type-A LDRD project awarded in FY2022 under the title “ A Second EIC Detector: Physics Case and Conceptual Design ”. The project was motivated by the strong interest within the EIC community in a second general-purpose detector and interaction region, and by the recognition that such a detector is essential to fully exploit the scientific potential of the EIC over its multi-decade lifetime. The key goals of the LDRD were to (i) strengthen the case for a second EIC detector, building on the arguments already articulated in the community Yellow Report, (ii) provide a realistic detector concept that is complementary to the current project detector, ePIC, in terms of physics reach, precision, and control of systematics, and (iii) broaden the overall physics program of the EIC facility. Since a possible second detector is expected to be realized with a delay of several years relative to the first detector, the project explicitly aimed at identifying technologies that are not yet sufficiently mature for ePIC but could be deployed on the later timescale of a second detector, thereby providing genuine complementarity and room for innovation. LDRD 23-050 provided support for two postdoctoral researchers and partial support for several BNL staff members, and the effort ramped up in mid-2023. Work was carried out in close collaboration with colleagues from the EIC project, the Cold QCD and STAR groups at BNL, and with substantial input from members of the EIC User Group and the ePIC Collaboration as reflected in the author list. Over the period from October 2022 through September 2025, this team developed and refined a physics program tailored to a second detector, translated the resulting physics requirements into detector-level performance targets, and explored multiple conceptual detector layouts capable of meeting these targets within the constraints of the second interaction region. The expected outcome, as stated in the original proposal, was a document detailing the physics potential and requirements of a second EIC detector, accompanied by a comprehensive conceptual detector design and an outline of the remaining R&D needed to bring the relevant technologies to maturity. The present report summarizes the progress that has been achieved toward these goals. It consolidates the physics studies, detector concepts, and technology assessments developed under this LDRD and places them in the broader context of worldwide detector R&D. While the evolving priorities of the EIC project and the substantial community effort required to design and construct ePIC naturally limited the scope of EIC-wide activities toward a second detector during this period, the work documented here is intended to provide a foundation and a point of reference for future efforts. Whatever form a second EIC detector may ultimately take, we hope that this report will serve as a useful guide for colleagues who continue to advance this program in the near- and mid-term future.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

A new coal-permeability model: Internal swelling stress and fracture-matrix interaction

We have developed a new coal-permeability model for uniaxial strain and constant confining stress conditions. The model is unique in that it explicitly considers fracture-matrix interaction during coal deformation processes and is based on a newly proposed internal-swelling stress concept. This concept is used to account for the impact of matrix swelling (or shrinkage) on fracture-aperture changes resulting from partial separation of matrix blocks by fractures that do not completely cut through the whole matrix. The proposed permeability model is evaluated with data from three Valencia Canyon coalbed wells in the San Juan Basin, where increased permeability has been observed during CH{sub 4} gas production, as well as with published data from laboratory tests. Model results are generally in good agreement with observed permeability changes. The importance of fracture-matrix interaction in determining coal permeability, demonstrated in this work using relatively simple stress conditions, underscores the need for a dual-continuum (fracture and matrix) mechanical approach to rigorously capture coal-deformation processes under complex stress conditions, as well as the coupled flow and transport processes in coal seams.

54 ENVIRONMENTAL SCIENCES↗

Commensurability effects in one-dimensional Anderson localization: Anomalies in eigenfunction statistics

Highlights: > Statistics of normalized eigenfunctions in one-dimensional Anderson localization at E = 0 is studied. > Moments of inverse participation ratio are calculated. > Equation for generating function is derived at E = 0. > An exact solution for generating function at E = 0 is obtained. > Relation of the generating function to the phase distribution function is established. - Abstract: The one-dimensional (1d) Anderson model (AM), i.e. a tight-binding chain with random uncorrelated on-site energies, has statistical anomalies at any rational point f=(2a)/({lambda}{sub E}) , where a is the lattice constant and {lambda}{sub E} is the de Broglie wavelength. We develop a regular approach to anomalous statistics of normalized eigenfunctions {psi}(r) at such commensurability points. The approach is based on an exact integral transfer-matrix equation for a generating function {Phi}{sub r}(u, {phi}) (u and {phi} have a meaning of the squared amplitude and phase of eigenfunctions, r is the position of the observation point). This generating function can be used to compute local statistics of eigenfunctions of 1d AM at any disorder and to address the problem of higher-order anomalies at f=p/q with q > 2. The descender of the generating function P{sub r}({phi}){identical_to}{Phi}{sub r}(u=0,{phi}) is shown to be the distribution function of phase which determines the Lyapunov exponent and the local density of states. In the leading order in the small disorder we derived a second-order partial differential equation for the r-independent ('zero-mode') component {Phi}(u, {phi}) at the E = 0 (f=1/2 ) anomaly. This equation is nonseparable in variables u and {phi}. Yet, we show that due to a hidden symmetry, it is integrable and we construct an exact solution for {Phi}(u, {phi}) explicitly in quadratures. Using this solution we computed moments I{sub m} = N< vertical bar {psi} vertical bar {sup 2m}> (m {>=} 1) for a chain of the length N {yields} {infinity} and found an essential difference between their m-behavior in the center-of-band anomaly and for energies outside this anomaly. Outside the anomaly the 'extrinsic' localization length defined from the Lyapunov exponent coincides with that defined from the inverse participation ratio ('intrinsic' localization length). This is not the case at the E = 0 anomaly where the extrinsic localization length is smaller than the intrinsic one. At E = 0 one also observes an anomalous enhancement of large moments compatible with existence of yet another, much smaller characteristic length scale.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Gauged soft recursion: on-shell construction of Goldstone-gauge amplitudes

We present a new on-shell recursion relation for scattering amplitudes involving Nambu-Goldstone bosons with a gauged unbroken symmetry. A central challenge is that gauge interactions break Adler’s zero condition for charged scalars, invalidating the standard soft recursion. To overcome this, we introduce a “gauged soft recursion” that leverages the soft theorems of the gauge bosons themselves, combined with a novel decomposition of amplitudes into gauge-invariant components where Adler’s zero is partially restored. The formalism, which also incorporates internal gauge bosons via angular momentum constraints, enables the systematic construction of tree-level amplitudes with arbitrary numbers of Goldstone bosons and gauge bosons in both Abelian and non-Abelian theories, as we demonstrate with explicit examples.

Chiral Lagrangian↗

Multilevel Graph Partitioning for Three-Dimensional Discrete Fracture Network Flow Simulations

We present a topology-based method for mesh-partitioning in three-dimensional discrete fracture network (DFN) simulations that takes advantage of the intrinsic multi-level nature of a DFN. DFN models are used to simulate flow and transport through low-permeability fractured media in the subsurface by explicitly representing fractures as discrete entities. The governing equations for flow and transport are numerically integrated on computational meshes generated on the interconnected fracture networks. Modern high-fidelity DFN simulations require high-performance computing on multiple processors where performance and scalability depends partially on obtaining a high-quality partition of the mesh to balance work-loads and minimize communication across all processors. The discrete structure of a DFN naturally lends itself to various graph representations, which can be thought of as coarse-scale representations of the computational mesh. Using this concept, we develop two applications of the multilevel graph partitioning algorithm to partition the mesh of a DFN. In the first, we project a partition of the graph based on the DFN topology onto the mesh of the DFN and in the second, this DFN-based projection is used as the initial condition for further partitioning refinement of the mesh. We compare the performance of these methods with standard multi-level graph partitioning using graph-based metrics (cut, imbalance, partitioning time), computational-based metrics (FLOPS, iterations, solver time), and total run time. The DFN-based and the mesh-based partitioning methods are comparable in terms of the graph-based metrics, but the time required to obtain the partition is several orders of magnitude faster using the DFN-based partitions. The computation-based metrics show comparable performance between both methods so, in combination, the DFN-based partitions are several orders of magnitude faster than the mesh-based partition. Furthermore, the method which uses the DFN-partition solution as the initial condition of the mesh partition provided cut and imbalance values that were close to the mesh-based partition but in a fraction of the time. In turn, this hybrid method outperformed both of the other methods in terms of the total run time.

58 GEOSCIENCES↗

A general non-Fourier Stefan problem formulation that accounts for memory effects

The Stefan problem is the classical model of a melting phase change. In heterogeneous systems, such phase changes can exhibit non-Fourier (anomalous) behaviors, where the advance of the melt interface does not follow the expected time scaling. These situations can be modeled by replacing the derivatives, in the governing partial differential equations, with fractional order derivatives. In particular, replacing the time derivatives leads to non-Fourier models that account for memory effects in the system. In this work, by using appropriate time convolution integrals, a general thermodynamic balance statement for melting phase problems, explicitly accounting for memory effects, is developed. From this balance, a general model formulation applicable to problems involving melting over a temperature range (i.e., a mushy region) is derived. A key component in this model is the representation of memory effects through the use of fractional derivative based constitutive models of the enthalpy and heat flux. Further, on shrinking the mushy region to a single isotherm, a general sharp interface melting model is obtained. Here, in contrast to the classic Stefan problem, the fractional derivatives induce a natural regularization, such that the constitutive models for enthalpy and heat flux are continuous at the melt interface; a result confirmed through numerical simulation. To further support the theoretical findings, a physical example of a non-Fourier Stefan problem is presented. Overall the development and results in this paper underscore the importance of explicitly relating the development of fractional calculus models to the appropriate thermodynamic balance statements.

42 ENGINEERING↗

On the C{sup n}/Z{sub m} fractional branes

We construct several geometric representatives for the C{sup n}/Z{sub m} fractional branes on either a partially or the completely resolved orbifold. In the process we use large radius and conifold-type monodromies and provide a strong consistency check. In particular, for C{sup 3}/Z{sub 5} we give three different sets of geometric representatives. We also find the explicit Seiberg duality which connects our fractional branes to the ones given by the McKay correspondence.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Phase Field Dislocation Dynamics (PFDD) version 2.x

This disclosure is for version 2.x of a mesoscale model called Phase Field Dislocation Dynamics (PFDD). PFDD is used for investigating deformation in nanoscale (grain sizes of ~300 nm and less) materials, such as metals and alloys. This approach models the motion and interaction of individual defects, namely dislocations, in the material using scalar-valued phase field variables, also called order parameters. The system is evolved through energy minimization thus the model calculates the total energy density in terms of the phase field variables. The energy minimization is completed using the Ginzburg-Landau equation, and is implemented with explicit time integration. The total system energy can be comprised of several terms, including the strain energy (which describes dislocation-dislocation interactions), the energy due to an applied stress (dislocation interactions with the applied stress), and a core/lattice (perfect dislocations) or generalized stacking fault (partial dislocations) energy (described the dislocation core structure). The latter term in particular may vary based on the crystal structure being modeled and is typically informed using lower length scale (e.g., atomistic) approaches, although no such (atomistic) calculations are completed within the PFDD algorithm. This basic formulation was previously reviewed by Los Alamos National Laboratory and released under license number C17113. This previously reviewed version we will henceforth refer to as PFDD v1.0. PFDD v1.0 consisted of 2 codes (one parallel and one serial) plus input files, all written in the C language. This new disclosure is addressing the next versions of the PFDD, versions 2.x. There have been several enhancements of PFDD v1.0, which are described here and included in the attached code, which we will refer to as PFDD v2.0. There are also several new features described here that are either planned or already in process and are expected to be subsequent releases, i.e., v2.1, v2.2, ...v2.x.

Hunter, Abigail↗

Variational objective analyses for cyclone studies

The basic analysis equations, i.e., the two horizontal momentum equations, the hydrostatic equation, and the integrated continuity equation were derived for the nonlinear vertical coordinate, nondimensionalized, and expressed in finite differences on a staggered grid. Special care was taken to transform the hydrostatic equation and the pressure gradient terms of the horizontal momentum equations to nearly eliminate truncation error over steeply sloping terrain. This formulation also eliminated explicit reference to orographically induced variations in the thermodynamic variables so that the variational adjustments are on the scale of the meteorological perturbations. The analysis equations were subjected to the Euler-Lagrange operations as expressed for finite differences and an additional set of five partial differential equations was derived, bringing to nine the number of equations in Model I. Higher order terms, terms containing observed quantities, and terms containing none of the variables to be adjusted were grouped into forcing functions and the equations were solved for the zero order terms. Zero order variables were eliminated between these equations and there resulted two diagnostic equations which take the form of general linear second order partial differential equations with nonconstant coefficients.

Achtemeier, G. L.↗

Multigrid Methods for Fully Implicit Oil Reservoir Simulation

In this paper we consider the simultaneous flow of oil and water in reservoir rock. This displacement process is modeled by two basic equations: the material balance or continuity equations and the equation of motion (Darcy's law). For the numerical solution of this system of nonlinear partial differential equations there are two approaches: the fully implicit or simultaneous solution method and the sequential solution method. In the sequential solution method the system of partial differential equations is manipulated to give an elliptic pressure equation and a hyperbolic (or parabolic) saturation equation. In the IMPES approach the pressure equation is first solved, using values for the saturation from the previous time level. Next the saturations are updated by some explicit time stepping method; this implies that the method is only conditionally stable. For the numerical solution of the linear, elliptic pressure equation multigrid methods have become an accepted technique. On the other hand, the fully implicit method is unconditionally stable, but it has the disadvantage that in every time step a large system of nonlinear algebraic equations has to be solved. The most time-consuming part of any fully implicit reservoir simulator is the solution of this large system of equations. Usually this is done by Newton's method. The resulting systems of linear equations are then either solved by a direct method or by some conjugate gradient type method. In this paper we consider the possibility of applying multigrid methods for the iterative solution of the systems of nonlinear equations. There are two ways of using multigrid for this job: either we use a nonlinear multigrid method or we use a linear multigrid method to deal with the linear systems that arise in Newton's method. So far only a few authors have reported on the use of multigrid methods for fully implicit simulations. Two-level FAS algorithm is presented for the black-oil equations, and linear multigrid for two-phase flow problems with strong heterogeneities and anisotropies is studied. Here we consider both possibilities. Moreover we present a novel way for constructing the coarse grid correction operator in linear multigrid algorithms. This approach has the advantage in that it preserves the sparsity pattern of the fine grid matrix and it can be extended to systems of equations in a straightforward manner. We compare the linear and nonlinear multigrid algorithms by means of a numerical experiment.

Molenaar, J.↗

Wilson lines in the MHV action

The MHV action is the Yang-Mills action quantized on the light-front, where the two explicit physical gluonic degrees of freedom have been canonically transformed to a new set of fields. This transformation leads to the action with vertices being off-shell continuations of the MHV amplitudes. We show that the solution to the field transformation expressing one of the new fields in terms of the Yang-Mills field is a certain type of the Wilson line. More precisely, it is a straight infinite gauge link with a slope extending to the light-cone minus and the transverse direction. One of the consequences of that fact is that certain MHV vertices reduced partially on-shell are gauge invariant — a fact discovered before using conventional light-front perturbation theory. We also analyze the diagrammatic content of the field transformations leading to the MHV action. We found that the diagrams for the solution to the transformation (given by the Wilson line) and its inverse differ only by light-front energy denominators. Further, we investigate the coordinate space version of the inverse solution to the one given by the Wilson line. We find an explicit expression given by a power series in fields. We also give a geometric interpretation to it by means of a specially defined vector field. Finally, we discuss the fact that the Wilson line solution to the transformation is directly related to the all-like helicity gluon wave function, while the inverse functional is a generating functional for solutions of self-dual Yang-Mills equations.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Fast alogorithms for Bayesian uncertainty quantification in large-scale linear inverse problems based on low-rank partial Hessian approximations

We consider the problem of estimating the uncertainty in large-scale linear statistical inverse problems with high-dimensional parameter spaces within the framework of Bayesian inference. When the noise and prior probability densities are Gaussian, the solution to the inverse problem is also Gaussian, and is thus characterized by the mean and covariance matrix of the posterior probability density. Unfortunately, explicitly computing the posterior covariance matrix requires as many forward solutions as there are parameters, and is thus prohibitive when the forward problem is expensive and the parameter dimension is large. However, for many ill-posed inverse problems, the Hessian matrix of the data misfit term has a spectrum that collapses rapidly to zero. We present a fast method for computation of an approximation to the posterior covariance that exploits the lowrank structure of the preconditioned (by the prior covariance) Hessian of the data misfit. Analysis of an infinite-dimensional model convection-diffusion problem, and numerical experiments on large-scale 3D convection-diffusion inverse problems with up to 1.5 million parameters, demonstrate that the number of forward PDE solves required for an accurate low-rank approximation is independent of the problem dimension. This permits scalable estimation of the uncertainty in large-scale ill-posed linear inverse problems at a small multiple (independent of the problem dimension) of the cost of solving the forward problem.

97 MATHEMATICS AND COMPUTING↗

Run-time scheduling and execution of loops on message passing machines

Sparse system solvers and general purpose codes for solving partial differential equations are examples of the many types of problems whose irregularity can result in poor performance on distributed memory machines. Often, the data structures used in these problems are very flexible. Crucial details concerning loop dependences are encoded in these structures rather than being explicitly represented in the program. Good methods for parallelizing and partitioning these types of problems require assignment of computations in rather arbitrary ways. Naive implementations of programs on distributed memory machines requiring general loop partitions can be extremely inefficient. Instead, the scheduling mechanism needs to capture the data reference patterns of the loops in order to partition the problem. First, the indices assigned to each processor must be locally numbered. Next, it is necessary to precompute what information is needed by each processor at various points in the computation. The precomputed information is then used to generate an execution template designed to carry out the computation, communication, and partitioning of data, in an optimized manner. The design is presented for a general preprocessor and schedule executer, the structures of which do not vary, even though the details of the computation and of the type of information are problem dependent.

Crowley, Kay↗

Run-time scheduling and execution of loops on message passing machines

Sparse system solvers and general purpose codes for solving partial differential equations are examples of the many types of problems whose irregularity can result in poor performance on distributed memory machines. Often, the data structures used in these problems are very flexible. Crucial details concerning loop dependences are encoded in these structures rather than being explicitly represented in the program. Good methods for parallelizing and partitioning these types of problems require assignment of computations in rather arbitrary ways. Naive implementations of programs on distributed memory machines requiring general loop partitions can be extremely inefficient. Instead, the scheduling mechanism needs to capture the data reference patterns of the loops in order to partition the problem. First, the indices assigned to each processor must be locally numbered. Next, it is necessary to precompute what information is needed by each processor at various points in the computation. The precomputed information is then used to generate an execution template designed to carry out the computation, communication, and partitioning of data, in an optimized manner. The design is presented for a general preprocessor and schedule executer, the structures of which do not vary, even though the details of the computation and of the type of information are problem dependent.

Saltz, Joel↗

Description of Charge Radii in Halo Nuclei within the Gamow Shell Model

The charge radius of the halo nucleus {sup 6}He is studied within the framework of the Gamow Shell Model (GSM). The charge radius carries information about the size of the neutron halo, the recoil of the core, and the effective interaction between valence nucleons. The motivation for this work stems from the precise measurements of charge radii in {sup 6,8}He, {sup 11}Li, and {sup 11}Be. For these weakly bound nuclei, the proper treatment of the particle continuum turns out to be crucial. The GSM is a tool that can properly account for the coupling of the continuum space (of both resonant and scattering character) with that of the bound states. We use a GSM Hamiltonian written explicitly in intrinsic coordinates. This guarantees that the core recoil effect is properly described and the spurious center-of-mass motion is removed. According to our calculations for {sup 6}He, the charge radius is very sensitive to (i) the halo extent given by the two-neutron separation energy of the system, and (ii) the p{sub 3/2} occupation. In particular, we show that the two-body wave function of halo neutrons in {sup 6}He should contain {approx}91% of a p{sub 3/2} partial wave to reproduce the charge radius. This observation will help us to construct a GSM effective interaction on the interface of p and sd shells that is needed to describe other halo systems.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗