Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Convex functions”

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 181 records · Page 10
All sourcesNASA NTRSDOE OSTI
NASA NTRS1988

Higher order sensitivity of solutions to convex programming problems without strict complementarity

Consideration is given to a family of convex programming problems which depend on a vector parameter. It is shown that the solutions of the problems and the associated Lagrange multipliers are arbitrarily many times directionally differentiable functions of the parameter, provided that the data of the problems are sufficiently regular. The characterizations of the respective derivatives are given.

Malanowski, Kazimierz↗
NASA NTRS1990

The shape of Eros

Monte Carlo simulations are presently used to optimize estimation, ascertain associated errors, and guide bias-correction procedures, for the Eros polar silhouette convex hull that has been estimated from radar echo spectra. This hull is trapezoidal; this nonaxisymmetric shape may account for odd harmonics in Eros' echo spectral signature as a function of rotation phase. Additional constraints have been obtained for the figure of Eros through the inversion of the optical lightcurve to estimate the asteroid's two-dimensional average of the three-dimensional shape. This 'mean cross-section' and the polar silhouette exhibit similar elongations.

Ostro, S. J.↗
NASA NTRS1991

Transferable Output ASCII Data (TOAD) editor version 1.0 user's guide

The Transferable Output ASCII Data (TOAD) editor is an interactive software tool for manipulating the contents of TOAD files. The TOAD editor is specifically designed to work with tabular data. Selected subsets of data may be displayed to the user's screen, sorted, exchanged, duplicated, removed, replaced, inserted, or transferred to and from external files. It also offers a number of useful features including on-line help, macros, a command history, an 'undo' option, variables, and a full compliment of mathematical functions and conversion factors. Written in ANSI FORTRAN 77 and completely self-contained, the TOAD editor is very portable and has already been installed on SUN, SGI/IRIS, and CONVEX hosts.

Bingel, Bradford D.↗
DOE OSTI2021

Scaled boundary cubature scheme for numerical integration over planar regions with affine and curved boundaries

This paper introduces the scaled boundary cubature (SBC) scheme for accurate and efficient integration of functions over polygons and two-dimensional regions bounded by parametric curves. Over two-dimensional domains, the SBC method reduces integration over a region bounded by m curves to integration over m regions (referred to as curved triangular regions), where each region is bounded by two line segments and a curve. With proper (counterclockwise) orientation of the boundary curves, the scheme is applicable to convex and nonconvex domains. Additionally, for star-convex domains, a tensor-product cubature rule with positive weights and integration points in the interior of the domain is obtained. If the integrand is homogeneous, we show that this new method reduces to the homogeneous numerical integration scheme; however, the SBC scheme is more versatile since it is equally applicable to both homogeneous and non-homogeneous functions. This paper also introduces several methods for smoothing integrands with point singularities and near-singularities. When these methods are used, highly efficient integration of weakly singular functions is realized. Finally, the SBC method is applied to a number of benchmark problems, which reveal its broad applicability and superior performance (in terms of time to generate a rule and accuracy per cubature point) when compared to existing methods for integration.

42 ENGINEERING↗
DOE OSTI2020

Polyelectrolyte Surface Diffusion in a Nanoslit Geometry

The surface diffusion of poly-l-lysine (PLL) in a planar nanoslit was studied using convex lens-induced confinement (CLiC) single-molecule tracking microscopy. Here, three surface chemistries were employed to understand the interplay of electrostatic and short-range interactions: an amine-functionalized silica surface, an oligo(ethylene oxide) (OEG)-modified surface, and a 1:1 mixture of the two ligands. Effective surface diffusion coefficients increased rapidly with slit height until saturating for slit heights <30 nm. While diffusion at a semi-infinite interface was significantly faster for OEG surfaces, the diffusion coefficient increased most rapidly with slit height for amine-functionalized surfaces, resulting in surface diffusion within very thin slits being nearly independent of surface chemistry. Intermittent random walks were simulated within a planar slit geometry, using experimentally measured parameters obtained from diffusion at a single interface to account for the characteristic short-range interactions between PLL and each surface chemistry, and were in good agreement with experimental measurements.

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

On the spectral energy distributions of blazars

The multifrequency spectral properties of complete samples of three kinds of blazars observed with the Rosat position sensitive proportional counter (PSPC) in pointed mode are investigated: radio selected BL Lacs (RBLs); X-ray selected BL Lacs (XBLs); and flat spectrum radio quasars (FSRQs). Their spectral energy distributions are compared. The bolometric luminosities and peak emission frequencies of each source are estimated by fitting parabolic functions to the individual rest frame spectra of the power per decade. The shape of the optical to X-ray continua is described, and it is found that the continua of XBLs are convex while those of FSRQs are concave.

Maraschi, L.↗
NASA NTRS1995

The Singularity Mystery Associated with a Radially Continuous Maxwell Viscoelastic Structure

The singularity problem associated with a radially continuous Maxwell viscoclastic structure is investigated. A special tool called the isolation function is developed. Results calculated using the isolation function show that the discrete model assumption is no longer valid when the viscoelastic parameter becomes a continuous function of radius. Continuous variations in the upper mantle viscoelastic parameter are especially powerful in destroying the mode-like structures. The contribution to the load Love numbers of the singularities is sensitive to the convexity of the viscoelastic parameter models. The difference between the vertical response and the horizontal response found in layered viscoelastic parameter models remains with continuous models.

Fang, Ming↗
DOE OSTI2025

A time-parallel multiple-shooting method for large-scale quantum optimal control

Quantum optimal control plays a crucial role in quantum computing by providing the interface between compiler and hardware. Solving the optimal control problem is particularly challenging for multi-qubit gates, due to the exponential growth in computational complexity with the system's dimensionality and the deterioration of optimization convergence. To ameliorate the computational complexity of time-integration, this paper introduces a multiple-shooting approach in which the time domain is divided into multiple windows and the intermediate states at window boundaries are treated as additional optimization variables. Further, this enables parallel computation of state evolution across time-windows, significantly accelerating objective function and gradient evaluations. Since the initial state matrix in each window is only guaranteed to be unitary upon convergence of the optimization algorithm, the conventional gate trace infidelity is replaced by a generalized infidelity that is convex for non-unitary state matrices. Continuity of the state across window boundaries is enforced by equality constraints. A quadratic penalty optimization method is used to solve the constrained optimal control problem, and an efficient adjoint technique is employed to calculate the gradients in each iteration. We demonstrate the effectiveness of the proposed method through numerical experiments on quantum Fourier transform gates in systems with 2, 3, and 4 qubits, noting a speedup of 80x for evaluating the gradient in the 4-qubit case, highlighting the method's potential for optimizing control pulses in multi-qubit quantum systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Throughput Measurements and Profile Analysis of Cloud Networks

Cloud networks utilize virtual connections to connect virtual machines distributed across cloud sites. They are increasingly deployed due to flexible provisioning using software and cost-effectiveness in not requiring to build physical network infrastructure. However, their extensive virtualization makes it unclear how well the established practices of conventional networks translate to them. Here, we study throughput measurements over a Google Cloud network using a matching hardware emulated conventional network, which provide production and exploratory conditions, respectively. The measurements span connections representing local, cross-continental and around the Earth distances. We study the effects of parallel flows, congestion control algorithms and retransmissions on the network throughput profile expressed as a function of RTT. We compare the throughput profile of Google Cloud network with those of emulated network under various loss conditions, including those too disruptive or expensive in the former. Our analysis based on the concave-convex shape and utilization-concavity coefficients of throughput profiles indicates an overall agreement of performance between the two networks, thereby justifying the use of conventional network emulations to analyze cloud networks. In terms of practical use, our study establishes that BBR and BBRv2 alpha TCP achieve higher throughput compared to loss-based congestion control algorithms under most network configurations, especially, under losses at large RTT.

Phanekham, Derek [Southern Methodist Univ., Dallas↗
NASA NTRS1986

Flexible tactile sensing arrays for robotics: Architectural robustness and yield considerations

No tactile sensor array developed to date fills all, nor even most, of the requirements of: (1) many sensor elements to minimize tactile imaging time, (2) close spacing of small sensing elements for fine spatial discrimination, (3) ability to be molded to a convex fingertip surface for taction on concave surfaces, (4) ability to sense both force and temperature in order to fully mimic biological touch, (5) tolerance to overscale forces without damage, and (6) graceful failure in use, i.e., functional survival of most of the array when part of it is damaged, well. Several investigators have recently developed tactile sensing arrays suitable for imaging shapes on hard flat surfaces, but not well suited for taction on curved surfaces. Others have developed single tactile sensors suitable for incorporation into arrays, which will probably prove uneconomical when large numbers of sensors are needed. Still others have developed flexible capacitive arrays suitable for use on curved surfaces but incapable of obtaining temperature or proximity data. A technology is being developed herein suitable to the achievement of all of the above goals, and to incrementally demonstrate useful steps toward those goals.

Barth, Phillip W.↗
NASA NTRS1999

Deblurring

In most instances, traditional EEG methodology provides insufficient spatial detail to identify relationships between brain electrical events and structures and functions visualized by magnetic resonance imaging or positron emission tomography. This article describes a method called Deblurring for increasing the spatial detail of the EEG and for fusing neurophysiologic and neuroanatomic data. Deblurring estimates potentials near the outer convexity of the cortex using a realistic finite element model of the structure of a subject's head determined from their magnetic resonance images. Deblurring is not a source localization technique and thus makes no assumptions about the number or type of generator sources. The validity of Deblurring has been initially tested by comparing deblurred data with potentials measured with subdural grid recordings. Results suggest that deblurred topographic maps, registered with a subject's magnetic resonance imaging and rendered in three dimensions, provide better spatial detail than has heretofore been obtained with scalp EEG recordings. Example results are presented from research studies of somatosensory stimulation, movement, language, attention and working memory. Deblurred ictal EEG data are also presented, indicating that this technique may have future clinical application as an aid to seizure localization and surgical planning.

Non-NASA Center↗
NASA NTRSDate not supplied

Multiple-Effector Control Allocation: Theory and Practice

Redundant controls are ubiquitous in many aerospace domains, including aircraft, spacecraft, and launch vehicles. Multiple control effectors having different capabilities (e.g., reaction controls, aerosurfaces, and vectored engines) must be optimally allocated to achieve high-performance and robust vehicle control, while considering different constraints, cost, or performance metrics associated with various control mixing schemes. These can include force or deflection limits, rate limits, propellant usage or drag penalties, cross-axis coupling, uncertainties, or even servoelastic interactions. This presentation introduces the fundamentals of control allocation theory, based on linear algebra and convex sets, using a handful of examples taken from the air and space vehicle domains. It is shown that even simple methods can provide verifiable and quantifiable performance benefits over ad-hoc approaches, and can support enhanced functions like fault tolerance and control reconfiguration.

Bill Benson↗
DOE OSTI2022

GEOMWRITER - A Workflow for Automatically Generating MCNP Geometry for Neutron Guide Simulations

This report describes the functionality of the geomwriter.py script, which is a python script for producing complex MCNP CSG geometries from the IGES CAD format. It is specifically written to handle neutron supermirror guides, but can handle more complex objects through utilizing a convex hull algorithm. This work flow reduces the amount of time spent on generating the surface definitions for a complex neutron guide system with hundreds of segments such that changes to the neutron guide system design in McStas can be rapidly incorporated into an MCNP model and integrated with the shielding geometry present in that model.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2023

Data-driven, structure-preserving approximations to entropy-based moment closures for kinetic equations

In this study, we present a data-driven approach for approximating entropy-based closures of moment systems from kinetic equations. The proposed closure learns the entropy function by fitting the map between the moments and the entropy of the moment system, and thus does not depend on the spacetime discretization of the moment system or specific problem configurations such as initial and boundary conditions. With convex and C 2 approximations, this data-driven closure inherits several structural properties from entropy-based closures, such as entropy dissipation, hyperbolicity, and H-Theorem. We construct convex approximations to the Maxwell–Boltzmann entropy using convex splines and neural networks, test them on the plane source benchmark problem for linear transport in slab geometry, and compare the results to the standard, entropy-based systems which solve a convex optimization problem to find the closure. Numerical results indicate that these data-driven closures provide accurate solutions in much less computation time than that required by the optimization routine.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Fourier-DeepONet: Fourier-enhanced deep operator networks for full waveform inversion with improved accuracy, generalizability, and robustness

In this article, full waveform inversion (FWI) infers the subsurface structure information from seismic waveform data by solving a non-convex optimization problem. Data-driven FWI has been increasingly studied with various neural network architectures to improve accuracy and computational efficiency. Nevertheless, the applicability of pre-trained neural networks is severely restricted by potential discrepancies between the source function used in the field survey and the one utilized during training. Here, we develop a Fourier-enhanced deep operator network (Fourier-DeepONet) for FWI with the generalization of seismic sources, including the frequencies and locations of sources. Specifically, we employ the Fourier neural operator as the decoder of DeepONet, and we utilize source parameters as one input of Fourier-DeepONet, facilitating the resolution of FWI with variable sources. To test Fourier-DeepONet, we develop three new and realistic FWI benchmark datasets (FWI-F, FWI-L, and FWI-FL) with varying source frequencies, locations, or both. Our experiments demonstrate that compared with existing data-driven FWI methods, Fourier-DeepONet obtains more accurate predictions of subsurface structures in a wide range of source parameters. Moreover, the proposed Fourier-DeepONet exhibits superior robustness when handling data with Gaussian noise or missing traces and sources with Gaussian noise, paving the way for more reliable and accurate subsurface imaging across diverse real conditions.

42 ENGINEERING↗
DOE OSTI2024

Efficient First-Order Algorithms for Large-Scale, Non-Smooth Maximum Entropy Models with Application to Wildfire Science

Maximum entropy (MaxEnt) models are a class of statistical models that use the maximum entropy principle to estimate probability distributions from data. Due to the size of modern data sets, MaxEnt models need efficient optimization algorithms to scale well for big data applications. State-of-the-art algorithms for MaxEnt models, however, were not originally designed to handle big data sets; these algorithms either rely on technical devices that may yield unreliable numerical results, scale poorly, or require smoothness assumptions that many practical MaxEnt models lack. In this paper, we present novel optimization algorithms that overcome the shortcomings of state-of-the-art algorithms for training large-scale, non-smooth MaxEnt models. Our proposed first-order algorithms leverage the Kullback–Leibler divergence to train large-scale and non-smooth MaxEnt models efficiently. For MaxEnt models with discrete probability distribution of n elements built from samples, each containing m features, the stepsize parameter estimation and iterations in our algorithms scale on the order of O(mn) operations and can be trivially parallelized. Moreover, the strong ℓ1 convexity of the Kullback–Leibler divergence allows for larger stepsize parameters, thereby speeding up the convergence rate of our algorithms. To illustrate the efficiency of our novel algorithms, we consider the problem of estimating probabilities of fire occurrences as a function of ecological features in the Western US MTBS-Interagency wildfire data set. Our numerical results show that our algorithms outperform the state of the art by one order of magnitude and yield results that agree with physical models of wildfire occurrence and previous statistical analyses of wildfire drivers.

Physics↗