Search NASA⌕ Search

SEARCH · Search NASA

Results for “mathematical regularization”

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 217 records · Page 12
All sourcesNASA NTRSDOE OSTI
DOE OSTI2019

A Regularized Entropy-Based Moment Method for Kinetic Equations

Here, we present a new entropy-based moment method for the velocity discretization of kinetic equations. This method is based on a regularization of the optimization problem defining the original entropy-based moment method, and this gives the new method the advantage that the moment vectors of the solution do not have to take on realizable values. We show that this equation still retains many of the properties of the original equations, including hyperbolicity, an entropy-dissipation law, and rotational invariance. The cost of the regularization is mismatch between the moment vector of the solution and that of the ansatz returned by the regularized optimization problem. However, we show how to control this error using the parameter defining the regularization. This suggests that with proper choice of the regularization parameter, the new method can be used to generate accurate solutions of the original entropy-based moment method, and we confirm this with numerical simulations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Utilizing Weak Indicators to Detect Anomalous Behaviors in Networks

We consider the use of a novel weak in- dicator alongside more commonly used weak indicators to help detect anomalous behavior in a large computer network. The data of the network which we are studying in this research paper concerns remote log-in information (Virtual Private Network, or VPN sessions) from the internal network of Los Alamos National Laboratory (LANL). The novel indicator we are utilizing is some- thing which, while novel in its application to data science/cyber security research, is a concept borrowed from the business world. The Her ndahl-Hirschman Index (HHI) is a computationally trivial index which provides a useful heuristic for regulatory agencies to ascertain the relative competitiveness of a particular industry. Using this index as a lagging indicator in the monthly format we have studied could help to detect anomalous behavior by a particular or small set of users on the network. Additionally, we study indicators related to the speed of movement of a user based on the physical location of their current and previous logins. This data can be ascertained from the IP addresses of the users, and is likely very similar to the fraud detection schemes regularly utilized by credit card networks to detect anomalous activity. In future work we would look to nd a way to combine these indicators for use as an internal fraud detection system.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1979

Voyager high gain antenna calibration and pointing

A mathematical description of the data reduction technique used in analyzing Voyager calibration data is presented. To achieve the required telecommunication link performance, highly accurate pointing of the Voyager high gain antenna boresight relative to earth is necessary. To provide the optimum pointing, in-flight calibrations of the high gain antenna pointing mechanism are regularly made, and the design of the calibration and the antenna error models is delineated. It is shown that due to the use of wide angle sun sensors for celestial attitude control, the Voyager antenna error model differs from those of previous missions. Results of the in-flight calibrations and their implementation in improving the antenna pointing are also presented.

Jahanshahi, M. H.↗
DOE OSTI2017

An Immersed Boundary method with divergence-free velocity interpolation and force spreading

The Immersed Boundary (IB) method is a mathematical framework for constructing robust numerical methods to study fluid–structure interaction in problems involving an elastic structure immersed in a viscous fluid. The IB formulation uses an Eulerian representation of the fluid and a Lagrangian representation of the structure. The Lagrangian and Eulerian frames are coupled by integral transforms with delta function kernels. The discretized IB equations use approximations to these transforms with regularized delta function kernels to interpolate the fluid velocity to the structure, and to spread structural forces to the fluid. It is well-known that the conventional IB method can suffer from poor volume conservation since the interpolated Lagrangian velocity field is not generally divergence-free, and so this can cause spurious volume changes. In practice, the lack of volume conservation is especially pronounced for cases where there are large pressure differences across thin structural boundaries. The aim of this paper is to greatly reduce the volume error of the IB method by introducing velocity-interpolation and force-spreading schemes with the properties that the interpolated velocity field in which the structure moves is at least $\mathscr{C}$ 1 and satisfies a continuous divergence-free condition, and that the force-spreading operator is the adjoint of the velocity-interpolation operator. We confirm through numerical experiments in two and three spatial dimensions that this new IB method is able to achieve substantial improvement in volume conservation compared to other existing IB methods, at the expense of a modest increase in the computational cost. Further, the new method provides smoother Lagrangian forces (tractions) than traditional IB methods. Finally, the method presented here is restricted to periodic computational domains. Its generalization to non-periodic domains is important future work.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2024

Automated Detection of Spurious Signals in VLBI Phase Calibration Data

In this memorandum, a set of processing strategies for automatic masking of phase calibration tones is outlined as implemented in the software package PIMA in the task Generate Phase Calibration Mask, or GEPM. The task relies on a robust procedure of cleaning phase calibration data before employing several mathematical strategies designed to selectively identify spurious signals from phase calibration tones. These strategies were derived as more rigorous implementations of heuristics traditionally used by analysts in manually identifying problematic phase calibration data. The task is intended to automate the process of generating a phase calibration mask and in so doing increase the speed and regularity of VLBI analysis. At the outset of the project, a series of goals were identified to evaluate the success of this mask generation. This included the development of an algorithm to identify and mask short-term (defined as less than 10 seconds in length) spurious signals affecting phase calibration data, the development of an algorithm to identify and mask phase calibration tones affected by constant radio-frequency interference, the implementation of a detection scheme for identifying large jumps in phase calibration phase caused by clock breaks, and finally a method of reporting phase calibration health metrics to the user. Processing of over 10 experiments has demonstrated that the final form of the task GEPM as detailed in this technical memorandum satisfies each of these conditions and satisfactorily performs the task of automatic phase calibration data masking, although the wide variety in quality and characteristics of phase calibration data makes a single solution to the problem quite difficult. A series of user inputs have therefore been defined to assist analysts in tailoring automatic masking to specific stations and phase calibration generators. The vast majority of applicable code was written in FORTRAN to increase execution speed and ease of interfacing with the existing code base in PIMA, but a wrapper function in Python was also written to allow for a simpler method of interacting with GEPM and inputting relevant parameters. In addition to this report, thorough documentation was added to the already existing repositories associated with PIMA as a whole.

Geodesy↗
DOE OSTI2018

The parameter choice rules for weighted Tikhonov regularization scheme

The well-known approach to solve the ill-posed problem is Tikhonov regularization scheme. But, the approximate solution of Tikhonov scheme may not contain all the details of the exact solution. To circumference this problem, weighted Tikhonov regularization has been introduced. In this article, we propose two a posteriori parameter choice rules to choose the regularization parameter for weighted Tikhonov regularization and establish the optimal rate of convergence O(δ{sup ((α+1)/(α+2))}) for the scheme based on these proposed rules. The numerical results are documented to demonstrate the significance of the theoretical results.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1995

Formal methods in the design of Ada 1995

Formal, mathematical methods are most useful when applied early in the design and implementation of a software system--that, at least, is the familiar refrain. I will report on a modest effort to apply formal methods at the earliest possible stage, namely, in the design of the Ada 95 programming language itself. This talk is an 'experience report' that provides brief case studies illustrating the kinds of problems we worked on, how we approached them, and the extent (if any) to which the results proved useful. It also derives some lessons and suggestions for those undertaking future projects of this kind. Ada 95 is the first revision of the standard for the Ada programming language. The revision began in 1988, when the Ada Joint Programming Office first asked the Ada Board to recommend a plan for revising the Ada standard. The first step in the revision was to solicit criticisms of Ada 83. A set of requirements for the new language standard, based on those criticisms, was published in 1990. A small design team, the Mapping Revision Team (MRT), became exclusively responsible for revising the language standard to satisfy those requirements. The MRT, from Intermetrics, is led by S. Tucker Taft. The work of the MRT was regularly subject to independent review and criticism by a committee of distinguished Reviewers and by several advisory teams--for example, the two User/Implementor teams, each consisting of an industrial user (attempting to make significant use of the new language on a realistic application) and a compiler vendor (undertaking, experimentally, to modify its current implementation in order to provide the necessary new features). One novel decision established the Language Precision Team (LPT), which investigated language proposals from a mathematical point of view. The LPT applied formal mathematical analysis to help improve the design of Ada 95 (e.g., by clarifying the language proposals) and to help promote its acceptance (e.g., by identifying a verifiable subset that would meet the needs of safety-critical applications). The first LPT project, which ran from the fall of 1990 unti the end of 1992, produced studies of several language issues: optimization, sharing and storage, tasking and protected records, overload resolution, the floating point model, distribution, program erros, and object-oriented programming. The second LPT project, in 1994, formally modeled the dynamic semantics of a large part of the (almost) final language definition, looking especially for interactions between language features.

Guaspari, David↗
DOE OSTI2024

Clustering and Cliques in Preferential Attachment Random Graphs with Edge Insertion

In this paper, we investigate the global clustering coefficient (a.k.a transitivity) and clique number of graphs generated by a preferential attachment random graph model with an additional feature of allowing edge connections between existing vertices. Specifically, at each time step t, either a new vertex is added with probability f(t), or an edge is added between two existing vertices with probability 1 – f(t). We establish concentration inequalities for the global clustering and clique number of the resulting graphs under the assumption that f(t) is a regularly varying function at infinity with index of regular variation –$\gamma$, where $\gamma$ $\in$ [0, 1). Finally, we also demonstrate an inverse relation between these two statistics: the clique number is essentially the reciprocal of the global clustering coefficient.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

LANL Workforce Reporting Tool

The LANL Workforce Reporting Tool compiles and analyzes workforce demographics and attributes as presented in the annual Stockpile and Stewardship Management Plan (SSMP) over FY15-21 using MicroStrategy, a data analytics and visualization software. There are three major employee populations included in the tool: 1) LANL’s regular (permanent) employees; 2) LANL’s entire workforce (regular, craft, contractors, students, post doctorate students, limited term employees, and lab associates); 3) The Nuclear Security Enterprise’s (NSE) permanent career employees (combined and site-by-site).

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

QUIC-DEPDOSE: Software tools to prepare for and respond to nuclear emergencies

QUIC-DEPDOSE is a software application that calculates radiation doses from inhalation of radionuclides downstream from an atmospheric radiological release. Unlike other radiological modeling software, QUIC-DEPDOSE can provide accurate dose information in as little as an hour running on a regular laptop, allowing for use by emergency responders after an accident.

61 RADIATION PROTECTION AND DOSIMETRY↗
NASA NTRS1988

Unsteady three-dimensional flow separation

A concise mathematical framework is constructed to study the topology of steady 3-D separated flows of an incompressible, or a compressible viscous fluid. Flow separation is defined by the existence of a stream surface which intersects with the body surface. The line of separation is itself a skin-friction line. Flow separation is classified as being either regular or singular, depending respectively on whether the line of separation contains only a finite number of singular points or is a singular line of the skin-friction field. The special cases of 2-D and axisymmetric flow separation are shown to be of singular type. In regular separation it is shown that a line of separation originates from a saddle point of separation of the skin-friction field and ends at nodal points of separation. Unsteady flow separation is defined relative to a coordinate system fixed to the body surface. It is shown that separation of an unsteady 3-D incompressible viscous flow at time t, when viewed from such a frame of reference, is topologically the same as that of the fictitious steady flow obtained by freezing the unsteady flow at the instant t. Examples are given showing effects of various forms of flow unsteadiness on flow separation.

Hui, W. H.↗
DOE OSTI2017

Adjoint-Based Constant-Mass Partial Derivatives

It is well known that the adjoint equation in transport theory provides an economical means of computing derivatives of a system response to system parameters. It is also well known, though not often remarked on, that adjoint-based partial derivatives with respect to mass density are constant-volume derivatives. Likewise, adjoint-based partial derivatives with respect to dimensions (i.e., internal interface locations and the outer system boundary) are constant-density derivatives. In this paper, we derive a formula for the constant-mass partial derivative of a response with respect to internal interface locations and the outer system boundary. The formula uses the partial derivatives for density and dimensions, which may be adjoint-based. This paper includes numerical comparisons for a two-dimensional (r-z) cylinder that also demonstrate the correctness of the regular adjoint-based derivatives for surface locations. Adjoint-based derivatives for the neutron problems were computed using the new SENSMG code at Los Alamos National Laboratory.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2019

Epi-Regularization of Risk Measures

Uncertainty pervades virtually every branch of science and engineering, and in many disciplines, the underlying phenomena can be modeled by partial differential equations (PDEs) with uncertain or random inputs. This work is motivated by risk-averse stochastic programming problems constrained by PDEs. These problems are posed in infinite dimensions, which leads to a significant increase in the scale of the (discretized) problem. In order to handle the inherent nonsmoothness of, for example, coherent risk measures and to exploit existing solution techniques for smooth, PDE-constrained optimization problems, we propose a variational smoothing technique called epigraphical (epi-)regularization. Here, we investigate the effects of epi-regularization on the axioms of coherency and prove differentiability of the smoothed risk measures. In addition, we demonstrate variational convergence of the epi-regularized risk measures and prove the consistency of minimizers and first-order stationary points for the approximate risk-averse optimization problem. We conclude with numerical experiments confirming our theoretical results.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

The eXtended virtual element method for elliptic problems with weakly singular solutions

This paper introduces a novel eXtended virtual element method, an extension of the conforming virtual element method. The X-VEM is formulated by incorporating appropriate enrichment functions in the local spaces. The method is designed to handle highly generic enrichment functions, including singularities arising from fractured domains. By achieving consistency on the enrichment space, the method is proven to achieve arbitrary approximation orders even in the presence of singular solutions. The paper includes a complete convergence analysis under general assumptions on mesh regularity, and numerical experiments validating the method’s accuracy on various mesh families, demonstrating optimal convergence rates in the L 2 - and H 1 - norms on fractured or L-shaped domains.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Logarithmic enhancements in conformal perturbation theory and their real time interpretation

We study various corrections of correlation functions to leading order in conformal perturbation theory, both on the cylinder and on the plane. Many problems on the cylinder are mathematically equivalent to those in the plane if we give the perturbations a position dependent scaling profile. The integrals to be done are then similar to those in the study of correlation functions with one additional insertion at the center of the profile. We will be primarily interested in the divergence structure of these corrections when computed in dimensional regularization. In particular, we show that the logarithmic divergences (enhancements) that show up in the plane under these circumstances can be understood in terms of resonant behavior in time dependent perturbation theory, for a transition between states that is induced by an oscillatory perturbation on the cylinder.

Physics↗
NASA NTRS1973

Steady, subsonic, lifting surface theory for wings with swept, partial span, trailing edge control surfaces

A method for computing the lifting pressure distribution on a wing with partial span, swept control surfaces is presented. This method is valid within the framework of linearized, steady, potential flow theory and consists of using conventional lifting surface theory in conjuction with a flap pressure mode. The cause of a numerical instability that can occur during the quadrature of the flap pressure mode is discussed, and an efficient technique to eliminate the instability is derived. This technique is valid for both the flap pressure mode and regular pressure modes and could be used to improve existing lifting surface methods. Examples of the use of the flap pressure mode and comparisons among this method, other theoretical methods, and experiments are given. Discrepancies with experiment are indicated and candidate causes are presented. It is concluded that the method can lead to an efficient and accurate solution of the mathematical problem when a partial span, trailing edge flap is involved.

Medan, R. T.↗
DOE OSTI2018

On a Homogenization Problem

We study the average Green’s function of stochastic, uniformly elliptic operators of divergence form on Zdℤ{sup d}. When the randomness is independent and has small variance, we prove regularity of the Fourier transform of the self-energy. The proof relies on the Schur complement formula and the analysis of singular integral operators combined with a Steinhaus system.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Georgia Tech Accelerated, Compressed, and Regularized Compute of Kinetic-based PDEs (Final Report)

This report summarizes the collaborative effort between Lawrence Livermore National Laboratory and Georgia Tech to enhance the BoBa library for tensor train computation in PDE solvers, with a target on kinetic equations and their continuum limits. We aimed to reduce computational cost and memory usage by replacing traditional array-based computations with tensor trains. We examined the compressibility of time-evolving solutions to the Euler equations with discontinuities. We also explored using the first invsicid and linear regularization of the compressible flow equations via the information geometric regularization (IGR). We explored this in a tensor train formulation. To identify that inverse terms in the IGR equations pose problems for tensor train formulations and investigate efficient methods for batched inversion of tensor trains.

97 MATHEMATICS AND COMPUTING↗