Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Derived Matrices”

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 37 records · Page 2

Rotational symmetry relation for efficient response function generation in the coarse mesh transport method COMET

The coarse mesh transport code COMET is a continuous energy hybrid stochastic-deterministic neutronics solver with high fidelity and formidable computation speed in solving reactor core problems. Its method is based on the incident flux expansion theory. In this work, we take advantage of the local geometric symmetry in many reactor cores lattices (e.g., fuel lattices and reflector blocks) to develop relations among the flux response expansion coefficients for symmetric surfaces to further improve the computational efficiency of the COMET response function generation tool (method). This is done by a rigorous derivation of the transformation matrices for the angular and spatial expansion moments resulting from a rotation of a coarse mesh by an arbitrary angle. The relations for the response coefficients for the symmetric surfaces can be then written as the Kronecker product of those transformation matrices. The method is implemented into COMET and tested on two advanced high temperature reactor (AHTR) full-length single assembly benchmark problems. The COMET results using the response function library based on the symmetry relations were compared to those using the library directly generated by continuous energy Monte Carlo for all surfaces. It was found that the eigenvalues and stripe-wise fission densities using the two libraries are in statistical agreement as expected. This indicates that the new method maintains the high fidelity of the original COMET method while improving the computational efficiency in the response function generation by 270% to 400%, depending on the local geometric symmetry. This method also reduces the size of the response function library by the same magnitude (270% to 400%). (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Dedicated beam position monitor pair for model-independent lattice characterization at NSLS-II

This paper reports recent lattice characterization results obtained at the National Synchrotron Light Source II (NSLS-II) storage ring, conducted without reliance on a lattice model. A pair of beam position monitors (BPMs) with bunch-by-bunch (B×B) resolution, were recently installed in a section of the storage ring free of magnetic fields. The new BPM pair measured the beam, or bunch’s transverse Poincar´e map precisely after the beam was excited. Linear one-turn-matrices (OTM) were then derived, and from these, the 4-dimensional coupled Twiss parameters were extracted at the locations of the BPM pair. By normalizing beam oscillation amplitudes with the Twiss parameters, the global action-variables were obtained. These action-variables facilitated the measurement of the local Twiss parameters observed by other BPMs independent on lattice model. This method is general, and particularly useful in certain scenarios such as a round beam mode in a diffraction-limited light source ring. We applied it to assess both weakly and strongly coupled lattices at the NSLS-II ring. Through analysis of the strongly coupled lattice, the quadrupole tilt errors were estimated to be less than 400 µrad. Utilizing the BPMs’ B×B resolution, for the first time we observed the variations of the linear lattice along a long bunch-train.

43 PARTICLE ACCELERATORS↗

What is the gradient of a scalar function defined on a subspace of square matrices?

We illustrate a technique to calculate the gradient of scalar functions that are defined on any arbitrary matrix subspace. It generalizes our earlier work titled “What is the gradient of a scalar function of a symmetric matrix ?”(Indian Journal of Pure and Applied Mathematics (2022), doi:10.1007/s13226-022-00313-x), in which we considered the special case of the subspace of symmetric matrices. Extant methods to calculate the gradient in such cases have an inherent flaw which leads to spurious results that populate several publications, as well as respected textbooks and handbooks on matrix calculus. We examine these sources and results in a rigorous and concrete mathematical setting of a finite-dimensional inner-product space and discover the inherent flaw and also a remedy. We demonstrate two ways to calculate the derivative/gradient and second derivative for scalar functions of matrices defined over an arbitrary matrix subspace; the first method is by considering any (differentiable) extension to the space of square matrices and projection of its gradient onto the given subspace. The second method utilizes an ordered basis and computes each component of the gradient through evaluation of the directional derivative. All the ideas presented are illustrated by non-trivial examples, namely, considering the subspace of 3 × 3 circulant and Toeplitz matrices and presenting the results of gradient-descent with both the spurious and correct gradients. Moreover, our bibliography makes it clear that a rigorous approach to matrix calculus is not common in practice, and our presentation of matrix calculus in the language of inner-product spaces will be significant and meaningful for applied mathematicians, engineers and researchers working in inter-disciplinary fields to avoid the conceptual pitfalls that exist.

97 MATHEMATICS AND COMPUTING↗

What is the gradient of a scalar function defined on a subspace of square matrices?

We illustrate a technique to calculate the gradient of scalar functions that are defined on any arbitrary matrix subspace. It generalizes our earlier work titled “What is the gradient of a scalar function of a symmetric matrix ?”(Indian Journal of Pure and Applied Mathematics (2022), https://doi.org/10.1007/s13226-022-00313-x), in which we considered the special case of the subspace of symmetric matrices. Extant methods to calculate the gradient in such cases have an inherent flaw which leads to spurious results that populate several publications, as well as respected textbooks and handbooks on matrix calculus. Here, we examine these sources and results in a rigorous and concrete mathematical setting of a finite-dimensional inner-product space and discover the inherent flaw and also a remedy. We demonstrate two ways to calculate the derivative/gradient and second derivative for scalar functions of matrices defined over an arbitrary matrix subspace; the first method is by considering any (differentiable) extension to the space of square matrices and projection of its gradient onto the given subspace. The second method utilizes an ordered basis and computes each component of the gradient through evaluation of the directional derivative. All the ideas presented are illustrated by non-trivial examples, namely, considering the subspace of 3 x 3 circulant and Toeplitz matrices and presenting the results of gradient-descent with both the spurious and correct gradients. Moreover, our bibliography makes it clear that a rigorous approach to matrix calculus is not common in practice, and our presentation of matrix calculus in the language of inner-product spaces will be significant and meaningful for applied mathematicians, engineers and researchers working in inter-disciplinary fields to avoid the conceptual pitfalls that exist.

97 MATHEMATICS AND COMPUTING↗

Improved quantum algorithms for linear and nonlinear differential equations

We present substantially generalized and improved quantum algorithms over prior work for inhomogeneous linear and nonlinear ordinary differential equations (ODE). Specifically, we show how the norm of the matrix exponential characterizes the run time of quantum algorithms for linear ODEs opening the door to an application to a wider class of linear and nonlinear ODEs. In [1], a quantum algorithm for a certain class of linear ODEs is given, where the matrix involved needs to be diagonalizable. The quantum algorithm for linear ODEs presented here extends to many classes of non-diagonalizable matrices including singular matrices. The algorithm here is also exponentially faster than the bounds derived in [1] for certain classes of diagonalizable matrices. Our linear ODE algorithm is then applied to nonlinear differential equations using Carleman linearization (an approach taken recently by us in [2]). The improvement over that result is two-fold. First, we obtain an exponentially better dependence on error. This kind of logarithmic dependence on error has also been achieved by [3], but only for homogeneous nonlinear equations. Second, the present algorithm can handle any sparse matrix (that models dissipation) if it has a negative log-norm (including non-diagonalizable matrices), whereas [2] and [3] additionally require normality.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Derivation of K-matrix reaction theory in a discrete basis formalism

The usual derivations of the S and K matrices for two-particle reactions proceed through the Lippmann–Schwinger equation with formal definitions of the incoming and outgoing scattering states. Here we present a simpler alternative derivation that is carried out completely in the Hamiltonian representation, using a discrete basis of configurations for the scattering channels as well as the quasi-bound configurations of the combined fragments. We use matrix algebra to derive an explicit expression for the K matrix in terms of the Hamiltonian of the internal states of the compound system and the coupling between the channels and the internal states. The formula for the K matrix includes explicitly a real dispersive shift matrix to the internal Hamiltonian that is easily computed in the formalism. That expression is applied to derive the usual form of the S matrix as a sum over poles in the complex energy plane. Some extensions and limitations of the discrete-basis Hamiltonian formalism are discussed in the concluding remarks and in the Appendix.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

An Interior-Point Solver for Optimal Power Flow Problem Considering Distributed FACTS Devices

In this paper, we propose an AC optimal power flow (ACOPF) model considering distributed flexible AC transmission system (D-FACTS) devices, in which the reactance of D-FACTS equipped lines are introduced as decision variables. This is motivated by increasing interests in using D-FACTS devices to address system operational and cyber-security concerns. First, D-FACTS devices can be incorporated in real-time operations for economic benefits such as managing power congestions and reducing system losses. Second, D-FACTS devices can be utilized by moving target defense (MTD), an emerging concept against cyber-attacks, to prevent attackers from knowing true system configurations. Therefore, system operators can use the proposed ACOPF model to achieve economic benefits and provide the setpoints of D-FACTS devices for MTD at the same time. In addition, we rigorously derive the gradient and Hessian matrices of the objective function and constraints, which are further used to build an interior-point solver of the proposed ACOPF. Numerical results on the IEEE 118-bus transmission system show the validity of the proposed ACOPF model as well as the efficacy of the interior-point solver in minimizing system losses and generation costs.

Liu, Bo↗

Validation and Demonstration of Control System Functional Capabilities within the IES Plug-and-Play Simulation Environment

The concept of an integrated energy system (IES) is meant to combine different energy technologies in synergistic ways to achieve a more secure and economical energy supply. The RAVEN-based HYBRID framework is used to find the optimal installed capacity and the optimal economical dispatch of each component of the IES. The new RAVEN plugin for grid and capacity optimization (HERON) only addresses the limits that affect the production variables and the corresponding rates of variation (explicit constraints). However, other variables are subject to constraints, and the associated limits should be accounted for (implicit constraints). In particular, for the power dispatch problem, the optimization algorithm takes into account the limits on the electrical power output and the corresponding hourly power variations but does not consider other constraints on process variables whose response affects the service life of the IES. This report describes a scheme that allows accounting for implicit constraints without increasing the size of the optimization problem. To obtain a more accurate approximation of the nonlinear dynamic behavior, a parametric version of the dynamic mode decomposition with control (DMDc) algorithm was developed to derive the state-space representation matrices of the IES components at different scheduling parameter. Thanks to this approach, a more accurate approximation of the system response can be obtained, the limits imposed by thermal mechanical implicit constraints can be translated into power dispatch limits, and the feedbacks to HERON power dispatcher can be provided. To assess the developed methodology, a power dispatching test case composed of three power generating and storage units (Balance of Plant, Secondary Energy Source, Thermal Energy Storage) was developed. The power output of each one of the three units was optimized to meet the imposed time-dependent load demand trajectory and to maximize the IES profitability by meeting both the explicit and implicit constraints.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Quantum Theory of the Classical: Einselection, Envariance, Quantum Darwinism and Extantons

Core quantum postulates including the superposition principle and the unitarity of evolutions are natural and strikingly simple. I show that—when supplemented with a limited version of predictability (captured in the textbook accounts by the repeatability postulate)—these core postulates can account for all the symptoms of classicality. In particular, both objective classical reality and elusive information about reality arise, via quantum Darwinism, from the quantum substrate. This approach shares with the Relative State Interpretation of Everett the view that collapse of the wavepacket reflects perception of the state of the rest of the Universe relative to the state of observer’s records. However, our “let quantum be quantum” approach poses questions absent in Bohr’s Copenhagen Interpretation that relied on the preexisting classical domain. Thus, one is now forced to seek preferred, predictable, hence effectively classical but ultimately quantum states that allow observers keep reliable records. Without such (i) preferred basis relative states are simply “too relative”, and the ensuing basis ambiguity makes it difficult to identify events (e.g., measurement outcomes). Moreover, universal validity of quantum theory raises the issue of (ii) the origin of Born’s rule, p k =|ψ k | 2 , relating probabilities and amplitudes (that is simply postulated in textbooks). Last not least, even preferred pointer states (defined by einselection—environment—induced superselection)—are still quantum. Therefore, unlike classical states that exist objectively, quantum states of an individual system cannot be found out by an initially ignorant observer through direct measurement without being disrupted. So, to complete the ‘quantum theory of the classical’ one must identify (iii) quantum origin of objective existence and explain how the information about objectively existing states can appear to be essentially inconsequential for them (as it does for states in Newtonian physics) and yet matter in other settings (e.g., thermodynamics). I show how the mathematical structure of quantum theory supplemented by the only uncontroversial measurement postulate (that demands immediate repeatability—hence, predictability) leads to preferred states. These (i) pointer states correspond to measurement outcomes. Their stability is a prerequisite for objective existence of effectively classical states and for events such as quantum jumps. Events at hand, one can now enquire about their probability—the probability of a pointer state (or of a measurement record). I show that the symmetry of entangled states—(ii) entanglement—assisted invariance or envariance—implies Born’s rule. Envariance also accounts for the loss of phase coherence between pointer states. Thus, decoherence can be traced to symmetries of entanglement and understood without its usual tool—reduced density matrices. A simple and manifestly noncircular derivation of p k =|ψ k | 2 follows. Monitoring of the system by its environment in course of decoherence typically leaves behind multiple copies of its pointer states in the environment. Only pointer states can survive decoherence and can spawn such plentiful information-theoretic progeny. This (iii) quantum Darwinism allows observers to use environment as a witness—to find out pointer states indirectly, leaving systems of interest untouched. Quantum Darwinism shows how epistemic and ontic (coexisting in epiontic quantum state) separate into robust objective existence of pointer states and detached information about them, giving rise to extantons—composite objects with system of interest in the core and multiple records of its pointer states in the halo comprising of environment subsystems (e.g., photons) which disseminates that information throughout the Universe.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Sparse Cholesky factorization for solving nonlinear PDEs via Gaussian processes

In recent years, there has been widespread adoption of machine learning-based approaches to automate the solving of partial differential equations (PDEs). Among these approaches, Gaussian processes (GPs) and kernel methods have garnered considerable interest due to their flexibility, robust theoretical guarantees, and close ties to traditional methods. They can transform the solving of general nonlinear PDEs into solving quadratic optimization problems with nonlinear, PDE-induced constraints. However, the complexity bottleneck lies in computing with dense kernel matrices obtained from pointwise evaluations of the covariance kernel, and its partial derivatives, a result of the PDE constraint and for which fast algorithms are scarce. The primary goal of this paper is to provide a near-linear complexity algorithm for working with such kernel matrices. We present a sparse Cholesky factorization algorithm for these matrices based on the near-sparsity of the Cholesky factor under a novel ordering of pointwise and derivative measurements. The near-sparsity is rigorously justified by directly connecting the factor to GP regression and exponential decay of basis functions in numerical homogenization. We then employ the Vecchia approximation of GPs, which is optimal in the Kullback-Leibler divergence, to compute the approximate factor. This enables us to compute ϵ-approximate inverse Cholesky factors of the kernel matrices with complexity O(N log d (N/ϵ)) in space and O(N log 2d (N/ϵ)) in time. We integrate sparse Cholesky factorizations into optimization algorithms to obtain fast solvers of the nonlinear PDE. We numerically illustrate our algorithm’s near-linear space/time complexity for a broad class of nonlinear PDEs such as the nonlinear elliptic, Burgers, and Monge-Ampère equations. In summary, we provide a fast, scalable, and accurate method for solving general PDEs with GPs and kernel methods.

97 MATHEMATICS AND COMPUTING↗

Macromolecular gelatin properties affect fibrin microarchitecture and tumor spheroid behavior in fibrin-gelatin gels

The biophysical properties of extracellular matrices (ECM) are known to regulate cell behavior, however decoupling cell behavior changes due to the relative contributions of material microstructure versus biomechanics or nutrient permeability remains challenging, especially within complex, multi-material matrices. We developed four gelatin-fibrin interpenetrating network (IPN) formulations which are identical in composition but possess variable gelatin molecular weight distributions, and display differences in microstructure, biomechanics, and diffusivity. In this work we interrogate the response of multicellular tumor spheroids to these IPN formulations and found that a high stiffness, gelatin-network dominated IPNs impeded remodeling and invasion of multicellular tumor spheroids; whereas relatively lower stiffness, fibrin-network dominated IPNs permitted protease-dependent remodeling and spheroid invasion. Cell proliferation correlated to nutrient diffusivity across tested IPN formulations. These findings demonstrate the complexity of ECM IPNs, relative to single polymer matrices, and highlight that cell response does not derive from a single aspect of the ECM, but rather from the interplay of multiple biomechanical properties. The methodology developed in this study represents a framework for future studies which aim to characterize cellular phenotypic responses to biophysical cues present within complex, multi-material matrices.

36 MATERIALS SCIENCE↗

Evaluation of two-particle properties within finite-temperature self-consistent one-particle Green’s function methods: Theory and application to GW and GF2

One-particle Green’s function methods can model molecular and solid spectra at zero or non-zero temperatures. One-particle Green’s functions directly provide electronic energies and one-particle properties, such as dipole moment. However, the evaluation of two-particle properties, such as $\langle$S 2 $\rangle$ and $\langle$N 2 $\rangle$, can be challenging because they require a solution of the computationally expensive Bethe–Salpeter equation to find two-particle Green’s functions. We demonstrate that the solution of the Bethe–Salpeter equation can be completely avoided. Applying the thermodynamic Hellmann–Feynman theorem to self-consistent one-particle Green’s function methods, we derive expressions for two-particle density matrices in a general case and provide explicit expressions for GF2 and GW methods. Such density matrices can be decomposed into an antisymmetrized product of correlated one-electron density matrices and the two-particle electronic cumulant of the density matrix. Cumulant expressions reveal a deviation from ensemble representability for GW, explaining its known deficiencies. We analyze the temperature dependence of $\langle$S 2 $\rangle$ and $\langle$N 2 $\rangle$ for a set of small closed-shell systems. Interestingly, both GF2 and GW show a non-zero spin contamination and a non-zero fluctuation of the number of particles for closed-shell systems at the zero-temperature limit.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A Latent-Variable Formulation of the Poisson Canonical Polyadic Tensor Model: Maximum Likelihood Estimation and Fisher Information

We establish parameter inference for the Poisson canonical polyadic (PCP) tensor model through a latent-variable formulation. Our approach exploits the observation that any random PCP tensor can be derived by marginalizing an unobservable random tensor of one dimension larger. The loglikelihood of this larger dimensional tensor, referred to as the “complete” loglikelihood, is comprised of multiple rank one PCP loglikelihoods. Using this methodology, we first derive maximum likelihood estimators for the PCP model and demonstrate that several existing algorithms for fitting non-negative matrix and tensor factorizations are Expectation-Maximization algorithms. Next, we derive the observed and expected Fisher information matrices for the PCP model. The Fisher information provides us crucial insights into the well-posedness of the tensor model, such as the role that tensor rank plays in identifiability and indeterminacy. For the special case of rank one PCP models, we demonstrate that these results are greatly simplified.

97 MATHEMATICS AND COMPUTING↗

Bounds on Lorentz Violation Parameters in the DUNE Experiment

The Standard Model (SM) has been highly successful in describing fundamental interactions, yet phenomena like neutrino oscillations point to physics beyond its framework. Among the proposed extensions, Lorentz invariance violation (LIV) stands out as a compelling possibility. Long-baseline neutrino experiments such as DUNE, with its 1300 km baseline, offer a promising setting to test LIV effects with high precision. In this work, we evaluate DUNE s sensitivity to LIV by analyzing event rates and oscillation probabilities using the GLoBES framework. A custom implementation of LIV parameters was employed to derive bounds on the aa and cc matrices, identifying the parameter values that lead to a 10% deviation from the standard oscillation probability. Our results show partial agreement with previous studies for the aa parameters, while deviations in the cc parameters highlight the impact of differing methodologies and sensitivities. These findings reinforce the relevance of LIV searches and motivate further theoretical and experimental efforts in this direction.

Cruz, Thiago. [Tech. Fed. Parana U.]↗

Generalized Quasi-Static Mooring System Modeling with Analytic Jacobians

This paper presents a generalized and efficient method for quasi-static analysis of mooring systems, including complex scenarios such as when shared mooring lines interconnect multiple floating wind or wave energy devices. While quasi-static mooring models are well established, most published formulations are focused on specific applications, and no publicly available implementations provide efficient handling of large mooring system networks. The present formulation addresses these gaps by: (1) formulating solutions for edge cases not typically supported by quasi-static models; (2) creating a fully generalized model structure such that any combination of mooring lines, point masses, and floating bodies can be assembled; and (3) deriving analytic expressions for the system Jacobians (stiffness matrices) so that systems with many degrees of freedom can be solved efficiently. These techniques form the theory basis of MoorPy, an open-source mooring analysis library. The model is demonstrated on nine scenarios of increasing complexity with features of interest for offshore renewable energy applications. When compared with steady-state results from a lumped-mass dynamic model, the results show that the quasi-static formulation accurately calculates profiles and tensions and that its analytic approach provides more efficient and reliable computation of system stiffness matrices than finite-differencing methods. These results verify the accuracy of the MoorPy model.

16 TIDAL AND WAVE POWER↗

An accurate and efficient fragmentation approach via the generalized many-body expansion for density matrices

With relevant chemical space growing larger and larger by the day, the ability to extend computational tractability over that larger space is of paramount importance in virtually all fields of science. The solution we aim to provide here for this issue is in the form of the generalized many-body expansion for building density matrices (GMBE-DM) based on the set-theoretical derivation with overlapping fragments, through which the energy can be obtained by a single Fock build. In combination with the purification scheme and the truncation at the one-body level, the DM-based GMBE(1)-DM-P approach shows both highly accurate absolute and relative energies for medium-to-large size water clusters with about an order of magnitude better than the corresponding energy-based GMBE(1) scheme. Simultaneously, GMBE(1)-DM-P is about an order of magnitude faster than the previously proposed MBE-DM scheme [F. Ballesteros and K. U. Lao, J. Chem. Theory Comput. 18, 179 (2022)] and is even faster than a supersystem calculation without significant parallelization to rescue the fragmentation method. For even more challenging systems including ion–water and ion–pair clusters, GMBE(1)-DM-P also performs about 3 and 30 times better than the energy-based GMBE(1) approach, respectively. In addition, this work provides the first overlapping fragmentation algorithm with a robust and effective binning scheme implemented internally in a popular quantum chemistry software package. Thus, GMBE(1)-DM-P opens a new door to accurately and efficiently describe noncovalent clusters using quantum mechanics.

Chemistry↗

Training quantum neural networks using the quantum information bottleneck method

Abstract We provide in this paper a concrete method for training a quantum neural network to maximize the relevant information about a property that is transmitted through the network. This is significant because it gives an operationally well founded quantity to optimize when training autoencoders for problems where the inputs and outputs are fully quantum. We provide a rigorous algorithm for computing the value of the quantum information bottleneck quantity within error ε that requires O ( log 2 ⁡ ( 1 / ϵ ) + 1 / δ 2 ) queries to a purification of the input density operator if its spectrum is supported on { 0 } ⋃ [ δ , 1 − δ ] for δ > 0 and the kernels of the relevant density matrices are disjoint. We further provide algorithms for estimating the derivatives of the QIB function, showing that quantum neural networks can be trained efficiently using the QIB quantity given that the number of gradient steps required is polynomial.

Çatlı, Ahmet Burak (ORCID:0000000152294141)↗

Integrability Breaking from Backscattering

Herein we analyze the onset of diffusive hydrodynamics in the one-dimensional hard-rod gas subject to stochastic backscattering. While this perturbation breaks integrability and leads to a crossover from ballistic to diffusive transport, it preserves infinitely many conserved quantities corresponding to even moments of the velocity distribution of the gas. In the limit of small noise, we derive the exact expressions for the diffusion and structure factor matrices, and show that they generically have off diagonal components. We find that the particle density structure factor is non-Gaussian and singular near the origin, with a return probability showing logarithmic deviations from diffusion.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗