Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “algorithms optimization”

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 865 records · Page 48

Energetic Potential for Demand Response in Detached Single Family Homes in Austin, TX

This study builds a generalized tool to quantify the maximum peak load reduction achievable with residential demand response and distributed energy resources (DERs). The tool is demonstrated by using empirical energy usage data from detached single family households within the service territory of Austin Energy - the local municipal utility in Austin, TX. The demand response optimization algorithm shifts energy usage of four controllable, high-consumption residential devices to off-peak hours: HVAC (heating, ventilation, and air conditioning) systems, electric water heaters, electric vehicles, and pool pumps. In addition, rooftop solar generation on individual residences is considered to reduce net load to the utility, and an energy storage system optimization model performing energy arbitrage further reduces peak demand. Results from the aggregate demand response and battery optimization study indicate that peak demand for the 2017 summer peak in Austin Energy could have been reduced by 26 MW or 2.9%. Here, by considering the combined effect of controllable consumer loads, solar generation, and energy storage systems, this study highlights the potential of strategic demand response and energy arbitrage to reduce peak demand at the distribution level.

14 SOLAR ENERGY↗

Development of Building Design Optimization Methodology: Residential Building Applications

Building design optimization is a highly complex problem, requiring long computational running processes because of the many options that exist when a building is being designed. This paper introduces an integrated approach through which to perform this optimization within an acceptable time frame. The approach includes the methods of variable selection, model simplification, and a sequential optimization process. Using singular value decomposition, a large number of design variables is reduced to a smaller subset that can be solved more quickly through the optimization algorithm. To expedite the variable selection process, a modeling approach that quickly simulates annual energy consumption was developed to replace full annual energy simulations. The developed methodology was applied to two residential buildings in the US, and the results are discussed herein. To assess the accuracy of the integrated optimization methodology, the optimized life cycle costs are compaa variables demonstrating the strongest contributions in the optimization study were identified. The proposed methodology significantly shortened the time requirements for the optimization processes of the two case studies by 74% and 84%; the optimized life cycle costs were within 0.05% and 0.06%, respectively, of the optimum point.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

SU-E-T-185: Feasibility Study of Dose Rate Modulated Arc Therapy (DrMAT) for Lung SBRT

Purpose: To show the feasibility of clinical application of DrMAT for SBRT in lung cancer patients. DrMAT is a form of dynamic conformal arc therapy where MLC segments and dose rates are controlled through simple field weight optimization. Methods: To show feasibility a new treatment plan was created based on the CT of SBRT lung cancer patients. Static plans with 33 fields are made, which have 11deg in between each field and are acquired rotating gantry angle from 180deg to 188deg in CCW direction, total 352deg is rotated. MLC maintained static aperture for each field. To optimize 33 individual fields, field weight was adjusted accordingly using weight optimization algorithm. Keeping weights and MU of static plan, static MLC aperture was converted to multiple arc segments. Arc plan could be created with the fields in the intervals of 11deg. Static MLC should be converted to arc segment MLC. Dynamic conformal arc therapy plan consists of 33 arc fields, is converted to one dose rate modulated arc therapy (DrMAT) plan. DrMAT plan consists of 166 control points which becomes a single arc plan that changes the shape of MLC for every 2.2deg. The resulting DrMAT plan is not an inverse plan it is a simple form of dynamic conformal arc plan using field weight obtained from static plan. This is compared and evaluated with the VMAT plan. Results: DrMAT and VMAT plans have been compared based on the RTOG1021. Both DrMAT and VMAT plans satisfy 100% irradiation to 95% of PTV and critical organs did not exceed dose limit suggested in RTOG1021. DrMAT plan is almost similar with VMAT plan in Result. Conclusion: Field weight optimization method did not show better Resultcompared to VMAT optimization. However, considering simplicity, DrMAT satisfies the condition in RTOG1021. Therefore clinical application of DrMAT is feasible.

60 APPLIED LIFE SCIENCES↗

Cascade Optimization Strategy Maximizes Thrust for High-Speed Civil Transport Propulsion System Concept

The design of a High-Speed Civil Transport (HSCT) air-breathing propulsion system for multimission, variable-cycle operations was successfully optimized through a soft coupling of the engine performance analyzer NASA Engine Performance Program (NEPP) to a multidisciplinary optimization tool COMETBOARDS that was developed at the NASA Lewis Research Center. The design optimization of this engine was cast as a nonlinear optimization problem, with engine thrust as the merit function and the bypass ratios, r-values of fans, fuel flow, and other factors as important active design variables. Constraints were specified on factors including the maximum speed of the compressors, the positive surge margins for the compressors with specified safety factors, the discharge temperature, the pressure ratios, and the mixer extreme Mach number. Solving the problem by using the most reliable optimization algorithm available in COMETBOARDS would provide feasible optimum results only for a portion of the aircraft flight regime because of the large number of mission points (defined by altitudes, Mach numbers, flow rates, and other factors), diverse constraint types, and overall poor conditioning of the design space. Only the cascade optimization strategy of COMETBOARDS, which was devised especially for difficult multidisciplinary applications, could successfully solve a number of engine design problems for their flight regimes. Furthermore, the cascade strategy converged to the same global optimum solution even when it was initiated from different design points. Multiple optimizers in a specified sequence, pseudorandom damping, and reduction of the design space distortion via a global scaling scheme are some of the key features of the cascade strategy. HSCT engine concept, optimized solution for HSCT engine concept. A COMETBOARDS solution for an HSCT engine (Mach-2.4 mixed-flow turbofan) along with its configuration is shown. The optimum thrust is normalized with respect to NEPP results. COMETBOARDS added value in the design optimization of the HSCT engine.

Source record↗

Geometry Optimization of Cable-Based Actuation for Small-Scale Model Testing of a Floating Marine Turbine: Preprint

This research aims to apply combined wave and tidal current loads to a small-scale floating marine current turbine in a wave tank, where an actuation system applies hydrodynamic and mooring forces on the hardware based on results from a simulation. We use a real-time hybrid test setup with physical wave forcing from the wave tank and simulated current and mooring forces implemented through a tensioned cable array. For this paper, we developed an optimization algorithm that adjusts the hardware geometry of the cable array to achieve more efficient tension allocation across the cables for the loads that need to be actuated. By adjusting the points where the cables are attached to the floating platform and the angles between the platform and the winches, an optimal cable geometry can be found to minimize tension variations in the lines, maintain the desired pretension, and prevent excessive tensions. We present the optimization problem formulation, the actuation system evaluation approach, and optimization results that show effective cable actuation setups that are being considered for implementation in the wave tank tests.

cable-based actuation↗

A Parallel Trade Study Architecture for Design Optimization of Complex Systems

Design of a successful product requires evaluating many design alternatives in a limited design cycle time. This can be achieved through leveraging design space exploration tools and available computing resources on the network. This paper presents a parallel trade study architecture to integrate trade study clients and computing resources on a network using Web services. The parallel trade study solution is demonstrated to accelerate design of experiments, genetic algorithm optimization, and a cost as an independent variable (CAIV) study for a space system application.

Kim, Hongman↗

Reentry-Vehicle Shape Optimization Using a Cartesian Adjoint Method and CAD Geometry

A DJOINT solutions of the governing flow equations are becoming increasingly important for the development of efficient analysis and optimization algorithms. A well-known use of the adjoint method is gradient-based shape. Given an objective function that defines some measure of performance, such as the lift and drag functionals, its gradient is computed at a cost that is essentially independent of the number of design variables (e.g., geometric parameters that control the shape). Classic aerodynamic applications of gradient-based optimization include the design of cruise configurations for transonic and supersonic flow, as well as the design of high-lift systems. are perhaps the most promising approach for addressing the issues of flow solution automation for aerodynamic design problems. In these methods, the discretization of the wetted surface is decoupled from that of the volume mesh. This not only enables fast and robust mesh generation for geometry of arbitrary complexity, but also facilitates access to geometry modeling and manipulation using parametric computer-aided design (CAD). In previous work on Cartesian adjoint solvers, Melvin et al. developed an adjoint formulation for the TRANAIR code, which is based on the full-potential equation with viscous corrections. More recently, Dadone and Grossman presented an adjoint formulation for the two-dimensional Euler equations using a ghost-cell method to enforce the wall boundary conditions. In Refs. 18 and 19, we presented an accurate and efficient algorithm for the solution of the adjoint Euler equations discretized on Cartesian meshes with embedded, cut-cell boundaries. Novel aspects of the algorithm were the computation of surface shape sensitivities for triangulations based on parametric-CAD models and the linearization of the coupling between the surface triangulation and the cut-cells. The accuracy of the gradient computation was verified using several three-dimensional test cases, which included design variables such as the free stream parameters and the planform shape of an isolated wing. The objective of the present work is to extend our adjoint formulation to problems involving general shape changes. Factors under consideration include the computation of mesh sensitivities that provide a reliable approximation of the objective function gradient, as well as the computation of surface shape sensitivities based on a direct-CAD interface. We present detailed gradient verification studies and then focus on a shape optimization problem for an Apollo-like reentry vehicle. The goal of the optimization is to enhance the lift-to-drag ratio of the capsule by modifying the shape of its heat-shield in conjunction with a center-of-gravity (c.g.) offset. This multipoint and multi-objective optimization problem is used to demonstrate the overall effectiveness of the Cartesian adjoint method for addressing the issues of complex aerodynamic design.

Nemec, Marian↗

Clustering of electromagnetic showers and particle interactions with graph neural networks in liquid argon time projection chambers

Liquid argon time projection chambers (LArTPCs) are a class of detectors that produce high resolution images of charged particles within their sensitive volume. In these images, the clustering of distinct particles into superstructures is of central importance to the current and future neutrino physics program. Electromagnetic (EM) activity typically exhibits spatially detached fragments of varying morphology and orientation that are challenging to efficiently assemble using traditional algorithms. Similarly, particles that are spatially removed from each other in the detector may originate from a common interaction. Graph neural networks (GNNs) were developed in recent years to find correlations between objects embedded in an arbitrary space. The graph particle aggregator (GrapPA) first leverages GNNs to predict the adjacency matrix of EM shower fragments and to identify the origin of showers, i.e., primary fragments. On the PILArNet public LArTPC simulation dataset, the algorithm achieves a shower clustering accuracy characterized by a mean purity of 99.4%, a mean efficiency of 99.6% and a primary identification accuracy of 99.8%. It yields a relative shower energy uncertainty of (4.1 + 1.4 / $\sqrt{\text{E(GeV)})}$% and a shower direction uncertainty of (2.1/ $\sqrt{\text{E(GeV)})}$°. Finally, the optimized algorithm is then applied to the related task of clustering particle instances into interactions and yields a mean purity of 99.8% and a mean efficiency of 99.5% for an interaction density of $\mathcal{O}(1)$ m –3 .

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Efficient generation of grids and traversal graphs in compositional spaces towards exploration and path planning

Abstract Diverse disciplines across science and engineering deal with problems related to compositions, which exist in non-Euclidean simplex spaces, rendering many standard tools inaccurate or inefficient. This work explores such spaces conceptually in the context of materials discovery, quantifies their computational feasibility, and implements several essential methods specific to simplex spaces through a new high-performance open-source library . Most significantly, we derive and implement an algorithm for constructing a novel n-dimensional simplex graph data structure, containing all discretized compositions and possible neighbor-to-neighbor transitions. Critically, no distance or neighborhood calculations are performed, instead leveraging pure combinatorics and order in procedurally generated simplex grids, keeping the algorithm $${\mathcal{O}}(N)$$ O ( N ) , with minimal memory, enabling rapid construction of graphs with billions of transitions in seconds. Additionally, we demonstrate how such graph representations can be combined to homogeneously express complex path-planning problems, while facilitating efficient deployment of existing high-performance gradient descent, graph traversal, and other optimization algorithms.

Krajewski, Adam M. (ORCID:0000000222660099)↗

Effective optimization of atomic decoration in giant and superstructurally ordered crystals with machine learning

Crystals with complicated geometry are often observed with mixed chemical occupancy among Wyckoff sites, presenting a unique challenge for accurate atomic modeling. Similar systems possessing exact occupancy on all the sites can exhibit superstructural ordering, dramatically inflating the unit cell size. In this work, a crystal graph convolutional neural network (CGCNN) is used to predict optimal atomic decorations on fixed crystalline geometries. This is achieved with a site permutation search (SPS) optimization algorithm based on Monte Carlo moves combined with simulated annealing and basin-hopping techniques. Our approach relies on the evidence that, for a given chemical composition, a CGCNN estimates the correct energetic ordering of different atomic decorations, as predicted by electronic structure calculations. This provides a suitable energy landscape that can be optimized according to site occupation, allowing the prediction of chemical decoration in crystals exhibiting mixed or disordered occupancy, or superstructural ordering. Verification of the procedure is carried out on several known compounds, including the superstructurally ordered clathrate compound Rb8Ga27Sb16 and vacancy-ordered perovskite Cs2SnI6, neither of which was previously seen during the neural network training. In addition, the critical temperature of an order–disorder phase transition in solid solution CuZn is probed with our SPS routines by sampling site configuration trajectories in the canonical ensemble. This strategy provides an accurate method for determining favorable decoration in complex crystals and analyzing site occupation at unprecedented speed and scale.

Chemistry↗

Plant Reload Optimization (prlo)

The PRLO framework is built on a modular and extensible architecture that tightly couples advanced evolutionary optimization algorithms with nuclear fuel depletion solvers (i.e., nuclear physics neutronics code). It supports exploring complex, high-dimensional design spaces constrained by user-specified operational, safety, and economic constraints. Objectives such as minimizing fresh fuel enrichment, flattening radial and axial power distributions, and maximizing discharge burnup are evaluated. PRLO’s equilibrium cycle optimization capability enables the identification of core configurations that maintain fuel cycle sustainability over extended planning horizons. Its integration with the RAVEN platform facilitates optimization of loading patterns or fuel shuffling schemes across multiple cycles. The interface with SIMULATE, a licensed industry-standard nodal code developed by Studsvik, ensures accurate neutronic and thermal-hydraulic feedback for reactor core design. PRLO’s automated workflow engine supports iterative design refinement, enabling utilities to streamline core design processes and meet evolving performance and regulatory targets.

Kim, Junyung [Idaho National Laboratory] (00090005↗

Optimization of residual stresses in MMC's through the variation of interfacial layer architectures and processing parameters

The objective of this work was the development of efficient, user-friendly computer codes for optimizing fabrication-induced residual stresses in metal matrix composites through the use of homogeneous and heterogeneous interfacial layer architectures and processing parameter variation. To satisfy this objective, three major computer codes have been developed and delivered to the NASA-Lewis Research Center, namely MCCM, OPTCOMP, and OPTCOMP2. MCCM is a general research-oriented code for investigating the effects of microstructural details, such as layered morphology of SCS-6 SiC fibers and multiple homogeneous interfacial layers, on the inelastic response of unidirectional metal matrix composites under axisymmetric thermomechanical loading. OPTCOMP and OPTCOMP2 combine the major analysis module resident in MCCM with a commercially-available optimization algorithm and are driven by user-friendly interfaces which facilitate input data construction and program execution. OPTCOMP enables the user to identify those dimensions, geometric arrangements and thermoelastoplastic properties of homogeneous interfacial layers that minimize thermal residual stresses for the specified set of constraints. OPTCOMP2 provides additional flexibility in the residual stress optimization through variation of the processing parameters (time, temperature, external pressure and axial load) as well as the microstructure of the interfacial region which is treated as a heterogeneous two-phase composite. Overviews of the capabilities of these codes are provided together with a summary of results that addresses the effects of various microstructural details of the fiber, interfacial layers and matrix region on the optimization of fabrication-induced residual stresses in metal matrix composites.

Pindera, Marek-Jerzy↗

Accelerated Training for Large Feedforward Neural Networks

In this paper we introduce a new training algorithm, the scaled variable metric (SVM) method. Our approach attempts to increase the convergence rate of the modified variable metric method. It is also combined with the RBackprop algorithm, which computes the product of the matrix of second derivatives (Hessian) with an arbitrary vector. The RBackprop method allows us to avoid computationally expensive, direct line searches. In addition, it can be utilized in the new, 'predictive' updating technique of the inverse Hessian approximation. We have used directional slope testing to adjust the step size and found that this strategy works exceptionally well in conjunction with the Rbackprop algorithm. Some supplementary, but nevertheless important enhancements to the basic training scheme such as improved setting of a scaling factor for the variable metric update and computationally more efficient procedure for updating the inverse Hessian approximation are presented as well. We summarize by comparing the SVM method with four first- and second- order optimization algorithms including a very effective implementation of the Levenberg-Marquardt method. Our tests indicate promising computational speed gains of the new training technique, particularly for large feedforward networks, i.e., for problems where the training process may be the most laborious.

Stepniewski, Slawomir W.↗

Thermodynamics of Gas Turbine Cycles with Analytic Derivatives in OpenMDAO

A new equilibrium thermodynamics analysis tool was built based on the CEA method using the OpenMDAO framework. The new tool provides forward and adjoint analytic derivatives for use with gradient based optimization algorithms. The new tool was validated against the original CEA code to ensure an accurate analysis and the analytic derivatives were validated against finite-difference approximations. Performance comparisons between analytic and finite difference methods showed a significant speed advantage for the analytic methods. To further test the new analysis tool, a sample optimization was performed to find the optimal air-fuel equivalence ratio, , maximizing combustion temperature for a range of different pressures. Collectively, the results demonstrate the viability of the new tool to serve as the thermodynamic backbone for future work on a full propulsion modeling tool.

Propulsion↗

Approximate Boltzmann distributions in quantum approximate optimization

Approaches to compute or estimate the output probability distributions from the quantum approximate optimization algorithm (QAOA) are needed to assess the likelihood it will obtain a quantum computational advantage. We analyze output from QAOA circuits solving 7200 random MaxCut instances, with $n$ = 14–23 qubits and depth parameter $p$ ≤ 12 and find that the average basis state probabilities follow approximate Boltzmann distributions: The average probabilities scale exponentially with their energy (cut value), with a peak at the optimal solution. Furthermore, we describe the rate of exponential scaling or effective temperature in terms of a series with a leading-order term $T$ ~ $C$ min /$n$ $\sqrt{p}$, with $C$ min the optimal solution energy. Using this scaling, we generate approximate output distributions with up to 38 qubits and find these give accurate accounts of important performance metrics in cases we can simulate exactly.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

WE-G-16A-01: Evolution of Radiation Treatment Planning

Welcome and Introduction - Lawrence N. Rothenberg This symposium is one a continuing series of presentations at AAPM Annual Meetings on the historical aspects of medical physics, radiology, and radiation oncology that have been organized by the AAPM History Committee. Information on previous presentations including “Early Developments in Teletherapy” (Indianapolis 2013), “Historical Aspects of Cross-Sectional Imaging” (Charlotte 2012), “Historical Aspects of Brachytherapy” (Vancouver 2011), “50 Years of Women in Medical Physics” (Houston 2008), and “Roentgen's Early Investigations” (Minneapolis 2007) can be found in the Education Section of the AAPM Website. The Austin 2014 History Symposium will be on “Evolution of Radiation Treatment Planning.” Overview - Radhe Mohan Treatment planning is one of the most critical components in the chain of radiation therapy of cancers. Treatment plans of today contain a wide variety of sophisticated information conveying the potential clinical effectiveness of the designed treatment to practitioners. Examples of such information include dose distributions superimposed on three- or even four-dimensional anatomic images; dose volume histograms, dose, dose-volume and dose-response indices for anatomic structures of interest; etc. These data are used for evaluating treatment plans and for making treatment decisions. The current state-of-the-art has evolved from the 1940s era when the dose to the tumor and normal tissues was estimated approximately by manual means. However, the symposium will cover the history of the field from the late-1950's, when computers were first introduced for treatment planning, to the present state involving the use of high performance computing and advanced multi-dimensional anatomic, functional and biological imaging, focusing only on external beam treatment planning. The symposium will start with a general overview of the treatment planning process including imaging, structure delineation, assignment of dose requirements, consideration of uncertainties, selection of beam configurations and shaping of beams, and calculations, optimization and evaluation of dose distributions. This will be followed by three presentations covering the evolution of treatment planning, which parallels the evolution of computers, availability of advanced volumetric imaging and the development of novel technologies such as dynamic multi-leaf collimators and online image guidance. This evolution will be divided over three distinct periods - prior to 1970's, the 2D era; from 1980 to the mid-1990's, the 3D era; and from the mid 1990's to today, the IMRT era. When the World was Flat: The Two-Dimensional Radiation Therapy Era” - Jacob Van Dyk In the 2D era, anatomy was defined with the aid of solder wires, special contouring devices and projection x-rays. Dose distributions were calculated manually from single field, flat surface isodoses on transparencies. Precalculated atlases of generic dose distributions were produced by the International Atomic Energy Agency. Massive time-shared main frames and mini-computers were used to compute doses at individual points or dose distributions in a single plane. Beam shapes were generally rectangular, with wedges, missing tissue compensators and occasional blocks to shield critical structures. Dose calculations were measurement-based or they used primary and scatter calculations based on scatter-air ratio methodologies. Dose distributions were displayed on line printers as alpha-numeric character maps or isodose patterns made with pen plotters. More than Pretty Pictures: 3D Treatment Planning and Conformal Therapy - Benedick A. Fraass The introduction of computed tomography allowed the delineation of anatomy three-dimensionally and, supported partly by contracts from the National Cancer Institute, made possible the introduction and clinical use of 3D treatment planning, leading to development and use of 3D conformal therapy in the 1980's. 3D computer graphics and 3D anatomical structure definitions made possible Beam's Eye View (BEV) displays, making conformal beam shaping and much more sophisticated beam arrangements possible. These conformal plans significantly improved target dose coverage as well as normal tissue sparing. The use of dose volume histograms, gross/clinical/planning target volumes, MRI and PET imaging, multileaf collimators, and computer-controlled treatment delivery made sophisticated planning approaches practical. The significant improvements in dose distributions and analysis achievable with 3D conformal therapy made possible formal dose escalation and normal tissue tolerance clinical studies that set new and improved expectations for improved local control and decreasing complications in many clinical sites. From the Art to the State of the Art: Inverse Planning and IMRT - Thomas R. Bortfeld While the potential of intensity modulation was recognized in the mid- 1980's, intensity-modulated radiotherapy (IMRT) did not become a reality until the mid-1990's. Broad beams of photons could be sub-divided into narrow beamlets whose intensities could be determined using sophisticated optimization algorithms to appropriately balance tumor dose with normal tissue sparing. The development of dynamic multi-leaf collimators (on conventional linear accelerators as well as in helical delivery devices) enabled the efficient delivery of IMRT. The evolution of IMRT planning is continuing in the form of Volumetric Modulated Arc Therapy (VMAT) and through advanced optimization tools, such as multi-criteria optimization, automated IMRT planning, and robust optimization to protect dose distributions against uncertainties. IMRT also facilitates “dose painting” in which different sub-volumes of the target are prescribed different doses. Clearly, these advancements are being made possible by the increasing power and lower cost of computers and developments in other fields such as imaging and operations research. Summary - Radhe Mohan The history does not end here. The advancement of treatment planning is expected to continue, leading to further automation and improvements in conformality and robustness of dose distributions, particularly in the area of particle therapy. Radiobiological modeling will gain emphasis as part of the planning process. Learning Objectives: The scope of changes in technology and the capabilities of radiation treatment planning The impact of these changes in the quality of treatment plans and optimality of dose distributions The impact of development in other fields (imaging, computers, operations research, etc.) on the evolution of radiation treatment planning.

60 APPLIED LIFE SCIENCES↗

Adjoint DSMC for nonlinear Boltzmann equation constrained optimization

Applications for kinetic equations such as optimal design and inverse problems often involve finding unknown parameters through gradient-based optimization algorithms. Based on the adjoint-state method, we derive two different frameworks for approximating the gradient of an objective functional constrained by the nonlinear Boltzmann equation. While the forward problem can be solved by the DSMC method, it is difficult to efficiently solve the high-dimensional continuous adjoint equation obtained by the “optimize-then-discretize” approach. This challenge motivates us to propose an adjoint DSMC method following the “discretize-then-optimize” approach for Boltzmann-constrained optimization. We also analyze the properties of the two frameworks and their connections. Here, several numerical examples are presented to demonstrate their accuracy and efficiency.

97 MATHEMATICS AND COMPUTING↗

Model-Based Iterative Reconstruction of Magnetization Using Vector Field Electron Tomography

Vector field electron tomography (VFET) is extensively used for three-dimensional (3-D) imaging of magnetic materials at nanometer resolutions. The conventional approach is to reconstruct and visualize the magnetic vector potential or the magnetic field associated with the sample. There is a lack of algorithms capable of reconstructing the 3-D distribution of magnetization from VFET data. Unlike magnetic vector potential and magnetic field, magnetization is a fundamental physical property of the sample that does not extend beyond the dimensions of the sample. We present a model-based iterative reconstruction algorithm (MBIR) that reconstructs the magnetization by minimizing a cost function consisting of a forward model term and a prior model term. The forward model uses the physics of imaging to model the VFET data as a function of the magnetization, and the prior model enforces sparsity in the magnetization reconstruction. We then formulate an optimization algorithm based on the theory of alternate direction method of multipliers to minimize the resulting MBIR cost function. In conclusion, using simulated and real data, we show that our algorithm accurately reconstructs both the magnetization and the magnetic vector potential.

97 MATHEMATICS AND COMPUTING↗