SEARCH · Search NASA

Results for “Sequential scheme”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 217 records · Page 12

All sources NASA NTRS DOE OSTI

DOE OSTI2017

Comparative Implementation of High Performance Computing for Power System Dynamic Simulations

Dynamic simulation for transient stability assessment is one of the most important, but intensive, computations for power system planning and operation. Present commercial software is mainly designed for sequential computation to run a single simulation, which is very time consuming with a single processer. The application of High Performance Computing (HPC) to dynamic simulations is very promising in accelerating the computing process by parallelizing its kernel algorithms while maintaining the same level of computation accuracy. This paper describes the comparative implementation of four parallel dynamic simulation schemes in two state-of-the-art HPC environments: Message Passing Interface (MPI) and Open Multi-Processing (OpenMP). These implementations serve to match the application with dedicated multi-processor computing hardware and maximize the utilization and benefits of HPC during the development process.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS2011

Telemetry-Based Ranging

A telemetry-based ranging scheme was developed in which the downlink ranging signal is eliminated, and the range is computed directly from the downlink telemetry signal. This is the first Deep Space Network (DSN) ranging technology that does not require the spacecraft to transmit a separate ranging signal. By contrast, the evolutionary ranging techniques used over the years by NASA missions, including sequential ranging (transmission of a sequence of sinusoids) and PN-ranging (transmission of a pseudo-noise sequence) whether regenerative (spacecraft acquires, then regenerates and retransmits a noise-free ranging signal) or transparent (spacecraft feeds the noisy demodulated uplink ranging signal into the downlink phase modulator) relied on spacecraft power and bandwidth to transmit an explicit ranging signal. The state of the art in ranging is described in an emerging CCSDS (Consultative Committee for Space Data Systems) standard, in which a pseudo-noise (PN) sequence is transmitted from the ground to the spacecraft, acquired onboard, and the PN sequence is coherently retransmitted back to the ground, where a delay measurement is made between the uplink and downlink signals. In this work, the telemetry signal is aligned with the uplink PN code epoch. The ground station computes the delay between the uplink signal transmission and the received downlink telemetry. Such a computation is feasible because symbol synchronizability is already an integral part of the telemetry design. Under existing technology, the telemetry signal cannot be used for ranging because its arrival-time information is not coherent with any Earth reference signal. By introducing this coherence, and performing joint telemetry detection and arrival-time estimation on the ground, a high-rate telemetry signal can provide all the precision necessary for spacecraft ranging.

Hamkins, Jon↗

DOE OSTI2011

Robust, multidimensional mesh motion based on Monge-Kantorovich equidistribution

Mesh-motion (r-refinement) grid adaptivity schemes are attractive due to their potential to minimize the numerical error for a prescribed number of degrees of freedom. However, a key roadblock to a widespread deployment of this class of techniques has been the formulation of robust, reliable mesh-motion governing principles, which (1) guarantee a solution in multiple dimensions (2D and 3D), (2) avoid grid tangling (or folding of the mesh, whereby edges of a grid cell cross somewhere in the domain), and (3) can be solved effectively and efficiently. In this study, we formulate such a mesh-motion governing principle, based on volume equidistribution via Monge-Kantorovich optimization (MK). In earlier publications [1] and [2], the advantages of this approach with regard to these points have been demonstrated for the time-independent case. In this study, we demonstrate that Monge-Kantorovich equidistribution can in fact be used effectively in a time-stepping context, and delivers an elegant solution to the otherwise pervasive problem of grid tangling in mesh-motion approaches, without resorting to ad hoc time-dependent terms (as in moving-mesh PDEs, or MMPDEs [3] and [4]). We explore two distinct r-refinement implementations of MK: the direct method, where the current mesh relates to an initial, unchanging mesh, and the sequential method, where the current mesh is related to the previous one in time. We demonstrate that the direct approach is superior with regard to mesh distortion and robustness. The properties of the approach are illustrated with a hyperbolic PDE, the advection of a passive scalar, in 2D and 3D. Velocity flow fields with and without flow shear are considered. Three-dimensional grid, time-step, and nonlinear tolerance convergence studies are presented which demonstrate the optimality of the approach.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

NASA NTRS1992

Treating convection in sequential solvers

The treatment of the convection terms in the sequential solver, a standard procedure found in virtually all pressure based algorithms, to compute the flow problems with sharp gradients and source terms is investigated. Both scalar model problems and one-dimensional gas dynamics equations have been used to study the various issues involved. Different approaches including the use of nonlinear filtering techniques and adoption of TVD type schemes have been investigated. Special treatments of the source terms such as pressure gradients and heat release have also been devised, yielding insight and improved accuracy of the numerical procedure adopted.

Shyy, Wei↗

NASA NTRS1986

Implicit hybrid schemes for the flux-difference split, three-dimensional Navier-Stokes equations

Implicit hybrid algorithms employing symmetric planar Gauss-Seidel (SPGS) relaxation and either block-tridiagonally structured coefficient matrices (AF-SPGS) or block-triangular coefficient matrices (LU-SPGS) are derived to solve the flux-difference-split Navier-Stokes equations for three-dimensional incompressible flow in an upwind scheme. The physical basis of the approach is discussed, and results for problems involving vortex flow around a thin delta wing at Reynolds numbers 900,000 and 10,000 are presented graphically. It is found that AF-SPGS converges faster on vector computers which depend on long vector lengths to achieve optimum performance, whereas LU-SPGS is preferable on sequentially operating machines and vector computers using shorter vector lengths.

Hartwich, P.-M.↗

NASA NTRS1996

Unsteady, Transonic Flow Around Delta Wings Undergoing Coupled and Natural Modes Response: A Multidisciplinary Problem

The unsteady, three-dimensional Navier-Stokes equations coupled with the Euler equations of rigid-body dynamics are sequentially solved to simulate and analyze the aerodynamic response of a high angle of attack delta wing undergoing oscillatory motion. The governing equations of fluid flow and dynamics of the multidisciplinary problem are solved using a time-accurate solution of the laminar, unsteady, compressible, full Navier- Stokes equations with the implicit, upwind, Roe flux-difference splitting, finite-volume scheme and a four-stage Runge-Kutta scheme, respectively. The primary model under consideration consists of a 65 deg swept, sharp-edged, cropped delta wing of zero thickness at 20 deg angle of attack. In a freestream of Mach 0.85 and Reynolds number of 3.23 x 10(exp 6), the flow over the upper surface of the wing develops a complex shock system which interacts with the leading-edge primary vortices producing vortex breakdown. The effect of the oscillatory motion of the wing on the vortex breakdown and overall aerodynamic response is detailed to provide insight to the complicated physics associated with unsteady flows and the phenomenon of wing rock. Forced sinusoidal single and coupled mode rolling and pitching motion is presented for the wing in a transonic freestream. The Reynolds number, frequency of oscillation, and the phase angle are varied. Comparison between the single and coupled mode forced rolling and pitching oscillation cases illustrate the effects of coupling the motion. This investigation shows that even when coupled, forced rolling oscillation at a reduced frequency of 2(pi) eliminates the vortex breakdown which results in an increase in lift. The coupling effect for in phase forced oscillations show that the lift coefficient of the pitching-alone case and the rolling-moment coefficient of the rolling-alone case dominate the resulting response. However, with a phase lead in the pitching motion, the coupled motion results in a non-periodic response of the rolling moment. The second class of problems involve releasing the wing in roll to respond to the flowfield. Two models of sharp-edged delta wings, the previous 65 deg swept model and an 80 deg swept, sharp-edged delta wing, are used to observe the aerodynamic response of a wing free to roll in a transonic and subsonic freestream, respectively. These cases demonstrate damped oscillations, self-sustained limit cycle oscillations, and divergent rolling oscillations. Ultimately, an active control model using a mass injection system was applied on the surface of the wing to suppress the self-sustained limit cycle oscillation known as wing rock. Comparisons with experimental investigations complete this study, validating the analysis and illustrating the complex details afforded by computational investigations.

Menzies, Margaret Anne↗

DOE OSTI2020

Bayesian inference of Stochastic reaction networks using Multifidelity Sequential Tempered Markov Chain Monte Carlo

Stochastic reaction network models are often used to explain and predict the dynamics of gene regulation in single cells.These models usually involve several parameters, such as the kinetic rates of chemical reactions, that are not directly measurable and must be inferred from experimental data. Bayesian inference provides a rigorous probabilistic frame-work for identifying these parameters by finding a posterior parameter distribution that captures their uncertainty.Traditional computational methods for solving inference problems such as Markov Chain Monte Carlo methods based on classical Metropolis-Hastings algorithm involve numerous serial evaluations of the likelihood function, which in turn requires expensive forward solutions of the chemical master equation (CME). We propose an alternate approach based on a multifidelity extension of the Sequential Tempered Markov Chain Monte Carlo (ST-MCMC) sampler. This algorithm is built upon Sequential Monte Carlo and solves the Bayesian inference problem by decomposing it into a sequence of efficiently solved subproblems that gradually increase both model fidelity and the influence of the observed data. We reformulate the finite state projection (FSP) algorithm, a well-known method for solving the CME, to produce a hierarchy of surrogate master equations to be used in this multifidelity scheme. To determine the appropriate fidelity, we introduce a novel information-theoretic criteria that seeks to extract the most information about the ultimate Bayesian posterior from each model in the hierarchy without inducing significant bias. This novel sampling scheme is tested with high performance computing resources using biologically relevant problems.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2017

Fast synchronization-free algorithms for parallel sparse triangular solves with multiple right-hand sides

The sparse triangular solve kernels, SpTRSV and SpTRSM, are important building blocks for a number of numerical linear algebra routines. Parallelizing SpTRSV and SpTRSM on today's many-core platforms, such as GPUs, is not an easy task since computing a component of the solution may depend on previously computed components, enforcing a degree of sequential processing. As a consequence, most existing work introduces a preprocessing stage to partition the components into a group of level-sets or colour-sets so that components within a set are independent and can be processed simultaneously during the subsequent solution stage. However, this class of methods requires a long preprocessing time as well as significant runtime synchronization over-heads between the sets. To address this, we

HPC↗

DOE OSTI2023

A Review of Distributed Secondary Control Architectures in Islanded-Inverter-Based Microgrids

The increasing energy demand, the shortage of energy resources, and the environmental challenges faced by conventional power-generation systems are some of the ongoing challenges faced by modern power systems. Therefore, many efforts have been made by the scientific community to develop comprehensive solutions to overcome these issues. For instance, current technological advances have allowed the integration of distributed generators into the power systems, promoting the use of microgrids to overcome these issues. However, the use of renewable distributed generators have introduced new challenges to the traditional control system schemes. To overcome these challenges, a hierarchical control approach has been proposed for distributed renewable sources. In other words, the control scheme have been divided into three hierarchical levels, primary, secondary, and tertiary, to overcome the new challenges present in modern power systems. Due to extensiveness of this topic, this overview is focused on secondary control systems, mainly for AC isolated microgrids. To improve the power quality of modern systems, several secondary control schemes have been proposed to overcome the well-known problem of frequency and voltage deviation. Some of these schemes have also introduced adequate active/reactive power sharing techniques to optimize the utilization of resources. Additionally, other secondary control schemes have also focused on reducing the communication load, to lower the network cost and adding robustness against communication problems. This article presents an insight of the different control techniques used to overcome power quality and communication problems. A comprehensive overview of distributed secondary control techniques for islanded microgrids is presented. In addition, the implementation of these techniques is explained in an orderly and sequential manner.

14 SOLAR ENERGY↗

DOE OSTI2025

Communication Lower Bounds and Optimal Algorithms for Symmetric Matrix Computations

In this article, we focus on the communication costs of three symmetric matrix computations: (i) multiplying a matrix with its transpose, known as a symmetric rank-k update (SYRK) (ii) adding the result of the multiplication of a matrix with the transpose of another matrix and the transpose of that result, known as a symmetric rank-2k update (SYR2K) (iii) performing matrix multiplication with a symmetric input matrix (SYMM). All three computations appear in the Level 3 Basic Linear Algebra Subroutines (BLAS) and have wide use in applications involving symmetric matrices. We establish communication lower bounds for these kernels using sequential and distributed-memory parallel computational models, and we show that our bounds are tight by presenting communication-optimal algorithms for each setting. Our lower bound proofs rely on applying a geometric inequality for symmetric computations and analytically solving constrained nonlinear optimization problems. As a result, the symmetric matrix and its corresponding computations are accessed and performed according to a triangular block partitioning scheme in the optimal algorithms.

Al Daas, Hussam [Rutherford Appleton Laboratory, D↗

NASA NTRS1996

Natural Rolling Responses of a Delta Wing in Transonic and Subsonic Flows

The unsteady, three-dimensional, full Navier-Stokes (NS) equations and the Euler equations of rigid-body dynamics are sequentially solved to simulate the natural rolling response of slender delta wings of zero thickness at moderate to high angles of attack, to transonic and subsonic flows. The governing equations of fluid flow and dynamics of the present multi-disciplinary problem are solved using the time-accurate solution of the NS equations with the implicit, upwind, Roe flux-difference splitting, finite-volume scheme and a four-stage Runge-Kutta scheme, respectively. The main focus is to analyze the effect of Mach number and angle of attack on the leading edge vortices and their breakdown, the resultant rolling motion, and overall aerodynamic response of the wing. Three cases demonstrate the natural response of a 65 deg swept, cropped delta wing in a transonic flow with breakdown of the leading edge vortices and an 80 deg swept delta wing in a subsonic flow undergoing either damped or self-excited limit-cycle rolling oscillations as a function of angle of attack. Comparisons with an experimental investigation completes this study, validating the analysis and illustrating the complex details afforded by computational investigations.

Menzies, Margaret A.↗

NASA NTRS1998

Computational Investigation and Validation of Twin-Tail Buffet Response Including Dynamics and Control

Multidisciplinary tools for prediction of single rectangular-tail buffet are extended to single swept-back-tail buffet in transonic-speed flow, and multidisciplinary tools for prediction and control of twin-tail buffet are developed and presented. The configuration model consists of a sharp-edged delta wing with single or twin tails that are oriented normal to the wing surface. The tails are treated as cantilevered beams fixed at the root and allowed to oscillate in both bending and torsion. This complex multidisciplinary problem is solved sequentially using three sets of equations on a dynamic single or multi-block grid structure. The first set is the unsteady, compressible, Reynolds-averaged Navier-Stokes equations which are used for obtaining the flow field vector and the aerodynamic loads on the tails. The Navier-Stokes equations are solved accurately in time using the implicit, upwind, flux-difference splitting, finite volume scheme. The second set is the coupled bending and torsion aeroelastic equations of cantilevered beams which are used for obtaining the bending and torsion deflections of the tails. The aeroelastic equations'are solved accurately in time using, a fifth-order-accurate Runge-Kutta scheme. The third set is the grid-displacement equations and the rigid-body dynamics equations, which are used for updating the grid coordinates due to the tail deflections and rigid-body motions. The tail-buffet phenomenon is predicted for highly-swept, single vertical tail placed at the plane of geometric symmetry, and for highly-swept, vertical twin tails placed at three different spanwise separation distances. The investigation demonstrates the effects of structural inertial coupling and uncoupling of the bending and torsion modes of vibration, spanwise positions of the twin-tail, angle of attack, and pitching and rolling dynamic motions of the configuration model on the tail buffet loading and response. The fundamental issue of twin-tail buffet alleviation is addressed using two active flow-control methods. These methods are the tangential leading-edge blowing and the flow suction from the leading-edge vortex cores along their paths. Qualitative and quantitative comparisons with the available experimental data are presented. The comparisons indicate that the present multidisciplinary aeroelastic analysis tools are robust, accurate and efficient.

Kandil, Osama A.↗

NASA NTRS2009

Porting Gravitational Wave Signal Extraction to Parallel Virtual Machine (PVM)

Laser Interferometer Space Antenna (LISA) is a planned NASA-ESA mission to be launched around 2012. The Gravitational Wave detection is fundamentally the determination of frequency, source parameters, and waveform amplitude derived in a specific order from the interferometric time-series of the rotating LISA spacecrafts. The LISA Science Team has developed a Mock LISA Data Challenge intended to promote the testing of complicated nested search algorithms to detect the 100-1 millihertz frequency signals at amplitudes of 10E-21. However, it has become clear that, sequential search of the parameters is very time consuming and ultra-sensitive; hence, a new strategy has been developed. Parallelization of existing sequential search algorithms of Gravitational Wave signal identification consists of decomposing sequential search loops, beginning with outermost loops and working inward. In this process, the main challenge is to detect interdependencies among loops and partitioning the loops so as to preserve concurrency. Existing parallel programs are based upon either shared memory or distributed memory paradigms. In PVM, master and node programs are used to execute parallelization and process spawning. The PVM can handle process management and process addressing schemes using a virtual machine configuration. The task scheduling and the messaging and signaling can be implemented efficiently for the LISA Gravitational Wave search process using a master and 6 nodes. This approach is accomplished using a server that is available at NASA Ames Research Center, and has been dedicated to the LISA Data Challenge Competition. Historically, gravitational wave and source identification parameters have taken around 7 days in this dedicated single thread Linux based server. Using PVM approach, the parameter extraction problem can be reduced to within a day. The low frequency computation and a proxy signal-to-noise ratio are calculated in separate nodes that are controlled by the master using message and vector of data passing. The message passing among nodes follows a pattern of synchronous and asynchronous send-and-receive protocols. The communication model and the message buffers are allocated dynamically to address rapid search of gravitational wave source information in the Mock LISA data sets.

Thirumalainambi, Rajkumar↗

DOE OSTI2017

A robust and efficient stepwise regression method for building sparse polynomial chaos expansions

Polynomial Chaos (PC) expansions are widely used in various engineering fields for quantifying uncertainties arising from uncertain parameters. The computational cost of classical PC solution schemes is unaffordable as the number of deterministic simulations to be calculated grows dramatically with the number of stochastic dimension. This considerably restricts the practical use of PC at the industrial level. A common approach to address such problems is to make use of sparse PC expansions. This paper presents a non-intrusive regression-based method for building sparse PC expansions. The most important PC contributions are detected sequentially through an automatic search procedure. The variable selection criterion is based on efficient tools relevant to probabilistic method. Two benchmark analytical functions are used to validate the proposed algorithm. The computational efficiency of the method is then illustrated by a more realistic CFD application, consisting of the non-deterministic flow around a transonic airfoil subject to geometrical uncertainties. To assess the performance of the developed methodology, a detailed comparison is made with the well established LAR-based selection technique. The results show that the developed sparse regression technique is able to identify the most significant PC contributions describing the problem. Moreover, the most important stochastic features are captured at a reduced computational cost compared to the LAR method. The results also demonstrate the superior robustness of the method by repeating the analyses using random experimental designs.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2014

SU-E-T-395: Multi-GPU-Based VMAT Treatment Plan Optimization Using a Column-Generation Approach

Purpose: GPU has been employed to speed up VMAT optimizations from hours to minutes. However, its limited memory capacity makes it difficult to handle cases with a huge dose-deposition-coefficient (DDC) matrix, e.g. those with a large target size, multiple arcs, small beam angle intervals and/or small beamlet size. We propose multi-GPU-based VMAT optimization to solve this memory issue to make GPU-based VMAT more practical for clinical use. Methods: Our column-generation-based method generates apertures sequentially by iteratively searching for an optimal feasible aperture (referred as pricing problem, PP) and optimizing aperture intensities (referred as master problem, MP). The PP requires access to the large DDC matrix, which is implemented on a multi-GPU system. Each GPU stores a DDC sub-matrix corresponding to one fraction of beam angles and is only responsible for calculation related to those angles. Broadcast and parallel reduction schemes are adopted for inter-GPU data transfer. MP is a relatively small-scale problem and is implemented on one GPU. One headand- neck cancer case was used for test. Three different strategies for VMAT optimization on single GPU were also implemented for comparison: (S1) truncating DDC matrix to ignore its small value entries for optimization; (S2) transferring DDC matrix part by part to GPU during optimizations whenever needed; (S3) moving DDC matrix related calculation onto CPU. Results: Our multi-GPU-based implementation reaches a good plan within 1 minute. Although S1 was 10 seconds faster than our method, the obtained plan quality is worse. Both S2 and S3 handle the full DDC matrix and hence yield the same plan as in our method. However, the computation time is longer, namely 4 minutes and 30 minutes, respectively. Conclusion: Our multi-GPU-based VMAT optimization can effectively solve the limited memory issue with good plan quality and high efficiency, making GPUbased ultra-fast VMAT planning practical for real clinical use.

60 APPLIED LIFE SCIENCES↗

NASA NTRS1990

Gamma guidance of trajectories for coplanar, aeroassisted orbital transfer

The optimization and guidance of trajectories for coplaner, aeroassisted orbital transfer (AOT) from high Earth orbit (HEO) to low Earth orbit (LEO) are examined. In particular, HEO can be a geosynchronous Earth orbit (GEO). It is assumed that the initial and final orbits are circular, that the gravitational field is central and is governed by the inverse square law, and that at most three impulses are employed: one at HEO exit, one at atmospheric exit, and one at LEO entry. It is also assumed that, during the atmospheric pass, the trajectory is controlled via the lift coefficient. The presence of upper and lower bounds on the lift coefficient is considered. First, optimal trajectories are computed by minimizing the total velocity impulse (hence, the propellant consumption) required for AOT transfer. The sequential gradient-restoration algorithm (SGRA) is used for optimal control problems. The optimal trajectory is shown to include two branches: a relatively short descending flight branch (branch 1) and a long ascending flight branch (branch 2). Next, attention is focused on guidance trajectories capable of approximating the optimal trajectories in real time, while retaining the essential characteristics of simplicity, ease of implementation, and reliability. For the atmospheric pass, a feedback control scheme is employed and the lift coefficient is adjusted according to a two-stage gamma guidance law. Further improvements are possible via a modified gamma guidance which is more stable with respect to dispersion effects arising from navigation errors, variations of the atmospheric density, and uncertainties in the aerodynamic coefficients than gamma guidance trajectory. A byproduct of the studies on dispersion effects is the following design concept. For coplaner aeroassisted orbital transfer, the lift-range-to-weight ratio appears to play a more important role than the lift-to-drag ratio. This is because the lift-range-to-weight ratio controls mainly the minimum altitude (hence, the peak heating rate) of the guidance trajectory; on the other hand, the lift-to-drag ratio controls mainly the duration of the atmospheric pass of the guidance trajectory.

Miele, A.↗

DOE OSTI2021

Using spin alignment of inelastically excited nuclei in fast beams to assign spins: The spectroscopy of 13 O as a test case

Excited states in O 13 were investigated using inelastic scattering of an E / A = 69.5 MeV O 13 beam off of a Be 9 target. The excited states were identified in the invariant-mass spectra of the decay products. Both single-proton and sequential two-proton decays of the excited states were examined. Furthermore, for a number of the excited states, the protons were emitted with strong anisotropy where emissions transverse to the beam axis are favored. The measured proton-decay angular distributions were compared to predictions from distorted-wave Born-approximation calculations of the spin alignment which was shown to be largely independent of the excitation mechanism. The deduced O 13 level scheme is compared to ab initio no-core shell model with continuum predictions. The lowest-energy excited states decay isotropically consistent with predictions of strong proton 1 s 1 / 2 structure. Above these states in the level scheme, we observed a number of higher-spin states not predicted within the model. Possibly these are associated with rotational bands built on deformed cluster configurations predicted by antisymmetrized molecular dynamics calculations. The spin alignment mechanism is shown to be useful for making spin assignments and may have widespread use.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

DOE OSTI2021

Data for Conversion of High-Solids Hydrothermally Pretreated Bioenergy Sorghum to Lipids and Ethanol Using Yeast Cultures

Glucose and xylose are the major sugars present in cellulosic hydrolysates. The cellulosic sugars can be used for the production of platform chemicals. In this study, productions of lipid and ethanol by yeasts were compared for concentrated bioenergy sorghum syrup. Bioenergy sorghum was hydrothermally pretreated at 50% w/w solids in a continuous industrial reactor and sequentially mechanically refined using a burr mill to improve biomass accessibility for hydrolysis. Fed-batch enzymatic hydrolysis was conducted with 50% w/v solids loading and cellulase cocktail (50 FPU/g biomass) to achieve 230 g/L sugar concentration. Various strains of Rhodosporidium toruloides were evaluated for converting sugars into lipids, and strain Y-6987 had the highest lipid titer (9.2 g/L). The lipid titer was improved to 19.0 g/L by implementing a two-stage culture scheme, where the first stage was optimized for yeast growth and the second for lipid production. For ethanol production, the engineered Saccharomyces cerevisiae SR8ΔADH6 was used to coferment glucose and xylose. Ethanol fermentation was optimized for media nutrients (YP, YNB/urea, and urea), cellulosic sugar concentration, and sulfite conditioning to maximize the ethanol concentration from sorghum syrups. Fermentation of 70% v/v concentrated hydrolysate conditioned with sulfite produces 50.1 g/L ethanol from 141 g/L of sugars.

Conversion↗