Search NASA⌕ Search

SEARCH · Search NASA

Results for “Initialization method”

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 109 records · Page 6
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Fragment-based initialization for quantum subspace methods

Here, we present a novel quantum-classical algorithm called LAS-QKSD for multireference systems, by combining a classical localized active space (LAS) fragment-based multireference algorithm with the quantum Krylov subspace diagonalization (QKSD) method for quantum computers. The algorithm uses wave function information from a LAS self-consistent field (LASSCF) calculation to prepare an initial state with better overlap with the target ground state than the Hartree-Fock state. This is coupled with the use of QKSD to ultimately converge to the exact energy, providing faster convergence than starting from the Hartree-Fock state. Fragmentation has the two-fold benefit of fewer configurations on the classical side of the algorithm as well as fewer state preparation gates on the quantum side. First, we compare the LAS-QKSD method to the classical LASSCF method and to QKSD with a Hartree-Fock initial state. We then examine ways to load the LASSCF wave function using direct initialization and a QKSD-motivated spectral filtering approach. Finally, using a bimetallic complex, we show that the LAS-QKSD method is an efficient alternative to highly expensive complete active space SCF (CASSCF) calculations on strongly correlated systems.

D'Cunha, Ruhee↗
DOE OSTI2024

Functional stimuli-responsive polymers on micro- and nano-patterned interfaces

Micro- and nano-patterned surfaces offer precise control over morphology and chemical composition, enhancing the stability, durability, and functionality of coating materials. When combined with stimuli-responsive polymers, these surfaces gain dynamic adaptability, enabling reversible binding, reusable sensing, and selective molecular capture. Furthermore, while recent review articles have explored various aspects of stimuli-responsive materials, from hydrogel patterns for bioanalytical applications to shape-morphing hydrogels for soft robotics and sensors, a comprehensive review focused on the integration of smart polymers with micro- or nano-patterned interfaces remains absent. This review addresses key surface patterning techniques, including soft lithography, colloidal lithography, and polymer brush photolithography, as well as advances in surface-initiated polymerization methods, such as surface-initiated controlled radical polymerization (SI-CRP). In addition, we discuss recent progress in integrating stimuli-responsive polymers with patterned surfaces to create advanced, functional materials.

Colloidal lithography↗
NASA NTRS1976

Generalized Du Fort-Frankel methods for parabolic initial-boundary value problems

The Du Fort-Frankel difference scheme is generalized to difference operators of arbitrary high order accuracy in space and to arbitrary order of the parabolic differential operator. Spectral methods can also be used to approximate the spatial part of the differential operator. The scheme is explicit, and it is unconditionally stable for the initial value problem. Stable boundary conditions are given for two different fourth order accurate space approximations.

Gottlieb, D.↗
NASA NTRS1998

Initial Results of an MDO Method Evaluation Study

The NASA Langley MDO method evaluation study seeks to arrive at a set of guidelines for using promising MDO methods by accumulating and analyzing computational data for such methods. The data are collected by conducting a series of re- producible experiments. In the first phase of the study, three MDO methods were implemented in the SIGHT: framework and used to solve a set of ten relatively simple problems. In this paper, we comment on the general considerations for conducting method evaluation studies and report some initial results obtained to date. In particular, although the results are not conclusive because of the small initial test set, other formulations, optimality conditions, and sensitivity of solutions to various perturbations. Optimization algorithms are used to solve a particular MDO formulation. It is then appropriate to speak of local convergence rates and of global convergence properties of an optimization algorithm applied to a specific formulation. An analogous distinction exists in the field of partial differential equations. On the one hand, equations are analyzed in terms of regularity, well-posedness, and the existence and unique- ness of solutions. On the other, one considers numerous algorithms for solving differential equations. The area of MDO methods studies MDO formulations combined with optimization algorithms, although at times the distinction is blurred. It is important to

Alexandrov, Natalia M.↗
NASA NTRS1986

Stability analysis of spectral methods for hyperbolic initial-boundary value systems

A constant coefficient hyperbolic system in one space variable, with zero initial data is discussed. Dissipative boundary conditions are imposed at the two points x = + or - 1. This problem is discretized by a spectral approximation in space. Sufficient conditions under which the spectral numerical solution is stable are demonstrated - moreover, these conditions have to be checked only for scalar equations. The stability theorems take the form of explicit bounds for the norm of the solution in terms of the boundary data. The dependence of these bounds on N, the number of points in the domain (or equivalently the degree of the polynomials involved), is investigated for a class of standard spectral methods, including Chebyshev and Legendre collocations.

Gottlieb, D.↗
NASA NTRS2000

Solving ODE Initial Value Problems With Implicit Taylor Series Methods

In this paper we introduce a new class of numerical methods for integrating ODE initial value problems. Specifically, we propose an extension of the Taylor series method which significantly improves its accuracy and stability while also increasing its range of applicability. To advance the solution from t (sub n) to t (sub n+1), we expand a series about the intermediate point t (sub n+mu):=t (sub n) + mu h, where h is the stepsize and mu is an arbitrary parameter called an expansion coefficient. We show that, in general, a Taylor series of degree k has exactly k expansion coefficients which raise its order of accuracy. The accuracy is raised by one order if k is odd, and by two orders if k is even. In addition, if k is three or greater, local extrapolation can be used to raise the accuracy two additional orders. We also examine stability for the problem y'= lambda y, Re (lambda) less than 0, and identify several A-stable schemes. Numerical results are presented for both fixed and variable stepsizes. It is shown that implicit Taylor series methods provide an effective integration tool for most problems, including stiff systems and ODE's with a singular point.

Scott, James R.↗
NASA NTRS1977

Initial development of a method of significant waveheight estimation for GEOS-III

The numerical method by which ocean surface significant waveheight estimates are produced from the GEOS-3 radar altimeter data is described. Four parameters characterizing the expected radar mean return waveform are determined from the altimeter's sixteen sample-and-hold waveform samplers through use of an iterative, least squares approach. One of the four parameters is a risetime term which has contributions from both the transmitted radar pulse width and the rms ocean surface height; the estimated significant waveheight is extracted from this risetime. The noise character of the estimation process leads to occasional negative significant waveheight estimates, and the origin of these nonphysical negative results is discussed. Possible modifications and areas for additional investigation are indicated.

Hayne, G. S.↗
NASA NTRS1991

Application of multiple criteria decision methods in space exploration initiative design and planning

Fellowship activities were directed towards the identification of opportunities for application of the Multiple Criteria Decision Making (MCDM) techniques in the Space Exploration Initiative (SEI) domain. I identified several application possibilities and proposed demonstration application in these three areas: evaluation and ranking of SEI architectures, space mission planning and selection, and space system design. Here, only the first problem is discussed. The most meaningful result of the analysis is the wide separation between the two top ranked architectures, indicating a significant preference difference between them. It must also be noted that the final ranking reflects, to some extent, the biases of the evaluators and their understanding of the architecture.

Masud, Abu S. M.↗
NASA NTRS1993

Initialization of a modeled convective storm using Doppler radar-derived fields

A method is developed to initialize convective storm simulations with Doppler radar-derived fields. Input fields for initialization include velocity, rainwater derived from radar reflectivity, and pressure and temperature fields obtained through thermodynamic retrieval. A procedure has been developed to fill in missing wind data, followed by a variational adjustment to the filled wind field to minimize 'shocks' that would otherwise cause the simulated fields to deteriorate rapidly. A series of experiments using data from a simulated storm establishes the feasibility of the initialization method. Multiple-Doppler radar observations from the 20 May 1977 Del City tornadic storm are used for the initialization experiments. Simulation results are shown and compared to observations taken at a later time. The simulated storm shows good agreement with the subsequent observations, though the simulated storm appears to be evolving faster than observed. Possible reasons for the discrepancies are discussed.

Lin, Ying↗
DOE OSTI2025

Quantum Simulation of Molecular Dynamics Processes─A Benchmark Study Using a Classical Simulator and Present-Day Quantum Hardware

Here, we explore how the fundamental problems in quantum molecular dynamics can be modeled using classical simulators (emulators) of quantum computers and the actual quantum hardware available to us today. The list of problems we tackle includes propagation of a free wave packet, vibration of a harmonic oscillator, and tunneling through a barrier. Each of these problems starts with the initial wave packet setup. Although Qiskit provides a general method for initializing wave functions, in most cases it generates deep quantum circuits. While these circuits perform well on noiseless simulators, they suffer from excessive noise on quantum hardware. To overcome this issue, we designed a shallower quantum circuit for preparing a Gaussian-like initial wave packet, which improves the performance of real hardware. Next, quantum circuits are implemented to apply the kinetic and potential energy operators for the evolution of a wave function over time. The results of our modeling on classical emulators of quantum hardware agree perfectly with the results obtained using the traditional (classical) methods. This serves as a benchmark and demonstrates that the quantum algorithms and Qiskit codes we developed are accurate. However, the results obtained on the actual quantum hardware available today, such as IBM’s superconducting qubits and IonQ’s trapped ions, indicate large discrepancies due to hardware limitations. This work highlights both the potential and challenges of using quantum computers to solve fundamental quantum molecular dynamics problems.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
NASA NTRS1971

An analysis and comparison of several trajectory optimization methods

The sensitivities of the convergence characteristics of the methods to initially assumed parameters and trial solution, convergence times, computer logic, and storage requirements are discussed. Numerical comparison of the convergence characteristics is made by considering a minimum time, low thrust, Earth-Mars transfer trajectory. A modified quasi-linearization method reduces convergence time by approximately 70% when compared with the generalized Newton-Raphson method and allows the terminal boundary to be specified by a general function of the problem variables. A uniquely specified and easily determined, time dependent weighting matrix for the gradient techniques accelerates the shaping of the optimal control program and improves the convergence characteristics during the terminal iterations. Convergence envelopes, indicating how sensitive the convergence characteristics are to initially assumed parameters, are plotted for the perturbation and quasi-linearization methods. Several iteration schemes are proposed which increase the size of the convergence envelopes and decrease the sensitivity of the method to initially assumed parameters.

Lewallen, J. M.↗
NASA NTRS1980

Initial boundary value problems for the method of lines

This paper treats the stability of the initial boundary value problem for the method of lines applied to hyperbolic and parabolic partial differential equations in one space dimension. The theory treats the case of variable coefficients and allows for very general boundary conditions. Several examples are given which illustrate the theory. The theory is analogous to that developed by Gustafsson, Kreiss, and Sundstrom for finite-difference methods.

Strikwerda, J. C.↗
DOE OSTI2025

Adaptive Interface-PINNs (AdaI-PINNs) for transient diffusion: Applications to forward and inverse problems in heterogeneous media

We model transient diffusion in heterogeneous materials using a novel physics-informed neural networks framework (PINNs) termed Adaptive interface physics-informed neural networks or AdaI-PINNs (Roy et al. arXiv preprint arXiv:2406.04626, 2024). AdaI-PINNs utilize different activation functions with trainable slopes tailored to each material region within the computational domain, allowing for a fully automated and adaptive PINNs approach to model interface problems with strongly and weakly discontinuous solutions. To enhance its performance in highly heterogeneous transient diffusion systems, we prescribe a suite of robust practices, including appropriate non-dimensionalization of equations, a biased sampling method, Glorot initialization, and the hard enforcement of boundary and initial conditions. Here we evaluate the efficacy of the proposed method on several benchmark forward and inverse problems. Comparative studies on one-dimensional and two-dimensional benchmark problems reveal that the modified AdaI-PINNs outperform its unmodified counterpart, achieving root-mean-square errors that are at least two orders of magnitude better in forward problems. For inverse problems, the maximum errors in the approximated diffusion coefficients by modified AdaI-PINNs are four orders of magnitude better than those of the unmodified version. Additionally, modified AdaI-PINNs demonstrate improved stability in problems with large material mismatches.

42 ENGINEERING↗
NASA NTRS1991

Inverse problems in diffraction

A two-dimensional problem of diffraction of a plane electromagnetic wave on a smooth 2 pi-periodic surface is considered. A numerical algorithm solving this problem is developed. An inverse problem of determination of the shape of 2 pi-periodic surface using the performance data of reverse scattering is considered. The inverse problem was solved by means of minimization of the residual functional with the help of the gradient descent method. The initial data were calculated with the help of the numerical method. On each step of the iterative method of minimization, the residual functional was calculated approximately with the help of the small slope method. The examples of the shape determination are considered.

Mikheev, Andrew G.↗
DOE OSTI2025

Triangle Method for Dense ReLU Layers [SWR-25-72]

This software is an implementation of the methods for initializing and training neural networks to be more efficient per parameter, described more fully below and in the related publication: In theory, depth should make a ReLU network EXPONENTIALLY more efficient by enabling it to produce an exponential number of piecewise linear sections in its output. This reasoning is largely based on the work of mathematicians that have hand-constructed networks that make good use of depth. In practice however, even very deep ReLU networks that have been randomly initialized will behave identically to their shallow counterparts - missing an entire exponential dimension of efficiency. The triangle method is a first attempt at realizing the exponential potential of deep networks. Instead of randomly setting weights, we force pairs of neurons in each layer learn to build triangles (i.e. functions from [0,1] -> [0,1] that look like triangles). This is a very efficient pattern for generating lots of linear pieces because composing two triangular functions doubles the number of pieces with each composition. The triangle method is more than just a different initialization, it is a new paradigm of training. Instead of making direct updates to the matrix weights, we do an extra step of backpropagation to collect the derivatives of the loss function with respect to the shapes of the triangles, training them to tilt left or right. This process essentially holds the networks hand throughout the loss landscape and forces it to always use depth effectively by producing triangular shapes internally. This can produce several orders of magnitude of improvement on convex one-dimensional regression problems. Much more theoretical work is needed to realize its full potential beyond this context, but the implementation in this repository will still work in arbitrary numbers of dimensions. The file Triangle_Method.py is a generalized form of the method that will build each neuron its own custom 1-d convex activation function (with exponential efficiency). Example usage on one dimensional problems can be found in Example_Usage.ipynb and an example of using this in a real neural network can be found in Example_VGG16_CIFAR10.ipynb.

Milkert, Max [National Renewable Energy Laboratory↗