Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Iterative”

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,621 records · Page 90
All sourcesNASA NTRSDOE OSTI
DOE OSTI2016

A Three-Phase Microgrid Restoration Model Considering Unbalanced Operation of Distributed Generation

Recent severe outages highlight the urgency of improving grid resiliency in the U.S. Microgrid formation schemes are proposed to restore critical loads after outages occur. Most distribution networks have unbalanced configurations that are not represented in sufficient detail by single-phase models. This study provides a microgrid formation plan that adopts a three-phase network model to represent unbalanced distribution networks. The problem formulation has a quadratic objective function with mixed-integer linear constraints. The three-phase network model enables us to examine the three-phase power outputs of distributed generators (DGs), preventing unbalanced operation that might trip DGs. Because the DG unbalanced operation constraint is non-convex, an iterative process is presented that checks whether the unbalanced operation limits for DGs are satisfied after each iteration of optimization. We also develop a relatively conservative linear approximation on the unbalanced operation constraint to handle larger networks. Compared with the iterative solution process, the conservative linear approximation is able to accelerate the solution process at the cost of sacrificing optimality to a limited extent. Simulation in the IEEE 34 node and IEEE 123 test feeders indicate that the proposed method yields more practical microgrid formations results. In addition, this paper explores the coordinated operation of DGs and energy storage (ES) installations. The unbalanced three-phase outputs of ESs combined with the relatively balanced outputs of DGs could supply unbalanced loads. In conclusion, the case study also validates the DG-ES coordination.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2019

Evaluating Optimization Strategies for Engine Simulations Using Machine Learning Emulators

This work evaluates different optimization algorithms for computational fluid dynamics (CFD) simulations of engine combustion. Due to the computational expense of CFD simulations, emulators built with machine learning algorithms were used as surrogates for the optimizers. Two types of emulators were used: a Gaussian process (GP) and a weighted variety of machine learning methods called SuperLearner (SL). The emulators were trained using a dataset of 2048 CFD simulations that were run concurrently on a supercomputer. The design of experiments (DOE) for the CFD runs was obtained by perturbing nine input parameters using a Monte-Carlo method. The CFD simulations were of a heavy duty engine running with a low octane gasoline-like fuel at a partially premixed compression ignition mode. Ten optimization algorithms were tested, including types typically used in research applications. Each optimizer was allowed 800 function evaluations and was randomly tested 100 times. The optimizers were evaluated for the median, minimum, and maximum merits obtained in the 100 attempts. Some optimizers required more sequential evaluations, thereby resulting in longer wall clock times to reach an optimum. The best performing optimization methods were particle swarm optimization (PSO), differential evolution (DE), GENOUD (an evolutionary algorithm), and micro-genetic algorithm (GA). These methods found a high median optimum as well as a reasonable minimum optimum of the 100 trials. Moreover, all of these methods were able to operate with less than 100 successive iterations, which reduced the wall clock time required in practice. Two methods were found to be effective but required a much larger number of successive iterations: the DIRECT and MALSCHAINS algorithms. A random search method that completed in a single iteration performed poorly in finding optimum designs but was included to illustrate the limitation of highly concurrent search methods. The last three methods, Nelder–Mead, bound optimization by quadratic approximation (BOBYQA), and constrained optimization by linear approximation (COBYLA), did not perform as well.

Probst, Daniel M.↗
DOE OSTI2022

Accelerated Deterministic Phonon Transport With Consistent Material Temperature and Intensities

Abstract We present a method for deterministically solving the frequency and temperature dependent phonon radiative transport (PRT) equation in the single-mode relaxation time (SMRT) approximation in the self-adjoint angular flux (SAAF) form. To handle the nonlinear coupling between the phonon intensities and the material temperature, we apply a linearization approach that is similar to one in thermal radiative transport. This procedure leads to the PRT equation with pseudo-scattering. The method presented includes acceleration of both the inner pseudo-scattering source iterations and outer temperature iteration with a gray diffusion synthetic acceleration (DSA) and Anderson acceleration, respectively. We use the finite-element method to discretize the PRT equation in space and the method of discrete ordinates (SN) for angular discretization. The proposed method is verified by a gray method of manufactured solutions problem and demonstrated on a problem using temperature and direction dependent multigroup data from lithium aluminate (LiAlO2). The iterative performance of the acceleration method in each test is then compared to the unaccelerated method.

Engineering↗
DOE OSTI2025

DESIGN ISSUES AND QUALIFICATION OF HYDROFORMED DOUBLE WALLED EXPANSION JOINTS IN VACUUM SERVICE

The Vacuum Auxiliary System for ITER is devoted to pumping out, venting, and purging the vacuum volumes of the tokamak. Over 5000 clients including the cryostat and vacuum vessel, at 8500 m3 and 1400 m3 respectively, are serviced by approximately 150 pumping stations through 6 km of pipework. The piping and functions provided to the clients include component operation, routing of potentially tritiated gases, and timely leak localization. Expansion joints are used to reduce loadings on pumps and piping stresses but also to qualify in-line components having low allowable design loads. The ITER project utilizes vacuum valves that are not designed to withstand typical piping system loadings and require detailed design and evaluation. Loading scenarios prescribed by governing system specifications must be considered. To maintain allowable design loads for components and to keep piping stresses below code requirements, double walled hydroformed expansion joints have been employed in the design. These are not standard items and require custom fabrication. Installation space constraints and adjacent pipe support attachment location availability at ITER limit standard expansion joint installation guidelines provided by the Expasion Joint Manufacturers Association (EJMA). Careful consideration must be given to the analysis model to ensure proper function and life expectancy of the component. These considerations include accurate accounting of thrust forces, thermal movements, seismic accelerations, equipment and building differential displacements. In addition to displacements, the process internal, external, and interspace pressures affect the qualification and selection of the double walled expansion joints. The calculation results shall confirm that deflections, forces, and moments are reasonable for the size and type required for the system’s demands as evaluated against the manufacturer’s design.

Clark, Forrest [ORNL] (ORCID:0009000678106843)↗
DOE OSTI2019

Multiresolution spatiotemporal mechanical model of the heart as a prior to constrain the solution for 4D models of the heart

In several nuclear cardiac imaging applications (SPECT and PET), images are formed by reconstructing tomographic data using an iterative reconstruction algorithm with corrections for physical factors involved in the imaging detection process and with corrections for cardiac and respiratory motion. The physical factors are modeled as coefficients in the matrix of a system of linear equations and include attenuation, scatter, and spatially varying geometric response. The solution to the tomographic problem involves solving the inverse of this system matrix. This requires the design of an iterative reconstruction algorithm with a statistical model that best fits the data acquisition. The most appropriate model is based on a Poisson distribution. Using Bayes Theorem, an iterative reconstruction algorithm is designed to determine the maximum a posteriori estimate of the reconstructed image with constraints that maximizes the Bayesian likelihood function for the Poisson statistical model. The a priori distribution is formulated as the joint entropy (JE) to measure the similarity between the gated cardiac PET image and the cardiac MRI cine image modeled as a FE mechanical model. In conclusion, the developed algorithm shows the potential of using a FE mechanical model of the heart derived from a cardiac MRI cine scan to constrain solutions of gated cardiac PET images.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2012

Quantitative cone-beam CT imaging in radiation therapy using planning CT as a prior: First patient studies

Purpose: Quantitative cone-beam CT (CBCT) imaging is on increasing demand for high-performance image guided radiation therapy (IGRT). However, the current CBCT has poor image qualities mainly due to scatter contamination. Its current clinical application is therefore limited to patient setup based on only bony structures. To improve CBCT imaging for quantitative use, we recently proposed a correction method using planning CT (pCT) as the prior knowledge. Promising phantom results have been obtained on a tabletop CBCT system, using a correction scheme with rigid registration and without iterations. More challenges arise in clinical implementations of our method, especially because patients have large organ deformation in different scans. In this paper, we propose an improved framework to extend our method from bench to bedside by including several new components. Methods: The basic principle of our correction algorithm is to estimate the primary signals of CBCT projections via forward projection on the pCT image, and then to obtain the low-frequency errors in CBCT raw projections by subtracting the estimated primary signals and low-pass filtering. We improve the algorithm by using deformable registration to minimize the geometry difference between the pCT and the CBCT images. Since the registration performance relies on the accuracy of the CBCT image, we design an optional iterative scheme to update the CBCT image used in the registration. Large correction errors result from the mismatched objects in the pCT and the CBCT scans. Another optional step of gas pocket and couch matching is added into the framework to reduce these effects. Results: The proposed method is evaluated on four prostate patients, of which two cases are presented in detail to investigate the method performance for a large variety of patient geometry in clinical practice. The first patient has small anatomical changes from the planning to the treatment room. Our algorithm works well even without the optional iterations and the gas pocket and couch matching. The image correction on the second patient is more challenging due to the effects of gas pockets and attenuating couch. The improved framework with all new components is used to fully evaluate the correction performance. The enhanced image quality has been evaluated using mean CT number and spatial nonuniformity (SNU) error as well as contrast improvement factor. If the pCT image is considered as the ground truth, on the four patients, the overall mean CT number error is reduced from over 300 HU to below 16 HU in the selected regions of interest (ROIs), and the SNU error is suppressed from over 18% to below 2%. The average soft-tissue contrast is improved by an average factor of 2.6. Conclusions: We further improve our pCT-based CBCT correction algorithm for clinical use. Superior correction performance has been demonstrated on four patient studies. By providing quantitative CBCT images, our approach significantly increases the accuracy of advanced CBCT-based clinical applications for IGRT.

62 RADIOLOGY AND NUCLEAR MEDICINE↗
DOE OSTI2014

Beam geometry selection using sequential beam addition

Purpose: The selection of optimal beam geometry has been of interest since the inception of conformal radiotherapy. The authors report on sequential beam addition, a simple beam geometry selection method, for intensity modulated radiation therapy. Methods: The sequential beam addition algorithm (SBA) requires definition of an objective function (score) and a set of candidate beam geometries (pool). In the first iteration, the optimal score is determined for each beam in the pool and the beam with the best score selected. In the next iteration, the optimal score is calculated for each beam remaining in the pool combined with the beam selected in the first iteration, and the best scoring beam is selected. The process is repeated until the desired number of beams is reached. The authors selected three treatment sites, breast, lung, and brain, and determined beam arrangements for up to 11 beams from a pool comprised of 25 equiangular transverse beams. For the brain, arrangements were additionally selected from a pool of 22 noncoplanar beams. Scores were determined for geometries comprised equiangular transverse beams (EQA), as well as two tangential beams for the breast case. Results: In all cases, SBA resulted in scores superior to EQA. The breast case had the strongest dependence on beam geometry, for which only the 7-beam EQA geometry had a score better than the two tangential beams, whereas all SBA geometries with more than two beams were superior. In the lung case, EQA and SBA scores monotonically improved with increasing number of beams; however, SBA required fewer beams to achieve scores equivalent to EQA. For the brain case, SBA with a coplanar pool was equivalent to EQA, while the noncoplanar pool resulted in slightly better scores; however, the dose-volume histograms demonstrated that the differences were not clinically significant. Conclusions: For situations in which beam geometry has a significant effect on the objective function, SBA can identify arrangements equivalent to equiangular geometries but using fewer beams. Furthermore, SBA provides the value of the objective function as the number of beams is increased, allowing the planner to select the minimal beam number that achieves the clinical goals. The method is simple to implement and could readily be incorporated into an existing optimization system.

62 RADIOLOGY AND NUCLEAR MEDICINE↗
DOE OSTI2015

Improved image quality in pinhole SPECT by accurate modeling of the point spread function in low magnification systems

Purpose: Single photon emission computed tomography (SPECT) has become an important noninvasive imaging technique in small-animal research. Due to the high resolution required in small-animal SPECT systems, the spatially variant system response needs to be included in the reconstruction algorithm. Accurate modeling of the system response should result in a major improvement in the quality of reconstructed images. The aim of this study was to quantitatively assess the impact that an accurate modeling of spatially variant collimator/detector response has on image-quality parameters, using a low magnification SPECT system equipped with a pinhole collimator and a small gamma camera. Methods: Three methods were used to model the point spread function (PSF). For the first, only the geometrical pinhole aperture was included in the PSF. For the second, the septal penetration through the pinhole collimator was added. In the third method, the measured intrinsic detector response was incorporated. Tomographic spatial resolution was evaluated and contrast, recovery coefficients, contrast-to-noise ratio, and noise were quantified using a custom-built NEMA NU 4–2008 image-quality phantom. Results: A high correlation was found between the experimental data corresponding to intrinsic detector response and the fitted values obtained by means of an asymmetric Gaussian distribution. For all PSF models, resolution improved as the distance from the point source to the center of the field of view increased and when the acquisition radius diminished. An improvement of resolution was observed after a minimum of five iterations when the PSF modeling included more corrections. Contrast, recovery coefficients, and contrast-to-noise ratio were better for the same level of noise in the image when more accurate models were included. Ring-type artifacts were observed when the number of iterations exceeded 12. Conclusions: Accurate modeling of the PSF improves resolution, contrast, and recovery coefficients in the reconstructed images. To avoid the appearance of ring-type artifacts, the number of iterations should be limited. In low magnification systems, the intrinsic detector PSF plays a major role in improvement of the image-quality parameters.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2015

SU-E-J-130: Automating Liver Segmentation Via Combined Global and Local Optimization

Purpose: The aim of this work is to develop a robust algorithm for accurate segmentation of liver with special attention paid to the problems with fuzzy edges and tumor. Methods: 200 CT images were collected from radiotherapy treatment planning system. 150 datasets are selected as the panel data for shape dictionary and parameters estimation. The remaining 50 datasets were used as test images. In our study liver segmentation was formulated as optimization process of implicit function. The liver region was optimized via local and global optimization during iterations. Our method consists five steps: 1)The livers from the panel data were segmented manually by physicians, and then We estimated the parameters of GMM (Gaussian mixture model) and MRF (Markov random field). Shape dictionary was built by utilizing the 3D liver shapes. 2)The outlines of chest and abdomen were located according to rib structure in the input images, and the liver region was initialized based on GMM. 3)The liver shape for each 2D slice was adjusted using MRF within the neighborhood of liver edge for local optimization. 4)The 3D liver shape was corrected by employing SSR (sparse shape representation) based on liver shape dictionary for global optimization. Furthermore, H-PSO(Hybrid Particle Swarm Optimization) was employed to solve the SSR equation. 5)The corrected 3D liver was divided into 2D slices as input data of the third step. The iteration was repeated within the local optimization and global optimization until it satisfied the suspension conditions (maximum iterations and changing rate). Results: The experiments indicated that our method performed well even for the CT images with fuzzy edge and tumors. Comparing with physician delineated results, the segmentation accuracy with the 50 test datasets (VOE, volume overlap percentage) was on average 91%–95%. Conclusion: The proposed automatic segmentation method provides a sensible technique for segmentation of CT images. This work is supported by NIH/NIBIB (1R01-EB016777), National Natural Science Foundation of China (No.61471226 and No.61201441), Research funding from Shandong Province (No.BS2012DX038 and No.J12LN23), and Research funding from Jinan City (No.201401221 and No.20120109)

60 APPLIED LIFE SCIENCES↗
DOE OSTI2015

SU-E-T-270: Diffusion Synthetic Acceleration for Linear Boltzmann Transport Equation

Purpose: Linear Boltzmann transport equation (LBTE) is as accurate as the Monte Carlo method (MC) for dose calculation in photon/particle therapy (LBTE is a deterministic and Eulerian formulation and MC is a statistical and Lagrangian description). An advantage of LBTE is that numerous acceleration techniques can be utilized for acceleration. This work is to explore the acceleration of LBTE via diffusion synthetic acceleration (DSA). Methods: For simplicity, two-dimensional, steady-state, and within-group LBTE is considered with two angular dimensions and two spatial dimensions. The discrete ordinate method is developed for solving this integro-differential equation. The angular variables are discretized using a level-symmetric quadrature set on the unit sphere. The spatial variables are discretized on the structured grid based on the diamond scheme. The source-iteration method (SI) is used to solve the discretized system.Since SI is slow in optically thick and highly scattering regime. DSA is developed to accelerate SI. The motivation for DSA is that diffusion equation (DE) is a good approximation of LBTE in the above regime. However, DE is much cheaper than LBTE computationally since DE only involves spatial variables. Thus, in each DSA iteration, DSA adds to the SI step a computationally-negligible DE step, i.e., to first solve DE with the SI residual as source term, and then compensate the SI solution with DE solution. Results: DSA was benchmarked and compared with SI. The difference between two methods was within 0.12% which verifies the accuracy of DSA, while DSA demonstrated the great advantage in speed, e.g., the reduction of iteration number to 6% and 4% respectively for cases with 100 and 1,000 scattering-absorption ratio that commonly occur in clinical dose calculation. Conclusion: DSA has been developed as one of many possible means for accelerating the numerical solver of LBTE for dose calculation. The authors were partially supported by the NSFC (#11405105), the 973 Program (#2015CB856000) and the Shanghai Pujiang Talent Program (#14PJ1404500)

60 APPLIED LIFE SCIENCES↗
DOE OSTI2016

SU-F-I-08: CT Image Ring Artifact Reduction Based On Prior Image

Purpose: In computed tomography (CT) system, CT images with ring artifacts will be reconstructed when some adjacent bins of detector don’t work. The ring artifacts severely degrade CT image quality. We present a useful CT ring artifacts reduction based on projection data correction, aiming at estimating the missing data of projection data accurately, thus removing the ring artifacts of CT images. Methods: The method consists of ten steps: 1) Identification of abnormal pixel line in projection sinogram; 2) Linear interpolation within the pixel line of projection sinogram; 3) FBP reconstruction using interpolated projection data; 4) Filtering FBP image using mean filter; 5) Forwarding projection of filtered FBP image; 6) Subtraction forwarded projection from original projection; 7) Linear interpolation of abnormal pixel line area in the subtraction projection; 8) Adding the interpolated subtraction projection on the forwarded projection; 9) FBP reconstruction using corrected projection data; 10) Return to step 4 until the pre-set iteration number is reached. The method is validated on simulated and real data to restore missing projection data and reconstruct ring artifact-free CT images. Results: We have studied impact of amount of dead bins of CT detector on the accuracy of missing data estimation in projection sinogram. For the simulated case with a resolution of 256 by 256 Shepp-Logan phantom, three iterations are sufficient to restore projection data and reconstruct ring artifact-free images when the dead bins rating is under 30%. The dead-bin-induced artifacts are substantially reduced. More iteration number is needed to reconstruct satisfactory images while the rating of dead bins increases. Similar results were found for a real head phantom case. Conclusion: A practical CT image ring artifact correction scheme based on projection data is developed. This method can produce ring artifact-free CT images feasibly and effectively.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2016

Optimization of rotational arc station parameter optimized radiation therapy

Purpose: To develop a fast optimization method for station parameter optimized radiation therapy (SPORT) and show that SPORT is capable of matching VMAT in both plan quality and delivery efficiency by using three clinical cases of different disease sites. Methods: The angular space from 0° to 360° was divided into 180 station points (SPs). A candidate aperture was assigned to each of the SPs based on the calculation results using a column generation algorithm. The weights of the apertures were then obtained by optimizing the objective function using a state-of-the-art GPU based proximal operator graph solver. To avoid being trapped in a local minimum in beamlet-based aperture selection using the gradient descent algorithm, a stochastic gradient descent was employed here. Apertures with zero or low weight were thrown out. To find out whether there was room to further improve the plan by adding more apertures or SPs, the authors repeated the above procedure with consideration of the existing dose distribution from the last iteration. At the end of the second iteration, the weights of all the apertures were reoptimized, including those of the first iteration. The above procedure was repeated until the plan could not be improved any further. The optimization technique was assessed by using three clinical cases (prostate, head and neck, and brain) with the results compared to that obtained using conventional VMAT in terms of dosimetric properties, treatment time, and total MU. Results: Marked dosimetric quality improvement was demonstrated in the SPORT plans for all three studied cases. For the prostate case, the volume of the 50% prescription dose was decreased by 22% for the rectum and 6% for the bladder. For the head and neck case, SPORT improved the mean dose for the left and right parotids by 15% each. The maximum dose was lowered from 72.7 to 71.7 Gy for the mandible, and from 30.7 to 27.3 Gy for the spinal cord. The mean dose for the pharynx and larynx was reduced by 8% and 6%, respectively. For the brain case, the doses to the eyes, chiasm, and inner ears were all improved. SPORT shortened the treatment time by ∼1 min for the prostate case, ∼0.5 min for brain case, and ∼0.2 min for the head and neck case. Conclusions: The dosimetric quality and delivery efficiency presented here indicate that SPORT is an intriguing alternative treatment modality. With the widespread adoption of digital linac, SPORT should lead to improved patient care in the future.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2018

Ensemble Grouping Strategies for Embedded Stochastic Collocation Methods Applied to Anisotropic Diffusion Problems

Previous work has demonstrated that propagating groups of samples, called ensembles, together through forward simulations can dramatically reduce the aggregate cost of sampling-based uncertainty propagation methods [E. Phipps, M. D'Elia, H. C. Edwards, M. Hoemmen, J. Hu, and S. Rajamanickam, SIAM J. Sci. Comput., 39 (2017), pp. C162--C193]. However, critical to the success of this approach when applied to challenging problems of scientific interest is the grouping of samples into ensembles to minimize the total computational work. For example, the total number of linear solver iterations for ensemble systems may be strongly influenced by which samples form the ensemble when applying iterative linear solvers to parameterized and stochastic linear systems. In this paper we explore sample grouping strategies for local adaptive stochastic collocation methods applied to PDEs with uncertain input data, in particular canonical anisotropic diffusion problems where the diffusion coefficient is modeled by truncated Karhunen--Loève expansions. Finally, we demonstrate that a measure of the total anisotropy of the diffusion coefficient is a good surrogate for the number of linear solver iterations for each sample and therefore provides a simple and effective metric for grouping samples.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Structure- and Physics-Preserving Reductions of Power Grid Models

The large size of multiscale, distribution and transmission, power grids hinders fast systemwide estimation and real-time control and optimization of operations. This paper studies graph reduction methods of power grids that are favorable for fast simulations and follow-up applications. While the classical Kron reduction has been successful in reduced order modeling of power grids with traditional, hierarchical design, the selection of reference nodes for the reduced model in a multiscale, distribution and transmission, network becomes ambiguous. In this work we extend the use of the iterative Kron reduction by utilizing the electric grid's graph topology for the selection of reference nodes, consistent with the design features of multiscale networks. Additionally, we propose further reductions by aggregation of coherent subnetworks of triangular meshes, based on the graph topology and network characteristics, in order to preserve currents and build another power-flow equivalent network. Our reductions are achieved through the use of iterative aggregation of subgraphs that include general tree structures, lines, and triangles. Important features of our reduction algorithms include that (i) the reductions are either equivalent to the Kron reduction or otherwise produce a power-flow equivalent network; (ii) due to the mentioned power-flow equivalence, the reduced network can model the dynamic of the swing equations for a lossless, inductive, steady state network; (iii) the algorithms efficiently utilize hash tables to store the sequential reduction steps. The third feature allows for easy reintroduction of detailed models into the reduced, conceptual network and makes the final reduced order model backward compatible with a sequence of intermediate, partially reduced networks with varying resolution---the ordered sequence of iterative reductions corresponds to a sequence of reduced order models. The performance of our graph reduction algorithms and features of the reduced grids are discussed on a real-word transmission and distribution grid. We produce visualizations of the reduced models through open source libraries and release our reduction algorithms with example code and toy data.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2019

An Efficient Parallel-in-Time Method for Optimization with Parabolic PDEs

To solve optimization problems with parabolic PDE constraints, often methods working on the reduced objective functional are used. They are computationally expensive due to the necessity of solving both the state equation and a backward-in-time adjoint equation to evaluate the reduced gradient in each iteration of the optimization method. In this study, we investigate the use of the parallel-in-time method PFASST in the setting of PDE-constrained optimization. In order to develop an efficient fully time-parallel algorithm, we discuss different options for applying PFASST to adjoint gradient computation, including the possibility of doing PFASST iterations on both the state and the adjoint equations simultaneously. Here, we also explore the additional gains in efficiency from reusing information from previous optimization iterations when solving each equation. Numerical results for both a linear and a nonlinear reaction-diffusion optimal control problem demonstrate the parallel speedup and efficiency of different approaches.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Stochastic Trust-Region Algorithm in Random Subspaces with Convergence and Expected Complexity Analyses

Here, this work proposes a framework for large-scale stochastic derivative-free optimization (DFO) by introducing STARS, a trust-region method based on iterative minimization in random subspaces. This framework is both an algorithmic and theoretical extension of a random subspace derivative-free optimization (RSDFO) framework, and an algorithm for stochastic optimization with random models (STORM). Moreover, like RSDFO, STARS achieves scalability by minimizing interpolation models that approximate the objective in low-dimensional affine subspaces, thus significantly reducing per-iteration costs in terms of function evaluations and yielding strong performance on largescale stochastic DFO problems. The user-determined dimension of these subspaces, when the latter are defined, for example, by the columns of so-called Johnson-Lindenstrauss transforms, turns out to be independent of the dimension of the problem. For convergence purposes, inspired by the analyses of RSDFO and STORM, both a particular quality of the subspace and the accuracies of random function estimates and models are required to hold with sufficiently high, but fixed, probabilities. Using martingale theory under the latter assumptions, an almost sure global convergence of STARS to a first-order stationary point is shown, and the expected number of iterations required to reach a desired first-order accuracy is proved to be similar to that of STORM and other stochastic DFO algorithms, up to constants.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Convergence Analysis of the Alternating Anderson–Picard Method for Nonlinear Fixed-Point Problems

Anderson acceleration (AA) has been widely used to solve nonlinear fixed-point problems due to its rapid convergence. This work focuses on a variant of AA in which multiple Picard iterations are performed between each AA step, referred to as the Alternating Anderson–Picard (AAP) method. Furthermore, despite introducing more “slow” Picard iterations, this method has been shown to be efficient and even more robust in both linear and nonlinear cases. However, there is a lack of theoretical analysis for AAP in the nonlinear case. In this paper, we address this gap by establishing the equivalence between AAP and a multisecant-GMRES method that uses GMRES to solve a multisecant linear system at each iteration. From this perspective, we show that AAP “converges” to the Newton-GMRES method. Specifically, as the residual approaches zero, the multisecant matrix, the approximate Jacobian inverse, the search direction, and the optimization gain of AAP converge to their counterparts in the Newton-GMRES method. These connections provide insights for analyzing the asymptotic convergence properties of AAP. Consequently, we show that AAP is locally 𝑞-linear convergent and provide an upper bound for the convergence factor of AAP. To validate the theoretical results, numerical examples are provided.

Anderson acceleration↗
DOE OSTI2018

Parallel Ellipsoidal Perfectly Matched Layers for Acoustic Helmholtz Problems on Exterior Domains

Exterior acoustic problems occur in a wide range of applications, making the finite element analysis of such problems a common practice in the engineering community. Various methods for truncating infinite exterior domains have been developed, including absorbing boundary conditions, infinite elements, and more recently, perfectly matched layers (PML). PML are gaining popularity due to their generality, ease of implementation, and effectiveness as an absorbing boundary condition. PML formulations have been developed in Cartesian, cylindrical, and spherical geometries, but not ellipsoidal. In addition, the parallel solution of PML formulations with iterative solvers for the solution of the Helmholtz equation, and how this compares with more traditional strategies such as infinite elements, has not been adequately investigated. In this study, we present a parallel, ellipsoidal PML formulation for acoustic Helmholtz problems. To faciliate the meshing process, the ellipsoidal PML layer is generated with an on-the-fly mesh extrusion. Though the complex stretching is defined along ellipsoidal contours, we modify the Jacobian to include an additional mapping back to Cartesian coordinates in the weak formulation of the finite element equations. This allows the equations to be solved in Cartesian coordinates, which is more compatible with existing finite element software, but without the necessity of dealing with corners in the PML formulation. Herein we also compare the conditioning and performance of the PML Helmholtz problem with infinite element approach that is based on high order basis functions. On a set of representative exterior acoustic examples, we show that high order infinite element basis functions lead to an increasing number of Helmholtz solver iterations, whereas for PML the number of iterations remains constant for the same level of accuracy. Finally, this provides an additional advantage of PML over the infinite element approach.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗