Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Iterative methods”

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 991 records · Page 55
All sourcesNASA NTRSDOE OSTI
DOE OSTI2016

Using a derivative-free optimization method for multiple solutions of inverse transport problems

Identifying unknown components of an object that emits radiation is an important problem for national and global security. Radiation signatures measured from an object of interest can be used to infer object parameter values that are not known. This problem is called an inverse transport problem. An inverse transport problem may have multiple solutions and the most widely used approach for its solution is an iterative optimization method. This paper proposes a stochastic derivative-free global optimization algorithm to find multiple solutions of inverse transport problems. The algorithm is an extension of a multilevel single linkage (MLSL) method where a mesh adaptive direct search (MADS) algorithm is incorporated into the local phase. Furthermore, numerical test cases using uncollided fluxes of discrete gamma-ray lines are presented to show the performance of this new algorithm.

42 ENGINEERING↗
DOE OSTI2013

2D/1D approximations to the 3D neutron transport equation. I: Theory

A new class of '2D/1D' approximations is proposed for the 3D linear Boltzmann equation. These approximate equations preserve the exact transport physics in the radial directions x and y and diffusion physics in the axial direction z. Thus, the 2D/1D equations are more accurate approximations of the 3D Boltzmann equation than the conventional 3D diffusion equation. The 2D/1D equations can be systematically discretized, to yield accurate simulation methods for 3D reactor core problems. The resulting solutions will be more accurate than 3D diffusion solutions, and less expensive to generate than standard 3D transport solutions. In this paper, we (i) show that the simplest 2D/1D equation has certain desirable properties, (ii) systematically discretize this equation, and (iii) derive a stable iteration scheme for solving the discrete system of equations. In a companion paper [1], we give numerical results that confirm the theoretical predictions of accuracy and iterative stability. (authors)

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Analysis of cell-based diffusion acceleration for the slice balance approach

In this work, we perform analysis on the use of cell-based diffusion acceleration methodologies to accelerate the convergence of transport solutions discretized with the slice balance approach (SBA) on unstructured polygonal grids.We investigated both linear diffusion synthetic acceleration (DSA) and non linear diffusion acceleration (NDA), including its partial-current variant (pNDA). DSA and NDA were both shown to diverge for intermediate ranges of mesh optical thicknesses. However, pNDA and Krylov methods like GMRES and Broyden stabilized the acceleration schemes, including problems with degenerate cells formed by mesh refinement. (author)

42 ENGINEERING↗
DOE OSTI2014

SU-D-9A-04: Brain PET/CT Imaging On a Scanner with a Large Axial Field-Of-View

Purpose: Large axial field-of-view (FOV) PET/CT scanners are valued for high sensitivity. Brain PET image quality may depend on the head position within the FOV. We investigated the precision of activity estimation for brain PET imaging when the brain was positioned at the end (END) and in the middle (CEN) of the FOV. The additional CT dose for the CEN position was recorded. Methods: An image quality (Jaszczak) phantom and a striatal phantom were filled with F-18 and positioned in END and CEN locations. For each phantom and each location, we acquired a ∼1-hr listmode PET, rebinned the data into 10 frames with equal number of coincidence events, and reconstructed each frame using an iterative algorithm. For the striatal phantom, END and CEN were compared by drawing on each image three regions of interest (ROI) in axially separated uniform areas. The standard deviation of the activity estimation within each ROI was averaged over the 10 images. The coefficient of variation (CV) for activity estimation was calculated at each position. Image quality was assessed by inspecting the resolution bar pattern in the Jaszczak phantom at two different head positions. Results: The CV was the lowest for ROIs near the center of the FOV. For slices near the end, not only was the CV highest, but also the resolution pattern was degraded. CTDIvol summarized in the dose report indicated that the CT dose was ∼ 10% higher for CEN as compared to END position. Conclusion: Positioning the brain in the middle of the FOV in a large FOV PET/CT scanner allows more precise measurement of tracer uptake and better image quality at the cost of increased CT dose. For the end location longer scan times may minimize image quality degradation without any additional CT dose.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2014

SU-E-J-184: Stereo Time-Of-Flight System for Patient Positioning in Radiotherapy

Purpose: The objective of this work is to test the advantage of using the surface acquired by two stereo Time-of-Flight (ToF) cameras in comparison of the use of one camera only for patient positioning in radiotherapy. Methods: A first step consisted on validating the use of a stereo ToFcamera system for positioning management of a phantom mounted on a linear actuator producing very accurate and repeatable displacements. The displacements between two positions were computed from the surface point cloud acquired by either one or two cameras thanks to an iterative closest point algorithm. A second step consisted on determining the displacements on patient datasets, with two cameras fixed on the ceiling of the radiotherapy room. Measurements were done first on voluntary subject with fixed translations, then on patients during the normal clinical radiotherapy routine. Results: The phantom tests showed a major improvement in lateral and depth axis for motions above 10 mm when using the stereo-system instead of a unique camera (Fig1). Patient measurements validate these results with a mean real and measured displacement differences in the depth direction of 1.5 mm when using one camera and 0.9 mm when using two cameras (Fig2). In the lateral direction, a mean difference of 1 mm was obtained by the stereo-system instead of 3.2 mm. Along the longitudinal axis mean differences of 5.4 and 3.4 mm with one and two cameras respectively were noticed but these measurements were still inaccurate and globally underestimated in this direction as in the literature. Similar results were also found for patient subjects with a mean difference reduction of 35%, 7%, and 25% for the lateral, depth, and longitudinal displacement with the stereo-system. Conclusion: The addition of a second ToF-camera to determine patient displacement strongly improved patient repositioning results and therefore insures better radiation delivery.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2014

SU-E-T-258: Parallel Optimization of Beam Configurations for CyberKnife Treatments

Purpose: The CyberKnife delivers a large number of beams originating at different non-planar positions and with different orientation. We study how much the quality of treatment plans depends on the beams considered during plan optimization. Particularly, we evaluate a new approach to search for optimal treatment plans in parallel by running optimization steps concurrently. Methods: So far, no deterministic, complete and efficient method to select the optimal beam configuration for robotic SRS/SBRT is known. Considering a large candidate beam set increases the likelihood to achieve a good plan, but the optimization problem becomes large and impractical to solve. We have implemented an approach that parallelizes the search by solving multiple linear programming problems concurrently while iteratively resampling zero weighted beams. Each optimization problem contains the same set of constraints but different variables representing candidate beams. The search is synchronized by sharing the resulting basis variables among the parallel optimizations. We demonstrate the utility of the approach based on an actual spinal case with the objective to improve the coverage. Results: The objective function is falling and reaches a value of 5000 after 49, 31, 25 and 15 iterations for 1, 2, 4, and 8 parallel processes. This corresponds to approximately 97% coverage in 77%, 59%, and 36% of the mean number of iterations with one process for 2, 4, and 8 parallel processes, respectively. Overall, coverage increases from approximately 91.5% to approximately 98.5%. Conclusion: While on our current computer with uniform memory access the reduced number of iterations does not translate into a similar speedup, the approach illustrates how to effectively parallelize the search for the optimal beam configuration. The experimental results also indicate that for complex geometries the beam selection is critical for further plan optimization.

07 ISOTOPE AND RADIATION SOURCES↗
DOE OSTI2016

SU-F-J-214: Dose Reduction by Spatially Optimized Image Quality Via Fluence Modulated Proton CT (FMpCT)

Purpose: Proton CT (pCT) is a promising imaging modality for reducing range uncertainty in image-guided proton therapy. Range uncertainties partially originate from X-ray CT number conversion to stopping power ratio (SPR) and are limiting the exploitation of the full potential of proton therapy. In this study we explore the concept of spatially dependent fluence modulated proton CT (FMpCT), for achieving optimal image quality in a clinical region of interest (ROI), while reducing significantly the imaging dose to the patient. Methods: The study was based on simulated ideal pCT using pencil beam (PB) scanning. A set of 250 MeV protons PBs was used to create 360 projections of a cylindrical water phantom and a head and neck cancer patient. The tomographic images were reconstructed using a filtered backprojection (FBP) as well as an iterative algorithm (ITR). Different fluence modulation levels were investigated and their impact on the image was quantified in terms of SPR accuracy as well as noise within and outside selected ROIs, as a function of imaging dose. The unmodulated image served as reference. Results: Both FBP reconstruction and ITR without total variation (TV) yielded image quality in the ROIs similar to the reference images, for modulation down to 0.1 of the full proton fluence. The average dose was reduced by 75% for the water phantom and by 40% for the patient. FMpCT does not improve the noise for ITR with TV and modulation 0.1. Conclusion: This is the first work proposing and investigating FMpCT for producing optimal image quality for treatment planning and image guidance, while simultaneously reducing imaging dose. Future work will address spatial resolution effects and the impact of FMpCT on the quality of proton treatment plans for a prototype pCT scanner capable of list mode data acquisition. Acknowledgement: DFG-MAP DFG - Munich-Centre for Advanced Photonics (MAP)

60 APPLIED LIFE SCIENCES↗
DOE OSTI2025

Implementation of Perturbation Theory and Sensitivity Capabilities in Griffin

Griffin is a Multiphysics Object-Oriented Simulation Environment (MOOSE) based reactor Multiphysics analysis application, jointly developed by Argonne and Idaho National Laboratories under the DOE-NE NEAMS program. This fiscal year, capabilities for reactivity and sensitivity evaluation using perturbation methods were implemented and verified. The First Order Perturbation Method (FOPT) was employed to compute reactivity worth resulting from small perturbations in input parameters, while the Generalized Perturbation Theory (GPT) was used to evaluate sensitivities of a range of response types, including reaction rate ratio, k-eigenvalue, neutron generation time, and effective delayed neutron fraction. These perturbation methods enable users to quantify how response quantities change due to a perturbation in a input parameter without explicitly performing an additional transport simulation for each perturbed state. In particular, the GPT formulation accounts for indirect effects arising from flux changes by solving generalized inhomogeneous equations, for which a Neumann series-based iterative solution method was developed and implemented in Griffin. The implemented reactivity and sensitivity evaluation capabilities were verified using two test problems: an infinite homogeneous system and a two-dimensional hexagonal core. The results showed excellent agreement with reference solutions obtained by a direct method based on finite difference approximation as well as GPT-based results from the PERSENT code, confirming the accuracy of both reactivity and sensitivity evaluations. Additionally, preliminary uncertainty quantification (UQ) results were obtained by combining the sensitivity values computed using GPT and external covariance data, demonstrating that the implemented sensitivity results can be reliably used for uncertainty calculations. To further demonstrate the generality and practical strength of the implementation, the sensitivity evaluation capability was successfully applied to the Empire microreactor with a geometrically complex design that poses significant modeling challenges. The results confirm that Griffin enables sensitivity evaluations even for irregular and highly heterogeneous reactor configurations, thereby establishing a foundation for UQ applications in advanced reactor designs and analyses.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2019

Pilot Point Optimization of Mining Boundaries for Lateritic Metal Deposits: Finding the Trade-off Between Dilution and Ore Loss

Geological contacts in lateritic metal deposits (footwall topographies) often delineate the orebody boundaries. Spatial variations seen in such contacts are frequently higher than those for the metal grades of the deposit. Therefore, borehole spacing chosen based on the grade variations cannot adequately capture the geological contact variability. Consequently, models created using such boreholes cause high volumetric uncertainties in the actual and targeted ore extraction volumes, which, in turn, lead to high unplanned dilution and ore losses. In this paper, a method to design optimum ore/mining boundaries for lateritic metal deposits is presented. The proposed approach minimizes the dilution/ore losses and comprises two main steps. First, the uncertainty on the orebody boundary is represented using a set of stochastic realizations generated with a multiple-point statistics algorithm. Then, the optimal orebody boundary is determined using an optimization technique inspired by a model calibration method called Pilot Points. The pilot points represent synthetic elevation values, and they are used to construct smooth mining boundaries using the multilevel B-spline technique. The performance of a generated surface is evaluated using the expected sum of losses in each of the stochastic realizations. The simulated annealing algorithm is used to iteratively determine the pilot point values which minimize the expected losses. The results show a significant reduction in the dilution volume as compared to those obtained from the actual mining operation.

58 GEOSCIENCES↗
DOE OSTI2014

A block matching-based registration algorithm for localization of locally advanced lung tumors

Purpose: To implement and evaluate a block matching-based registration (BMR) algorithm for locally advanced lung tumor localization during image-guided radiotherapy. Methods: Small (1 cm{sup 3}), nonoverlapping image subvolumes (“blocks”) were automatically identified on the planning image to cover the tumor surface using a measure of the local intensity gradient. Blocks were independently and automatically registered to the on-treatment image using a rigid transform. To improve speed and robustness, registrations were performed iteratively from coarse to fine image resolution. At each resolution, all block displacements having a near-maximum similarity score were stored. From this list, a single displacement vector for each block was iteratively selected which maximized the consistency of displacement vectors across immediately neighboring blocks. These selected displacements were regularized using a median filter before proceeding to registrations at finer image resolutions. After evaluating all image resolutions, the global rigid transform of the on-treatment image was computed using a Procrustes analysis, providing the couch shift for patient setup correction. This algorithm was evaluated for 18 locally advanced lung cancer patients, each with 4–7 weekly on-treatment computed tomography scans having physician-delineated gross tumor volumes. Volume overlap (VO) and border displacement errors (BDE) were calculated relative to the nominal physician-identified targets to establish residual error after registration. Results: Implementation of multiresolution registration improved block matching accuracy by 39% compared to registration using only the full resolution images. By also considering multiple potential displacements per block, initial errors were reduced by 65%. Using the final implementation of the BMR algorithm, VO was significantly improved from 77% ± 21% (range: 0%–100%) in the initial bony alignment to 91% ± 8% (range: 56%–100%;p < 0.001). Left-right, anterior-posterior, and superior-inferior systematic BDE were 3.2, 2.4, and 4.4 mm, respectively, with random BDE of 2.4, 2.1, and 2.7 mm. Margins required to include both localization and delineation uncertainties ranged from 5.0 to 11.7 mm, an average of 40% less than required for bony alignment. Conclusions: BMR is a promising approach for automatic lung tumor localization. Further evaluation is warranted to assess the accuracy and robustness of BMR against other potential localization strategies.

62 RADIOLOGY AND NUCLEAR MEDICINE↗
DOE OSTI2015

SU-E-J-44: A Novel Approach to Quantify Patient Setup and Target Motion for Real-Time Image-Guided Radiotherapy (IGRT)

Purpose Isocenter shifts and rotations to correct patient setup errors and organ motion cannot remedy some shape changes of large targets. We are investigating new methods in quantification of target deformation for realtime IGRT of breast and chest wall cancer. Methods Ninety-five patients of breast or chest wall cancer were accrued in an IRB-approved clinical trial of IGRT using 3D surface images acquired at daily setup and beam-on time via an in-room camera. Shifts and rotations relating to the planned reference surface were determined using iterative-closest-point alignment. Local surface displacements and target deformation are measured via a ray-surface intersection and principal component analysis (PCA) of external surface, respectively. Isocenter shift, upper-abdominal displacement, and vectors of the surface projected onto the two principal components, PC1 and PC2, were evaluated for sensitivity and accuracy in detection of target deformation. Setup errors for some deformed targets were estimated by superlatively registering target volume, inner surface, or external surface in weekly CBCT or these outlines on weekly EPI. Results Setup difference according to the inner-surface, external surface, or target volume could be 1.5 cm. Video surface-guided setup agreed with EPI results to within < 0.5 cm while CBCT results were sometimes (∼20%) different from that of EPI (>0.5 cm) due to target deformation for some large breasts and some chest walls undergoing deep-breath-hold irradiation. Square root of PC1 and PC2 is very sensitive to external surface deformation and irregular breathing. Conclusion PCA of external surfaces is quick and simple way to detect target deformation in IGRT of breast and chest wall cancer. Setup corrections based on the target volume, inner surface, and external surface could be significant different. Thus, checking of target shape changes is essential for accurate image-guided patient setup and motion tracking of large deformable targets. NIH grant for the first author as cionsultant and the last author as the PI.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2016

Implementation of a Red-Black SOR CMFD Solver in MPACT

As part of the Consortium for Advanced Simulation of Light Water Reactors (CASL), the Virtual Environment for Reactor Applications (VERA) is being developed to provide high-fidelity multi-physics simulations of nuclear reactor cores. The MPACT code being developed collaboratively by Oak Ridge National Laboratory and the University of Michigan includes the primary deterministic neutron transport solver available within VERA. MPACT employs the 2D/1D method to solve three-dimensional problems, using 2D method of characteristics (MOC) radial transport solvers with 1D NEM-SP3 axial transport solvers, which are coupled using axial and radial transverse leakages. A 3D coarse mesh finite difference (CMFD) solver is used to provide accelerated convergence that is more stable. The Portable, Extensible Tool kit for Scientific Computation (PETSc) generalized minimal residual (GMRES) iterative solver with a block Jacobi preconditioner has been used to solve the CMFD linear systems. This work focused on the addition of a red-black successive over-relaxation (RBSOR) solver to reduce overall runtime by reducing time spent solving the CMFD linear systems. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗
DOE OSTI2020

Approximate inverse-based block preconditioners in poroelasticity

We focus on the fully implicit solution of the linear systems arising from a three-field mixed finite element approximation of Biot’s poroleasticity equations. The objective is to develop algebraic block preconditioners for the efficient solution of such systems by Krylov subspace methods. In this work, we investigate the use of approximate inverse-based techniques to decouple the native system of equations and obtain explicit sparse approximations of the Schur complements related to the physics-based partitioning of the unknowns by field type. Here, the proposed methods are tested in various numerical experiments including real-world applications dealing with petroleum and geotechnical engineering.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2020

OmniFold: A Method to Simultaneously Unfold All Observables

Collider data must be corrected for detector effects (“unfolded”) to be compared with many theoretical calculations and measurements from other experiments. Unfolding is traditionally done for individual, binned observables without including all information relevant for characterizing the detector response. We introduce OmniFold, an unfolding method that iteratively reweights a simulated dataset, using machine learning to capitalize on all available information. Our approach is unbinned, works for arbitrarily high-dimensional data, and naturally incorporates information from the full phase space. We illustrate this technique on a realistic jet substructure example from the Large Hadron Collider and compare it to standard binned unfolding methods. This new paradigm enables the simultaneous measurement of all observables, including those not yet invented at the time of the analysis.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2014

Automatic segmentation of head and neck CT images for radiotherapy treatment planning using multiple atlases, statistical appearance models, and geodesic active contours

Purpose: Accurate delineation of organs at risk (OARs) is a precondition for intensity modulated radiation therapy. However, manual delineation of OARs is time consuming and prone to high interobserver variability. Because of image artifacts and low image contrast between different structures, however, the number of available approaches for autosegmentation of structures in the head-neck area is still rather low. In this project, a new approach for automated segmentation of head-neck CT images that combine the robustness of multiatlas-based segmentation with the flexibility of geodesic active contours and the prior knowledge provided by statistical appearance models is presented. Methods: The presented approach is using an atlas-based segmentation approach in combination with label fusion in order to initialize a segmentation pipeline that is based on using statistical appearance models and geodesic active contours. An anatomically correct approximation of the segmentation result provided by atlas-based segmentation acts as a starting point for an iterative refinement of this approximation. The final segmentation result is based on using model to image registration and geodesic active contours, which are mutually influencing each other. Results: 18 CT images in combination with manually segmented labels of parotid glands and brainstem were used in a leave-one-out cross validation scheme in order to evaluate the presented approach. For this purpose, 50 different statistical appearance models have been created and used for segmentation. Dice coefficient (DC), mean absolute distance and max. Hausdorff distance between the autosegmentation results and expert segmentations were calculated. An average Dice coefficient of DC = 0.81 (right parotid gland), DC = 0.84 (left parotid gland), and DC = 0.86 (brainstem) could be achieved. Conclusions: The presented framework provides accurate segmentation results for three important structures in the head neck area. Compared to a segmentation approach based on using multiple atlases in combination with label fusion, the proposed hybrid approach provided more accurate results within a clinically acceptable amount of time.

62 RADIOLOGY AND NUCLEAR MEDICINE↗
DOE OSTI2022

A coupling approach for linear elasticity problems with spatially non-coincident discretized interfaces

Here we present a new method for coupled linear elasticity problems whose finite element discretization may lead to spatially non-coincident discretized interfaces. Our approach combines the classical Dirichlet–Neumann coupling formulation with a new set of discretized interface conditions obtained through Taylor series expansions. We show that these conditions ensure linear consistency of the coupled finite element solution. We then formulate an iterative solution method for the coupled discrete system and apply the new coupling approach to two representative settings for which we also provide several numerical illustrations. The first setting is a mesh-tying problem in which both coupled structures have the same Lamé parameters whereas the second setting is an interface problem for which the Lamé parameters in the two coupled structures are different.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Accelerating multigrid with streaming chiral SVD for Wilson fermions in lattice QCD

A modification to the setup algorithm for the multigrid preconditioner of Wilson fermions in lattice QCD is presented. A larger basis of test vectors than that used in regular multigrid is calculated by the smoother and truncated by singular value decomposition on the chiral components of the test vectors. The truncated basis is used to form the prolongation and restriction matrices of the multigrid hierarchy. This modification of the setup method is demonstrated to increase the convergence of linear solvers on an anisotropic lattice with m π ≈ 239 MeV from the Hadron Spectrum Collaboration and an isotropic lattice with m π ≈ 220 MeV from the MILC Collaboration. The lattice volume dependence of the method is also examined. Increasing the number of test vectors improves speedup up to a point, but storing these vectors becomes impossible in limited memory resources such as GPUs. To address storage cost, we implement a streaming singular value decomposition of the basis of test vectors on the chiral components and demonstrate a decrease in the number of fine level iterations by a factor of 1.7 for m q ≈ m crit

Iterative methods↗
DOE OSTI2015

Algebraic multigrid domain and range decomposition (AMG-DD / AMG-RD)*

In modern large-scale supercomputing applications, algebraic multigrid (AMG) is a leading choice for solving matrix equations. However, the high cost of communication relative to that of computation is a concern for the scalability of traditional implementations of AMG on emerging architectures. This paper introduces two new algebraic multilevel algorithms, algebraic multigrid domain decomposition (AMG-DD) and algebraic multigrid range decomposition (AMG-RD), that replace traditional AMG V-cycles with a fully overlapping domain decomposition approach. While the methods introduced here are similar in spirit to the geometric methods developed by Brandt and Diskin [Multigrid solvers on decomposed domains, in Domain Decomposition Methods in Science and Engineering, Contemp. Math. 157, AMS, Providence, RI, 1994, pp. 135--155], Mitchell [Electron. Trans. Numer. Anal., 6 (1997), pp. 224--233], and Bank and Holst [SIAM J. Sci. Comput., 22 (2000), pp. 1411--1443], they differ primarily in that they are purely algebraic: AMG-RD and AMG-DD trade communication for computation by forming global composite “grids” based only on the matrix, not the geometry. (As is the usual AMG convention, “grids” here should be taken only in the algebraic sense, regardless of whether or not it corresponds to any geometry.) Another important distinguishing feature of AMG-RD and AMG-DD is their novel residual communication process that enables effective parallel computation on composite grids, avoiding the all-to-all communication costs of the geometric methods. The main purpose of this paper is to study the potential of these two algebraic methods as possible alternatives to existing AMG approaches for future parallel machines. As a result, this paper develops some theoretical properties of these methods and reports on serial numerical tests of their convergence properties over a spectrum of problem parameters.

97 MATHEMATICS AND COMPUTING↗