Search NASA⌕ Search

SEARCH · Search NASA

Results for “general linear methods”

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 1,639 records · Page 91

Exact results on diffusion in a piecewise linear potential with a time-dependent sink

The Smoluchowski equation with a time-dependent sink term is solved exactly. In this method, knowing the probability distribution P(0, s) at the origin, allows deriving the probability distribution P(x, s) at all positions. Exact solutions of the Smoluchowski equation are also provided in different cases where the sink term has linear, constant, inverse, and exponential variation in time.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

TNet: A Model-Constrained Tikhonov Network Approach for Inverse Problems

Deep learning (DL), in particular deep neural networks, by default is purely data-driven and in general does not require physics. This is the strength of DL but also one of its key limitations when applied to science and engineering problems in which underlying physical properties—such as stability, conservation, and positivity—and accuracy are required. DL methods in their original forms are often not capable of respecting the underlying mathematical models or achieving desired accuracy even in big-data regimes. On the other hand, many data-driven science and engineering problems, such as inverse problems, typically have limited experimental or observational data, and DL would overfit the data in this case. Leveraging information encoded in the underlying mathematical models, we argue, not only compensates for missing information in low data regimes but also provides opportunities to equip DL methods with the underlying physics, hence promoting better generalization. This paper develops a model-constrained DL approach and its variant TNet—a Tikhonov neural network—which are capable of learning not only information hidden in the training data but also in the underlying mathematical models to solve inverse problems governed by partial differential equations in low data regimes. We provide the constructions and some theoretical results for the proposed approaches for both linear and nonlinear inverse problems. Since TNet is designed to learn inverse solutions with Tikhonov regularization, it is interpretable: in fact it recovers Tikhonov solutions for linear cases while potentially approximating Tikhonov solutions for nonlinear inverse problems. We also prove that data randomization can enhance not only the smoothness of the networks but also their generalizations. Comprehensive numerical results confirm the theoretical findings and show that with even as little as 1 training data sample for one-dimensional (1D) deconvolution, 5 for an inverse 2D heat conductivity problem, 100 for inverse initial conditions for a time-dependent 2D Burgers’s equation, and 50 for inverse initial conditions for 2D Navier–Stokes equations, TNet solutions can be as accurate as Tikhonov solutions while being several orders of magnitude faster. Furthermore, this is possible owing to the model-constrained term, replications, and randomization.

97 MATHEMATICS AND COMPUTING↗

The use of Compton scattering in detecting anomaly in soil-possible use in pyromaterial detection

The Compton scattering is able to determine the signature of land mine detection based on dependency of density anomaly and energy change of scattered photons. In this study, 4.43 MeV gamma of the Am-Be source was used to perform Compton scattering. Two detectors were placed between source with distance of 8 cm and radius of 1.9 cm. Detectors of thallium-doped sodium iodide NaI(TI) was used for detecting gamma ray. There are 9 anomalies used in this simulation. The physical of anomaly is in cylinder form with radius of 10 cm and 8.9 cm height. The anomaly is buried 5 cm deep in the bed soil measured 80 cm radius and 53.5 cm height. Monte Carlo methods indicated the scattering of photons is directly proportional to density of anomalies. The difference between detector response with anomaly and without anomaly namely contrast ratio values are in a linear relationship with density of anomalies. Anomalies of air, wood and water give positive contrast ratio values whereas explosive, sand, concrete, graphite, limestone and polyethylene give negative contrast ratio values. Overall, the contrast ratio values are greater than 2 % for all anomalies. The strong contrast ratios result a good detection capability and distinction between anomalies.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Optimal Transfer Operators in Algebraic Two-Level Methods for Nonsymmetric and Indefinite Problems

Consider an algebraic two-level method applied to the 𝑛-dimensional linear system 𝐴⁢𝒙 = 𝒃 using fine-space preconditioner (i.e., “relaxation” or “smoother”) 𝑀, with 𝑀 ≈ 𝐴, restriction and interpolation 𝑅 and 𝑃, and algebraic coarse-space operator 𝐴 𝑐 : = 𝑅 ∗ ⁢𝐴⁢𝑃. Then, what are the best possible transfer operators 𝑅 and 𝑃 of a given dimension 𝑛 𝑐 < 𝑛? Brannick et al. [12] showed that when 𝐴 and 𝑀 are Hermitian positive definite (HPD), the optimal interpolation is such that its range contains the 𝑛 𝑐 smallest generalized eigenvectors of the matrix pencil (𝐴, 𝑀). Recently, in Ali et al. [5] we generalized this framework to the non-HPD setting, by considering both right (interpolation) and left (restriction) generalized eigenvectors of (𝐴, 𝑀) and defining corresponding nonsymmetric transfer operators {𝑅#, 𝑃#}. Tight convergence bounds for {𝑅#, 𝑃#} are derived in spectral radius, as well as a proof of pseudo-optimality. Note, {𝑅#, 𝑃#} are typically complex valued, which is not practical for real-valued problems. Here, in this work, we build on [5], first characterizing all inner products in which the coarse-space correction defined by {𝑅#, 𝑃#} is orthogonal. We then develop tight two-level convergence bounds in these norms, and prove that the underlying transfer operators {𝑅#, 𝑃#} are genuinely optimal. As a special case, our theory both recovers and extends the HPD results from [12]. Finally, we show how to construct optimal, real-valued transfer operators in the case of that 𝐴 and 𝑀 are real valued, but are not HPD. Numerical examples arising from a discretized advection-reaction equation, wave-equation, and Stokes equations are used to verify and illustrate the theory.

97 MATHEMATICS AND COMPUTING↗

Stability of new exact solutions of the nonlinear Schrödinger equation in a Pöschl–Teller external potential

Here, we discuss the stability properties of the solutions of the general nonlinear Schrödinger equation in 1 + 1 dimensions in an external potential derivable from a parity-time ($ \newcommand{\PT}{\mathcal{PT}} \PT$ ) symmetric superpotential $W(x)$ that we considered earlier in Kevrekidis et al (2015 Phys. Rev. E 92 042901). In particular we consider the nonlinear partial differential equation $ \{i \, \partial_t + \partial_x^2 - V(x) + g \vert \psi(x, t) \vert ^{2\kappa} \} \, \psi(x, t) = 0 \>, $ for arbitrary nonlinearity parameter κ, where $g= \pm1$ and V is the well known Pöschl–Teller potential which we allow to be repulsive as well as attractive. Using energy landscape methods, linear stability analysis as well as a time dependent variational approximation, we derive consistent analytic results for the domains of instability of these new exact solutions as a function of the strength of the external potential and κ. For the repulsive potential we show that there is a translational instability which can be understood in terms of the energy landscape as a function of a stretching parameter and a translation parameter being a saddle near the exact solution. In this case, numerical simulations show that if we start with the exact solution, the initial wave function breaks into two pieces traveling in opposite directions. If we explore the slightly perturbed solution situations, a 1% change in initial conditions can change significantly the details of how the wave function breaks into two separate pieces. For the attractive potential, changing the initial conditions by 1% modifies the domain of stability only slightly. For the case of the attractive potential and negative g perturbed solutions merely oscillate with the oscillation frequencies predicted by the variational approximation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Temperature Uncertainty Modeling with Proxy Structural Data as Geostatistical Constraints for Well Siting: An Example Applied to Granite Springs Valley, NV, USA

Utilizing existing temperature and structural information around Granite Springs Valley, Nevada, we build 3D stochastic temperature models with the aim of evaluating the 3D uncertainty of temperature and choosing between candidate exploration well locations . The data used to support the modeling are measured temperatures and structural proxies from 3D geologic modeling, the latter considered "secondary" data. Two stochastic geostatistical techniques are explored for incorporating the structural proxies: cosimulation and local varying mean. With both the cosimulation and local varying mean methods, many equally likely temperature models (i.e., realizations) are produced, from which temperature probability profiles are calculated at candidate well locations. To aid in choosing between the candidate locations, two quantities summarize the temperature probabilities: Vprior and entropy. Vprior quantifies the likelihood for economic temperatures at each candidate location, whereas entropy identifies where new information has the most potential to reduce uncertainty. In general, the cosimulation realizations have smoother spatial structure, and extrapolate high temperatures at candidate locations that are located along the direction of the longest spatial correlation, which are down dip from existing temperature logs. The smooth realizations result in tight temperature probability profiles that are easier to interpret, but they have unrealistic temperature reversals in some locations because the cosimulation technique does not enforce a conductive geothermal gradient as a baseline (i.e., linearly increasing temperature with depth). The local varying mean results produce realizations with more realistic geothermal gradients, with temperatures increasing downward since a depth-temperature relationship is included. However, because they have much noisier spatial nature compared to cosimulation, it is harder to interpret the temperature probability profiles. The different local varying mean results allow the geologist to determine which proxy (e.g., dilation versus distance to fault termination) should be used given the specific geothermal system. In general, Vprior from local varying mean results identify locations that are close to high values for the structural proxies: areas with highe r probabilities for higher temperatures. The entropy results identify where uncertainty is greatest and therefore new drilling information could be most useful. Though these techniques provide useful information, even when applied to areas of sparse data, our comp arison of these two techniques demonstrates the need for new geothermal geostatistics techniques that combine the advantages of these two methods and that are tailored to the spatial uncertainty issues inherent in geothermal exploration.

3D temperature modeling↗

Proving the achronal averaged null energy condition from the generalized second law

A null line is a complete achronal null geodesic. It is proven that for any quantum fields minimally coupled to semiclassical Einstein gravity, the averaged null energy condition (ANEC) on null lines is a consequence of the generalized second law of thermodynamics for causal horizons. This result is shown to leading order in Planck's constant for perturbations to classical backgrounds satisfying the null energy condition. Auxiliary assumptions include CPT and the existence of a suitable renormalization scheme for the generalized entropy. Although the ANEC can be violated on general geodesics in curved spacetimes, as long as the ANEC holds on null lines there exist theorems showing that semiclassical gravity should satisfy positivity of energy, topological censorship, and should not admit closed timelike curves. It is pointed out that these theorems fail once the linearized graviton field is quantized, because then the renormalized shear-squared term in the Raychaudhuri equation can be negative. A 'shear-inclusive' generalization of the ANEC is proposed to remedy this, and is proven under an additional assumption about perturbations to horizons in classical general relativity.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

NEUTRINO TRANSFER IN THREE DIMENSIONS FOR CORE-COLLAPSE SUPERNOVAE. I. STATIC CONFIGURATIONS

We develop a numerical code to calculate the neutrino transfer with multi-energy and multi-angle in three dimensions (3D) for the study of core-collapse supernovae. The numerical code solves the Boltzmann equations for neutrino distributions by the discrete-ordinate (S{sub n} ) method with a fully implicit differencing for time advance. The Boltzmann equations are formulated in the inertial frame with collision terms being evaluated to the zeroth order of v/c. A basic set of neutrino reactions for three neutrino species is implemented together with a realistic equation of state of dense matter. The pair process is included approximately in order to keep the system linear. We present numerical results for a set of test problems to demonstrate the ability of the code. The numerical treatments of advection and collision terms are validated first in the diffusion and free-streaming limits. Then we compute steady neutrino distributions for a background extracted from a spherically symmetric, general relativistic simulation of a 15 M{sub Sun} star and compare them with the results in the latter computation. We also demonstrate multi-dimensional capabilities of the 3D code solving neutrino transfers for artificially deformed supernova cores in 2D and 3D. Formal solutions along neutrino paths are utilized as exact solutions. We plan to apply this code to the 3D neutrino-radiation hydrodynamics simulations of supernovae. This is the first article in a series of reports on the development.

79 ASTRONOMY AND ASTROPHYSICS↗

The matrix product approximation for the dynamic cavity method

Stochastic dynamics of classical degrees of freedom, defined on vertices of locally tree-like graphs, can be studied in the framework of the dynamic cavity method which is exact for tree graphs. Such models correspond for example to spin-glass systems, Boolean networks, neural networks, and other technical, biological, and social networks. The central objects in the cavity method are edge messages—conditional probabilities of two vertex variable trajectories. In this paper, we discuss a rather pedagogical derivation for the dynamic cavity method, give a detailed account of the novel matrix product edge message (MPEM) algorithm for the solution of the dynamic cavity equation as introduced, and present optimizations and extensions. Matrix product approximations of the edge messages are constructed recursively in an iteration over time. Computation costs and precision can be tuned by controlling the matrix dimensions of the MPEM in truncations. Without truncations, the dynamics is exact. Data for Glauber–Ising dynamics shows a linear growth of computation costs in time. In contrast to Monte Carlo simulations, the approach has a much better error scaling. Hence, it gives for example access to low probability events and decaying observables like temporal correlations. Here, we discuss optimized truncation schemes and an extension that allows to capture models which have a continuum time limit.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Comparison of Fuel Loading Pattern Optimization Results using Exhaustive Search for Fresh Fuels and Local Search for Burned Fuels

Fuel loading pattern optimization is a combinatorial optimization problem from the mathematical point of view. However, exhaustive search is impractical because enormous computational cost is necessary due to huge search space. For this reason, various optimization methods have been developed so far, but no methods are able to guarantee to reach the optimum solution. In the present study, search space is divided into subspaces using key parameters that well represent characteristics of a loading pattern and then promising subspaces are extensively searched. In the present method, balance between division of a search space into subspaces and a search method used in a subspace is essential. For example, when the number of division is set to be one, it is equivalent to the exhaustive search thus is impractical. Similarly, when the division to subspaces is too coarse, an optimum (or near optimum) solution cannot be found through local search in each subspace since design space of a subspace is still too large. Contrary, if division to subspaces is too fine, number of subspaces becomes to large thus promising subspaces cannot be found. In the present study, search space is divided focusing on the location of fresh fuel assemblies with gadolinia since it has significant impact on core characteristics. Number of possible loading patterns of gadolinia bearing fresh fuel assemblies is not very large thus exhaustive search is possible. Local fine search is executed by considering location of burned fuels for each loading pattern of gadolinia bearing fresh fuel assembly. If the same solution is obtained by multiple local searches starting from different initial burnt fuel locations (but the same loading patterns for gadolinia bearing fresh fuel assemblies), the obtained solution is highly likely the optimum in the subspace. In more general, the present method is based on the 'divide and conquer' approach, which is familiar in the optimization field. Namely, after division of search space into subspaces and then promising subspace is searched. Once the promising subspace is found, the subspace is further subdivided into subspaces and repeat the above procedures. This method would be efficient when appropriate balance between search space division method and performance of local search is achieved. The previous works utilizes the similar approach. In reference [1], exhaustive search in small region in a core is carried out focusing on loading patterns of gadolinia bearing fresh fuel assemblies. In reference [2], rough exhaustive search based on the 'batch-wise' loading pattern is performed with the assist of the linear programming. By contrast, in the present study, exhaustive search is carried out for loading patterns of gadolinia bearing fresh fuel assemblies. The random Multi-start Local Search (MSLS) with the direct search or the exhaustive binary swap is used to find out optimal solutions in a subspace, which consists of loading patterns having the same arrangement of gadolinia bearing fresh fuel assemblies. (authors)

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

A spectral analysis of the domain decomposed Monte Carlo method for linear systems

The domain decomposed behavior of the adjoint Neumann-Ulam Monte Carlo method for solving linear systems is analyzed using the spectral properties of the linear operator. Relationships for the average length of the adjoint random walks, a measure of convergence speed and serial performance, are made with respect to the eigenvalues of the linear operator. In addition, relationships for the effective optical thickness of a domain in the decomposition are presented based on the spectral analysis and diffusion theory. Using the effective optical thickness, the Wigner rational approximation and the mean chord approximation are applied to estimate the leakage fraction of stochastic histories from a domain in the decomposition as a measure of parallel performance and potential communication costs. The one-speed, two-dimensional neutron diffusion equation is used as a model problem to test the models for symmetric operators. In general, the derived approximations show good agreement with measured computational results. (authors)

97 MATHEMATICS AND COMPUTING↗

Construction of approximate analytical solutions to a new class of non-linear oscillator equation

The principle of harmonic balance is invoked in the development of an approximate analytic model for a class of nonlinear oscillators typified by a mass attached to a stretched wire. By assuming that harmonic balance will hold, solutions are devised for a steady state limit cycle and/or limit point motion. A method of slowly varying amplitudes then allows derivation of approximate solutions by determining the form of the exact solutions and substituting into them the lowest order terms of their respective Fourier expansions. The latter technique is actually a generalization of the method proposed by Kryloff and Bogoliuboff (1943).

Mickens, R. E.↗

Battery Charge Curve Prediction via Feature Extraction and Supervised Machine Learning

Real-time onboard state monitoring and estimation of a battery over its lifetime is indispensable for the safe and durable operation of battery-powered devices. In this study, a methodology to predict the entire constant-current cycling curve with limited input information that can be collected in a short period of time is developed. A total of 10 066 charge curves of LiNiO 2 -based batteries at a constant C-rate are collected. With the combination of a feature extraction step and a multiple linear regression step, the method can accurately predict an entire battery charge curve with an error of < 2% using only 10% of the charge curve as the input information. The method is further validated across other battery chemistries (LiCoO 2 -based) using open-access datasets. The prediction error of the charge curves for the LiCoO 2 -based battery is around 2% with only 5% of the charge curve as the input information, indicating the generalization of the developed methodology for predicting battery cycling curves. The developed method paves the way for fast onboard health status monitoring and estimation for batteries during practical applications.

25 ENERGY STORAGE↗

SU-F-P-09: A Global Medical Physics Collaboration for Implementation of Modern Radiotherapy in Botswana

Purpose: The global burden of cancer is considerable, particularly in low and middle-income countries. Massachusetts General Hospital (MGH) and Botswana-Harvard AIDS Institute have partnered with the oncology community and government of Botswana to form BOTSOGO (BOTSwana Oncology Global Outreach) to address the rising burden of cancer in Botswana. Currently, radiation therapy (RT) is only available at a single linear accelerator (LINAC) in Gaborone Private Hospital (GPH). BOTSOGO worked to limit the absence of RT during a LINAC upgrade and ensure a safe transition to modern radiotherapy techniques. Methods: The existing Elekta Precise LINAC was decommissioned in November 2015 and replaced with a new Elekta VERSA-HD with IMRT/VMAT/CBCT capability. Upgraded treatment planning and record-and-verify systems were also installed. Physicists from GPH and MGH collaborated during an intensive on-site visit in Botswana during the commissioning process. Measurements were performed using newly purchased Sun Nuclear equipment. Photon beams were matched with an existing model to minimize the time needed for beam modeling and machine down time. Additional remote peer review was also employed. Independent dosimetry was performed by irradiating OSLDs, which were subsequently analyzed at MGH. Results: Photon beam quality agreed with reference data within 0.2%. Electron beam data agreed with example clinical data within 3%. Absolute dose calibration was performed using both IAEA and AAPM protocols. Absolute dose measurements with OSLDs agreed within 5%. Quentry cloud-based software was installed to facilitate remote review of treatment plans. Patient treatments resumed in February 2016. The time without RT was reduced, therefore likely resulting in reduced patient morbidity/mortality. Conclusion: A global physics collaboration was utilized to commission a modern LINAC in a resource-constrained setting. This can be a useful model in other areas with limited resources. Further use of technology and on-site exchanges will facilitate the introduction of more advanced techniques in Botswana. We acknowledge funding support from the AAPM International Educational Activities Committee and the NCI Federal Share Proton Beam Program Income Grant.

60 APPLIED LIFE SCIENCES↗

Numerical Methods for Large-Scale Data Factorization (Final Report (Milestone Date 9/30/11) for Subcontract No. B594099)

The following work has been performed by PI Hans De Sterck and graduate student Manda Winlaw for the required tasks 1-5 (as listed in the Statement of Work). Graduate student Manda Winlaw has visited LLNL January 31-March 11, 2011 and May 23-August 19, 2010, working with Van Henson and Mike O'Hara on non-negative matrix factorizations (NMF). She has investigated the dense subgraph clustering algorithm from 'Finding Dense Subgraphs for Sparse Undirected, Directed, and Bipartite Graphs' by Chen and Saad, testing this method on several term-document matrices and adapting it to cluster based on the rank of the subgraphs instead of the density. Manda Winlaw was awarded a first prize in the annual LLNL summer student poster competition for a poster on her NMF research. PI Hans De Sterck has developed a new adaptive algebraic multigrid algorithm for computing a few dominant or minimal singular triplets of sparse rectangular matrices. This work builds on adaptive algebraic multigrid methods that were further developed by the PI and collaborators (including Sanders and Henson) for Markov chains. The method also combines and extends existing multigrid algorithms for the symmetric eigenproblem. The PI has visited LLNL February 22-25, 2011, and has given a CASC seminar 'Algebraic Multigrid for the Singular Value Problem' on this work on February 23, 2011. During his visit, he has discussed this work and related topics with Van Henson, Geoffrey Sanders, Panayot Vassilevski, and others. He has tested the algorithm on PDE matrices and on a term-document matrix, with promising initial results. Manda Winlaw has also started to work, with O'Hara, on estimating probability distributions over undirected graph edges. The goal is to estimate probabilistic models from sets of undirected graph edges for the purpose of prediction, anomaly detection and support to supervised learning. Graduate student Manda Winlaw is writing a paper on the results obtained with O'Hara which will be submitted some time later in 2011 to a data mining conference. PI Hans De Sterck has developed a new optimization algorithm for canonical tensor approximation, formulating an extension of the nonlinear GMRES method to optimization problems. Numerical results for tensors with up to 8 modes show that this new method is efficient for sparse and dense tensors. He has written a paper on this which has been submitted to the SIAM Journal on Scientific Computing. PI Hans De Sterck has further developed his new optimization algorithm for canonical tensor approximation, formulating an extension in terms of steepest-descent preconditioning, which makes the approach generally applicable for nonlinear optimization. He has written a paper on this extension which has been submitted to Numerical Linear Algebra with Applications.

97 MATHEMATICS AND COMPUTING↗

Utilization of EREP data in geological evaluation, regional planning, forest management, and water management in North Carolina

The author has identified the following significant results. Skylab imagery was evaluated, compiling vegetational and land use information in conjunction with a potential state park site fin along the Eno River in Durham County. Preliminary evaluation indicates that accuracy of identification was at the 90% level. Attempts at distinguishing between rock types in the Piedmont have proved generally unsuccessful, and recognition of linear features seems the best geologic use which the imagery can be put. The study concentrated on the High Rock Lake area of Davidson County. A study evaluating Skylab photographs for land use mapping in urban and rural areas of Piedmont North Carolina shows that S190A and S190B as well as U-2 imagery have almost the same accuracy when the interpretations are assessed with the square grid sampling method, even though the S190B imagery basically has a greater resolution.

Welby, C. W.↗

ADS: A FORTRAN program for automated design synthesis: Version 1.10

A new general-purpose optimization program for engineering design is described. ADS (Automated Design Synthesis - Version 1.10) is a FORTRAN program for solution of nonlinear constrained optimization problems. The program is segmented into three levels: strategy, optimizer, and one-dimensional search. At each level, several options are available so that a total of over 100 possible combinations can be created. Examples of available strategies are sequential unconstrained minimization, the Augmented Lagrange Multiplier method, and Sequential Linear Programming. Available optimizers include variable metric methods and the Method of Feasible Directions as examples, and one-dimensional search options include polynomial interpolation and the Golden Section method as examples. Emphasis is placed on ease of use of the program. All information is transferred via a single parameter list. Default values are provided for all internal program parameters such as convergence criteria, and the user is given a simple means to over-ride these, if desired.

Vanderplaats, G. N.↗

A decentralized square root information filter/smoother

A number of developments has recently led to a considerable interest in the decentralization of linear least squares estimators. The developments are partly related to the impending emergence of VLSI technology, the realization of parallel processing, and the need for algorithmic ways to speed the solution of dynamically decoupled, high dimensional estimation problems. A new method is presented for combining Square Root Information Filters (SRIF) estimates obtained from independent data sets. The new method involves an orthogonal transformation, and an information matrix filter 'homework' problem discussed by Schweppe (1973) is generalized. The employed SRIF orthogonal transformation methodology has been described by Bierman (1977).

Bierman, G. J.↗