Search NASA⌕ Search

SEARCH · Search NASA

Results for “CONJUGATED SYSTEM”

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 253 records · Page 14
All sourcesNASA NTRSDOE OSTI
NASA NTRS2010

Simulation of Propellant Loading System Senior Design Implement in Computer Algorithm

Propellant loading from the Storage Tank to the External Tank is one of the very important and time consuming pre-launch ground operations for the launch vehicle. The propellant loading system is a complex integrated system involving many physical components such as the storage tank filled with cryogenic fluid at a very low temperature, the long pipe line connecting the storage tank with the external tank, the external tank along with the flare stack, and vent systems for releasing the excess fuel. Some of the very important parameters useful for design purpose are the prediction of pre-chill time, loading time, amount of fuel lost, the maximum pressure rise etc. The physics involved for mathematical modeling is quite complex due to the fact the process is unsteady, there is phase change as some of the fuel changes from liquid to gas state, then conjugate heat transfer in the pipe walls as well as between solid-to-fluid region. The simulation is very tedious and time consuming too. So overall, this is a complex system and the objective of the work is student's involvement and work in the parametric study and optimization of numerical modeling towards the design of such system. The students have to first become familiar and understand the physical process, the related mathematics and the numerical algorithm. The work involves exploring (i) improved algorithm to make the transient simulation computationally effective (reduced CPU time) and (ii) Parametric study to evaluate design parameters by changing the operational conditions

Bandyopadhyay, Alak↗
DOE OSTI2024

Vapor Phase Infiltration of Titanium Oxide into P3HT to Create Organic–Inorganic Hybrid Photocatalysts

Herein, we report for the first time the use of vapor phase infiltration (VPI) to infuse conducting polymers with inorganic metal oxide clusters that together form a photocatalytic material. While vapor infiltration has previously been used to electrically dope conjugated polymers, this is the first time, to our knowledge, that the resultant hybrid material has been demonstrated to have photocatalytic properties. The system studied is poly(3-hexylthiophene-2,5-diyl) (P3HT) vapor infiltrated with TiCl 4 and H 2 O to create P3HT-TiO x organic–inorganic hybrid photocatalytic materials. X-ray photoelectron spectroscopy analysis shows that P3HT-TiO x VPI films consist of a partially oxidized P3HT matrix, and the infiltrated titanium inorganic is in a 4+ oxidation state with mostly oxide coordination. Upon visible light illumination, these P3HT-TiO x hybrids degrade methylene blue dye molecules. The P3HT-TiO x hybrids are 4.6× more photocatalytically active than either the P3HT or TiO 2 individually or when sequentially deposited (e.g., P3HT on TiO 2 ). On a per surface area basis, these hybrid photocatalysts are comparable or better than other best in class polymer semiconductor photocatalysts. VPI of TiCl 4 + H 2 O into P3HT makes a unique hybrid structure and idealized photocatalyst architecture by creating nanoscale TiO x clusters concentrated toward the surface achieving extremely high catalytic rates. The mechanism for this enhanced photocatalytic rate is understood using photoluminescence spectroscopy, which shows significant quenching of excitons in P3HT-TiO x as compared to neat P3HT, indicating that P3HT acts as a photosensitizer for the TiO x catalyst sites in the hybrid material. This work introduces a new approach to designing and synthesizing organic–inorganic hybrid photocatalytic materials, with expansive opportunities for further exploration and optimization.

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

An M-step preconditioned conjugate gradient method for parallel computation

This paper describes a preconditioned conjugate gradient method that can be effectively implemented on both vector machines and parallel arrays to solve sparse symmetric and positive definite systems of linear equations. The implementation on the CYBER 203/205 and on the Finite Element Machine is discussed and results obtained using the method on these machines are given.

Adams, L.↗
NASA NTRS1988

On the constrained Chebyshev approximation problem on ellipses

Constrained Chebyshev approximation problems of the type with minimum (p is an element of Pi(sub n):p(c)=1) and maximum (z is an element of E) with /p(z)/ are considered. Here Pi(sub n) denotes the set of all complex polynomials of degree at most n, E is any ellipse in the complex plane, and c is an element of C/E. Such approximation problems arise in the context of optimizing semi-iterative methods for the solution of large, sparse systems of linear equations Ax=b with complex non-Hermitian coefficient matrices A. The problem of obtaining optimal polynomial preconditioners for conjugate gradient type methods for Ax=b also leads to problems of this type. A new family of polynomials -- q(sub n)(z;c), n is an element of N, and c is an element of C/E -- are introduced as the polynomials which are optimal for a modified version of the Chebyshev approximation problem with Pi(sub n) replaced by a certain subfamily. Some simple properties of q(sub n) are also listed. A necessary and sufficient condition for q(sub n) to be the extremal polynomial for the approximation problem is then derived. Finally, it is shown that q(sub n) is indeed optimal for the problem for all fixed n whenever the distance between c and E is sufficiently large. Results of some numerical tests are presented.

Freund, Roland↗
NASA NTRS1991

Dynamic modelling and analysis of a magnetically suspended flexible rotor

A 12-state lumped-element model is presented for a flexible rotor supported by two attractive force electromagnetic journal bearings. The rotor is modeled as a rigid disk with radial mass unbalance mounted on a flexible, massless shaft with internal damping (Jeffcott rotor). The disk is offset axially from the midspan of the shaft. Bearing dynamics in each radial direction are modeled as a parallel combination of a negative (unstable) spring and a linear current-to-force actuator. The model includes translation and rotation of the rigid mass and the first and second bending models of the flexible shaft, and it simultaneously includes internal shaft damping, gyroscopic effects, and the unstable nature of the attractive force magnetic bearings. The model is used to analyze the dependence of the system transmission zeros and open-loop poles on system parameters. The dominant open-loop poles occur in stable/unstable pairs with bandwidth dependent on the ratios of bearing (unstable) stiffnesses to rotor mass and damping dependent on the shaft spin rate. The zeros occur in complex conjugate pairs with bandwidth dependent on the ratios of shaft stiffness to rotor mass and damping dependent on the shaft spin rate. Some of the transmission zeros are non-minimum phase when the spin rate exceeds the shaft critical speed. The transmission zeros and open-loop poles impact the design of magnetic bearing control systems. The minimum loop cross-over frequency of the closed-loop system is the speed of the unstable open-loop poles. For the supercritical shaft spin rates, the presence of non-minimum phase zeros limits the distribution rejection achievable at frequencies near or above the shaft critical speed. Since non-minimum phase transmission zeros can only be changed by changing the system inputs and/or outputs, closed-loop performance is limited for supercritical spin rates unless additional force or torque actuators are added.

Mccallum, Duncan C.↗
NASA NTRS1989

Parallel linear equation solvers for finite element computations

The overall objective of this research is to develop efficient methods for the solution of linear and nonlinear systems of equations on parallel and supercomputers, and to apply these methods to the solution of problems in structural analysis. Attention has been given so far only to linear equations. The methods considered for the solution of the stiffness equation Kx=f have been Choleski factorization and the conjugate gradient iteration with SSOR and Incomplete Choleski preconditioning. More detail on these methods will be given on subsequent slides. These methods have been used to solve for the static displacements for the mast and panel focus problems in conjunction with the CSM testbed system based on NICE/SPAR.

Ortega, James M.↗
NASA NTRS1980

Ionospheric effects in active retrodirective array and mitigating system design

The operation of an active retrodirective array (ARA) in an ionospheric environment (that is either stationary or slowly-varying) was examined. The restrictions imposed on the pilot signal structure as a result of such operation were analyzed. A 3 tone pilot beam system was defined which first estimates the total electron content along paths of interest and then utilizes this information to aid the phase conjugator so that correct beam pointing can be achieved.

Nandi, A. K.↗
NASA NTRS1980

Ionospheric effects in active retrodirective array and mitigating system design

The operation of an active retrodirective array (ARA) in an ionospheric environment (that is either stationary or slowly-varying) was examined. The restrictions imposed on the pilot-signal structure as a result of such operation are analyzed. A 3-tone pilot beam system is defined which first estimates the total electron content along paths of interest and then utilizes this information to aid the phase conjugator so that correct beam pointing can be achieved.

Nandi, A. K.↗
NASA NTRS1993

Layout optimization with algebraic multigrid methods

Finding the optimal position for the individual cells (also called functional modules) on the chip surface is an important and difficult step in the design of integrated circuits. This paper deals with the problem of relative placement, that is the minimization of a quadratic functional with a large, sparse, positive definite system matrix. The basic optimization problem must be augmented by constraints to inhibit solutions where cells overlap. Besides classical iterative methods, based on conjugate gradients (CG), we show that algebraic multigrid methods (AMG) provide an interesting alternative. For moderately sized examples with about 10000 cells, AMG is already competitive with CG and is expected to be superior for larger problems. Besides the classical 'multiplicative' AMG algorithm where the levels are visited sequentially, we propose an 'additive' variant of AMG where levels may be treated in parallel and that is suitable as a preconditioner in the CG algorithm.

Regler, Hans↗
NASA NTRS2004

Putting Priors in Mixture Density Mercer Kernels

This paper presents a new methodology for automatic knowledge driven data mining based on the theory of Mercer Kernels, which are highly nonlinear symmetric positive definite mappings from the original image space to a very high, possibly infinite dimensional feature space. We describe a new method called Mixture Density Mercer Kernels to learn kernel function directly from data, rather than using predefined kernels. These data adaptive kernels can en- code prior knowledge in the kernel using a Bayesian formulation, thus allowing for physical information to be encoded in the model. We compare the results with existing algorithms on data from the Sloan Digital Sky Survey (SDSS). The code for these experiments has been generated with the AUTOBAYES tool, which automatically generates efficient and documented C/C++ code from abstract statistical model specifications. The core of the system is a schema library which contains template for learning and knowledge discovery algorithms like different versions of EM, or numeric optimization methods like conjugate gradient methods. The template instantiation is supported by symbolic- algebraic computations, which allows AUTOBAYES to find closed-form solutions and, where possible, to integrate them into the code. The results show that the Mixture Density Mercer-Kernel described here outperforms tree-based classification in distinguishing high-redshift galaxies from low- redshift galaxies by approximately 16% on test data, bagged trees by approximately 7%, and bagged trees built on a much larger sample of data by approximately 2%.

Srivastava, Ashok N.↗
NASA NTRS2005

An Ensemble Approach to Building Mercer Kernels with Prior Information

This paper presents a new methodology for automatic knowledge driven data mining based on the theory of Mercer Kernels, which are highly nonlinear symmetric positive definite mappings from the original image space to a very high, possibly dimensional feature space. we describe a new method called Mixture Density Mercer Kernels to learn kernel function directly from data, rather than using pre-defined kernels. These data adaptive kernels can encode prior knowledge in the kernel using a Bayesian formulation, thus allowing for physical information to be encoded in the model. Specifically, we demonstrate the use of the algorithm in situations with extremely small samples of data. We compare the results with existing algorithms on data from the Sloan Digital Sky Survey (SDSS) and demonstrate the method's superior performance against standard methods. The code for these experiments has been generated with the AUTOBAYES tool, which automatically generates efficient and documented C/C++ code from abstract statistical model specifications. The core of the system is a schema library which contains templates for learning and knowledge discovery algorithms like different versions of EM, or numeric optimization methods like conjugate gradient methods. The template instantiation is supported by symbolic-algebraic computations, which allows AUTOBAYES to find closed-form solutions and, where possible, to integrate them into the code.

Srivastava, Ashok N.↗
DOE OSTI2024

Decoupling excitons from high-frequency vibrations in organic molecules

The coupling of excitons in π-conjugated molecules to high-frequency vibrational modes, particularly carbon–carbon stretch modes (1,000–1,600 cm -1 ) has been thought to be unavoidable. These high-frequency modes accelerate non-radiative losses and limit the performance of light-emitting diodes, fluorescent biomarkers and photovoltaic devices. Here, by combining broadband impulsive vibrational spectroscopy, first-principles modelling and synthetic chemistry, we explore exciton–vibration coupling in a range of π-conjugated molecules. We uncover two design rules that decouple excitons from high-frequency vibrations. First, when the exciton wavefunction has a substantial charge-transfer character with spatially disjoint electron and hole densities, we find that high-frequency modes can be localized to either the donor or acceptor moiety, so that they do not significantly perturb the exciton energy or its spatial distribution. Second, it is possible to select materials such that the participating molecular orbitals have a symmetry-imposed non-bonding character and are, thus, decoupled from the high-frequency vibrational modes that modulate the π-bond order. We exemplify both these design rules by creating a series of spin radical systems that have very efficient near-infrared emission (680–800 nm) from charge-transfer excitons. We show that these systems have substantial coupling to vibrational modes only below 250 cm -1 , frequencies that are too low to allow fast non-radiative decay. This enables non-radiative decay rates to be suppressed by nearly two orders of magnitude in comparison to π-conjugated molecules with similar bandgaps. Our results show that losses due to coupling to high-frequency modes need not be a fundamental property of these systems.

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

High fidelity multiphysics tightly coupled model for a lead cooled fast reactor concept and application to statistical calculation of hot channel factors

A tightly coupled multiphysics code system is established using the MOOSE framework for hot channel factor (HCF) evaluation on a Lead Fast Reactor (LFR) concept. The coupled system is driven by the Griffin multiphysics coupling capability under which the MOOSE Heat Transfer module and NekRS computational fluid dynamics solver are coupled for conjugate heat transfer using the Cardinal application. The coupled capability is demonstrated on an LFR assembly model based on materials and geometry of a prototypical lead-cooled fast reactor design by Westinghouse Electric Company, LLC. Moreover, the work integrates the Multiphysics Object Oriented Simulation Environment (MOOSE) Stochastic Tools Module (STM) to perform calculations for statistical analysis of HCF. Furthermore, the coupling strategy and workflow demonstrated in this paper is not only useful for predicting accurate hot channel factors for different kinds of advanced reactors but also for other engineering applications such as control rod worth assessment, generation of high-fidelity database for Artificial intelligence (AI)/machine learning (ML) training, design optimization and multi-resolution modeling.

Cardinal↗
NASA NTRS1980

Solid-state configurations

Two prototype solid-state phased array systems concepts developed for the solar power satellite (SPS) are described. In both concepts, the beam was centered on the rectenna by means of phase conjugation of a pilot signal emanating from the ground. Also discussed are results of solid state studies.

Schroeder, K. G.↗
NASA NTRS2004

Automatic Generation of Algorithms for the Statistical Analysis of Planetary Nebulae Images

Analyzing data sets collected in experiments or by observations is a Core scientific activity. Typically, experimentd and observational data are &aught with uncertainty, and the analysis is based on a statistical model of the conjectured underlying processes, The large data volumes collected by modern instruments make computer support indispensible for this. Consequently, scientists spend significant amounts of their time with the development and refinement of the data analysis programs. AutoBayes [GF+02, FS03] is a fully automatic synthesis system for generating statistical data analysis programs. Externally, it looks like a compiler: it takes an abstract problem specification and translates it into executable code. Its input is a concise description of a data analysis problem in the form of a statistical model as shown in Figure 1; its output is optimized and fully documented C/C++ code which can be linked dynamically into the Matlab and Octave environments. Internally, however, it is quite different: AutoBayes derives a customized algorithm implementing the given model using a schema-based process, and then further refines and optimizes the algorithm into code. A schema is a parameterized code template with associated semantic constraints which define and restrict the template s applicability. The schema parameters are instantiated in a problem-specific way during synthesis as AutoBayes checks the constraints against the original model or, recursively, against emerging sub-problems. AutoBayes schema library contains problem decomposition operators (which are justified by theorems in a formal logic in the domain of Bayesian networks) as well as machine learning algorithms (e.g., EM, k-Means) and nu- meric optimization methods (e.g., Nelder-Mead simplex, conjugate gradient). AutoBayes augments this schema-based approach by symbolic computation to derive closed-form solutions whenever possible. This is a major advantage over other statistical data analysis systems which use numerical approximations even in cases where closed-form solutions exist. AutoBayes is implemented in Prolog and comprises approximately 75.000 lines of code. In this paper, we take one typical scientific data analysis problem-analyzing planetary nebulae images taken by the Hubble Space Telescope-and show how AutoBayes can be used to automate the implementation of the necessary anal- ysis programs. We initially follow the analysis described by Knuth and Hajian [KHO2] and use AutoBayes to derive code for the published models. We show the details of the code derivation process, including the symbolic computations and automatic integration of library procedures, and compare the results of the automatically generated and manually implemented code. We then go beyond the original analysis and use AutoBayes to derive code for a simple image segmentation procedure based on a mixture model which can be used to automate a manual preproceesing step. Finally, we combine the original approach with the simple segmentation which yields a more detailed analysis. This also demonstrates that AutoBayes makes it easy to combine different aspects of data analysis.

Fischer, Bernd↗
NASA NTRS1996

Preserving Symmetry in Preconditioned Krylov Subspace Methods

We consider the problem of solving a linear system Ax = b when A is nearly symmetric and when the system is preconditioned by a symmetric positive definite matrix M. In the symmetric case, one can recover symmetry by using M-inner products in the conjugate gradient (CG) algorithm. This idea can also be used in the nonsymmetric case, and near symmetry can be preserved similarly. Like CG, the new algorithms are mathematically equivalent to split preconditioning, but do not require M to be factored. Better robustness in a specific sense can also be observed. When combined with truncated versions of iterative methods, tests show that this is more effective than the common practice of forfeiting near-symmetry altogether.

Chan, Tony F.↗
NASA NTRS2002

Rationally designed fluorescently labeled sulfate-binding protein mutants: evaluation in the development of a sensing system for sulfate

Periplasmic binding proteins from E. coli undergo large conformational changes upon binding their respective ligands. By attaching a fluorescent probe at rationally selected unique sites on the protein, these conformational changes in the protein can be monitored by measuring the changes in fluorescence intensity of the probe which allow the development of reagentless sensing systems for their corresponding ligands. In this work, we evaluated several sites on bacterial periplasmic sulfate-binding protein (SBP) for attachment of a fluorescent probe and rationally designed a reagentless sensing system for sulfate. Eight different mutants of SBP were prepared by employing the polymerase chain reaction (PCR) to introduce a unique cysteine residue at a specific location on the protein. The sites Gly55, Ser90, Ser129, Ala140, Leu145, Ser171, Val181, and Gly186 were chosen for mutagenesis by studying the three-dimensional X-ray crystal structure of SBP. An environment-sensitive fluorescent probe (MDCC) was then attached site-specifically to the protein through the sulfhydryl group of the unique cysteine residue introduced. Each fluorescent probe-conjugated SBP mutant was characterized in terms of its fluorescence properties and Ser171 was determined to be the best site for the attachment of the fluorescent probe that would allow for the development of a reagentless sensing system for sulfate. Three different environment-sensitive fluorescent probes (1,5-IAEDANS, MDCC, and acylodan) were studied with the SBP171 mutant protein. A calibration curve for sulfate was constructed using the labeled protein and relating the change in the fluorescence intensity with the amount of sulfate present in the sample. The detection limit for sulfate was found to be in the submicromolar range using this system. The selectivity of the sensing system was demonstrated by evaluating its response to other anions. A fast and selective sensing system with detection limits for sulfate in the submicromolar range was developed. Copyright 2002 Wiley Periodicals, Inc. Biotechnol Bioeng 78: 517-526, 2002.

Evaluation Studies↗