Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “ORTHOGONAL FUNCTION”

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 433 records · Page 24
All sourcesNASA NTRSDOE OSTI
NASA NTRS2000

A Probabilistic Framework for the Validation and Certification of Computer Simulations

The paper presents a methodology for quantifying, propagating, and managing the uncertainty in the data required to initialize computer simulations of complex phenomena. The purpose of the methodology is to permit the quantitative assessment of a certification level to be associated with the predictions from the simulations, as well as the design of a data acquisition strategy to achieve a target level of certification. The value of a methodology that can address the above issues is obvious, specially in light of the trend in the availability of computational resources, as well as the trend in sensor technology. These two trends make it possible to probe physical phenomena both with physical sensors, as well as with complex models, at previously inconceivable levels. With these new abilities arises the need to develop the knowledge to integrate the information from sensors and computer simulations. This is achieved in the present work by tracing both activities back to a level of abstraction that highlights their commonalities, thus allowing them to be manipulated in a mathematically consistent fashion. In particular, the mathematical theory underlying computer simulations has long been associated with partial differential equations and functional analysis concepts such as Hilbert spares and orthogonal projections. By relying on a probabilistic framework for the modeling of data, a Hilbert space framework emerges that permits the modeling of coefficients in the governing equations as random variables, or equivalently, as elements in a Hilbert space. This permits the development of an approximation theory for probabilistic problems that parallels that of deterministic approximation theory. According to this formalism, the solution of the problem is identified by its projection on a basis in the Hilbert space of random variables, as opposed to more traditional techniques where the solution is approximated by its first or second-order statistics. The present representation, in addition to capturing significantly more information than the traditional approach, facilitates the linkage between different interacting stochastic systems as is typically observed in real-life situations.

Ghanem, Roger↗
DOE OSTI2014

Multi-input regulation and logic with T7 promoters in cells and cell free systems

Engineered gene circuits offer an opportunity to harness biological systems for biotechnological and biomedical applications. However, reliance on host E. coli promoters for the construction of circuit elements, such as logic gates, makes implementation of predictable, independently functioning circuits difficult. In contrast, T7 promoters offer a simple orthogonal expression system for use in a variety of cellular backgrounds and even in cell free systems. Here we develop a T7 promoter system that can be regulated by two different transcriptional repressors for the construction of a logic gate that functions in cells and in cell free systems. We first present LacI repressible T7lacO promoters that are regulated from a distal lac operator site for repression. We next explore the positioning of a tet operator site within the T7lacO framework to create T7 promoters that respond to tet and lac repressors and realize an IMPLIES gate. Finally, we demonstrate that these dual input sensitive promoters function in a commercially available E. coli cell-free protein expression system. Together, our results contribute to the first demonstration of multi-input regulation of T7 promoters and expand the utility of T7 promoters in cell based as well as cell-free gene circuits.

Iyer, Sukanya↗
DOE OSTI2013

Multi-Input Regulation and Logic with T7 Promoters in Cells and Cell-Free Systems

Engineered gene circuits offer an opportunity to harness biological systems for biotechnological and biomedical applications. However, reliance on native host promoters for the construction of circuit elements, such as logic gates, can make the implementation of predictable, independently functioning circuits difficult. In contrast, T7 promoters offer a simple orthogonal expression system for use in a variety of cellular backgrounds and even in cell-free systems. Here we develop a T7 promoter system that can be regulated by two different transcriptional repressors for the construction of a logic gate that functions in cells and in cell-free systems. We first present LacI repressible T7lacO promoters that are regulated from a distal lac operator site for repression. We next explore the positioning of a tet operator site within the T7lacO framework to create T7 promoters that respond to tet and lac repressors and realize an IMPLIES gate. Finally, we demonstrate that these dual input sensitive promoters function in an E. coli cellfree protein expression system. Our results expand the utility of T7 promoters in cell based as well as cell-free synthetic biology applications.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2013

Quartic Poisson algebras and quartic associative algebras and realizations as deformed oscillator algebras

We introduce the most general quartic Poisson algebra generated by a second and a fourth order integral of motion of a 2D superintegrable classical system. We obtain the corresponding quartic (associative) algebra for the quantum analog, extend Daskaloyannis construction obtained in context of quadratic algebras, and also obtain the realizations as deformed oscillator algebras for this quartic algebra. We obtain the Casimir operator and discuss how these realizations allow to obtain the finite-dimensional unitary irreducible representations of quartic algebras and obtain algebraically the degenerate energy spectrum of superintegrable systems. We apply the construction and the formula obtained for the structure function on a superintegrable system related to type I Laguerre exceptional orthogonal polynomials introduced recently.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1999

30 Years of Wahba's Problem

This article discusses a problem proposed by Grace Wahba: Find the orthogonal matrix A with determinant +1 that minimizes the loss function L(A) is identical with the 1/2(summation from i( a(sub i) * absolute value of (b(sub i)- Ar(sub i))squared). where {b(sub i)} is a set of unit vectors measured in a spacecraft's body frame, {r(sub i)} e the corresponding unit vectors in a reference frame and {a(sub i) are non-negative weights). The orthogonal Procrustes problem is to find the orthogonal matrix A that is closest to B in the sense of the Fobenius norm, so that Wahba's Problem is equivalent to the orthogonal Procrustes problem with the provision that the determinant of A must be +1. The article reviews various solutions to this problem and the implementations of the various solutions.

Markley, F. Landis↗
DOE OSTI2017

Model's sparse representation based on reduced mixed GMsFE basis methods

In this paper, we propose a model's sparse representation based on reduced mixed generalized multiscale finite element (GMsFE) basis methods for elliptic PDEs with random inputs. A typical application for the elliptic PDEs is the flow in heterogeneous random porous media. Mixed generalized multiscale finite element method (GMsFEM) is one of the accurate and efficient approaches to solve the flow problem in a coarse grid and obtain the velocity with local mass conservation. When the inputs of the PDEs are parameterized by the random variables, the GMsFE basis functions usually depend on the random parameters. This leads to a large number degree of freedoms for the mixed GMsFEM and substantially impacts on the computation efficiency. In order to overcome the difficulty, we develop reduced mixed GMsFE basis methods such that the multiscale basis functions are independent of the random parameters and span a low-dimensional space. To this end, a greedy algorithm is used to find a set of optimal samples from a training set scattered in the parameter space. Reduced mixed GMsFE basis functions are constructed based on the optimal samples using two optimal sampling strategies: basis-oriented cross-validation and proper orthogonal decomposition. Although the dimension of the space spanned by the reduced mixed GMsFE basis functions is much smaller than the dimension of the original full order model, the online computation still depends on the number of coarse degree of freedoms. To significantly improve the online computation, we integrate the reduced mixed GMsFE basis methods with sparse tensor approximation and obtain a sparse representation for the model's outputs. The sparse representation is very efficient for evaluating the model's outputs for many instances of parameters. To illustrate the efficacy of the proposed methods, we present a few numerical examples for elliptic PDEs with multiscale and random inputs. In particular, a two-phase flow model in random porous media is simulated by the proposed sparse representation method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Quantum algorithm for electronic band structures with local tight-binding orbitals

While the main thrust of quantum computing research in materials science is to accurately measure the classically intractable electron correlation effects due to Coulomb repulsion, designing optimal quantum algorithms for simpler problems with well-understood solutions is a useful tactic to advance our quantum “toolbox”. With this in mind, we consider the quantum calculation of a periodic system’s single-electron band structure over a path through reciprocal space. Previous efforts have used the Variational Quantum Eigensolver algorithm to solve the energy of each band, which involves numerically optimizing the parameters of a variational quantum circuit to minimize a cost function, constructed as the expectation value of a Hamiltonian operator. Traditionally, a unique Hamiltonian operator is constructed for each k-point, so that many cost functions, each with their own parameter space, must be optimized to generate a single band. Similarly, calculating higher bands than the first has traditionally involved modifying the cost function with additional overlap terms to ensure higher-energy eigenstates are orthogonal to those of lower bands. In this paper, we adopt a direct space approach, using a novel hybrid first/second-quantized qubit mapping which allows us to construct a single Hamiltonian, and a single cost-function, suitable for solving the entire electronic band structure. In contrast to previous approaches, the k-point and the band index are selected by additional parameters in our quantum circuit, rather than through modifications to the cost function. The result is a technically and conceptually simpler approach to band structure calculations on a quantum computer. Moreover, we expect that the tools developed herein will motivate new strategies for tackling highly-correlated materials beyond the grasp of classical computing.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2014

The algebra of two dimensional generalized Chebyshev-Koornwinder oscillator

In the previous works of Borzov and Damaskinsky [“Chebyshev-Koornwinder oscillator,” Theor. Math. Phys. 175(3), 765–772 (2013)] and [“Ladder operators for Chebyshev-Koornwinder oscillator,” in Proceedings of the Days on Diffraction, 2013], the authors have defined the oscillator-like system that is associated with the two variable Chebyshev-Koornwinder polynomials. We call this system the generalized Chebyshev-Koornwinder oscillator. In this paper, we study the properties of infinite-dimensional Lie algebra that is analogous to the Heisenberg algebra for the Chebyshev-Koornwinder oscillator. We construct the exact irreducible representation of this algebra in a Hilbert space H of functions that are defined on a region which is bounded by the Steiner hypocycloid. The functions are square-integrable with respect to the orthogonality measure for the Chebyshev-Koornwinder polynomials and these polynomials form an orthonormalized basis in the space H. The generalized oscillator which is studied in the work can be considered as the simplest nontrivial example of multiboson quantum system that is composed of three interacting oscillators.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS1989

Cyclotron line features from neutron star atmospheres

Cyclotron line features from the polar cap plasmas of accreting magnetized neutron stars are modeled. The polar cap environment is modeled by a homogeneous isothermal plane-parallel slab threaded by a uniform superstrong magnetic field oriented orthogonal to the slab. Two physical cyclotron photon source functions are used. For conventional stopping depths, the emergent line spectra are fairly independent of the source functions. For hot atmospheres the details of the line transfer using relativistic kinematics differ substantially from those using nonrelativistic kinematics. Aside from finite recoil, both a finite natural linewidth and conventional stopping depths suppress the escape of photons blueward of line center and potential line features tend to be smeared out into the low-energy continuum. The formation of a line features is most favorable in low-field high-temperature atmospheres where cyclotron photon production is confined to a layer of small column density.

Wang, John C. L.↗
DOE OSTI2021

Discrete Empirical Interpolation Method Based Dynamic Load Model Reduction

Dynamic load models add significant complexity to bulk power system time-domain simulations. The complexity is due to the large number of ordinary differential equations (ODEs) introduced by the dynamic load components such as induction motors. It is challenging to derive reduced-order models (ROMs) for dynamic loads due to the nonlinear functions in their governing equations. This paper applies the discrete empirical interpolation method enhanced proper orthogonal decomposition (DEIM-POD) to approximate the full dynamic load model with the ROM that minimizes the projection error of the nonlinear functions in dynamic load ODEs onto their dominant modes. This approach only requires evaluation of nonlinear functions at selected observation points. The observation points selected by DEIM also provide information for screening critical load buses where dynamic load model parameters contribute the most to the accuracy of ROM across multiple contingencies. The proposed approach is validated on IEEE 9-bus, WECC 179-bus and 2384-bus Polish systems.

bulk power system↗
DOE OSTI2023

Machine-learning-based spectral methods for partial differential equations

Spectral methods are an important part of scientific computing’s arsenal for solving partial differential equations (PDEs). However, their applicability and effectiveness depend crucially on the choice of basis functions used to expand the solution of a PDE. The last decade has seen the emergence of deep learning as a strong contender in providing efficient representations of complex functions. In the current work, we present an approach for combining deep neural networks with spectral methods to solve PDEs. In particular, we use a deep learning technique known as the Deep Operator Network (DeepONet) to identify candidate functions on which to expand the solution of PDEs. We have devised an approach that uses the candidate functions provided by the DeepONet as a starting point to construct a set of functions that have the following properties: (1) they constitute a basis, (2) they are orthonormal, and (3) they are hierarchical, i.e., akin to Fourier series or orthogonal polynomials. We have exploited the favorable properties of our custom-made basis functions to both study their approximation capability and use them to expand the solution of linear and nonlinear time-dependent PDEs. The proposed approach advances the state of the art and versatility of spectral methods and, more generally, promotes the synergy between traditional scientific computing and machine learning.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

RNAi and genome editing of sugarcane: Progress and prospects

SUMMARY Sugarcane, which provides 80% of global table sugar and 40% of biofuel, presents unique breeding challenges due to its highly polyploid, heterozygous, and frequently aneuploid genome. Significant progress has been made in developing genetic resources, including the recently completed reference genome of the sugarcane cultivar R570 and pan‐genomic resources from sorghum, a closely related diploid species. Biotechnological approaches including RNA interference (RNAi), overexpression of transgenes, and gene editing technologies offer promising avenues for accelerating sugarcane improvement. These methods have successfully targeted genes involved in important traits such as sucrose accumulation, lignin biosynthesis, biomass oil accumulation, and stress response. One of the main transformation methods—biolistic gene transfer or Agrobacterium ‐mediated transformation—coupled with efficient tissue culture protocols, is typically used for implementing these biotechnology approaches. Emerging technologies show promise for overcoming current limitations. The use of morphogenic genes can help address genotype constraints and improve transformation efficiency. Tissue culture‐free technologies, such as spray‐induced gene silencing, virus‐induced gene silencing, or virus‐induced gene editing, offer potential for accelerating functional genomics studies. Additionally, novel approaches including base and prime editing, orthogonal synthetic transcription factors, and synthetic directed evolution present opportunities for enhancing sugarcane traits. These advances collectively aim to improve sugarcane's efficiency as a crop for both sugar and biofuel production. This review aims to discuss the progress made in sugarcane methodologies, with a focus on RNAi and gene editing approaches, how RNAi can be used to inform functional gene targets, and future improvements and applications.

Brant, Eleanor [Agronomy Department, Plant Molecul↗
DOE OSTI2014

A complex guided spectral transform Lanczos method for studying quantum resonance states

A complex guided spectral transform Lanczos (cGSTL) algorithm is proposed to compute both bound and resonance states including energies, widths, and wavefunctions. The algorithm comprises of two layers of complex-symmetric Lanczos iterations. A short inner layer iteration produces a set of complex formally orthogonal Lanczos polynomials. They are used to span the guided spectral transform function determined by a retarded Green operator. An outer layer iteration is then carried out with the transform function to compute the eigen-pairs of the system. The guided spectral transform function is designed to have the same wavefunctions as the eigenstates of the original Hamiltonian in the spectral range of interest. Therefore, the energies and/or widths of bound or resonance states can be easily computed with their wavefunctions or by using a root-searching method from the guided spectral transform surface. The new cGSTL algorithm is applied to bound and resonance states of HO{sub 2}, and compared to previous calculations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2014

Assessment of approximate computational methods for conical intersections and branching plane vectors in organic molecules

Quantum-chemical computational methods are benchmarked for their ability to describe conical intersections in a series of organic molecules and models of biological chromophores. Reference results for the geometries, relative energies, and branching planes of conical intersections are obtained using ab initio multireference configuration interaction with single and double excitations (MRCISD). They are compared with the results from more approximate methods, namely, the state-interaction state-averaged restricted ensemble-referenced Kohn-Sham method, spin-flip time-dependent density functional theory, and a semiempirical MRCISD approach using an orthogonalization-corrected model. It is demonstrated that these approximate methods reproduce the ab initio reference data very well, with root-mean-square deviations in the optimized geometries of the order of 0.1 Å or less and with reasonable agreement in the computed relative energies. A detailed analysis of the branching plane vectors shows that all currently applied methods yield similar nuclear displacements for escaping the strong non-adiabatic coupling region near the conical intersections. Our comparisons support the use of the tested quantum-chemical methods for modeling the photochemistry of large organic and biological systems.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2025

Inference of response functions with the help of machine-learning algorithms

Response functions are a key quantity to describe the near-equilibrium dynamics of strongly interacting many-body systems. Recent techniques that attempt to overcome the challenges of calculating these ab initio have employed expansions in terms of orthogonal polynomials. We employ a neural network prediction algorithm to reconstruct a response function 𝑆⁡(𝜔) defined over a range in frequencies 𝜔. Here, we represent the calculated response function as a truncated Chebyshev series whose coefficients can be optimized to reduce the representation error. We compare the quality of response functions obtained using coefficients calculated using a neural network (NN) algorithm with those computed using the Gaussian integral transform (GIT) method. In the regime where only a small number of terms in the Chebyshev series are retained, we find that the NN scheme outperforms the GIT method.

Kurkcuoglu, Doga Murat [Fermi National Accelerator↗
NASA NTRS1974

Elementary solutions of coupled model equations in the kinetic theory of gases

The method of elementary solutions is employed to solve two coupled integrodifferential equations sufficient for determining temperature-density effects in a linearized BGK model in the kinetic theory of gases. Full-range completeness and orthogonality theorems are proved for the developed normal modes and the infinite-medium Green's function is constructed as an illustration of the full-range formalism. The appropriate homogeneous matrix Riemann problem is discussed, and half-range completeness and orthogonality theorems are proved for a certain subset of the normal modes. The required existence and uniqueness theorems relevant to the H matrix, basic to the half-range analysis, are proved, and an accurate and efficient computational method is discussed. The half-space temperature-slip problem is solved analytically, and a highly accurate value of the temperature-slip coefficient is reported.

Kriese, J. T.↗
DOE OSTI2015

SU-E-T-33: A Feasibility-Seeking Algorithm Applied to Planning of Intensity Modulated Proton Therapy: A Proof of Principle Study

Purpose: To investigate the applicability of feasibility-seeking cyclic orthogonal projections to the field of intensity modulated proton therapy (IMPT) inverse planning. Feasibility of constraints only, as opposed to optimization of a merit function, is less demanding algorithmically and holds a promise of parallel computations capability with non-cyclic orthogonal projections algorithms such as string-averaging or block-iterative strategies. Methods: A virtual 2D geometry was designed containing a C-shaped planning target volume (PTV) surrounding an organ at risk (OAR). The geometry was pixelized into 1 mm pixels. Four beams containing a subset of proton pencil beams were simulated in Geant4 to provide the system matrix A whose elements a-ij correspond to the dose delivered to pixel i by a unit intensity pencil beam j. A cyclic orthogonal projections algorithm was applied with the goal of finding a pencil beam intensity distribution that would meet the following dose requirements: D-OAR < 54 Gy and 57 Gy < D-PTV < 64.2 Gy. The cyclic algorithm was based on the concept of orthogonal projections onto half-spaces according to the Agmon-Motzkin-Schoenberg algorithm, also known as ‘ART for inequalities’. Results: The cyclic orthogonal projections algorithm resulted in less than 5% of the PTV pixels and less than 1% of OAR pixels violating their dose constraints, respectively. Because of the abutting OAR-PTV geometry and the realistic modelling of the pencil beam penumbra, complete satisfaction of the dose objectives was not achieved, although this would be a clinically acceptable plan for a meningioma abutting the brainstem, for example. Conclusion: The cyclic orthogonal projections algorithm was demonstrated to be an effective tool for inverse IMPT planning in the 2D test geometry described. We plan to further develop this linear algorithm to be capable of incorporating dose-volume constraints into the feasibility-seeking algorithm.

60 APPLIED LIFE SCIENCES↗