Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Automatic Differentiation”

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 199 records · Page 11
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Structure analysis of supported disordered molybdenum oxides using pair distribution function analysis and automated cluster modelling

Molybdenum oxides and sulfides on various low-cost high-surface-area supports are excellent catalysts for several industrially relevant reactions. The surface layer structure of these materials is, however, difficult to characterize due to small and disordered MoO x domains. Here, it is shown how X-ray total scattering can be applied to gain insights into the structure through differential pair distribution function (d-PDF) analysis, where the scattering signal from the support material is subtracted to obtain structural information on the supported structure. MoO x catalysts supported on alumina nanoparticles and on zeolites are investigated, and it is shown that the structure of the hydrated molybdenum oxide layer is closely related to that of disordered and polydisperse polyoxometalates. By analysing the PDFs with a large number of automatically generated cluster structures, which are constructed in an iterative manner from known polyoxometalate clusters, information is derived on the structural motifs in supported MoO x .

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2025

Automated Scoring of Morphological Changes in Images of Pentaerythritol Tetranitrate

Recent advances in characterization techniques that generate large datasets of material microstructure images require robust, automated image-processing. We applied an unsupervised anomaly detection method called feature anomaly detection system (FADS) to automatically detect and quantify microstructure changes in images of the explosive pentaerythritol tetranitrate (PETN) aged at various temperatures. We demonstrated the FADS approach on two-dimensional images extracted from computed tomography scans, but the same technique can be readily applied to other imaging modalities. FADS calculates anomaly scores on the basis of differences in filter activations of nominal and test data in pretrained convolutional neural networks. The FADS scores successfully differentiated between pristine PETN and PETN aged at a temperature where material coarsening occurred. Morphological metric analysis of segmented images verified observed trends in FADS scores as a function of aging temperature and aging time, specifically by calculating volume fractions, specific boundary lengths, two-point correlation functions, and local thicknesses. Here, the FADS technique has two important advantages compared to traditional morphological analysis: First, it uses grayscale images as input, rather than images that are segmented to separate the appropriate phases; and second, FADS scores capture any type of changes among image sets, rather than requiring prior knowledge or selection of a relevant set of metrics.

Accelerated aging↗
DOE OSTI2025

Parallel sorting algorithm classification: is manual instrumentation necessary?

Understanding parallel algorithms is crucial for accelerating scientific simulations on complex, distributed memory, high-performance computers. Modern algorithm classification approaches learn semantics directly from source code to differentiate between algorithms, however, accessing source code is not always possible. We can learn about parallel algorithms from observing their performance, as programs running the same algorithms and using the same hardware should exhibit similar performance characteristics. We present an approach to learn algorithm classes from parallel performance data directly in order to classify algorithms without access to the source code. We extend previous work to enable classifying parallel sorting algorithms using automatic instrumentation instead of requiring manual region annotations in the source code. In this work, we design and demonstrate a study for classification of parallel sorting algorithms using parallel performance data collected from automatic instrumentation, and evaluate the performance of our new methodology on classification. We leverage Caliper to collect the performance data, Thicket for our exploratory data analysis (EDA), and PyTorch and Scikit-learn to evaluate the effectiveness of random forests, support vector machines (SVMs), decision trees, neural networks, and logistic regressions on parallel performance data. Additionally, we study noise in parallel performance data, whether the removal of noise and pre-processing of the data is necessary to accurately classify parallel sorting algorithms, and determine the effectiveness of features created from performance data. In conclusion, we demonstrate classification accuracy for these five different models of up to 97.7% across four different parallel algorithm classes.

Algorithm Classification↗
DOE OSTI2023

Theory of an Automatic Seepage Meter and Ramifications for Applications

A new approach for measuring fluxes across surface water—groundwater interfaces was recently proposed. The Automatic Seepage Meter (ASM) is equipped with a precise water level sensor and digital memory that analyzes water level time series in a vertical tube inserted into a streambed. The ability to infer flux values with high temporal resolution relies on an accurate interpretation of water level dynamics inside the tube. Here, we reduce the three-dimensional hydrodynamic problem that describes the ASM water level in a variety of field conditions to a single ordinary differential equation. This novel general analytical solution for estimating ASM responses is more comprehensive and flexible than previous approaches and is applicable to the entire range of field conditions, including steady or transient stream stages, evaporation, rainfall, and noise. For example, our analysis determines the timing of the nonmonotonic ASM response to a monotonic linear stream stage variation and explains previously used empirical parabolic approximation for estimating fluxes. We present algorithms for simultaneous inference of vertical interface flux and hydraulic conductivity values together with an example code. We quantify how the accuracy of parameter estimation depends on test duration and noise amplitude and propose how our analysis can be used to optimize field test protocols. On this basis, changing the ASM geometry by increasing the radius and decreasing tube insertion depth may enable ASM field test protocols that estimate interface flux and hydraulic conductivity faster while maintaining desired accuracy. Potential applications of joint parameter estimation are suggested.

47 OTHER INSTRUMENTATION↗
DOE OSTI2020

Neutral gas analysis for JET DT operation

Neutral gas analysis, the measurement and evaluation of total and partial pressures, is a key technique to study the impact of neutral gas dynamics on retention, recycling and release processes of fuel or impurity species in fusion devices. At JET, the experiment closest to ITER in terms of operating parameters and size, various detectors and techniques for partial pressure and total pressure measurements are deployed together to characterise neutral gas dynamics during and after plasma operation on various toroidal and poloidal locations. An extensive modification of JET's sub-divertor neutral gas diagnostic system aims at retaining and extending established measurement capabilities in the forthcoming Deuterium-Tritium (DT) experiments (DTE2). To achieve DT compatibility, a separation of radiation-sensitive electronics from the sensor and adequate radiation shielding is required, as well as utilisation of a DT compatible differential pumping system with adjustable throughput to account for the strong pressure variation in the sub-divertor region. Finally, the sub-divertor neutral gas diagnostic will be equipped with multiple Residual Gas Analysers (RGAs), utilising quadrupole mass spectrometry and electrostatic ion-trap-principles, all operating with remote electronics located behind the biological radiation shield. These RGAs will record data in a fast selected discrete mass mode during plasma pulses (cycle ~2 s) and will automatically switch back to continuous data recording (cycle ~100 s) afterwards. They will be complemented by a newly improved Penning gauge spectroscopy configuration in particular supporting the He and D 2 separation relevant for DT operation. The distance between these devices and their associated control unit is typically 15m . A newly developed RGA with a cable length of 80 m, compatible with the ITER environment, will also be employed for the first time. Finally, this set-up and its operation in DTE2 will provide vital input to the development of the ITER divertor RGA in the most relevant environment currently available.

47 OTHER INSTRUMENTATION↗
DOE OSTI2022

A Decision-Making Machine Learning Approach in Hermite Spectral Approximations of Partial Differential Equations

The accuracy and effectiveness of Hermite spectral methods for the numerical discretization of partial differential equations on unbounded domains are strongly affected by the amplitude of the Gaussian weight function employed to describe the approximation space. This is particularly true if the problem is under-resolved, i.e., there are no enough degrees of freedom. The issue becomes even more crucial when the equation under study is time-dependent, forcing in this way the choice of Hermite functions where the corresponding weight depends on time. In order to adapt dynamically the approximation space, it is here proposed an automatic decision-making process that relies on machine learning techniques, such as deep neural networks and support vector machines. The algorithm is numerically tested with success on a simple 1D problem, but the main goal is its exportability in the context of more serious applications. Here we also show at the end an application in the framework of plasma physics.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Sequential Decision Making (SDM) for Mesh Refinement and Model Selection in Multiscale, Multi-Physics Applications

Intelligent automation and decision support are needed to enhance computational efficiency and robustness in multiscale and multi-physics problems, including materials science, manufacturing, and climate and weather modeling. Current scientific computing approaches for enabling decisions by scientists fail to explore the role of learning, reasoning, and probabilistic planning. Often these decisions are not performed in real-time during the computation but are made prior to the start of the computation, which must be interrupted in order to make changes to the prior choices. Such interruptions at different stages of the computation increase the total computing time and the need for a human expert to frequently monitor the results. State of art scientific computing methods consist of rule-based algorithms that cannot automatically adapt to a dynamically changing computing environment. The development of a Sequential Decision Making (SDM) framework will automate scientific computing by optimizing the policies for mesh refinement, time-stepping, model and algorithm selection, resource allocation, and pre and post-processing. Our agent SDM framework for scientific computing will consist of data-driven learning (Classifier), automated reasoning (contextual knowledge), and probabilistic planning (Reinforcement Learning). In this project, we focused on three problems to demonstrate our SDM framework on a set of ordinary and partial differential equations. Classification of Lorenz system regions using Feed-Forward Neural Networks examined learning in the SDM framework. On the other hand, reasoning and planning in the SDM framework were used in two problems: adaptive time-stepping for nonlinear ODEs using on-policy RL algorithms, and adaptive mesh refinement for 2-D PDEs using off-policy RL algorithms.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Kinetic Deep Learning v0.1

Here, we present a method that uses protein levels to predict times series of metabolite concentrations. Understanding this type of pathway dynamics is important in order to predict the behavior of the pathway and, more pragmatically, to be able to design biological systems (such as strains bioengineered to produce chemical products) reliably. Typically, for this purpose, kinetic models consisting of differential equations based on the Michaelis-Menten dynamics have been used in the past. However, these methods can rarely produce good fits to measured data time series. Possibly, this happens because the kinetic constants are unknown or are different from the ones measured in vivo, or perhaps because Michaelis-Menten dynamics is not a satisfactory description. In order to improve the predictive nature of these kinetic models we have eliminated the Michaelis-Menten description of pathway dynamics and we have substituted it by algorithms that automatically learn these dynamics from previously obtained metabolomics and proteomics data using machine learning approaches. Specifically, kinetic deep learning uses deep learning to map proteomics time series to metabolite concentration time series, instead of learning the first metabolite derivative and integrating in (as in the first version of kinetic learning). This approach is shown to provide good to excellent results with a data set specifically collected for this purpose.

Garcia Martin, Hector [Joint BioEnergy Institute (↗
DOE OSTI2021

Discovering Hidden Geothermal Signatures using Unsupervised Machine Learning

Discovering hidden geothermal resources is a very challenging task. It requires the mining of large datasets, including various diverse data attributes representing subsurface hydrogeological and geothermal conditions. The commonly used Play Fairway Analysis (PFA) typically relies on subject-matter expertise to analyze site or regional data to estimate geothermal conditions and prospectivity. Here, we demonstrate an alternative approach based on machine learning (ML) to process a geothermal dataset of Southwest New Mexico (SWNM). The study region includes low- and medium-temperature hydrothermal systems. However, most of these systems are poorly characterized because of insufficient existing data and limited past explorative studies. This study aims to discover hidden patterns and relationships in the SWNM geothermal dataset to better understand regional hydrothermal conditions. This is achieved by applying an unsupervised machine learning algorithm based on non-negative matrix factorization coupled with customized k-means clustering (NMFk). NMFk can automatically identify (1) hidden (latent) signatures characterizing datasets, (2) the optimal number of these signatures, (3) dominant data attributes associated with each signature, and (4) spatial distribution of the extracted signatures. Here, NMFk is applied to analyze 18 geological, geophysical, hydrogeological, geothermal attributes at 44 locations in SWNM. NMFk successfully finds data patterns and identifies the spatial associations of hydrothermal signatures with the four physiographic provinces in SWNM (Colorado Plateau, Volcanic Field, Basin and Range, and the Rio Grande rift). The algorithm identified up to 5 hydrothermal signatures in the SWNM datasets that differentiate between low- and medium-temperature hydrothermal systems in different provinces. Also, the algorithm identifies two medium-temperature hydrothermal systems in SWNM that require further exploration for geothermal resource development. Based on our analyses, 12 of the attributes are important to identify medium-temperature hydrothermal systems, and the remaining six attributes are critical to characterize low-temperature hydrothermal systems. Based on the obtained results, we identify potential physiographic provinces for further exploration to characterize them as geothermal resources. The resulting NMFk model can be applied to predict geothermal conditions and their uncertainties at new SWNM locations based on limited data from unexplored areas.

58 GEOSCIENCES↗
DOE OSTI2021

Application-driven Privacy-preserving Data Publishing with Correlated Attributes

Recent advances in computing have allowed for the possibility to collect large amounts of data on personal activities and private living spaces. To address the privacy concerns of users in this environment, we propose a novel framework called PR-GAN that offers privacy-preserving mechanism using generative adversarial networks. Given a target application, PR-GAN automatically modifies the data to hide sensitive attributes - which may be hidden and can be inferred by machine learning algorithms - while preserving the data utility in the target application. Unlike prior works, the public's possible knowledge of the correlation between the target application and sensitive attributes is built into our modeling. We formulate our problem as an optimization problem, show that an optimal solution exists and use generative adversarial networks (GAN) to create perturbations. We further show that our method provides privacy guarantees under the Pufferfish framework, an elegant generalization of the differential privacy that allows for the modeling of prior knowledge on data and correlations. Through experiments, we show that our method outperforms conventional methods in effectively hiding the sensitive attributes while guaranteeing high performance in the target application, for both property inference and training purposes. Finally, we demonstrate through further experiments that once our model learns a privacy-preserving task, such as hiding subjects' identity, on a group of individuals, it can perform the same task on a separate group with minimal performance drops.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

hIPPYlib-MUQ: A Bayesian Inference Software Framework for Integration of Data with Complex Predictive Models under Uncertainty

Bayesian inference provides a systematic framework for integration of data with mathematical models to quantify the uncertainty in the solution of the inverse problem. However, the solution of Bayesian inverse problems governed by complex forward models described by partial differential equations (PDEs) remains prohibitive with black-box Markov chain Monte Carlo (MCMC) methods. We present hIPPYlib-MUQ, an extensible and scalable software framework that contains implementations of state-of-the art algorithms aimed to overcome the challenges of high-dimensional, PDE-constrained Bayesian inverse problems. These algorithms accelerate MCMC sampling by exploiting the geometry and intrinsic low-dimensionality of parameter space via derivative information and low rank approximation. The software integrates two complementary open-source software packages, hIPPYlib and MUQ. hIPPYlib solves PDE-constrained inverse problems using automatically-generated adjoint-based derivatives, but it lacks full Bayesian capabilities. MUQ provides a spectrum of powerful Bayesian inversion models and algorithms, but expects forward models to come equipped with gradients and Hessians to permit large-scale solution. By combining these two complementary libraries, we created a robust, scalable, and efficient software framework that realizes the benefits of each and allows us to tackle complex large-scale Bayesian inverse problems across a broad spectrum of scientific and engineering disciplines. To illustrate the capabilities of hIPPYlib-MUQ, we present a comparison of a number of MCMC methods available in the integrated software on several high-dimensional Bayesian inverse problems. These include problems characterized by both linear and nonlinear PDEs, various noise models, and different parameter dimensions. The results demonstrate that large (~ 50×) speedups over conventional black box and gradient-based MCMC algorithms can be obtained by exploiting Hessian information (from the log-posterior), underscoring the power of the integrated hIPPYlib-MUQ framework.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

A 24-Channel Digitizer With a JESD204B-Compliant Serial Interface for High-Speed Detectors

In this report a 24-channel application-specific integrated circuit (ASIC) for the readout of high-speed CMOS active pixel sensors for charged particle detection is presented. The chip comprises 24 preamplifiers, 24 distinct 12-bit, 25 MSPS Pipelined analog-to-digital converters (ADCs) with self-calibration, an internal phase-locked loop (PLL), and a 3 Gbps serial interface that conforms to the JESD204B standard. To simplify interfacing with a variety of sensors, the ASIC also includes an automatic offset calibration loop. The high level of integration of the ASIC reduces overall system cost and area, and exploiting the signal characteristics of the image sensor allows the ADC to be optimized for reduced power dissipation. The use of an integrated serializer and an industry standard protocol simplifies integration of the ASIC into a complete camera system. The ASIC, called the High-Speed Image Preprocessor Targeted for Electron Readout, or HIPSTER, with a die area of 64.26 mm 2 , is packaged in a 480-ball grid array (BGA) and is fabricated in 180-nm CMOS technology. HIPSTER achieves typical differential nonlinearity (DNL) < 0.55 LSB, input-referred thermal noise of $114.5 μV-rms, and a bit error rate (BER) of better than 10-14. The power dissipation is 98 mW/channel.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2026

Time at Temperature Experiments on Neutron Irradiated Zircaloy-2 using Conventional & Flash DSC

Dryout events in Boiling Water Reactors (BWRs) are currently treated by NRC regulations as automatic disqualification for continued fuel rod operation, even though this criterion does not account for the rate or duration of power increases, associated changes in material behavior, or the possibility of rewetting. Operational history from Anticipated Operational Occurrences (AOOs) shows that short, transient power excursions often demand only modest heat removal, and industry experience suggests that fuel can briefly enter dryout yet return to safe, stable operation. The lack of detailed understanding of the material response during such events motivates the present series of experiments. This study uses unique and innovative methods to investigate microstructural evolution in irradiated Zircaloy-2 exposed to high temperatures in inert environments. Differential Scanning Calorimetry (DSC) and FlashDSC are combined to build a comprehensive experimental framework capable of identifying the a–ß phase transformation in zirconium and examining defect annealing under steep thermal gradients. FlashDSC enables rapid heating and cooling of Focused Ion Beam (FIB)–prepared large-area lift-outs (LALOs) of irradiated Zircaloy-2 at rates of 1,000 K/s to peak temperatures of 600°C, 750°C, and 900°C. The goal is to determine whether these conditions produce measurable microstructural changes that could influence cladding performance in typical BWR environments. Microstructural characterization includes quantifying dislocation density and assessing secondary phase particle (SPP) size and distribution using Transmission Electron Microscopy (TEM). Ongoing analysis, such as diffraction pattern indexing and 4D STEM processing, will further refine these observations.

36 - MATERIALS SCIENCE↗
DOE OSTI2022

Discovering hidden geothermal signatures using non-negative matrix factorization with customized k-means clustering

Discovery of hidden geothermal resources is challenging. It requires the mining of large datasets with diverse data attributes representing subsurface hydrogeological and geothermal conditions. The commonly used play fairway analysis approach typically incorporates subject-matter expertise to analyze regional data to estimate geothermal characteristics and favorability. We demonstrate an alternative approach based on machine learning (ML) to process a geothermal dataset from southwest New Mexico (SWNM). The study region includes low- and medium-temperature hydrothermal systems. Several of these systems are not well characterized because of insufficient existing data and limited past explorative work. This study discovers hidden patterns and relations in the SWNM geothermal dataset to improve our understanding of the regional hydrothermal conditions and energy-production favorability. This understanding is obtained by applying an unsupervised ML algorithm based on non-negative matrix factorization coupled with customized k-means clustering (NMFk). NMFk can automatically identify (1) hidden signatures characterizing analyzed datasets, (2) the optimal number of these signatures, (3) the dominant data attributes associated with each signature, and (4) the spatial distribution of the extracted signatures. Here, in this study, NMFk is applied to analyze 18 geological, geophysical, hydrogeological, and geothermal attributes at 44 locations in SWNM. Using NMFk, we find data patterns and identify the spatial associations of hydrothermal signatures within two physiographic provinces (Colorado Plateau and Basin and Range) and two sub-regions of these provinces (the Mogollon-Datil volcanic field and the Rio Grande rift) in SWNM. The ML algorithm extracted five hydrothermal signatures in the SWNM datasets that differentiate between low (<90°C) and medium (90-150°C)-temperature hydrothermal systems. The algorithm also suggests that the Rio Grande rift and northern Mogollon-Datil volcanic field are the most favorable regions for future geothermal resource discovery. NMFk also identified critical attributes to identify medium-temperature hydrothermal systems in the study area. The resulting NMFk model can be applied to predict geothermal conditions and their uncertainties at new SWNM locations based on limited data from unexplored regions. The code to execute the performed analyses as well as the corresponding data can be found at https://github.com/SmartTensors/GeoThermalCloud.jl.

15 GEOTHERMAL ENERGY↗
DOE OSTI2025

Graph-based Reversible Evaluation and Tangents Library

GRETL is a C++ library for evaluation, re-evaluation and algorithmic differentiation of functional operations on an arbitrary computational graph with limited memory usage. Similar to popular machine learning frameworks in Python, like PyTorch and JAX, it tracks and stores both operations and output data as functions are evaluated. Once this composition of functions is built up, the entire chain of operations can be back propagated to compute sensitivities of the final result with respect to any number of inputs. In contrast to most machine learning applications, memory usage becomes the bottleneck for back propagation in many physics applications, especially for time-dependent PDEs. Dynamic check pointing becomes essential. An important distinguishing feature of GRETL is its ability to limit the maximum memory usage by automatically dynamic checkpointing the data output for each graph operation (see Wang, Moin, Iaccarino, 2009). During backpropagation, parts of the graph that are no longer in memory are automatically re-evaluated from upstream checkpointed states as needed for derivative sensitivity calculations (or more precisely, for vector-Jacobian products). GRETL is particularly beneficial for applications, such as coupled multi-physics, where deriving adjoint-based sensitivities and managing checkpoint memory across modules becomes onerous. Cases which can be readily handled by the GRETL library include: different time-integration algorithms per physics (e.g., coupled predictor-corrector algorithms, IMEX, etc.), sub-cycling, asynchronous integrators, state dependent timestep sizes, iterative solvers and coupling algorithms, controller algorithms, and more.

Tupek, MichaelR [Lawrence Livermore National Labor↗
DOE OSTI2020

Dynamically Reconfigurable Data Readout of Pixel Detectors for Automatic Synchronization with Data Acquisition Systems

Reconfigurable detectors with dynamically selectable sensing and readout modes are highly desirable for implementing edge computing as well as enabling advanced imaging techniques such as foveation. The concept of a camera system capable of simultaneous passive imaging and dynamic ranging in different regions of the detector is presented. Such an adaptive-autonomous detector with both spatial and temporal control requires programmable window of exposure (time frames), ability to switch between readout modes such as full-frame imaging and zero-suppressed data, modification of the number of pixel data bits and independent programmability for distinct detector regions. In this work, a method is presented for seamlessly changing time frames and readout modes without data corruption while still ensuring that the data acquisition system (DAQ) does not need to stop and resynchronize at each change of setting, thus avoiding significant dead time. Data throughput is maximized by using a minimum unique data format, rather than lengthy frame headers, to differentiate between consecutive frames. A data control and transmitter (DCT) synchronizes data transfer from the pixel to the periphery, reconfigures the data to transmit it serially off-chip, while providing optimized decision support based on a DAQ definable mode. Measurements on a test structure demonstrate that the DCT can operate at 1 GHz in a 65 nm LP CMOS process.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2024

Multiphysics Time-Integration for Turbulent Combustion at the Exascale

Turbulent reacting flow systems are often modeled with coupled time-dependent partial differential equations (PDEs). Solving such equations can easily tax the world's largest supercomputers. One pragmatic strategy for attacking such problems is to split the PDEs into components that can more easily be solved in isolation. This generic operator-splitting strategy leads to a set of ordinary differential equations (ODEs) that need to be solved as part of an "outer-loop" time-stepping approach. In many combustion applications, the ODEs to be solved can be very stiff, exhibiting timescales that span many orders of magnitude. The SUNDIALS library provides a plethora of robust time integration algorithms for solving these ODEs on exascale-capable computing hardware, yet for many complex applications (such multicomponent fuels or emissions predictions), the chemical models remain too complex to solve using reasonable resources. The Quasi-Steady State Approximation (QSSA) can be an effective tool for reducing the size and stiffness of the simulations. In this talk, I will discuss the use of the SUDIALS library of ODE solvers together with automatic code generation tools to solve complex turbulent reacting flow problems using QSSA models.

chemistry↗
DOE OSTI2021

Parametrizations of the spin density matrix

Highlights: • Proposed two methods for parametrizing the SDM of spinning, unstable particles. • All non-negativity conditions fulfilled; adaptability to various constraints. • First method: based on a theorem; applicable in a simple and flexible way. • Second method: particularly suitable for especial conditions. • Applications: two of them interesting in the search for new physics. We propose for the spin density matrix two parametrizations which automatically fulfill the non-negativity conditions, without setting any bound on the parameters. The first one relies on a theorem, that we prove, and it is rather simple and easily adaptable to some specific reactions, where, for example, parity is conserved or angular momentum conservation entails selection rules. Moreover, in the case when the rank is less than the order of the density matrix, we show how to improve the fits to the data, either by implementing previous suggestions, or by elaborating an alternative method, for which we prove a second theorem. Our second parametrization is a variant of previous treatments, it appears suitable for some particular processes. Moreover, we discuss about the possibility of inferring the elements of the density matrix from the differential decay width. Last, we illustrate various examples of current interest, both in strong and weak decays; some of them may be helpful in the investigation of physics beyond the standard model.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗