Search NASA⌕ Search

SEARCH · Search NASA

Results for “iterative linear solution”

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 577 records · Page 32
All sourcesNASA NTRSDOE OSTI
NASA NTRS2014

Badger COMET Compartmentalized Onboard Material Extrusion Technology

In response to the 2014 NASA Academic Innovation Challenge, the University of Wisconsin – Madison team presents the design of a collapsible Fused Deposition Modeling (FDM) system for in situ manufacturing in a space habitat environment, the Badger Compartmentalized Onboard Material Extrusion Technology (COMET). The proposed mechanism incorporates one year of design and testing on an array of current additive manufacturing techniques, with the goal of providing a reliable and maintainable manufacturing solution. Seven Level 1 requirements were employed to guide the design process, based on information in the challenge, communications with NASA, and the evolving systems feedback of project work groups. These requirements provided a baseline for the development of the System Requirements Document (SRD, Appendix I), which framed the design of the system. The design requirements deemed critical to the success of the systems are as follows: - The system shall compose an FDM workstation capable of producing parts within industry standard tolerances. - The system shall reduce to a minimum of 50 percent or less of its deployed volume when not in use, and must collapse without the need for disassembly. - The system shall meet all relevant NASA safety and functional standards. The final design for the Badger COMET was selected from multiple design iterations, which balanced the critical design requirements listed above with system reliability, with the final goal of providing a minimal system weight. The system collapses in the vertical direction, allowing for a maximum reduction in volume. Guide rods and precision, anti-backlash lead screws provide all linear movement in the device. Stepper motors were chosen to actuate each system axis, due to their high precision and repeatable accuracy. The system is controlled through an on-board computer system and embedded electronics package.

Frederick T. Elder↗
DOE OSTI2022

Multistage mixed precision iterative refinement

Abstract Low precision arithmetic, in particular half precision (16‐bit) floating point arithmetic, is now available in commercial hardware. Using lower precision can offer significant savings in computation and communication costs with proportional savings in energy. Motivated by this, there has been a renewed interest in mixed precision iterative refinement schemes for solving linear systems , and new variants of GMRES‐based iterative refinement have been developed. Each particular variant with a given combination of precisions leads to different condition number‐based constraints for convergence of the backward and forward errors, and each has different performance costs. The constraints for convergence given in the literature are, as an artifact of the analyses, often overly strict in practice, and thus could lead a user to select a more expensive variant when a less expensive one would have sufficed. In this work, we develop a multistage mixed precision iterative refinement solver which aims to combine existing mixed precision approaches to balance performance and accuracy and improve usability. For a user‐specified initial combination of precisions, the algorithm begins with the least expensive approach and convergence is monitored via inexpensive computations with quantities produced during the iteration. If slow convergence or divergence is detected using particular stopping criteria, the algorithm switches to use a more expensive, but more reliable variant. A novel aspect of our approach is that, unlike existing implementations, our algorithm first attempts to use “stronger” GMRES‐based solvers for the solution update before resorting to increasing the precision(s). In some scenarios, this can avoid the need to refactorize the matrix in higher precision. We perform extensive numerical experiments on a variety of random dense problems and problems from real applications which confirm the benefits of the multistage approach.

Oktay, Eda↗
DOE OSTI2016

TU-H-BRA-04: A Novel Superconducting Magnet Design for Optimized Patient Access and Minimal SSD for Use in a Linac-MR Hybrid

Purpose: A prototype rotating hybrid MR imaging system and linac has been developed to allow for simultaneous imaging and radiation delivery parallel to B{sub 0}. However, the design of a compact magnet capable of rotation in a small vault with sufficient patient access and a typical clinical source-to-surface distance (SSD) is challenging. This work presents a novel superconducting magnet design that allows for a reduced SSD and ample patient access by moving the superconducting coils to the side of the yoke. The yoke and pole-plate structures are shaped to direct the magnetic flux appropriately. Methods: The surface of the pole plate for the magnet assembly is optimized. The magnetic field calculations required in this work are performed with the 3D finite element method software package Opera-3D. Each tentative design strategy is virtually modeled in this software package and externally controlled by MATLAB, with its key geometries defined as variables. The particle swarm optimization algorithm is used to optimize the variables subject to the minimization of a cost function. At each iteration, Opera-3D will solve the magnetic field solution over a field-of-view suitable for MR imaging and the degree of field uniformity will be assessed to calculate the value of the cost function associated with that iteration. Results: An optimized magnet assembly that generates a homogenous 0.2T magnetic field over an ellipsoid with large axis of 30 cm and small axes of 20 cm is obtained. Conclusion: The distinct features of this model are the minimal distance between the yoke’s top and the isocentre and the improved patient access. On the other hand, having homogeneity over an ellipsoid give us a larger field-of-view, essential for geometric accuracy of the MRI system. The increase of B{sub 0} from 0.2T in the present model to 0.5T is the subject of future work. Funding Sources: Alberta Innovates - Health Solutions (AIHS)| Disclosure and Conflict of Interest: B. Gino Fallone is a co-founder and CEO of MagnetTx Oncology Solutions (under discussions to license Alberta biplanar linac MR for commercialization).

60 APPLIED LIFE SCIENCES↗
DOE OSTI2016

Hybrid Multiscale Finite Volume Method for Advection-Diffusion Equations Subject to Heterogeneous Reactive Boundary Conditions

We present a hybrid scheme for the coupling of macro and microscale continuum models for reactive contaminant transport in fractured and porous media. The transport model considered is the advection-dispersion equation, subject to linear heterogeneous reactive boundary conditions. The Multiscale Finite Volume method (MsFV) is employed to define an approximation to the microscale concentration field defined in terms of macroscopic or \emph{global} degrees of freedom, together with local interpolator and corrector functions capturing microscopic spatial variability. The macroscopic mass balance relations for the MsFV global degrees of freedom are coupled with the macroscopic model, resulting in a global problem for the simultaneous time-stepping of all macroscopic degrees of freedom throughout the domain. In order to perform the hybrid coupling, the micro and macroscale models are applied over overlapping subdomains of the simulation domain, with the overlap denoted as the handshake subdomain $\Omega^{hs}$, over which continuity of concentration and transport fluxes between models is enforced. Continuity of concentration is enforced by posing a restriction relation between models over $\Omega^{hs}$. Continuity of fluxes is enforced by prolongating the macroscopic model fluxes across the boundary of $\Omega^{hs}$ to microscopic resolution. The microscopic interpolator and corrector functions are solutions to local microscopic advection-diffusion problems decoupled from the global degrees of freedom and from each other by virtue of the MsFV decoupling ansatz. The error introduced by the decoupling ansatz is reduced iteratively by the preconditioned GMRES algorithm, with the hybrid MsFV operator serving as the preconditioner.

Barajas-Solano, David A.↗
DOE OSTI2016

MO-AB-BRA-01: A Global Level Set Based Formulation for Volumetric Modulated Arc Therapy

Purpose: The current clinical Volumetric Modulated Arc Therapy (VMAT) optimization is formulated as a non-convex problem and various greedy heuristics have been employed for an empirical solution, jeopardizing plan consistency and quality. We introduce a novel global direct aperture optimization method for VMAT to overcome these limitations. Methods: The global VMAT (gVMAT) planning was formulated as an optimization problem with an L2-norm fidelity term and an anisotropic total variation term. A level set function was used to describe the aperture shapes and adjacent aperture shapes were penalized to control MLC motion range. An alternating optimization strategy was implemented to solve the fluence intensity and aperture shapes simultaneously. Single arc gVMAT plans, utilizing 180 beams with 2° angular resolution, were generated for a glioblastoma multiforme (GBM), lung (LNG), and 2 head and neck cases—one with 3 PTVs (H&N3PTV) and one with 4 PTVs (H&N4PTV). The plans were compared against the clinical VMAT (cVMAT) plans utilizing two overlapping coplanar arcs. Results: The optimization of the gVMAT plans had converged within 600 iterations. gVMAT reduced the average max and mean OAR dose by 6.59% and 7.45% of the prescription dose. Reductions in max dose and mean dose were as high as 14.5 Gy in the LNG case and 15.3 Gy in the H&N3PTV case. PTV coverages (D95, D98, D99) were within 0.25% of the prescription dose. By globally considering all beams, the gVMAT optimizer allowed some beams to deliver higher intensities, yielding a dose distribution that resembles a static beam IMRT plan with beam orientation optimization. Conclusions: The novel VMAT approach allows for the search of an optimal plan in the global solution space and generates deliverable apertures directly. The single arc VMAT approach fully utilizes the digital linacs’ capability in dose rate and gantry rotation speed modulation. Varian Medical Systems, NIH grant R01CA188300, NIH grant R43CA183390.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2016

A Full Multigrid Method for the Self-Adjoint Angular Flux Equation Based on Cellwise Block Jacobi Iteration

Previous work by Densmore et al. has demonstrated that multigrid methods for the self-adjoint angular flux (SAAF) equation with cellwise block Jacobi smoothing can be extremely effective at solving for the angular flux in one dimension. The extension of that work to two dimensions demonstrated that while the smoother works well, the use of a direct coarse-grid approximation can severely limit the rate of convergence for optically thin cells. In that paper, this convergence limit was evaded through the use of a partially Galerkin coarse-grid approximation. However, relying on a Galerkin coarse-grid approximation is not ideal as constructing the coarse-grid discretization in this approach is complicated. The motivation for this summary is to find a method that can work without the need for a Galerkin coarse-grid approximation. The Full Multigrid (FMG) method is well known as a method that can theoretically solve a problem to its discretization accuracy with optimal linear computational complexity, that is in just O(N) operations for N unknowns. Indeed, we develop an FMG method for the 2-D SAAF equation that yields discretization accuracy and does not require the use of a Galerkin coarse-grid approximation. Until recently, aside from proofs about the order of the error for FMG, little work had been done in quantifying when and how FMG can obtain discretization accuracy. However, recent work by Rodrigo et al. has introduced a Fourier analysis technique called worst-case right-hand side analysis used to calculate the FMG accuracy measure. The FMG accuracy measure is the upper bound on the constant of proportionality between the error of the FMG solution and the discretization error. In this summary, we develop and implement an FMG method for the 2-D Cartesian SAAF equations. We then perform worst-case right-hand side analysis and give numerical examples that demonstrate under what circumstances the method can solve the 2-D SAAF equations to discretization accuracy, for optically thin cells, without the need for a Galerkin coarse-grid approximation. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2018

Discontinuous Finite Element Quasidiffusion Methods

Here in this paper, two-level methods for solving transport problems in one-dimensional slab geometry based on the quasi-diffusion (QD) method are developed. A linear discontinuous finite element method (LDFEM) is derived for the spatial discretization of the low-order QD (LOQD) equations. It involves special interface conditions at the cell edges based on the idea of QD boundary conditions (BCs). We consider different kinds of QD BCs to formulate the necessary cell-interface conditions. We develop two-level methods with independent discretization of the high-order transport equation and LOQD equations, where the transport equation is discretized using the method of characteristics and the LDFEM is applied to the LOQD equations. We also formulate closures that lead to the discretization consistent with a LDFEM discretization of the transport equation. The proposed methods are studied by means of test problems formulated with the method of manufactured solutions. Numerical experiments are presented demonstrating the performance of the proposed methods. Lastly, we also show that the method with independent discretization has the asymptotic diffusion limit.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2019

Design and Analysis of the US ITER Central Solenoid Module Lifting Fixture

The central solenoid (CS) consists of six large high field superconducting magnets (also known as modules) approximately 4 m in diameter and 2 m tall that weigh approximately 120 tonnes each. These large and complex modules create challenges during assembly of the CS that require the development of custom assembly tooling such as the CS lifting fixture. The CS module lifting fixture is designed to lift and stack the six CS modules in the assembly building on the ITER site. Because of its unique design, fabrication, and assembly features, no lifting attachments could be incorporated within or under the CS modules. This limitation motivated the development of a friction-based lift fixture. The design and evaluation of the CS module lifting fixture considered both worker safety and investment protection, and the assessments were performed to international codes and standards. The CS module lifting fixture consists of two principal subassemblies: spider assembly and ring weldment. These subassemblies allow the frictional force to be augmented by the mechanical advantage of shallow-angle wedges. Large radial preloads created by both screw jack assemblies and the weight of a CS module develop frictional forces capable of performing a lift with a safety factor of at least 2. The design effort resulted in the use of low friction linear bearings on angle surfaces to ensure constant pressure, integrated jacks for pretensioning the fixture prior to lifting, and load pin strain gauges for monitoring the normal force. Testing of various materials and surface treatments led to the selection of laminated aluminum and rubber pads as the friction interface on the CS lifting fixture side and a grit-blasted Nitronic 50 stainless steel band on the CS module side. A redundant lifting method using the module slings between the spider and module is also utilized after the initial friction lift. The CS lifting fixture provides a safe and reliable solution for lifting and stacking the CS module during assembly.

Morris, Eric↗
DOE OSTI2025

Leveraging operator learning to accelerate convergence of the preconditioned conjugate gradient method

We propose a new deflation strategy to accelerate the convergence of the preconditioned conjugate gradient (PCG) method for solving parametric large-scale linear systems of equations. Unlike traditional deflation techniques that rely on eigenvector approximations or recycled Krylov subspaces, we generate the deflation subspaces using operator learning, specifically the Deep Operator Network (DeepONet). To this aim, we introduce two complementary approaches for assembling the deflation operators. The first approach approximates near-null space vectors of the discrete PDE operator using the basis functions learned by the DeepONet. The second approach directly leverages solutions predicted by the DeepONet. To further enhance convergence, we also propose several strategies for prescribing the sparsity pattern of the deflation operator. Here, a comprehensive set of numerical experiments encompassing steady-state, time-dependent, scalar, and vector-valued problems posed on both structured and unstructured geometries is presented and demonstrates the effectiveness of the proposed DeepONet-based deflated PCG method, as well as its generalization across a wide range of model parameters and problem resolutions.

Deflation↗
NASA NTRS2010

Fast Solution in Sparse LDA for Binary Classification

An algorithm that performs sparse linear discriminant analysis (Sparse-LDA) finds near-optimal solutions in far less time than the prior art when specialized to binary classification (of 2 classes). Sparse-LDA is a type of feature- or variable- selection problem with numerous applications in statistics, machine learning, computer vision, computational finance, operations research, and bio-informatics. Because of its combinatorial nature, feature- or variable-selection problems are NP-hard or computationally intractable in cases involving more than 30 variables or features. Therefore, one typically seeks approximate solutions by means of greedy search algorithms. The prior Sparse-LDA algorithm was a greedy algorithm that considered the best variable or feature to add/ delete to/ from its subsets in order to maximally discriminate between multiple classes of data. The present algorithm is designed for the special but prevalent case of 2-class or binary classification (e.g. 1 vs. 0, functioning vs. malfunctioning, or change versus no change). The present algorithm provides near-optimal solutions on large real-world datasets having hundreds or even thousands of variables or features (e.g. selecting the fewest wavelength bands in a hyperspectral sensor to do terrain classification) and does so in typical computation times of minutes as compared to days or weeks as taken by the prior art. Sparse LDA requires solving generalized eigenvalue problems for a large number of variable subsets (represented by the submatrices of the input within-class and between-class covariance matrices). In the general (fullrank) case, the amount of computation scales at least cubically with the number of variables and thus the size of the problems that can be solved is limited accordingly. However, in binary classification, the principal eigenvalues can be found using a special analytic formula, without resorting to costly iterative techniques. The present algorithm exploits this analytic form along with the inherent sequential nature of greedy search itself. Together this enables the use of highly-efficient partitioned-matrix-inverse techniques that result in large speedups of computation in both the forward-selection and backward-elimination stages of greedy algorithms in general.

Moghaddam, Baback↗
NASA NTRS1998

Transition in Turbine Flows

We have further developed our capabilities to analyze transition in turbine boundary layers from first principles by integrating the nonlinear parabolized stability equations (PSE) with improved initial and boundary conditions. With modified iteration schemes, we are able to proceed deeper into the transition region where skin friction coefficient and heat transfer coefficient significantly increase. Initial and boundary conditions at elevated turbulence levels can be derived by receptivity analysis. Test runs for ERCOFTAC test case T3A at 2.4\% turbulence level provide results in good agreement with the experimental data. The sharper minimum of the skin coefficient also shown by DNS results is likely due to the missing intermittency. The method has been applied to various experimentally studied turbine blades (UTRC, VKI, Zierke, Langston, Hippensteele, and others). The PSE results, though physically reasonable, do not agree as well as expected with the experimental findings. We have, therefore, performed an extensive search for the reasons of the seemingly systematic deviations. A first source of uncertainty has been found in the often insufficient documentation of the experiments (e.g. on blockage by end-wall boundary layers). However, variation of the relevant parameters does not lead to more satisfactory agreement. A second reason has been found in the "standard procedure" which considers a 2D flow at midspan and uses a panel code and subsequent boundary-layer code to obtain the laminar basic flow for the transition analysis. Comparison with the pressure distribution obtained with a 3D design code (RVC3D) shows significant three-dimensionality of the flow (e.g. in the UTRC experiments). The spanwise variation has been neglected in our original PSE code. To overcome this problem, we have developed the PSE/3D for fully 3D boundary layers to account for streamwise and spanwise variations. Since the design code does not provide the boundary-layer flow with sufficient resolution, we have generated the Euler solution and employed a 3D boundary-layer code to obtain the viscous basic flow. Although only the linear stability level of PSE/3D has been implemented so far, the discrepancies with the experiments change but do not disappear. We still find deviations between the computed and experimental variations of C(sub f), and St along the blade for laminar flow. The main reason can be seen by comparing the solution of the boundary-layer code with the viscous results of the design code. The conventional boundary-layer solution exhibits an asymptotic behavior appropriate in external aerodynamics but does not match the steep gradients of the inviscid flow through the passage and consequently provides biased results for C(sub f), and St. An attempt is currently being made to correct this deficiency. Before attempting to perform the transition analysis for the viscous flow provided by the design code, we have analyzed the implementation and "best possible" results. Code and results exhibit flaws that may negatively affect the design and are intolerable for transition analysis. Therefore, we have decided to develop a new code to obtain a reliable basis for stability and transition studies. We expect to report improved results by the time of the meeting.

Herbert, Thorwald↗
NASA NTRS2014

Data-Intensive Science meets Inquiry-Driven Pedagogy: Interactive Big Data Exploration, Threshold Concepts, and Liminality

Threshold concepts in any discipline are the core concepts an individual must understand in order to master a discipline. By their very nature, these concepts are troublesome, irreversible, integrative, bounded, discursive, and reconstitutive. Although grasping threshold concepts can be extremely challenging for each learner as s/he moves through stages of cognitive development relative to a given discipline, the learner's grasp of these concepts determines the extent to which s/he is prepared to work competently and creatively within the field itself. The movement of individuals from a state of ignorance of these core concepts to one of mastery occurs not along a linear path but in iterative cycles of knowledge creation and adjustment in liminal spaces - conceptual spaces through which learners move from the vaguest awareness of concepts to mastery, accompanied by understanding of their relevance, connectivity, and usefulness relative to questions and constructs in a given discipline. For example, challenges in the teaching and learning of atmospheric science can be traced to threshold concepts in fluid dynamics. In particular, Dynamic Meteorology is one of the most challenging courses for graduate students and undergraduates majoring in Atmospheric Science. Dynamic Meteorology introduces threshold concepts - those that prove troublesome for the majority of students but that are essential, associated with fundamental relationships between forces and motion in the atmosphere and requiring the application of basic classical statics, dynamics, and thermodynamic principles to the three dimensionally varying atmospheric structure. With the explosive growth of data available in atmospheric science, driven largely by satellite Earth observations and high-resolution numerical simulations, paradigms such as that of dataintensive science have emerged. These paradigm shifts are based on the growing realization that current infrastructure, tools and processes will not allow us to analyze and fully utilize the complex and voluminous data that is being gathered. In this emerging paradigm, the scientific discovery process is driven by knowledge extracted from large volumes of data. In this presentation, we contend that this paradigm naturally lends to inquiry-driven pedagogy where knowledge is discovered through inductive engagement with large volumes of data rather than reached through traditional, deductive, hypothesis-driven analyses. In particular, data-intensive techniques married with an inductive methodology allow for exploration on a scale that is not possible in the traditional classroom with its typical problem sets and static, limited data samples. In addition, we identify existing gaps and possible solutions for addressing the infrastructure and tools as well as a pedagogical framework through which to implement this inductive approach.

Ramachandran, Rahul↗
NASA NTRS1996

Spray Combustion Modeling with VOF and Finite-Rate Chemistry

A spray atomization and combustion model is developed based on the volume-of-fluid (VOF) transport equation with finite-rate chemistry model. The gas-liquid interface mass, momentum and energy conservation laws are modeled by continuum surface force mechanisms. A new solution method is developed such that the present VOF model can be applied for all-speed range flows. The objectives of the present study are: (1) to develop and verify the fractional volume-of-fluid (VOF) cell partitioning approach into a predictor-corrector algorithm to deal with multiphase (gas-liquid) free surface flow problems; (2) to implement the developed unified algorithm in a general purpose computational fluid dynamics (CFD) code, Finite Difference Navier-Stokes (FDNS), with droplet dynamics and finite-rate chemistry models; and (3) to demonstrate the effectiveness of the present approach by simulating benchmark problems of jet breakup/spray atomization and combustion. Modeling multiphase fluid flows poses a significant challenge because a required boundary must be applied to a transient, irregular surface that is discontinuous, and the flow regimes considered can range from incompressible to highspeed compressible flows. The flow-process modeling is further complicated by surface tension, interfacial heat and mass transfer, spray formation and turbulence, and their interactions. The major contribution of the present method is to combine the novel feature of the Volume of Fluid (VOF) method and the Eulerian/Lagrangian method into a unified algorithm for efficient noniterative, time-accurate calculations of multiphase free surface flows valid at all speeds. The proposed method reformulated the VOF equation to strongly couple two distinct phases (liquid and gas), and tracks droplets on a Lagrangian frame when spray model is required, using a unified predictor-corrector technique to account for the non-linear linkages through the convective contributions of VOF. The discontinuities within the sharp interface will be modeled as a volume force to avoid stiffness. Formations of droplets, tracking of droplet dynamics and modeling of the droplet breakup/evaporation, are handled through the same unified predictor-corrector procedure. Thus the new algorithm is non-iterative and is flexible for general geometries with arbitrarily complex topology in free surfaces. The FDNS finite-difference Navier-Stokes code is employed as the baseline of the current development. Benchmark test cases of shear coaxial LOX/H2 liquid jet with atomization/combustion and impinging jet test cases are investigated in the present work. Preliminary data comparisons show good qualitative agreement between data and the present analysis. It is indicative from these results that the present method has great potential to become a general engineering design analysis and diagnostics tool for problems involving spray combustion.

Chen, Yen-Sen↗
DOE OSTI2016

SU-G-JeP1-15: Sliding Window Prior Data Assisted Compressed Sensing for MRI Lung Tumor Tracking

Purpose: Prior Data Assisted Compressed Sensing (PDACS) is a partial k-space acquisition and reconstruction method for mobile tumour (i.e. lung) tracking using on-line MRI in radiotherapy. PDACS partially relies on prior data acquired at the beginning of dynamic scans, and is therefore susceptible to artifacts in longer duration scan due to slow drifts in MR signal. A novel sliding window strategy is presented to mitigate this effect. Methods: MRI acceleration is simulated by retrospective removal of data from the fully sampled sets. Six lung cancer patients were scanned (clinical 3T MRI) using a balanced steady state free precession (bSSFP) sequence for 3 minutes at approximately 4 frames per second, for a total of 650 dynamics. PDACS acceleration is achieved by undersampling of k-space in a single pseudo-random pattern. Reconstruction iteratively minimizes the total variations while constraining the images to satisfy both the currently acquired data and the prior data in missing k-space. Our novel sliding window technique (SW-PDACS), uses a series of distinct pseudo-random under-sampling patterns of partial k-space – with the prior data drawn from a sliding window of the most recent data available. Under-sampled data, simulating 2 – 5x acceleration are reconstructed using PDACS and SW-PDACS. Three quantitative metrics: artifact power, centroid error and Dice’s coefficient are computed for comparison. Results: Quantitively metric values from all 6 patients are averaged in 3 bins, each containing approximately one minute of dynamic data. For the first minute bin, PDACS and SW-PDACS give comparable results. Progressive decline in image quality metrics in bins 2 and 3 are observed for PDACS. No decline in image quality is observed for SW-PDACS. Conclusion: The novel approach presented (SW-PDACS) is a more robust for accelerating longer duration (>1 minute) dynamic MRI scans for tracking lung tumour motion using on-line MRI in radiotherapy. B.G. Fallone is a co-founder and CEO of MagnetTx Oncology Solutions (under discussions to license Alberta bi-planar linac MR for commercialization).

60 APPLIED LIFE SCIENCES↗
NASA NTRS2018

Real-Time Adaptive Drag Minimization Wind Tunnel Investigation of a Flexible Wing with Variable Camber Continuous Trailing Edge Flap System

This paper reports the results of a recently completed real-time adaptive drag minimization wind tunnel investigation of a highly flexible wing wind tunnel model equipped with the Variable Camber Continuous Trailing Flap (VCCTEF) technology at the University of Washington Aeronautical Laboratory (UWAL). The wind tunnel investigation is funded by NASA SBIR Phase II contract with Scientific Systems Company, Inc. (SSCI) and University of Washington (UW) as a subcontractor. The wind tunnel model is a sub-scale Common Research Model (CRM) wing constructed of foam core and fiberglass skin and is aeroelastically scaled to achieve a wing tip deflection of 10% of the wing semi-span which represents a typical wing tip deflection for a modern transport such as Boeing 787. The jig-shape twist of the CRM wing is optimized using a CART3D aero-structural model to achieve the minimum induced drag for the design cruise lift coefficient of 0.5. The wing is equipped with two chord wise cambered segments for each of the six span wise flap sections for a total of 12 individual flap segments that comprise the VCCTEF system. Each of the 12 flap segments is actively controlled by an electric servo-actuator. The real-time adaptive drag optimization strategy includes an on-board aerodynamic model identification, a model excitation, and a real-time drag optimization. The on-board aerodynamic model is constructed parametrically as a function of the angle of attack and flap positions to model the lift and drag coefficients of the wing. The lift coefficient models include a linear model and a second-order model. The drag coefficient models include a quadratic model and a higher-order up to 6th-order model to accurately model the drag coefficient at high angles of attack. The onboard aerodynamic model identification includes a recursive least-squares (RLS) algorithm and a batch least-squares (BLS) algorithm designed to estimate the model parameters. The model excitation method is designed to sample the input set that comprises the angle of attack and the flap positions. Three model excitation methods are developed: random excitation method, sweep method, and iterative angle-of-attack seeking method. The real-time drag optimization includes a generic algorithm developed by SSCI and several optimization methods developed by NASA which include a second-order gradient Newton-Raphson optimization method, an iterative gradient optimization method, a pseudo-inverse optimization method, an analytical optimization method, and an iterative refinement optimization method. The first wind tunnel test entry took place in September 2017. This test revealed major hardware issues and required further redesign of the flap servo mechanisms. The second test entry took place in April 2018. However, the test was not successful due to the issues with the onboard aerodynamic model identification RLS algorithm which incorrectly identified model parameters. This test also provides an experimental comparison study between the VCCTEF and a variable camber discrete trailing edge flap (VCDTEF) without the elastomer transition mechanisms. The experimental result confirms the benefit of the VCCTEF which produces lower drag by 5% than the VCDTEF. The third and final test entry took place in June 2018 after the issues with the RLS algorithm have been identified and corrected. Additional improvements were implemented. These include the BLS algorithm, the iterative angle-of-attack seeking method, the iterative gradient optimization method, and the pseudo-inverse optimization method. The test objectives were successfully demonstrated as the real-time drag optimization identifies several optimal solutions at off-design lift coefficients. The iterative gradient optimization method is found to achieve up to 4.7% drag reduction for the off-design lift coefficient of 0.7. The pseudo-inverse optimization method which does not require the drag coefficient model is found to be quite effective in reducing drag. Up to 9.4% drag reduction for the off-design lift coefficient of 0.7 is achieved with the pseudo-inverse optimization method. The wind tunnel investigation demonstrates the potential of real-time drag optimization technology. Several new capabilities are developed that could enable future adaptive wing technologies for flexible wings equipped with drag control devices such as the VCCTEF.

Drag Optimization↗
DOE OSTI2016

Space-Dependent Wielandt Shift Methods for Multigroup Diffusion Eigenvalue Problems

In the calculation of neutronic eigenfunctions and eigenvalues, it is often desirable to approximate the neutron transport equation by a diffusion equation that requires significantly less computational resources to solve. Even when a full transport solution is needed, the solution of the diffusion system can be used to accelerate iterative methods for calculating the transport eigenfunction and eigenvalue. The convergence rate of the basic power iteration method for eigenvalue problems is governed by the dominance ratio; realistic reactor core problems often have high dominance ratios and the power iteration method can converge slowly as a result. A common technique for accelerating the convergence of power iteration is the Wielandt shift (WS) method, which reduces the dominance ratio by 'shifting' the eigenvalue spectrum using an estimate of the desired eigenvalue. WS provides a significant speedup over power iteration if the eigenvalue estimate is close to the true eigenvalue, but it can be difficult to obtain such an estimate. In practice, the shift in the WS method can be dynamically updated in the iteration scheme, in a way that depends on the eigenvalue estimates from the most recent iterations. We present a physically-motivated Space-Dependent Wielandt Shift (SDWS) for solving multigroup diffusion eigenvalue problems. The space-dependence of the eigenvalue shift in SDWS enables a more effective acceleration of the power iteration scheme than WS at the beginning of the iteration scheme, when the current estimate of the eigenvalue is not close to the actual eigenvalue. Several variants of SDWS are discussed here, including an SDWS method that combines the strengths of SDWS (in the early iterations) with those of standard WS (in the later iterations). Numerical results from a 1-D multigroup diffusion problem demonstrate an order of magnitude speedup over power iteration and a 41% speedup over a standard WS technique. This speedup is problem-dependent and appears to be greater for 'more difficult' problems. In this summary, the term 'speedup' refers to a reduction in the number of iterations required to converge to the correct eigenvalue and eigenfunction. Because the scattering is treated fully implicitly (i.e., it is part of the left-hand side of the diffusion system and directly inverted), the computational cost of a single iteration does not vary significantly among the methods discussed in this summary. The number of iterations is therefore representative of the total computational cost for a method. We acknowledge that certain iterative solvers for linear systems (e.g., GMRES) require more computational time to converge when the system is nearly singular (i.e., when a very aggressive Wielandt shift is applied). Nonetheless, when using SDWS in the manner described in this summary, we have seen that the reduction in computational time from reducing the number of power iterations generally outweighs the extra computational time required by iterative solvers such as GMRES. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2016

Group Structure Optimization Using the PyGroup Code

Group constants are used as coefficients in the energy domain discretized Linear Boltzmann Equation (LBE), in which the Continuous-Energy (CE) fluxes are also integrated over energy bins and transformed into group fluxes. This procedure, based on the Multi-Group (MG) theory, is widely applied in radiation transport and diffusion simulations Careful preparation of MG cross section data, or group constants, is thus a prerequisite for success in acquiring high-fidelity LBE solutions. Generation of MG cross section data itself is a complicated multi-step task, since group constants are indispensably coupled with the solution of the LBE, i.e. the flux spectrum in the problem to be solved. Theoretically, a MG cross section library is only valid for the problem that it is built upon. Nevertheless, in practice MG cross section libraries are prepared for similar type of problems, such as thermal reactors, fast reactors, etc., to facilitate the neutronic simulations. Generally, CE point-wise cross section data set, generated by both theoretical models and experimental data, is first converted to Fine-Group (FG) libraries using a pre-defined or precalculated flux spectra, then, Broad-Group (BG) libraries are collapsed from the fine-group libraries using problem-dependent flux spectra. Proper treatments of energy and spatial self-shielding and resonance cross section are required in the CE-to-MG converting process Previously, we have developed a computer code, YGROUP, for fine-to-broad group cross section collapsing. To maintain high accuracy of the resulting BG libraries, YGROUP provides users several options on collapsing strategies and weighting schemes for group binning and evaluation of BG cross section data in users' specific problems.. An approach based on Particle Swarm Optimization was applied to automatically determine the optimal group structure. We also developed a hybrid weighting scheme to further improve BG library performance for Special Nuclear Materials (SNM) detection applications. In this work, a new computer code, PyGroup, has been developed to implement the PSO approach with an improved simulation-driven fitness function design that includes both response and forward/adjoint flux errors. Together with YGROUP, and deterministic transport code TITAN/PENMSHXP, the PyGroup code package is tested on a Dual Range Coincident Counter (DRCC) model. In this paper, we demonstrated the capability of the PyGroup code for group structure optimization using the DRCC detector model. In the future, an iteration scheme can be implemented to determine the number of broad groups based on a user-defined tolerance. we will also apply PyGroup to more complicated reactor models, and investigate physics-based fitness function designs to further reduce computational cost. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
NASA NTRS1999

The Analysis and Design of Low Boom Configurations Using CFD and Numerical Optimization Techniques

The use of computational fluid dynamics (CFD) for the analysis of sonic booms generated by aircraft has been shown to increase the accuracy and reliability of predictions. CFD takes into account important three-dimensional and nonlinear effects that are generally neglected by modified linear theory (MLT) methods. Up to the present time, CFD methods have been primarily used for analysis or prediction. Some investigators have used CFD to impact the design of low boom configurations using trial and error methods. One investigator developed a hybrid design method using a combination of Modified Linear Theory (e.g. F-functions) and CFD to provide equivalent area due to lift driven by a numerical optimizer to redesign or modify an existing configuration to achieve a shaped sonic boom signature. A three-dimensional design methodology has not yet been developed that completely uses nonlinear methods or CFD. Constrained numerical optimization techniques have existed for some time. Many of these methods use gradients to search for the minimum of a specified objective function subject to a variety of design variable bounds, linear and nonlinear constraints. Gradient based design optimization methods require the determination of the objective function gradients with respect to each of the design variables. These optimization methods are efficient and work well if the gradients can be obtained analytically. If analytical gradients are not available, the objective gradients or derivatives with respect to the design variables must be obtained numerically. To obtain numerical gradients, say, for 10 design variables, might require anywhere from 10 to 20 objective function evaluations. Typically, 5-10 global iterations of the optimizer are required to minimize the objective function. In terms of using CFD as a design optimization tool, the numerical evaluation of gradients can require anywhere from 100 to 200 CFD computations per design for only 10 design variables. If one CFD computation requires an hour of computational time on a Cray computer, one can see that the use of constrained numerical optimization quickly becomes impractical.Hence, in order to practically couple a numerical design optimization technique with a CFD method, the CFD method must be extremely efficient with running times on the order of only minutes. The CFD Euler code developed under NASA sponsorship and referred to as MIM3D-SB for the most part fulfills these efficiency requirements. Analysis of wing- body configurations can be computed in a matter of a few minutes. The present study will concentrate on the feasibility of the use of this CFD code in conjunction with a numerical design optimization technique for the sonic boom reduction of candidate HSCT configurations. A preliminary supersonic aircraft design system has been established that utilizes the numerical design optimization code NPSOL developed at Stanford University coupled with the supersonic NUM3D-SB CFD code. Many questions still need to be answered in regard to using CFD and numerical optimizers as design tools. There are difficulties related to both the CFD codes and the numerical optimizers. Numerical optimizers can converge to a local minima rather than a global minima. This behavior is largely a function of the initial guess in the design space. The optimizer also is searching for a minimum of the function in terms of its derivative without any regard to the actual function value. Numerically (i.e. CFD) determined gradients can also generate spurious numerical local minima. In addition, for the sonic boom problem, grid fineness will also determine the accuracy of the final design solution. Design optimization methods work well on problems defined by continuous objective functions. The sonic boom signature design problem is not necessarily defined by a continuous objective function. The signature can have a variety of shapes; i.e. from N-wave to multiple shocks. The far-field or ground signature may not transition continuously from one shape to another and hence, may exhibit discontinuous behavior. This is also a source of difficulty in using design optimization methods.In the following sections, several low boom and one reference aircraft configuration will be analyzed to predict their sonic boom signature characteristics. Modifications to some of these designs will also be presented to demonstrate the feasibility of using CFD as a design tool and to demonstrate the feasibility of designing shaped sonic boom signatures. Design modifications to some configurations will be presented to demonstrate the feasibility of achieving shaped signatures with reduced levels and not necessarily to represent realistic or aerodynamically efficient design modifications. Fuselage volume or camber are used as design variables in order to have a minimal effect on the primary wing aerodynamics. The paper will also seek to demonstrate whether a hybrid or ramped signature is feasible to achieve. For the low-boom configurations, the CFD predicted signatures will be compared qualitatively to their MLT design signatures.

Siclari, Michael J.↗