Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “permutation”

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 361 records · Page 20
All sourcesNASA NTRSDOE OSTI
DOE OSTI2014

Tungsten anode spectral model using interpolating cubic splines: Unfiltered x-ray spectra from 20 kV to 640 kV

Purpose: Monte Carlo methods were used to generate lightly filtered high resolution x-ray spectra spanning from 20 kV to 640 kV. Methods: X-ray spectra were simulated for a conventional tungsten anode. The Monte Carlo N-Particle eXtended radiation transport code (MCNPX 2.6.0) was used to produce 35 spectra over the tube potential range from 20 kV to 640 kV, and cubic spline interpolation procedures were used to create piecewise polynomials characterizing the photon fluence per energy bin as a function of x-ray tube potential. Using these basis spectra and the cubic spline interpolation, 621 spectra were generated at 1 kV intervals from 20 to 640 kV. The tungsten anode spectral model using interpolating cubic splines (TASMICS) produces minimally filtered (0.8 mm Be) x-ray spectra with 1 keV energy resolution. The TASMICS spectra were compared mathematically with other, previously reported spectra. Results: Using pairedt-test analyses, no statistically significant difference (i.e., p > 0.05) was observed between compared spectra over energy bins above 1% of peak bremsstrahlung fluence. For all energy bins, the correlation of determination (R{sup 2}) demonstrated good correlation for all spectral comparisons. The mean overall difference (MOD) and mean absolute difference (MAD) were computed over energy bins (above 1% of peak bremsstrahlung fluence) and over all the kV permutations compared. MOD and MAD comparisons with previously reported spectra were 2.7% and 9.7%, respectively (TASMIP), 0.1% and 12.0%, respectively [R. Birch and M. Marshall, “Computation of bremsstrahlung x-ray spectra and comparison with spectra measured with a Ge(Li) detector,” Phys. Med. Biol. 24, 505–517 (1979)], 0.4% and 8.1%, respectively (Poludniowski), and 0.4% and 8.1%, respectively (AAPM TG 195). The effective energy of TASMICS spectra with 2.5 mm of added Al filtration ranged from 17 keV (at 20 kV) to 138 keV (at 640 kV); with 0.2 mm of added Cu filtration the effective energy was 9 keV at 20 kV and 169 keV at 640 kV. Conclusions: Ranging from 20 kV to 640 kV, 621 x-ray spectra were produced and are available at 1 kV tube potential intervals. The spectra are tabulated at 1 keV intervals. TASMICS spectra were shown to be largely equivalent to published spectral models and are available in spreadsheet format for interested users by emailing the corresponding author (JMB)

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2014

Adaptive error detection for HDR/PDR brachytherapy: Guidance for decision making during real-time in vivo point dosimetry

Purpose: This study presents an adaptive error detection algorithm (AEDA) for real-timein vivo point dosimetry during high dose rate (HDR) or pulsed dose rate (PDR) brachytherapy (BT) where the error identification, in contrast to existing approaches, does not depend on an a priori reconstruction of the dosimeter position. Instead, the treatment is judged based on dose rate comparisons between measurements and calculations of the most viable dosimeter position provided by the AEDA in a data driven approach. As a result, the AEDA compensates for false error cases related to systematic effects of the dosimeter position reconstruction. Given its nearly exclusive dependence on stable dosimeter positioning, the AEDA allows for a substantially simplified and time efficient real-time in vivo BT dosimetry implementation. Methods: In the event of a measured potential treatment error, the AEDA proposes the most viable dosimeter position out of alternatives to the original reconstruction by means of a data driven matching procedure between dose rate distributions. If measured dose rates do not differ significantly from the most viable alternative, the initial error indication may be attributed to a mispositioned or misreconstructed dosimeter (false error). However, if the error declaration persists, no viable dosimeter position can be found to explain the error, hence the discrepancy is more likely to originate from a misplaced or misreconstructed source applicator or from erroneously connected source guide tubes (true error). Results: The AEDA applied on twoin vivo dosimetry implementations for pulsed dose rate BT demonstrated that the AEDA correctly described effects responsible for initial error indications. The AEDA was able to correctly identify the major part of all permutations of simulated guide tube swap errors and simulated shifts of individual needles from the original reconstruction. Unidentified errors corresponded to scenarios where the dosimeter position was sufficiently symmetric with respect to error and no-error source position constellations. The AEDA was able to correctly identify all false errors represented by mispositioned dosimeters contrary to an error detection algorithm relying on the original reconstruction. Conclusions: The study demonstrates that the AEDA error identification during HDR/PDR BT relies on a stable dosimeter position rather than on an accurate dosimeter reconstruction, and the AEDA’s capacity to distinguish between true and false error scenarios. The study further shows that the AEDA can offer guidance in decision making in the event of potential errors detected with real-timein vivo point dosimetry.

62 RADIOLOGY AND NUCLEAR MEDICINE↗
DOE OSTI2015

SU-F-BRA-01: A Procedure for the Fast Semi-Automatic Localization of Catheters Using An Electromagnetic Tracker (EMT) for Image-Guided Brachytherapy

Purpose: To evaluate the feasibility of brachytherapy catheter localization through use of an EMT and 3D image set. Methods: A 15-catheter phantom mimicking an interstitial implantation was built and CT-scanned. Baseline catheter reconstruction was performed manually. An EMT was used to acquire the catheter coordinates in the EMT frame of reference. N user-identified catheter tips, without catheter number associations, were used to establish registration with the CT frame of reference. Two algorithms were investigated: brute-force registration (BFR), in which all possible permutation of N identified tips with the EMT tips were evaluated; and signature-based registration (SBR), in which a distance matrix was used to generate a list of matching signatures describing possible N-point matches with the registration points. Digitization error (average of the distance between corresponding EMT and baseline dwell positions; average, standard deviation, and worst-case scenario over all possible registration-point selections) and algorithm inefficiency (maximum number of rigid registrations required to find the matching fusion for all possible selections of registration points) were calculated. Results: Digitization errors on average <2 mm were observed for N ≥5, with standard deviation <2 mm for N ≥6, and worst-case scenario error <2 mm for N ≥11. Algorithm inefficiencies were: N = 5, 32,760 (BFR) and 9900 (SBR); N = 6, 360,360 (BFR) and 21,660 (SBR); N = 11, 5.45*1010 (BFR) and 12 (SBR). Conclusion: A procedure was proposed for catheter reconstruction using EMT and only requiring user identification of catheter tips without catheter localization. Digitization errors <2 mm were observed on average with 5 or more registration points, and in any scenario with 11 or more points. Inefficiency for N = 11 was 9 orders of magnitude lower for SBR than for BFR. Funding: Kaye Family Award.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2015

Multipinhole SPECT helical scan parameters and imaging volume

Purpose: The authors developed SPECT imaging capability on an animal PET scanner using a multiple-pinhole collimator and step-and-shoot helical data acquisition protocols. The objective of this work was to determine the preferred helical scan parameters, i.e., the angular and axial step sizes, and the imaging volume, that provide optimal imaging performance. Methods: The authors studied nine helical scan protocols formed by permuting three rotational and three axial step sizes. These step sizes were chosen around the reference values analytically calculated from the estimated spatial resolution of the SPECT system and the Nyquist sampling theorem. The nine helical protocols were evaluated by two figures-of-merit: the sampling completeness percentage (SCP) and the root-mean-square (RMS) resolution. SCP was an analytically calculated numerical index based on projection sampling. RMS resolution was derived from the reconstructed images of a sphere-grid phantom. Results: The RMS resolution results show that (1) the start and end pinhole planes of the helical scheme determine the axial extent of the effective field of view (EFOV), and (2) the diameter of the transverse EFOV is adequately calculated from the geometry of the pinhole opening, since the peripheral region beyond EFOV would introduce projection multiplexing and consequent effects. The RMS resolution results of the nine helical scan schemes show optimal resolution is achieved when the axial step size is the half, and the angular step size is about twice the corresponding values derived from the Nyquist theorem. The SCP results agree in general with that of RMS resolution but are less critical in assessing the effects of helical parameters and EFOV. Conclusions: The authors quantitatively validated the effective FOV of multiple pinhole helical scan protocols and proposed a simple method to calculate optimal helical scan parameters.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2016

SU-D-207B-02: Early Grade Classification in Meningioma Patients Combining Radiomics and Semantics Data

Purpose: The clinical management of meningioma is guided by its grade and biologic behavior. Currently, diagnosis of tumor grade follows surgical resection and histopathologic review. Reliable techniques for pre-operative determination of tumor behavior are needed. We investigated the association between imaging features extracted from preoperative gadolinium-enhanced T1-weighted MRI and meningioma grade. Methods: We retrospectively examined the pre-operative MRI for 139 patients with de novo WHO grade I (63%) and grade II (37%) meningiomas. We investigated the predictive power of ten semantic radiologic features as determined by a neuroradiologist, fifteen radiomic features, and tumor location. Conventional (volume and diameter) imaging features were added for comparison. AUC was computed for continuous and χ{sup 2} for discrete variables. Classification was done using random forest. Performance was evaluated using cross validation (1000 iterations, 75% training and 25% validation). All p-values were adjusted for multiple testing. Results: Significant association was observed between meningioma grade and tumor location (p<0.001) and two semantic features including intra-tumoral heterogeneity (p<0.001) and overt hemorrhage (p=0.01). Conventional (AUC 0.61–0.67) and eleven radiomic (AUC 0.60–0.70) features were significant from random (p<0.05, Noether test). Median AUC values for classification of tumor grade were 0.57, 0.71, 0.72 and 0.77 respectively for conventional, radiomic, location, and semantic features after using random forest. By combining all imaging data (semantic, radiomic, and location), the median AUC was 0.81, which offers superior predicting power to that of conventional imaging descriptors for meningioma as well as radiomic features alone (p<0.05, permutation test). Conclusion: We demonstrate a strong association between radiologic features and meningioma grade. Pre-operative prediction of tumor behavior based on imaging features offers promise for guiding personalized medicine and improving patient management.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2025

Attention to quantum complexity

The imminent era of error-corrected quantum computing demands robust methods to characterize quantum state complexity from limited, noisy measurements. We introduce the Quantum Attention Network (QuAN), a classical artificial intelligence (AI) framework leveraging attention mechanisms tailored for learning quantum complexity. Inspired by large language models, QuAN treats measurement snapshots as tokens while respecting permutation invariance. Combined with our parameter-efficient miniset self-attention block, this enables QuAN to access high-order moments of bit-string distributions and preferentially attend to less noisy snapshots. We test QuAN across three quantum simulation settings: driven hard-core Bose-Hubbard model, random quantum circuits, and toric code under coherent and incoherent noise. QuAN directly learns entanglement and state complexity growth from experimental computational basis measurements, including complexity growth in random circuits from noisy data. In regimes inaccessible to existing theory, QuAN unveils the complete phase diagram for noisy toric code data as a function of both noise types, highlighting AI’s transformative potential for assisting quantum hardware.

Kim, Hyejin [Cornell Univ., Ithaca, NY (United Sta↗
DOE OSTI2023

Targeted metagenomic assessment reflects critical colonization in battlefield injuries

Current diagnostics and clinical management strategies for combat wounds are based on decisions made by expert clinicians. However, even in the hands of experienced surgeons, wounds from combat injuries can exhibit failed healing and complications related to limitations in the rapid and comprehensive generation of diagnostic information. Previous studies have demonstrated the possible use of genomic sequencing approaches to detect microbial signatures involved in combat casualty care. While effective, whole metagenome sequencing is limited by the depth required to confidently detect all relevant signatures. To address this, we developed a targeted capture sequencing panel to detect microbial signatures relevant to wound healing. These targets include known microbial nosocomial pathogens, wound colonizers, and genes involved in virulence and antimicrobial resistance. A bioinformatics pipeline was built to identify genomic regions of interest and over 8,000 oligonucleotide probes were designed for capture. The panel was synthesized and validated using control reference genomes in human background and on wound-effluent samples from a cohort of combat-injured U.S. service members. Our panel was sensitive against wound-colonizing species, Acinetobacter baumannii and Pseudomonas aeruginosa, and was specific in detecting corresponding virulence and antimicrobial-resistance genes as well as other pathogenic species present in microflora mixtures. Random forest feature permutation confirmed the prevalence of Acinetobacter and Pseudomonas in critically colonized wounds and wounds that failed to heal, respectively. Our results demonstrate the capability of targeted sequencing tools and analysis platforms to profile and deliver information on pathogenic factors influencing wound progression, thereby guiding therapeutic intervention.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2013

Exchange and spin states in quantum dots under strong spatial correlations. Computer simulation by the Feynman path integral method

The fundamental laws in the behavior of electrons in model quantum dots that are caused by exchange and strong Coulomb correlations are studied. The ab initio path integral method is used to numerically simulate systems of two, three, four, and six interacting identical electrons confined in a three-dimensional spherical potential well with a parabolic confining potential against the background of thermal fluctuations. The temperature dependences of spin and collective spin magnetic susceptibility are calculated for model quantum dots of various spatial sizes. A basically exact procedure is proposed for taking into account the permutation symmetry and the spin state of electrons, which makes it possible to perform numerical calculations using modern computer facilities. The conditions of applicability of a virial energy estimator and its optimum form in exchange systems are determined. A correlation estimator of kinetic energy, which is an alternative to a basic estimator, is suggested. A fundamental relation between the kinetic energy of a quantum particle and the character of its virtual diffusion in imaginary time is demonstrated. The process of natural 'pairing' of electron spins during the compression of a quantum dot and cooling of a system is numerically reproduced in terms of path integrals. The temperature dependences of the spin magnetic susceptibility of electron pairs with a characteristic maximum caused by spin pairing are obtained.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2013

Invariant exchange perturbation theory for multicenter systems and its application to the calculation of magnetic chains in manganites

The formalism of exchange perturbation theory is presented with regard to the general principles of constructing an antisymmetric vector with the use of the Young diagrams and tableaux in which the coordinate and spin parts are not separated. The form of the energy and wave function corrections coincides with earlier obtained expressions, which are reduced in the present paper to a simpler form of a symmetry-adapted perturbation operator, which preserves all intercenter exchange contributions. The exchange perturbation theory (EPT) formalism itself is presented in the standard form of invariant perturbation theory that takes into account intercenter electron permutations between overlapping nonorthogonal states. As an example of application of the formalism of invariant perturbation theory, we consider the magnetic properties of perovskite manganites La{sub 1/3}Ca{sub 2/3}MnO{sub 3} that are associated with the charge and spin ordering in magnetic chains of manganese. We try to interpret the experimental results obtained from the study of the effect of doping the above alloys by the model of superexchange interaction in manganite chains that is constructed on the basis of the exchange perturbation theory (EPT) formalism. The model proposed makes it possible to carry out a quantitative analysis of the effect of substitution of manganese atoms by doping elements with different electron configurations on the electronic structure and short-range order in a magnetic chain of manganites.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2015

Wall-crossing invariants: from quantum mechanics to knots

We offer a pedestrian-level review of the wall-crossing invariants. The story begins from the scattering theory in quantum mechanics where the spectrum reshuffling can be related to permutations of S-matrices. In nontrivial situations, starting from spin chains and matrix models, the S-matrices are operatorvalued and their algebra is described in terms of R- and mixing (Racah) U-matrices. Then the Kontsevich-Soibelman (KS) invariants are nothing but the standard knot invariants made out of these data within the Reshetikhin-Turaev-Witten approach. The R and Racah matrices acquire a relatively universal form in the semiclassical limit, where the basic reshufflings with the change of moduli are those of the Stokes line. Natural from this standpoint are matrices provided by the modular transformations of conformal blocks (with the usual identification R = T and U = S), and in the simplest case of the first degenerate field (2, 1), when the conformal blocks satisfy a second-order Shrödinger-like equation, the invariants coincide with the Jones (N = 2) invariants of the associated knots. Another possibility to construct knot invariants is to realize the cluster coordinates associated with reshufflings of the Stokes lines immediately in terms of check-operators acting on solutions of the Knizhnik-Zamolodchikov equations. Then the R-matrices are realized as products of successive mutations in the cluster algebra and are manifestly described in terms of quantum dilogarithms, ultimately leading to the Hikami construction of knot invariants.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2015

Effect of the shape on the spin state and exchange in quantum dots. Feynman path integral analysis

The ab initio computer simulation of the mixed quantum states of 1–5-nm model ellipsoid quantum dots with “soft” walls containing two and three quantum-indistinguishable nonrelativistic electrons has been performed by the path integral method. The calculation has been carried out beyond the single-electron and mean-field approximations with the fundamentally exact inclusion of Coulomb and exchange correlations of all orders and the spin variable. Distributions over the eigenfunctions of the spin-squared operator, as well as the equilibrium spin numbers, have been obtained depending on the shape of a quantum dot and the temperature. The complete set of basis functions symmetrized in permutations according to the spin of the system has been obtained by application of the Young symmetry operators. The dependence of the energy on the shape of the quantum dot corresponds to the negative sign of the surface tension at its boundary. The calculation indicates that the spin magnetic susceptibility in the system of two electrons decreases strongly for spherical quantum dots (“pairing” of spins) and the temperature dependences have a pronounced maximum whose position depends on the shape of the quantum dot. For three electrons in an oblate quantum dot, the inversion of the energy levels of spin states is observed and affects the spin magnetic susceptibility. The results indicate a strong dependence of the energy of collective spin states of electrons on the detailed inclusion of exchange and Coulomb spatial correlations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2018

Cyclotomic Shuffles

Analogues of 1-shuffle elements for complex reflection groups of type G(m,1,n) are introduced. A geometric interpretation for G(m,1,n) in terms of rotational permutations of polygonal cards is given. We compute the eigenvalues, and their multiplicities, of the 1-shuffle element in the algebra of the group G(m,1,n). Considering shuffling as a random walk on the group G(m,1,n), we estimate the rate of convergence to randomness of the corresponding Markov chain. We report on the spectrum of the 1-shuffle analogue in the cyclotomic Hecke algebra H(m,1,n) for m=2 and small n.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2018

Fast and effective reordering of columns within supernodes using partition refinement

In this paper, we consider the problem of computing a triangular factorization of a sparse symmetric matrix using Gaussian elimination. We assume that the sparse matrix has been permuted using a fill-reducing ordering algorithm. When the matrix is symmetric positive definite, the sparsity structure of the triangular factor can be determined once the fill-reducing ordering has been computed. Thus, an efficient numerical factorization scheme can be designed so that only the nonzero entries are stored and operated on. On modern architectures, the positions of the nonzero entries in the triangular factor play a big role in determining the efficiency. It is desirable to have dense blocks in the factor so that the computation can be cast in terms of level-3 BLAS as much as possible. On architectures with GPUs, for example, it is also desirable for these dense blocks to be as large as possible in order to reduce the times to transfer data between the main CPU and the GPUs. We address the problem of locally refining the ordering so that the number of dense blocks is reduced and the sizes of these dense blocks are increased in the triangular factor.

Jacquelin, Mathias↗
DOE OSTI2014

Communication-avoiding symmetric-indefinite factorization

We describe and analyze a novel symmetric triangular factorization algorithm. The algorithm is essentially a block version of Aasen's triangular tridiagonalization. It factors a dense symmetric matrix A as the product A=PLTL T P T where P is a permutation matrix, L is lower triangular, and T is block tridiagonal and banded. The algorithm is the first symmetric-indefinite communication-avoiding factorization: it performs an asymptotically optimal amount of communication in a two-level memory hierarchy for almost any cache-line size. Adaptations of the algorithm to parallel computers are likely to be communication efficient as well; one such adaptation has been recently published. As a result, the current paper describes the algorithm, proves that it is numerically stable, and proves that it is communication optimal.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Software for Sparse Tensor Decomposition on Emerging Computing Architectures

In this paper, we develop software for decomposing sparse tensors that is portable to and performant on a variety of multicore, manycore, and GPU computing architectures. The result is a single code whose performance matches optimized architecture-specific implementations. The key to a portable approach is to determine multiple levels of parallelism that can be mapped in different ways to different architectures, and we explain how to do this for the matricized tensor times Khatri--Rao product (MTTKRP), which is the key kernel in canonical polyadic tensor decomposition. Our implementation leverages the Kokkos framework, which enables a single code to achieve high performance across multiple architectures that differ in how they approach fine-grained parallelism. We also introduce a new construct for portable thread-local arrays, which we call compile-time polymorphic arrays. Not only are the specifics of our approaches and implementation interesting for tuning tensor computations, but they also provide a roadmap for developing other portable high-performance codes. As a last step in optimizing performance, we modify the MTTKRP algorithm itself to do a permuted traversal of tensor nonzeros to reduce atomic-write contention. Lastly, we test the performance of our implementation on 16- and 68-core Intel CPUs and the K80 and P100 NVIDIA GPUs, showing that we are competitive with state-of-the-art architecture-specific codes while having the advantage of being able to run on a variety of architectures.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Lorentz invariance of basis tensor gauge theory

Basis tensor gauge theory (BTGT) is a vierbein analog reformulation of ordinary gauge theories in which the vierbein field describes the Wilson line. After a brief review of the BTGT, we clarify the Lorentz group representation properties associated with the variables used for its quantization. In particular, we show that starting from an SO(1,3) representation satisfying the Lorentz-invariant U(1,3) matrix constraints, BTGT introduces a Lorentz frame choice to pick the Abelian group manifold generated by the Cartan subalgebra of U(1,3) for the convenience of quantization even though the theory is frame independent. This freedom to choose a frame can be viewed as an additional symmetry of BTGT that was not emphasized before. We then show how an [Formula: see text] permutation symmetry and a parity symmetry of frame fields natural in BTGT can be used to construct renormalizable gauge theories that introduce frame-dependent fields but remain frame independent perturbatively without any explicit reference to the usual gauge field.

Physics↗
DOE OSTI2017

Optimizing the Four-Index Integral Transform Using Data Movement Lower Bounds Analysis

The four-index integral transform is a fundamental and computationally demanding calculation used in many computational chemistry suites such as NWChem. It transforms a four-dimensional tensor from an atomic basis to a molecular basis. This transformation is most efficiently implemented as a sequence of four tensor contractions that each contract a four-dimensional tensor with a two-dimensional transformation matrix. Differing degrees of permutation symmetry in the intermediate and final tensors in the sequence of contractions cause intermediate tensors to be much larger than the final tensor and limit the number of electronic states in the modeled systems. Loop fusion, in conjunction with tiling, can be very effective in reducing the total space requirement, as well as data movement. However, the large number of possible choices for loop fusion and tiling, and data/computation distribution across a parallel system, make it challenging to develop an optimized parallel implementation for the four-index integral transform. We develop a novel approach to address this problem, using lower bounds modeling of data movement complexity. We establish relationships between available aggregate physical memory in a parallel computer system and ineffective fusion configurations, enabling their pruning and consequent identification of effective choices and a characterization of optimality criteria. This work has resulted in the development of a significantly improved implementation of the four-index transform that enables higher performance and the ability to model larger electronic systems than the current implementation in the NWChem quantum chemistry software suite.

Rajbhandari, Samyam↗
DOE OSTI2024

PyOED: An Extensible Suite for Data Assimilation and Model-Constrained Optimal Design of Experiments

This article describes PyOED, a highly extensible scientific package that enables developing and testing model-constrained optimal experimental design (OED) for inverse problems. Specifically, PyOED aims to be a comprehensive Python toolkit for model-constrained OED. The package targets scientists and researchers interested in understanding the details of OED formulations and approaches. It is also meant to enable researchers to experiment with standard and innovative OED technologies with a wide range of test problems (e.g., simulation models). OED, inverse problems (e.g., Bayesian inversion), and data assimilation (DA) are closely related research fields, and their formulations overlap significantly. Thus, PyOED is continuously being expanded with a plethora of Bayesian inversion, DA, and OED methods as well as new scientific simulation models, observation error models, and observation operators. These pieces are added such that they can be permuted to enable testing OED methods in various settings of varying complexities. The PyOED core is completely written in Python and utilizes the inherent object-oriented capabilities; however, the current version of PyOED is meant to be extensible rather than scalable. Specifically, PyOED is developed to “enable rapid development and benchmarking of OED methods with minimal coding effort and to maximize code reutilization.” This article provides a brief description of the PyOED layout and philosophy and provides a set of exemplary test cases and tutorials to demonstrate the potential of the package.

97 MATHEMATICS AND COMPUTING↗