Search NASA⌕ Search

SEARCH · Search NASA

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 1,189 records · Page 66

Tau-REx I: A next generation retrieval code for exoplanetary atmospheres

Spectroscopy of exoplanetary atmospheres has become a well established method for the characterization of extrasolar planets. We here present a novel inverse retrieval code for exoplanetary atmospheres. T-REx(Tau Retrieval for Exoplanets) is a line-by-line radiative transfer fully Bayesian retrieval framework. T-REx includes the following features:(1) the optimized use of molecular line lists from the ExoMol project; (2) an unbiased atmospheric composition prior selection, through custom built pattern recognition software; (3) the use of two independent algorithms to fully sample the Bayesian likelihood space: nested sampling as well as a more classical Markov Chain Monte Carlo approach; (4) iterative Bayesian parameter and model selection using the full Bayesian Evidence as well as the Savage–Dickey Ratio for nested models; and (5) the ability to fully map very large parameter spaces through optimal code parallelization and scalability to cluster computing. In this publication we outline the T-REx framework and demonstrate, using a theoretical hot-Jupiter transmission spectrum, the parameter retrieval and model selection. We investigate the impact of signal-to-noise ratio and spectral resolution on the retrievability of individual model parameters, both in terms of error bars on the temperature and molecular mixing ratios as well as its effect on the model’s global Bayesian evidence.

79 ASTRONOMY AND ASTROPHYSICS↗

Chebyshev polynomial filtered subspace iteration in the discontinuous Galerkin method for large-scale electronic structure calculations

The Discontinuous Galerkin (DG) electronic structure method employs an adaptive local basis (ALB) set to solve the Kohn-Sham equations of density functional theory in a discontinuous Galerkin framework. The adaptive local basis is generated on-the-fly to capture the local material physics and can systematically attain chemical accuracy with only a few tens of degrees of freedom per atom. A central issue for large-scale calculations, however, is the computation of the electron density (and subsequently, ground state properties) from the discretized Hamiltonian in an efficient and scalable manner. We show in this work how Chebyshev polynomial filtered subspace iteration (CheFSI) can be used to address this issue and push the envelope in large-scale materials simulations in a discontinuous Galerkin framework. We describe how the subspace filtering steps can be performed in an efficient and scalable manner using a two-dimensional parallelization scheme, thanks to the orthogonality of the DG basis set and block-sparse structure of the DG Hamiltonian matrix. The on-the-fly nature of the ALB functions requires additional care in carrying out the subspace iterations. We demonstrate the parallel scalability of the DG-CheFSI approach in calculations of large-scale twodimensional graphene sheets and bulk three-dimensional lithium-ion electrolyte systems. In conclusion, employing 55 296 computational cores, the time per self-consistent field iteration for a sample of the bulk 3D electrolyte containing 8586 atoms is 90 s, and the time for a graphene sheet containing 11 520 atoms is 75 s.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

SU-E-I-89: Assessment of CT Radiation Dose and Image Quality for An Automated Tube Potential Selection Algorithm Using Pediatric Anthropomorphic and ACR Phantoms

Purpose: To assess the impact of General Electrics automated tube potential algorithm, kV assist (kVa) on radiation dose and image quality, with an emphasis on optimizing protocols based on noise texture. Methods: Radiation dose was assessed by inserting optically stimulated luminescence dosimeters (OSLs) throughout the body of a pediatric anthropomorphic phantom (CIRS). The baseline protocol was: 120 kVp, 80 mA, 0.7s rotation time. Image quality was assessed by calculating the contrast to noise ratio (CNR) and noise power spectrum (NPS) from the ACR CT accreditation phantom. CNRs were calculated according to the steps described in ACR CT phantom testing document. NPS was determined by taking the 3D FFT of the uniformity section of the ACR phantom. NPS and CNR were evaluated with and without kVa and for all available adaptive iterative statistical reconstruction (ASiR) settings, ranging from 0 to 100%. Each NPS was also evaluated for its peak frequency difference (PFD) with respect to the baseline protocol. Results: For the baseline protocol, CNR was found to decrease from 0.460 ± 0.182 to 0.420 ± 0.057 when kVa was activated. When compared against the baseline protocol, the PFD at ASiR of 40% yielded a decrease in noise magnitude as realized by the increase in CNR = 0.620 ± 0.040. The liver dose decreased by 30% with kVa activation. Conclusion: Application of kVa reduces the liver dose up to 30%. However, reduction in image quality for abdominal scans occurs when using the automated tube voltage selection feature at the baseline protocol. As demonstrated by the CNR and NPS analysis, the texture and magnitude of the noise in reconstructed images at ASiR 40% was found to be the same as our baseline images. We have demonstrated that 30% dose reduction is possible when using 40% ASiR with kVa in pediatric patients.

60 APPLIED LIFE SCIENCES↗

SU-E-I-99: Estimation of Effective Charge Distribution by Dual-Energy CT Reconstruction

Purpose: Computed Tomography (CT) is a method to produce slice image of specific volume from the scanned x-ray projection images. The contrast of CT image is correlated with the attenuation coefficients of the x-ray in the object. The attenuation coefficient is strongly dependent on the x-ray energy and the effective charge of the material. The purpose of this presentation is to show the effective charge distribution predicted by CT images reconstructed with kilovoltage(kV) and megavoltage(MV) x-ray energy. Methods: The attenuation coefficients of x-ray can be characterized by cross section of photoionization and Compton scattering for the specific xray energy. In particular, the photoionization cross section is strongly correlated with the effective charge of the object. Hence we can calculate effective charge by solving the coupled equation between the attenuation coefficient and the theoretical cross section. For this study, we use the megavoltage (MV) and kilovoltage (kV) x-rays of Elekta Synergy as the dual source x-ray, and CT image of the Phantom Laboratory CatPhan is reconstructed by the filtered back projection (FBP) and iterative algorithm for cone-beam CT (CBCT). Results: We report attenuation coefficients of each component of the CatPhan specified by each x-ray source. Also the effective charge distribution is evaluated by the MV and kV dual x-ray sources. The predicted effective charges are comparable with the nominal ones. Conclusion: We developed the MV and kV dual-source CBCT reconstruction to yield the effective charge distribution. For more accuracy, it is critical to remove an effect of the scattering photon in the CBCT reconstruction algorithm. The finding will be fine reference of the effective charge of tissue and lead to the more realistic absorbed-dose calculation. This work was partly supported by the JSPS Core-to-Core Program(No. 23003), and this work was partly supported by JSPS KAKENHI 24234567.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Block preconditioning for fault/fracture mechanics saddle-point problems

The efficient simulation of fault and fracture mechanics is a key issue in several applications and is attracting a growing interest by the scientific community. Using a formulation based on Lagrange multipliers, the Jacobian matrix resulting from the Finite Element discretization of the governing equations has a non-symmetric generalized saddle-point structure. In this work, we propose a family of block preconditioners to accelerate the convergence of Krylov methods for such problems. We critically review possible advantages and difficulties of using various Schur complement approximations, based on both physical and algebraic considerations. In conclusion, the proposed approaches are tested in a number of real-world applications, showing their robustness and efficiency also in large-size and ill-conditioned problems.

42 ENGINEERING↗

WE-AB-207A-04: Random Undersampled Cone Beam CT: Theoretical Analysis and a Novel Reconstruction Method

Purpose: Reducing x-ray exposure and speeding up data acquisition motived studies on projection data undersampling. It is an important question that for a given undersampling ratio, what the optimal undersampling approach is. In this study, we propose a new undersampling scheme: random-ray undersampling. We will mathematically analyze its projection matrix properties and demonstrate its advantages. We will also propose a new reconstruction method that simultaneously performs CT image reconstruction and projection domain data restoration. Methods: By representing projection operator under the basis of singular vectors of full projection operator, matrix representations for an undersampling case can be generated and numerical singular value decomposition can be performed. We compared properties of matrices among three undersampling approaches: regular-view undersampling, regular-ray undersampling, and the proposed random-ray undersampling. To accomplish CT reconstruction for random undersampling, we developed a novel method that iteratively performs CT reconstruction and missing projection data restoration via regularization approaches. Results: For a given undersampling ratio, random-ray undersampling preserved mathematical properties of full projection operator better than the other two approaches. This translates to advantages of reconstructing CT images at lower errors. Different types of image artifacts were observed depending on undersampling strategies, which were ascribed to the unique singular vectors of the sampling operators in the image domain. We tested the proposed reconstruction algorithm on a Forbid phantom with only 30% of the projection data randomly acquired. Reconstructed image error was reduced from 9.4% in a TV method to 7.6% in the proposed method. Conclusion: The proposed random-ray undersampling is mathematically advantageous over other typical undersampling approaches. It may permit better image reconstruction at the same undersampling ratio. The novel algorithm suitable for this random-ray undersampling was able to reconstruct high-quality images.

60 APPLIED LIFE SCIENCES↗

Quasi-Optimal Schwarz Methods for the Conforming Spectral Element Discretization

Fast methods are proposed for solving the system K(sub N)x = b resulting from the discretization of self-adjoint elliptic equations in three dimensional domains by the spectral element method. The domain is decomposed into hexahedral elements, and in each of these elements the discretization space is formed by polynomials of degree N in each variable. Gauss-Lobatto-Legendre (GLL) quadrature rules replace the integrals in the Galerkin formulation. This system is solved by the preconditioned conjugate gradients method. The conforming finite element space on the GLL mesh consisting of piecewise Q(sub 1) elements produces a stiffness matrix K(sub h) that is spectrally equivalent to the spectral element stiffness matrix K(sub N). The action of the inverse of K(sub h) is expensive for large problems, and is therefore replaced by a Schwarz preconditioner B(sub h) of this finite element stiffness matrix. The preconditioned operator then becomes B(sub h)(exp -l)K(sub N). The technical difficulties stem from the nonregularity of the mesh. Tools to estimate the convergence of a large class of new iterative substructuring and overlapping Schwarz preconditioners are developed. This technique also provides a new analysis for an iterative substructuring method proposed by Pavarino and Widlund for the spectral element discretization.

Casarin, Mario↗

GPU-based fast cone beam CT reconstruction from undersampled and noisy projection data via total variation

Purpose: Cone-beam CT (CBCT) plays an important role in image guided radiation therapy (IGRT). However, the large radiation dose from serial CBCT scans in most IGRT procedures raises a clinical concern, especially for pediatric patients who are essentially excluded from receiving IGRT for this reason. The goal of this work is to develop a fast GPU-based algorithm to reconstruct CBCT from undersampled and noisy projection data so as to lower the imaging dose. Methods: The CBCT is reconstructed by minimizing an energy functional consisting of a data fidelity term and a total variation regularization term. The authors developed a GPU-friendly version of the forward-backward splitting algorithm to solve this model. A multigrid technique is also employed. Results: It is found that 20-40 x-ray projections are sufficient to reconstruct images with satisfactory quality for IGRT. The reconstruction time ranges from 77 to 130 s on an NVIDIA Tesla C1060 (NVIDIA, Santa Clara, CA) GPU card, depending on the number of projections used, which is estimated about 100 times faster than similar iterative reconstruction approaches. Moreover, phantom studies indicate that the algorithm enables the CBCT to be reconstructed under a scanning protocol with as low as 0.1 mA s/projection. Comparing with currently widely used full-fan head and neck scanning protocol of {approx}360 projections with 0.4 mA s/projection, it is estimated that an overall 36-72 times dose reduction has been achieved in our fast CBCT reconstruction algorithm. Conclusions: This work indicates that the developed GPU-based CBCT reconstruction algorithm is capable of lowering imaging dose considerably. The high computation efficiency in this algorithm makes the iterative CBCT reconstruction approach applicable in real clinical environments.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Plutonium Critical Mass Curve Comparison to Mass at Upper Subcritical Limit (USL) Using Whisper

Whisper is computational software designed to assist the nuclear criticality safety analyst with validation studies with the MCNP ® Monte Carlo radiation transport package. Standard approaches to validation rely on the selection of benchmarks based upon expert judgment. Whisper uses sensitivity/uncertainty (S/U) methods to select relevant benchmarks to a particular application or set of applications being analyzed. Using these benchmarks, Whisper computes a calculational margin. Whisper attempts to quantify the margin of subcriticality (MOS) from errors in software and uncertainties in nuclear data. The combination of the Whisper-derived calculational margin and MOS comprise the baseline upper subcritical limit (USL), to which an additional margin may be applied by the nuclear criticality safety analyst as appropriate to ensure subcriticality. A series of critical mass curves for plutonium, similar to those found in Figure 31 of LA-10860-MS, have been generated using MCNP6.1.1 and the iterative parameter study software, WORM_Solver. The baseline USL for each of the data points of the curves was then computed using Whisper 1.1. The USL was then used to determine the equivalent mass for plutonium metal-water system. ANSI/ANS-8.1 states that it is acceptable to use handbook data, such as the data directly from the LA-10860-MS, as it is already considered validated (Section 4.3 4) “Use of subcritical limit data provided in ANSI/ANS standards or accepted reference publications does not require further validation.”). This paper attempts to take a novel approach to visualize traditional critical mass curves and allows comparison with the amount of mass for which the k eff is equal to the USL (calculational margin + margin of subcriticality). However, the intent is to plot the critical mass data along with USL, not to suggest that already accepted handbook data should have new and more rigorous requirements for validation.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Measuring the density of a molecular cluster injector via visible emission from an electron beam

A method to measure the density distribution of a dense hydrogen gas jet is presented. A Mach 5.5 nozzle is cooled to 80 K to form a flow capable of molecular cluster formation. A 250 V, 10 mA electron beam collides with the jet and produces H{sub {alpha}} emission that is viewed by a fast camera. The high density of the jet, several 10{sup 16} cm{sup -3}, results in substantial electron depletion, which attenuates the H{sub {alpha}} emission. The attenuated emission measurement, combined with a simplified electron-molecule collision model, allows us to determine the molecular density profile via a simple iterative calculation.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Optimal Shielding Design For Minimum Materials Cost or Mass - Paper 128

Material costs dominate some shielding design problems. This is certainly the case for manned nuclear power space applications for which shielding is essential and the cost of launching by rocket from Earth is high. In such situations or in those where shielding volume or mass is constrained, it is important to optimize the design. Although trial and error synthesis methods may succeed, a more systematic approach is warranted. Design automation may also potentially reduce engineering costs. The objective is to automate the design of optimal radiation shielding to meet specified attenuation requirements given a menu of allowed shielding materials, their properties and their delivered costs per unit volume. The cost-optimal design is one which, at each location in the shield, chooses the menu material minimizing a particular functional of forward and adjoint angular fluxes plus material cost. Thus a Boltzmann forward and adjoint angular flux solver with additional calculations can evaluate whether a shield design is optimal or whether improvements are possible. An iterative algorithm based on approximated optimality is proposed to solve for the optimal shield design and numerical experiments with it are discussed. The future use of 3D Boltzmann solvers will allow extending results to shaped shield designs in which material is not wasted to maintain unneeded spherical symmetry. The largest cost savings of automated optimal design of shielding is expected to be for applications involving nuclear powered manned space missions where the required shielding attenuation of radiation and costs are both large. However, less exotic applications such as the shielding of radiation facilities on Earth could also benefit from optimal shielding design, and automation of the design process may reduce engineering costs. (author)

61 RADIATION PROTECTION AND DOSIMETRY↗

A DVH-guided IMRT optimization algorithm for automatic treatment planning and adaptive radiotherapy replanning

Purpose: To develop a novel algorithm that incorporates prior treatment knowledge into intensity modulated radiation therapy optimization to facilitate automatic treatment planning and adaptive radiotherapy (ART) replanning. Methods: The algorithm automatically creates a treatment plan guided by the DVH curves of a reference plan that contains information on the clinician-approved dose-volume trade-offs among different targets/organs and among different portions of a DVH curve for an organ. In ART, the reference plan is the initial plan for the same patient, while for automatic treatment planning the reference plan is selected from a library of clinically approved and delivered plans of previously treated patients with similar medical conditions and geometry. The proposed algorithm employs a voxel-based optimization model and navigates the large voxel-based Pareto surface. The voxel weights are iteratively adjusted to approach a plan that is similar to the reference plan in terms of the DVHs. If the reference plan is feasible but not Pareto optimal, the algorithm generates a Pareto optimal plan with the DVHs better than the reference ones. If the reference plan is too restricting for the new geometry, the algorithm generates a Pareto plan with DVHs close to the reference ones. In both cases, the new plans have similar DVH trade-offs as the reference plans. Results: The algorithm was tested using three patient cases and found to be able to automatically adjust the voxel-weighting factors in order to generate a Pareto plan with similar DVH trade-offs as the reference plan. The algorithm has also been implemented on a GPU for high efficiency. Conclusions: A novel prior-knowledge-based optimization algorithm has been developed that automatically adjust the voxel weights and generate a clinical optimal plan at high efficiency. It is found that the new algorithm can significantly improve the plan quality and planning efficiency in ART replanning and automatic treatment planning.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

AN EMPIRICAL METHOD FOR IMPROVING THE QUALITY OF RXTE HEXTE SPECTRA

We have developed a correction tool to improve the quality of Rossi X-ray Timing Explorer (RXTE) High Energy X-ray Timing Experiment (HEXTE) spectra by employing the same method we used earlier to improve the quality of RXTE Proportional Counter Array (PCA) spectra. We fit all of the hundreds of HEXTE spectra of the Crab individually to a simple power-law model, some 37 million counts in total for Cluster A and 39 million counts for Cluster B, and we create for each cluster a combined spectrum of residuals. We find that the residual spectrum of Cluster A is free of instrumental artifacts while that of Cluster B contains significant features with amplitudes ∼1%; the most prominent is in the energy range 30–50 keV, which coincides with the iodine K edge. Starting with the residual spectrum for Cluster B, via an iterative procedure we created the calibration tool hexBcorr for correcting any Cluster B spectrum of interest. We demonstrate the efficacy of the tool by applying it to Cluster B spectra of two bright black holes, which contain several million counts apiece. For these spectra, application of the tool significantly improves the goodness of fit, while affecting only slightly the broadband fit parameters. The tool may be important for the study of spectral features, such as cyclotron lines, a topic that is beyond the scope of this paper.

79 ASTRONOMY AND ASTROPHYSICS↗

Bayesian soft X-ray tomography using non-stationary Gaussian Processes

In this study, a Bayesian based non-stationary Gaussian Process (GP) method for the inference of soft X-ray emissivity distribution along with its associated uncertainties has been developed. For the investigation of equilibrium condition and fast magnetohydrodynamic behaviors in nuclear fusion plasmas, it is of importance to infer, especially in the plasma center, spatially resolved soft X-ray profiles from a limited number of noisy line integral measurements. For this ill-posed inversion problem, Bayesian probability theory can provide a posterior probability distribution over all possible solutions under given model assumptions. Specifically, the use of a non-stationary GP to model the emission allows the model to adapt to the varying length scales of the underlying diffusion process. In contrast to other conventional methods, the prior regularization is realized in a probability form which enhances the capability of uncertainty analysis, in consequence, scientists who concern the reliability of their results will benefit from it. Under the assumption of normally distributed noise, the posterior distribution evaluated at a discrete number of points becomes a multivariate normal distribution whose mean and covariance are analytically available, making inversions and calculation of uncertainty fast. Additionally, the hyper-parameters embedded in the model assumption can be optimized through a Bayesian Occam's Razor formalism and thereby automatically adjust the model complexity. This method is shown to produce convincing reconstructions and good agreements with independently calculated results from the Maximum Entropy and Equilibrium-Based Iterative Tomography Algorithm methods.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

WE-AB-BRA-07: Operating Room Quality Assurance (ORQA) for Spine Surgery Using Known-Component 3D-2D Image Registration

Purpose: Intraoperative x-ray radiography/fluoroscopy is commonly used to qualitatively assess delivery of surgical devices (e.g., spine pedicle screws) but can fail to reliably detect suboptimal placement (e.g., breach of adjacent critical structures). We present a method wherein prior knowledge of the patient and surgical components is leveraged to match preoperative CT and intraoperative radiographs for quantitative assessment of 3D pose. The method presents a new means of operating room quantitative quality assurance (ORQA) that could improve quality and safety, and reduce the frequency of revision surgeries. Methods: The algorithm (known-component registration, KC-Reg) uses patient-specific preoperative CT and parametrically defined surgical component models within a robust 3D-2D registration method to iteratively optimize gradient similarity using the covariance matrix adaptation evolution strategy. Advances from previous work address key challenges to clinical translation: i) absolving the need for offline geometric calibration of the C-arm; and ii) solving multiple component bodies simultaneously, thereby allowing QA in a single step (e.g., spinal construct with 4–20 screws), rather than sequential QA of each component. Performance was tested in a spine phantom with 10 pedicle screws, and first results from clinical studies are reported. Results: Phantom experiments demonstrated median target registration error (TRE) of (1.0±0.3) mm at the screw tip and (0.7°±0.4°) in angulation. The simultaneous multi-body registration approach improved TRE from the previous (sequential) method by 42%, reduced outliers, and fits into the natural workflow. Initial application of KC-Reg in clinical data shows TRE of (2.5±4.5) mm and (4.7°±0.5°). Conclusion: The KC-Reg algorithm offers a potentially valuable method for quantitative QA of the surgical product, using radiographic systems that are already within the surgical arsenal. For spine surgery, the method offers a near-real-time independent check on the quality of surgical product, facilitating immediate revision if necessary and potentially avoiding postoperative morbidity and/or revision surgery. Gerhard Kleinszig and Sebastian Vogt are employees of Siemens Healthcare.

60 APPLIED LIFE SCIENCES↗

SU-E-J-10: A Moving-Blocker-Based Strategy for Simultaneous Megavoltage and Kilovoltage Scatter Correction in Cone-Beam Computed Tomography Image Acquired During Volumetric Modulated Arc Therapy

Purpose: To evaluate a moving-blocker-based approach in estimating and correcting megavoltage (MV) and kilovoltage (kV) scatter contamination in kV cone-beam computed tomography (CBCT) acquired during volumetric modulated arc therapy (VMAT). Methods: XML code was generated to enable concurrent CBCT acquisition and VMAT delivery in Varian TrueBeam developer mode. A physical attenuator (i.e., “blocker”) consisting of equal spaced lead strips (3.2mm strip width and 3.2mm gap in between) was mounted between the x-ray source and patient at a source to blocker distance of 232mm. The blocker was simulated to be moving back and forth along the gantry rotation axis during the CBCT acquisition. Both MV and kV scatter signal were estimated simultaneously from the blocked regions of the imaging panel, and interpolated into the un-blocked regions. Scatter corrected CBCT was then reconstructed from un-blocked projections after scatter subtraction using an iterative image reconstruction algorithm based on constraint optimization. Experimental studies were performed on a Catphan 600 phantom and an anthropomorphic pelvis phantom to demonstrate the feasibility of using moving blocker for MV-kV scatter correction. Results: MV scatter greatly degrades the CBCT image quality by increasing the CT number inaccuracy and decreasing the image contrast, in addition to the shading artifacts caused by kV scatter. The artifacts were substantially reduced in the moving blocker corrected CBCT images in both Catphan and pelvis phantoms. Quantitatively, CT number error in selected regions of interest reduced from 377 in the kV-MV contaminated CBCT image to 38 for the Catphan phantom. Conclusions: The moving-blockerbased strategy can successfully correct MV and kV scatter simultaneously in CBCT projection data acquired with concurrent VMAT delivery. This work was supported in part by a grant from the Cancer Prevention and Research Institute of Texas (RP130109) and a grant from the American Cancer Society (RSG-13-326-01-CCE)

60 APPLIED LIFE SCIENCES↗

A physics-motivated Centroidal Voronoi Particle domain decomposition method

In this paper, we propose a novel domain decomposition method for large-scale simulations in continuum mechanics by merging the concepts of Centroidal Voronoi Tessellation (CVT) and Voronoi Particle dynamics (VP). The CVT is introduced to achieve a high-level compactness of the partitioning subdomains by the Lloyd algorithm which monotonically decreases the CVT energy. The number of computational elements between neighboring partitioning subdomains, which scales the communication effort for parallel simulations, is optimized implicitly as the generated partitioning subdomains are convex and simply connected with small aspect-ratios. Moreover, Voronoi Particle dynamics employing physical analogy with a tailored equation of state is developed, which relaxes the particle system towards the target partition with good load balance. Since the equilibrium is computed by an iterative approach, the partitioning subdomains exhibit locality and the incremental property. Numerical experiments reveal that the proposed Centroidal Voronoi Particle (CVP) based algorithm produces high-quality partitioning with high efficiency, independently of computational-element types. Thus it can be used for a wide range of applications in computational science and engineering.

97 MATHEMATICS AND COMPUTING↗

iCycle: Integrated, multicriterial beam angle, and profile optimization for generation of coplanar and noncoplanar IMRT plans

Purpose: To introduce iCycle, a novel algorithm for integrated, multicriterial optimization of beam angles, and intensity modulated radiotherapy (IMRT) profiles. Methods: A multicriterial plan optimization with iCycle is based on a prescription called wish-list, containing hard constraints and objectives with ascribed priorities. Priorities are ordinal parameters used for relative importance ranking of the objectives. The higher an objective priority is, the higher the probability that the corresponding objective will be met. Beam directions are selected from an input set of candidate directions. Input sets can be restricted, e.g., to allow only generation of coplanar plans, or to avoid collisions between patient/couch and the gantry in a noncoplanar setup. Obtaining clinically feasible calculation times was an important design criterium for development of iCycle. This could be realized by sequentially adding beams to the treatment plan in an iterative procedure. Each iteration loop starts with selection of the optimal direction to be added. Then, a Pareto-optimal IMRT plan is generated for the (fixed) beam setup that includes all so far selected directions, using a previously published algorithm for multicriterial optimization of fluence profiles for a fixed beam arrangement Breedveld et al.[Phys. Med. Biol. 54, 7199-7209 (2009)]. To select the next direction, each not yet selected candidate direction is temporarily added to the plan and an optimization problem, derived from the Lagrangian obtained from the just performed optimization for establishing the Pareto-optimal plan, is solved. For each patient, a single one-beam, two-beam, three-beam, etc. Pareto-optimal plan is generated until addition of beams does no longer result in significant plan quality improvement. Plan generation with iCycle is fully automated. Results: Performance and characteristics of iCycle are demonstrated by generating plans for a maxillary sinus case, a cervical cancer patient, and a liver patient treated with SBRT. Plans generated with beam angle optimization did better meet the clinical goals than equiangular or manually selected configurations. For the maxillary sinus and liver cases, significant improvements for noncoplanar setups were seen. The cervix case showed that also in IMRT with coplanar setups, beam angle optimization with iCycle may improve plan quality. Computation times for coplanar plans were around 1-2 h and for noncoplanar plans 4-7 h, depending on the number of beams and the complexity of the site. Conclusions: Integrated beam angle and profile optimization with iCycle may result in significant improvements in treatment plan quality. Due to automation, the plan generation workload is minimal. Clinical application has started.

62 RADIOLOGY AND NUCLEAR MEDICINE↗