Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “OPERATIONAL PROBLEM”

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,027 records · Page 57

Analysis of the SBP-SAT Stabilization for Finite Element Methods Part II: Entropy Stability

In the hyperbolic research community, there exists the strong belief that a continuous Galerkin scheme is notoriously unstable and additional stabilization terms have to be added to guarantee stability. In the first part of the series, the application of simultaneous approximation terms for linear problems is investigated where the boundary conditions are imposed weakly. By applying this technique, the authors demonstrate that a pure continuous Galerkin scheme is indeed linearly stable if the boundary conditions are imposed in the correct way. In this work, we extend this investigation to the nonlinear case and focus on entropy conservation. Here, by switching to entropy variables, we provide an estimation of the boundary operators also for nonlinear problems, that guarantee conservation. In numerical simulations, we verify our theoretical analysis.

97 MATHEMATICS AND COMPUTING↗

Detecting perceptual groupings in textures by continuity considerations

A generalization is presented for the second derivative of a Gaussian D(sup 2)G operator to apply to problems of perceptual organization involving textures. Extensions to other problems of perceptual organization are evident and a new research direction can be established. The technique presented is theoretically pleasing since it has the potential of unifying the entire area of image segmentation under the mathematical notion of continuity and presents a single algorithm to form perceptual groupings where many algorithms existed previously. The eventual impact on both the approach and technique of image processing segmentation operations could be significant.

Greene, Richard J.↗

Modeling heat exchange characteristics of long term space operations: Role of skin wettedness and exercise

The problems of heat exchange during rest and exercise during long term space operations are covered in this report. Particular attention is given to the modeling and description of the consequences of requirement to exercise in a zero-g atmosphere during Space Shuttle flights, especially long term ones. In space environments, there exists no free convection therefore only forced convection occurring by movement, such as pedalling on a cycle ergometer, augments required heat dissipation necessary to regulate body temperature. The requirement to exercise at discrete periods of the day is good practice in order to resist the deleterious consequences of zero-gravity problems and improve distribution of body fluids. However, during exercise (ca. 180 to 250W), in zero-g environments, the mass of eccrine sweating rests as sheets on the skin surface and the sweat cannot evaporate readily. The use of exercise suits with fabrics that have hydrophobic or outwicking properties somewhat distributes the mass of sweat to a larger surface from which to evaporate. However, with no free convection, increased skin wettedness throughout the body surface induces increasing thermal discomfort, particularly during continuous exercise. This report presents several alternatives to aid in this problem: use of intermittent exercise, methods to quantify local skin wettedness, and introduction of a new effective temperature that integrates thermal stress and heat exchange avenues in a zero-g atmosphere.

Gonzalez, Richard R.↗

Procedures for Tuning a Multiresonator Photonic Filter

Two procedures have been devised for tuning a photonic filter that comprises multiple whispering-gallery mode (WGM) disk resonators. As used here, tuning signifies locking the filter to a specific laser frequency and configuring the filter to obtain a desired high-order transfer function. The main problem in tuning such a filter is how to select the correct relative loading of the resonators to realize a prescribed filter function. The first of the two procedures solves this problem. As temperature gradients develop during operation, the spectra of individual resonators tend to drift, primarily because of the thermorefractive effect. Thus, there arises the additional problem of how to adjust the tuning during operation to maintain the desired transfer function. The second of the two procedures solves this problem. To implement the procedures, it is necessary to incorporate the resonators into an apparatus like that of Figure 1. In this apparatus, the spectrum of each resonator can be adjusted individually, via the electro-optical effect, by adjusting a bias voltage applied to that resonator. In addition, the positions of the coupling prisms and resonators can be adjusted to increase or reduce the gaps between them, thereby reducing or increasing, respectively, the optical coupling between them. The optical power (Pi) in resonator i is monitored by use of a tracking photodiode. Another tracking diode monitors the power reflected from the input terminal (Pr), and still others monitor the input power (Pin) and output power (Po). The readings of these photodiodes are used to guide the tuning adjustments described in this paper.

Matsko, Andrey↗

Adaptive Liquid Crystal Windows

Energy consumption by private and commercial sectors in the U.S. has steadily grown over the last decade. The uncertainty in future availability of imported oil, on which the energy consumption relies strongly, resulted in a dramatic increase in the cost of energy. About 20% of this consumption are used to heat and cool houses and commercial buildings. To reduce dependence on the foreign oil and cut down emission of greenhouse gases, it is necessary to eliminate losses and reduce total energy consumption by buildings. To achieve this goal it is necessary to redefine the role of the conventional windows. At a minimum, windows should stop being a source for energy loss. Ideally, windows should become a source of energy, providing net gain to reduce energy used to heat and cool homes. It is possible to have a net energy gain from a window if its light transmission can be dynamically altered, ideally electronically without the need of operator assistance, providing optimal control of the solar gain that varies with season and climate in the U.S. In addition, the window must not require power from the building for operation. Resolution of this problem is a societal challenge and of national interest and will have a broad global impact. For this purpose, the year-round, all-climate window solution to provide an electronically variable solar heat gain coefficient (SHGC) with a wide dynamic range is needed. AlphaMicron, Inc. (AMI) developed and manufactured 1ft × 1ft prototype panels for the world’s first auto-adjusting Adaptive Liquid Crystal Windows (ALCWs) that can operate from sunlight without the need for external power source and demonstrate an electronically adjustable SHGC. This novel windows are based on AlphaMicron’s patented e-Tint ® technology, a guest-host liquid crystal system implemented on flexible, optically clear plastic films. This technology is suitable both for OEM and aftermarket (retro-fitting) lamination to new and existing windows. Low level of power consumption by ALCWs allows for on-board power electronics for automatic matching of transmission through windows to varying climate conditions without drawing the power from the power grid. ALCWs are capable of transmitting more sunlight in winters to assist in heating and less sunlight in summers to minimize overheating. As such, they can change the window from being a source of energy loss to a source of energy gain. In addition, the scalable AMI’s roll-to-roll process, proved by making 1ft × 1ftALCW prototype panels, allows for cost-effective production of large-scale window panels along with capability to change easily their color and shape. In addition to architectural glazing in houses and commercial buildings, ALCWs can be used in other applications where control of sunlight is needed, such as green houses, used by commercial produce growers and botanical gardens, cars, aircrafts, etc.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

The improved robustness of multigrid elliptic solvers based on multiple semicoarsened grids

Multigrid convergence rates degenerate on problems with stretched grids or anisotropic operators, unless one uses line or plane relaxation. For 3-D problems, only plane relaxation suffices, in general. While line and plane relaxation algorithms are efficient on sequential machines, they are quite awkward and inefficient on parallel machines. A new multigrid algorithm is presented based on the use of multiple coarse grids, that eliminates the need for line or plane relaxation in anisotropic problems. This algorithm was developed and the standard multigrid theory was extended to establish rapid convergence for this class of algorithms. The new algorithm uses only point relaxation, allowing easy and efficient parallel implementation, yet achieves robustness and convergence rates comparable to line and plane relaxation multigrid algorithms. The algorithm described is a variant of Mulder's multigrid algorithm for hyperbolic problems. The latter uses multiple coarse grids to achieve robustness, but is unsuitable for elliptic problems, since its V-cycle convergence rate goes to one as the number of levels increases. The new algorithm combines the contributions from the multiple coarse grid via a local switch, based on the strength of the discrete operator in each coordinate direction.

Naik, Naomi H.↗

Neural operators for stochastic modeling of nonlinear structural system response to natural hazards

Traditionally, neural networks have been employed to learn the mapping between finite-dimensional Euclidean spaces. However, recent research has opened up new horizons, focusing on the utilization of deep neural networks to learn operators capable of mapping infinite-dimensional function spaces. Here, in this work, we employ two state-of-the-art neural operators, the deep operator network (DeepONet) and the Fourier neural operator (FNO) for the prediction of the nonlinear time history response of structural systems exposed to natural hazards, such as earthquakes and windstorms. Specifically, we propose two architectures, a self-adaptive FNO and a fast Fourier transform-based DeepONet (DeepFNOnet), where we employ a FNO beyond the DeepONet to learn the discrepancy between the ground truth and the solution predicted by the DeepONet. To demonstrate the efficiency and applicability of the architectures, two problems are considered. In the first, we use the proposed model to predict the seismic nonlinear dynamic response of a six-story shear building subject to stochastic ground motions. In the second problem, we employ the operators to predict the wind-induced nonlinear dynamic response of a high-rise building while explicitly accounting for the stochastic nature of the wind excitation. In both cases, the trained metamodels achieve high accuracy while being orders of magnitude faster than their corresponding high-fidelity models.

DeepONet↗

Quantum properties of non-Dirichlet boundary conditions in gravity

The Euclidean path integral for gravity is enriched by the addition of boundaries, which provide useful probes of thermodynamic properties. Common boundary conditions include Dirichlet conditions on the boundary induced metric; microcanonical conditions, which refers to fixing some components of the Brown-York boundary stress tensor; and conformal conditions, in which the conformal structure of the induced metric and the trace of the extrinsic curvature are fixed. Boundaries also present interesting problems of consistency. The Dirichlet problem is known, under various (and generally different) conditions, to be inconsistent with perturbative quantization of graviton fluctuations, to exhibit thermodynamic instability, or to require infinite fine-tuning in the presence of matter fluctuations. We extend some of these results to other boundary conditions. We find that similarly to the Dirichlet problem, the graviton fluctuation operator is not elliptic with microcanonical boundaries, and the nonelliptic modes correspond to “boundary-moving diffeomorphisms.” However, we argue that microcanonical factorization of path integrals—essentially, the insertion of microcanonical constraints on two-sided surfaces in the bulk—is not affected by the same issues of ellipticity. We also show that for a variety of matter field boundary conditions, matter fluctuations renormalize the gravitational bulk and boundary terms differently, so that the classical microcanonical or conformal variational problems are not preserved unless an infinite fine-tuning is performed.

Draper, Patrick [Univ. of Illinois at Urbana-Champ↗

Application of functional analysis to perturbation theory of differential equations

The deviation of the solution of the differential equation y' = f(t, y), y(O) = y sub O from the solution of the perturbed system z' = f(t, z) + g(t, z), z(O) = z sub O was investigated for the case where f and g are continuous functions on I x R sup n into R sup n, where I = (o, a) or I = (o, infinity). These functions are assumed to satisfy the Lipschitz condition in the variable z. The space Lip(I) of all such functions with suitable norms forms a Banach space. By introducing a suitable norm in the space of continuous functions C(I), introducing the problem can be reduced to an equivalent problem in terminology of operators in such spaces. A theorem on existence and uniqueness of the solution is presented by means of Banach space technique. Norm estimates on the rate of growth of such solutions are found. As a consequence, estimates of deviation of a solution due to perturbation are obtained. Continuity of the solution on the initial data and on the perturbation is established. A nonlinear perturbation of the harmonic oscillator is considered a perturbation of equations of the restricted three body problem linearized at libration point.

Bogdan, V. M.↗

Spectral relationships between kicked Harper and on-resonance double kicked rotor operators

Kicked Harper operators and on-resonance double kicked rotor operators model quantum systems whose semiclassical limits exhibit chaotic dynamics. Recent computational studies indicate a striking resemblance between the spectra of these operators. In this paper we apply C*-algebra methods to explain this resemblance. We show that each pair of corresponding operators belongs to a common rotation C*-algebra B{sub {alpha}}, prove that their spectra are equal if {alpha} is irrational, and prove that the Hausdorff distance between their spectra converges to zero as q increases if {alpha}=p/q with p and q coprime integers. Moreover, we show that corresponding operators in B{sub {alpha}} are homomorphic images of mother operators in the universal rotation C*-algebra A{sub {alpha}} that are unitarily equivalent and hence have identical spectra. These results extend analogous results for almost Mathieu operators. We also utilize the C*-algebraic framework to develop efficient algorithms to compute the spectra of these mother operators for rational {alpha} and present preliminary numerical results that support the conjecture that their spectra are Cantor sets if {alpha} is irrational. This conjecture for almost Mathieu operators, called the ten Martini problem, was recently proven after intensive efforts over several decades. This proof for the almost Mathieu operators utilized transfer matrix methods, which do not exist for the kicked operators. We outline a strategy, based on a special property of loop groups of semisimple Lie groups, to prove this conjecture for the kicked operators.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An Efficient Spectral Method for Ordinary Differential Equations with Rational Function Coefficients

We present some relations that allow the efficient approximate inversion of linear differential operators with rational function coefficients. We employ expansions in terms of a large class of orthogonal polynomial families, including all the classical orthogonal polynomials. These families obey a simple three-term recurrence relation for differentiation, which implies that on an appropriately restricted domain the differentiation operator has a unique banded inverse. The inverse is an integration operator for the family, and it is simply the tridiagonal coefficient matrix for the recurrence. Since in these families convolution operators (i.e. matrix representations of multiplication by a function) are banded for polynomials, we are able to obtain a banded representation for linear differential operators with rational coefficients. This leads to a method of solution of initial or boundary value problems that, besides having an operation count that scales linearly with the order of truncation N, is computationally well conditioned. Among the applications considered is the use of rational maps for the resolution of sharp interior layers.

Coutsias, Evangelos A.↗

PRF Ambiguity Detrmination for Radarsat ScanSAR System

PRF ambiguity is a potential problem for a spaceborne SAR operated at high frequencies. For a strip mode SAR, there were several approaches to solve this problem. This paper, however, addresses PRF ambiguity determination algorithms suitable for a burst mode SAR system such as the Radarsat ScanSAR. The candidate algorithms include the wavelength diversity algorithm, range look cross correlation algorithm, and multi-PRF algorithm.

Doppler centroid PRF ambiguity ScanSAR SAR burst w↗

Third quantization

The basic ideas of second quantization and Fock space are extended to density operator states, used in treatments of open many-body systems. This can be done for fermions and bosons. While the former only requires the use of a non-orthogonal basis, the latter requires the introduction of a dual set of spaces. In both cases an operator algebra closely resembling the canonical one is developed and used to define the dual sets of bases. We here concentrated on the bosonic case where the unboundedness of the operators requires the definitions of dual spaces to support the pair of bases. Some applications, mainly to non-equilibrium steady states, will be mentioned.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Testbed of Parallel Kernels for Computer Science Research

For several decades, computer scientists have sought guidance on how to evolve architectures, languages, and programming models for optimal performance, efficiency, and productivity. Unfortunately, this guidance is most often taken from the existing software/hardware ecosystem. Architects attempt to provide micro-architectural solutions to improve performance on fixed binaries. Researchers tweak compilers to improve code generation for existing architectures and implementations, and they may invent new programming models for fixed processor and memory architectures and computational algorithms. In today's rapidly evolving world of on-chip parallelism, these isolated and iterative improvements to performance may miss superior solutions in the same way gradient descent optimization techniques may get stuck in local minima. In an initial study, we have developed an alternate approach that, rather than starting with an existing hardware/software solution laced with hidden assumptions, defines the computational problems of interest and invites architects, researchers and programmers to implement novel hardware/ software co-designed solutions. Our work builds on the previous ideas of computational dwarfs, motifs, and parallel patterns by selecting a representative set of essential problems for which we provide: An algorithmic description; scalable problem definition; illustrative reference implementations; verification schemes. For simplicity, we focus initially on the computational problems of interest to the scientific computing community but proclaim the methodology (and perhaps a subset of the problems) as applicable to other communities. We intend to broaden the coverage of this problem space through stronger community involvement. Previous work has established a broad categorization of numerical methods of interest to the scientific computing, in the spirit of the NAS Benchmarks, which pioneered the basic idea of a 'pencil and paper benchmark' in the 1990s. The initial result of the more modern study was the seven dwarfs, which was subsequently extended to 13 motifs. These motifs have already been useful in defining classes of applications for architecture-software studies. However, these broad-brush problem statements often miss the nuance seen in individual kernels. For example, the computational requirements of particle methods vary greatly between the naive (but more accurate) direct calculations and the particle-mesh and particle-tree codes. Thus we commenced our study with an enumeration of problems, but then proceeded by providing not only reference implementations for each problem, but more importantly a mathematical definition that allows one to escape iterative approaches to software/hardware optimization. To ensure long term value, we have augmented each of our reference implementations with both a scalable problem generator and a verification scheme. In a paper we have prepared that documents our efforts, we describe in detail this process of problem definition, scalable input creation, verification, and implementation of reference codes for the scientific computing domain. Table 1 enumerates and describes the level of support we've developed for each kernel. We group these important kernels using the Berkeley dwarfs/motifs taxonomy using a red box in the appropriate column. As kernels become progressively complex, they build upon other, simpler computational methods. We note this dependency via orange boxes. After enumeration of the important numerical problems, we created a domain-appropriate high-level definition of each problem. To ensure future endeavors are not tainted by existing implementations, we specified the problem definition to be independent of both computer architecture and existing programming languages, models, and data types. Then, to provide context as to how such kernels productively map to existing architectures, languages and programming models, we produced reference implementations for most of the kernel (see table). These sample codes should be viewed as 'hints,' designed to show how other designers have mapped a problem's operands and operators to existing hardware and software. Since we wanted such implementations to be illustrative, we tried to ensure they were the most straightforward implementation in the easiest to understand languages using familiar architectures. To that end, most of the linear algebra-oriented computations are written in MATLAB using array indexing to process matrices, rather than one-line library calls to compute the same kernel. This ensures that the kernel's computation is explicit and readable in the implementation and not hidden behind a library. For other problems, such as the Barnes-Hut n-Body solver, the implementations were written in pure C, without any supporting library computations. Along this line, we have also created a scalable problem generator to accompany each computation.

97 MATHEMATICS AND COMPUTING↗

A Metadata-Rich File System

Despite continual improvements in the performance and reliability of large scale file systems, the management of file system metadata has changed little in the past decade. The mismatch between the size and complexity of large scale data stores and their ability to organize and query their metadata has led to a de facto standard in which raw data is stored in traditional file systems, while related, application-specific metadata is stored in relational databases. This separation of data and metadata requires considerable effort to maintain consistency and can result in complex, slow, and inflexible system operation. To address these problems, we have developed the Quasar File System (QFS), a metadata-rich file system in which files, metadata, and file relationships are all first class objects. In contrast to hierarchical file systems and relational databases, QFS defines a graph data model composed of files and their relationships. QFS includes Quasar, an XPATH-extended query language for searching the file system. Results from our QFS prototype show the effectiveness of this approach. Compared to the defacto standard, the QFS prototype shows superior ingest performance and comparable query performance on user metadata-intensive operations and superior performance on normal file metadata operations.

99 GENERAL AND MISCELLANEOUS↗

Tensor operators: Constructions and applications for long-range interaction systems

We consider the representation of operators in terms of tensor networks and their application to the ground-state approximation and time evolution of systems with long-range interactions. We provide an explicit construction to represent an arbitrary many-body Hamilton operator in terms of a one-dimensional tensor network (i.e., as a matrix product operator). For pairwise interactions, we show that such a representation is always efficient and requires a tensor dimension growing only linearly with the number of particles. For systems obeying certain symmetries or restrictions we find optimal representations with minimal tensor dimension. We discuss the analytic and numerical approximation of operators in terms of low-dimensional tensor operators. We demonstrate applications for time evolution and the ground-state approximation, in particular for long-range interaction with inhomogeneous couplings. The operator representations are also generalized to other geometries such as trees and two-dimensional lattices, where we show how to obtain and use efficient tensor network representations respecting a given geometry.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Design and Implementation of a Metadata-rich File System

Despite continual improvements in the performance and reliability of large scale file systems, the management of user-defined file system metadata has changed little in the past decade. The mismatch between the size and complexity of large scale data stores and their ability to organize and query their metadata has led to a de facto standard in which raw data is stored in traditional file systems, while related, application-specific metadata is stored in relational databases. This separation of data and semantic metadata requires considerable effort to maintain consistency and can result in complex, slow, and inflexible system operation. To address these problems, we have developed the Quasar File System (QFS), a metadata-rich file system in which files, user-defined attributes, and file relationships are all first class objects. In contrast to hierarchical file systems and relational databases, QFS defines a graph data model composed of files and their relationships. QFS incorporates Quasar, an XPATH-extended query language for searching the file system. Results from our QFS prototype show the effectiveness of this approach. Compared to the de facto standard, the QFS prototype shows superior ingest performance and comparable query performance on user metadata-intensive operations and superior performance on normal file metadata operations.

99 GENERAL AND MISCELLANEOUS↗