Search NASA⌕ Search

SEARCH · Search NASA

Results for “problem solving complexity”

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 469 records · Page 26
All sourcesNASA NTRSDOE OSTI
DOE OSTI2026

A Decomposition-Based Learn-To-Optimize Approach with Feasibility Layer Assistance for Sub-Hourly Unit Commitment

Sub-hourly unit commitment (UC) with 15-min intervals is gaining significant attention as a way to respond rapidly to the fluctuations in electricity supply and demand introduced by renewable resources. However, the increased temporal resolution and complex inter-temporal dependencies pose substantial computational challenges for traditional optimization methods. To this end, this paper explores a decomposition-based learn-to-optimize approach. Building on recent advances in machine learning, our method revisits the long- overlooked Lagrangian relaxation framework, which is a classical decomposition technique that enables tractable subproblem solving. These smaller subproblems are inherently well-suited for machine learning, as their reduced dimensionality and structural regularity allow predictive models to efficiently learn and generalize solution patterns. We thus propose a generic predictive model, which embeds Gated Recurrent Units (GRUs) and Attention in the encoder-decoder structure, and integrate a rule-based feasibility layer to capture temporal dependencies, reduce training effort, and improve feasibility w.r.t. unit-level constraints. Our method has been validated on the IEEE 118-bus system, demonstrating promising performance in solving sub-hourly UC problems efficiently and feasibly.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

MatCal Users Guide: Release 1.3.0

Any continuum mechanics model will require three components: (1) a discretized geometry of the boundary value problem being studied, (2) the partial differential equations to be solved, and (3) the initial conditions and boundary conditions for the problem. To describe material behavior in these computational models, material models contribute to (2) the underlying equations and, occasionally, to (3) the initial conditions for the simulation. These material models can exhibit a mathematical form that is empirically based, based on first principles, or developed from both empirical observations and known physics. In general, these models are meant to represent a class of materials with well understood behavior. As a result, material models have parameters that must be tuned or calibrated so that the model response matches characterization data available for the specific material it is intended to represent when used to simulate a specific system. For simple models, such as isotropic, linear elastic materials in solid mechanics, this calibration process can be a simple analytical calculation directly extracting the parameters from experimental measurements. For complex models that have many inputs and require many characterization datasets to adequately identify the material behavior, the model calibration process can require an inverse problem approach where an optimization is performed to tune the model parameters to the available data.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Tunable-fidelity wave functions for the ab initio description of scattering and reactions

Here, the no-core shell model (NCSM) is an ab initio method that solves the nuclear many-body problem by expanding the many-particle wave function into a (typically) harmonic oscillator basis and minimizing the energy to obtain the expansion coefficients. Extensions of the NCSM, such as its coupling with microscopic-cluster basis states, further allow for an ab initio treatment of light-ion nuclear reactions of interest for both astrophysics and nuclear technology applications. A downside of the method is the exponential scaling of the basis size with increasing number of nucleons and excitation quanta, which limits its applicability to mass A ≲ 16 nuclei, except for variants where the basis is further down-selected via some truncation scheme. We consider a basis selection method for the NCSM that was first introduced in the context of the large-scale shell model and captures the essential degrees of freedom of the nuclear wave function leading to a favorable complexity scaling for calculations and enabling ab initio reaction calculations in sd-shell nuclei. The particle configurations within the NCSM basis are ordered based on their contribution to the first moment of the Hamiltonian matrix that results from the projection onto the many-body basis. The truncation scheme then consists in retaining only the lowest-first-moment configurations, which typically contain only few many-body basis states (Slater determinants). As the energy threshold above which configurations are disregarded is increased, the size of the basis becomes an almost-continuous variable, allowing for tunable fidelity in the obtained wave functions. The resulting wave functions can then be used directly in ab initio reaction calculations. We present calculations for 7 Li and n + 12 C scattering using nucleon-nucleon interactions derived from chiral effective field theory and softened using the similarity renormalization group method. The obtained energy levels invariably demonstrate exponential convergence with the size of the basis, and we find improved convergence in scattering calculations. To demonstrate the possibilities enabled by the approach, we also present a first calculation for the scattering of neutrons from 24 Mg. The method presented in this work appears promising for future studies of nuclei with mass A > 16, opening multiple future research directions impacting both nuclear astrophysics and nuclear technology applications.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2026

Quantum Time-Space Tradeoffs for Matrix Problems

We consider the time and space required for quantum computers to solve a wide variety of problems involving matrices, many of which have only been analyzed classically in prior work. Our main results show that for a range of linear algebra problems—including matrix-vector product, matrix inversion, matrix multiplication and powering—existing classical time-space tradeoffs, several of which are tight for every space bound, also apply to quantum algorithms with at most a constant factor loss. For example, for almost all fixed matrices 𝐴, including the discrete Fourier transform matrix, we prove that quantum circuits with at most 𝑇 input queries and 𝑆 qubits of memory require 𝑇 = Ω⁢(𝑛 2 /𝑆) to compute matrix-vector product 𝐴⁢𝑥 for 𝑥 ∈{0,1 𝑛 . We similarly prove that matrix multiplication for 𝑛 ×𝑛 binary matrices requires 𝑇 = Ω⁢(𝑛 3 /$\sqrt{𝑆}$). Because many of our lower bounds are matched by deterministic algorithms with the same time and space complexity, our results show that quantum computers cannot provide any asymptotic advantage for these problems with any space bound. We obtain matching lower bounds for the stronger notion of quantum cumulative memory complexity—the sum of the space per layer of a circuit. We also consider Boolean (i.e., AND-OR) matrix multiplication and matrix-vector products, improving the previous quantum time-space tradeoff lower bounds for 𝑛 × 𝑛 Boolean matrix multiplication to 𝑇 = Ω⁢(𝑛 2.5 /𝑆 1/4 ) from 𝑇 = Ω⁢(𝑛 2.5 /𝑆 1/2 ). Our improved lower bound for Boolean matrix multiplication is based on a new coloring argument that extracts more from the strong direct product theorem that was the basis for prior work. To obtain our tight lower bounds for linear algebra problems, we require much stronger bounds than strong direct product theorems. We obtain these bounds by adding a new bucketing method to the quantum recording-query technique of Zhandry that lets us apply classical arguments to upper bound the success probability of quantum circuits.

lower bounds↗
DOE OSTI2025

LuGo: An enhanced quantum phase estimation implementation

Quantum Phase Estimation (QPE) is a cardinal algorithm in quantum computing that plays a crucial role in various applications, including cryptography, molecular simulation, and solving systems of linear equations. However, the standard implementation of QPE faces challenges related to time complexity and circuit depth, which limit its practicality for large-scale computations. We introduce LuGo, a novel framework designed to enhance the performance of QPE by reducing circuit duplication, as well as using parallelization techniques to achieve faster generation of the QPE circuit and gate reduction. We validate the effectiveness of our framework by generating quantum linear solver circuits, which require both QPE and inverse QPE, to solve linear systems of equations. LuGo achieves significant improvements in both computational efficiency and hardware requirements without compromising on accuracy. Compared to a standard QPE implementation, LuGo reduces time consumption to generate a circuit that solves a 2 6 × 2 6 system matrix by a factor of 50.68 and over 31× reduction of quantum gates and circuit depth, with no fidelity loss on an ideal quantum simulator. Furthermore, we demonstrated the versatility and scalability of LuGo enabled HHL algorithm by simulating a canonical Hele-Shaw fluid problem using a quantum simulator. With these advantages, LuGo paves the way for more efficient implementations of QPE, enabling broader applications across several quantum computing domains.

Quantum algorithm↗
DOE OSTI2025

Ab-initio simulation of spin-vibronic spectra of methoxy radical

Despite the fact that experimental and theoretical work on the spectrum of methoxy has stretched from the microwave to the ultraviolet and proceeded for nearly 50 years, parts of the spectrum have remained a challenge to simulate theoretically and make reliable line-by-line assignments. The spectral complexity arises because the radical has a non-zero electron spin and significant vibronic coupling between the two elec- tronic components of the ground state due to the presence of a conical intersection. This work describes a completely ab initio effort to understand and assign the spin- vibronic levels of the X 2E state from 0 to above 3000 cm−1, a region that includes the fundamental transitions of the C-H symmetric and asymmetric stretches that have not previously been identified uniquely. A potential energy surface for methoxy was calculated at the EOM-CCSDT/ANO1 level of theory. Subsequently this potential energy surface was fit to a quartic power series expansion of all nine vibrational nor- mal coordinates (as determined at the minimum of the conical intersection) by the use of a machine-learning-based algorithm. After the addition of spin-orbit coupling, the spin-vibronic problem was solved using both the Krylov-Schur and Lanczos algorithms with the SOCJT3 software to converge eigenvalues up to 3500 cm−1 and their eigen- vectors. The latter were used, in conjunction with the calculated dipole moment and its derivatives (calculated using finite differences at EOM-CCSDT/ANO1 level), to determine spectral intensities for the spin-vibronic spectra. The calculated transition frequencies and intensities were used to simulate and assign the observed transitions of the spin-vibronic spectra of the radical. The credibility of the assignments and their significance is discussed in detail.

Sharma, Ketan [University of Florida, Gainesville,↗
DOE OSTI2021

Variational, stable, and self-consistent coupling of 3D electromagnetics to 1D transmission lines in the time domain

This work presents a new multiscale method for coupling the 3D Maxwell's equations to the 1D telegrapher's equations. While Maxwell's equations are appropriate for modeling complex electromagnetics in arbitrary-geometry domains, simulation cost for many applications (e.g. pulsed power) can be dramatically reduced by representing less complex transmission line regions of the domain with a 1D model. By assuming a transverse electromagnetic (TEM) ansatz for the solution in a transmission line region, we reduce the Maxwell's equations to the telegrapher's equations. Here, we propose a self-consistent finite element formulation of the fully coupled system that uses boundary integrals to couple between the 3D and 1D domains and supports arbitrary unstructured 3D meshes. Additionally, by using a Lagrange multiplier to enforce continuity at the coupling interface, we allow for an absorbing boundary condition to also be applied to non-TEM modes on this boundary. We demonstrate that this feature reduces non-physical reflection and ringing of non-TEM modes off of the coupling boundary. By employing implicit time integration, we ensure a stable coupling, and we introduce an efficient method for solving the resulting linear systems. We demonstrate the accuracy of the new method on two verification problems, a transient O-wave in a rectilinear prism and a steady-state problem in a coaxial geometry, and show the efficiency and weak scalability of our implementation on a cold test of the Z-machine MITL and post-hole convolute.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

The dynamical state of RXCJ1230.7+3439: A multi-substructured merging galaxy cluster

We analyse the kinematical and dynamical state of the galaxy cluster RXCJ1230.7+3439 (RXCJ1230), at $z$ = 0.332 using 93 new spectroscopic redshifts of galaxies acquired at the Telescopio Nazionale Galileo and from SDSS DR16 public data. We study the density galaxy distribution retrieved from photometric SDSS multiband data and find that RXCJ1230 appears as a clearly isolated peak in the redshift space, with a global line-of-sight (LOS) velocity dispersion of $σ$ v = 1004 -122 +147 km s -1 . Several tests applied to the spatial and velocity distributions reveal that RXCJ1230 is a complex system with the presence of three subclusters, located to the southwest, east, and south with respect to the main body of the cluster, containing several bright galaxies (BGs) in their respective cores. Our analyses confirm that the three substructures are in a pre-merger phase, where the main interaction takes place with the southwest subclump, almost in the plane of the sky. We compute a velocity dispersion of $σ$ v ~ 1000 and $σ$ v ~ 800 km s -1 for the main cluster and the southwest substructure, respectively. The central main body and southwest substructure differ by ~870 km s -1 in the LOS velocity. From these data, we estimate a dynamical mass of $M$ 200 = 9.0 ± 1.5 × 1014 $M$ ⊙ and 4.4 ± 3.3 × 1014 $M$ ⊙ for the RXCJ1230 main body and southwest clump, respectively, which reveals that the cluster will undergo a merger characterised by a 2:1 mass ratio impact. We solve a two-body problem for this interaction and find that the most likely solution suggests that the merging axis lies ~17° from the plane of the sky and the subcluster will fully interact in ~0.3 Gyr. However, a slight excess in the X-ray temperature observed in the southwest clump confirms a certain degree of interaction already. The comparison between the dynamical masses and those derived from X-ray data reveals good agreement within errors (differences ~15%), which suggests that the innermost regions (< r 500 ) of the galaxy clumps are almost in hydrostatical equilibrium. In summary, RXCJ1230 is a young but also massive cluster in a pre-merging phase accreting other galaxy systems from its environment.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2022

Comprehensive uncertainty quantification (UQ) for full engineering models by solving probability density function (PDF) equation

This report details a new method for propagating parameter uncertainty (forward uncertainty quantification) in partial differential equations (PDE) based computational mechanics applications. The method provides full-field quantities of interest by solving for the joint probability density function (PDF) equations which are implied by the PDEs with uncertain parameters. Full-field uncertainty quantification enables the design of complex systems where quantities of interest, such as failure points, are not known apriori. The method, motivated by the well-known probability density function (PDF) propagation method of turbulence modeling, uses an ensemble of solutions to provide the joint PDF of desired quantities at every point in the domain. A small subset of the ensemble is computed exactly, and the remainder of the samples are computed with approximation of the driving (dynamics) term of the PDEs based on those exact solutions. Although the proposed method has commonalities with traditional interpolatory stochastic collocation methods applied directly to quantities of interest, it is distinct and exploits the parameter dependence and smoothness of the dynamics term of the governing PDEs. The efficacy of the method is demonstrated by applying it to two target problems: solid mechanics explicit dynamics with uncertain material model parameters, and reacting hypersonic fluid mechanics with uncertain chemical kinetic rate parameters. A minimally invasive implementation of the method for representative codes SPARC (reacting hypersonics) and NimbleSM (finite- element solid mechanics) and associated software details are described. For solid mechanics demonstration problems the method shows order of magnitudes improvement in accuracy over traditional stochastic collocation. For the reacting hypersonics problem, the method is implemented as a streamline integration and results show very good accuracy for the approximate sample solutions of re-entry flow past the Apollo capsule geometry at Mach 30.

42 ENGINEERING↗
DOE OSTI2025

Identifying environmentally induced calibration changes in cryogenic RF axion detector systems using deep neural networks

The axion is a compelling hypothetical particle that could account for the dark matter in our universe while simultaneously solving the strong CP problem in quantum chromodynamics. The most sensitive axion detection technique demonstrated so far makes use of a high Q cavity immersed in a strong magnetic field, where axions are converted to microwave photons. This is called an axion haloscope and has primarily targeted the 1–10 GHz range. As searches scan up in axion mass, toward the parameter space favored by theoretical predictions, individual cavity sizes decrease in order to achieve higher frequencies. This shrinking cavity volume translates directly to a loss in signal-to-noise, motivating the plan to replace individual cavity detectors with arrays of cavities. When the transition from one to (N) multiple cavities occurs, haloscope searches are anticipated to become much more complicated to operate, requiring N times as many measurements but also the new requirement that N detectors operate in unison, which can be achieved by locking them to a common frequency. To offset this anticipated increase in detector complexity, we aim to develop new tools for diagnosing experiments using neural networks. Current experiments monitor scattering parameters of their receiver for periodically measuring cavity quality factor and coupling. However, off-resonant data remain relatively useless. In this paper, we ask if it is possible that off-resonant information contained in vector network analyzer scans could be used to diagnose equipment failures/anomalies and measure physical conditions (e.g., temperatures and ambient magnetic field). We demonstrate a proof-of-concept that AI techniques can help manage the complexity of an axion haloscope search for operators.

Engel, Andrew W. [Pacific Northwest National Labor↗
DOE OSTI2023

Neuroevolution Application to Collaborative and Heuristics-Based Connected and Autonomous Vehicle Cohort Simulation at Uncontrolled Intersection

Artificial intelligence is gaining tremendous attractiveness and showing great success in solving various problems, such as simplifying optimal control derivation. This work focuses on the application of Neuroevolution to the control of Connected and Autonomous Vehicle (CAV) cohorts operating at uncontrolled intersections. The proposed method implementation’s simplicity, thanks to the inclusion of heuristics and effective real-time performance are demonstrated. The resulting architecture achieves nearly ideal operating conditions in keeping the average speeds close to the speed limit. It achieves twice as high mean speed throughput as a controlled intersection, hence enabling lower travel time and mitigating energy inefficiencies from stop-and-go vehicle dynamics. Low deviation from the road speed limit is hence continuously sustained for cohorts of at most 50 m long. This limitation can be mitigated with additional lanes that the cohorts can split into. The concept also allows the testing and implementation of fast-turning lanes by simply replicating and reconnecting the control architecture at each new road crossing, enabling high scalability for complex road network analysis. The controller is also successfully validated within a high-fidelity vehicle dynamic environment, showing its potential for driverless vehicle control in addition to offering a new traffic control simulation model for future autonomous operation studies.

Jacquelin, Frederic (ORCID:0000000183154344)↗
DOE OSTI2025

Multi-head physics-informed neural networks for learning functional priors and uncertainty quantification

In numerous applications, the integration of prior knowledge and historical information is essential, particularly for tasks requiring the solution of ordinary or partial differential equations (ODEs/PDEs) in data-sparse or noisy environments. For instance, achieving accurate solutions to time-dependent PDEs with limited initial condition measurements necessitates an effective strategy for embedding prior knowledge. Hard-parameter sharing architectures in neural networks (NNs) have demonstrated success in both traditional and scientific machine learning domains, facilitating the learning of informative representations. Here, in this study, we introduce a novel, yet efficient, method to enhance physics-informed neural networks (PINNs) by incorporating a multi-head structure that enables the learning of functional priors from both empirical data and governing physical laws. This prior information can then be used to address data sparsity and high-level noise in solving ODE/PDE problems with uncertainty quantification (UQ). The approach, termed Multi-Head PINN (MH-PINN), consists of a shared body NN and multiple head NNs, each corresponding to an individual PINN instance. Our framework for functional prior learning is carried out in two stages: (1) training the MH-PINNs to develop a shared body NN alongside multiple head NNs, and (2) employing these trained head NNs to estimate a prior distribution through a normalizing flow-based density estimator. The learned functional prior can then be applied as a regularization mechanism in deterministic contexts or as an informative prior within a Bayesian inference framework, aiding in the resolution of subsequent ODE/PDE tasks. We evaluate the efficacy of MH-PINNs across five benchmark problems, including a high-dimensional parametric PDE, all characterized by data sparsity or substantial noise levels. Our findings reveal that MH-PINNs deliver accurate solutions and robust UQ, demonstrating adaptability across a range of complex and challenging scenarios.

Bayesian inference↗
DOE OSTI2025

Backpropagation-based learning with local derivative approximation and memory replay in biologically plausible neural systems

When learning, the brain modifies individual synaptic connections to reach a desired behavior. Animal and human brains have been shown to be incredibly capable of learning complex and varied functions across a wide variety of tasks. In recent years, artificial neural networks, inspired by human and animal brains, have shown great capabilities in learning a wide variety of difficult tasks. However, artificial neural networks primarily teach themselves through the use of backpropagation, a learning method which has no clear analogue within the brain. Additionally, Artificial Neural Networks primarily use continuous activation functions, which differ significantly from the spiking neuronal behavior present in the brain. In this paper, we discuss and demonstrate a biologically plausible learning method that approximates backpropagation through two techniques on Spiking Neural Networks. First, we show that the local temporal derivatives that are necessary for backpropagation can be approximately recovered through reconstruction using spike timings. Second, we show that through learning during a sleep phase, inspired by neuroscience research into memory replay, the localized parallel feedback path can learn to approximate the derivative through the forward path weight matrix, thus solving the weight transport problem. Lastly, we demonstrate that the combination of these two methods can approach or exceed the accuracy of backpropagation-based methods for a variety of neuromorphic vision tasks while maintaining biological plausibility.

42 ENGINEERING↗
DOE OSTI2022

Uncertainty-Informed Operation Coordination in a Water-Energy Nexus

The widespread deployment of smart heterogeneous technologies and the growing complexity in our modern society calls for effective coordination of the interdependent lifeline networks. In particular, operation coordination of electric power and water infrastructures is urgently needed as the water system is one of the most energy-intensive networks, an interruption in which may quickly evolve into a dramatic societal concern. This paper develops a novel analytic for uncertainty-aware day-ahead operation optimization of the interconnected power and water systems (PaWS). Joint probabilistic constraint (JPC) programming is employed to capture the uncertainties in wind resources and water demand forecasts. The proposed integrated stochastic model is presented as a non-linear non-convex optimization problem, where the non-linear hydraulic constraints in the water network are linearized using piece-wise linearization technique, and the non-convexity is efficiently tackled with a solution methodology to convert the proposed model with JPCs to a tractable mixed-integer linear programming (MILP) formulation that can be quickly solved to optimality. Here, the suggested framework is applied to a 15-node commercial-scale water network jointly operated with a power transmission system using a modified IEEE 57-bus test system. The numerical results demonstrate the of the proposed stochastic framework, resulting in cost reduction (13% on average when compared to the traditional setting) and energy saving of the integrated model under different realizations of uncertain renewable energy sources (RESs) and water demand scenarios. Additionally, the scalability of the proposed model is tested on a modified IEEE 118-bus test system connected to five water networks.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2021

Utilizing computer vision and artificial intelligence algorithms to predict and design the mechanical compression response of direct ink write 3D printed foam replacement structures

Additive Manufacturing (AM) of porous polymeric materials, such as foams, recently became a topic of intensive research due their unique combination of low density, impressive mechanical properties, and stress dissipation capabilities. Conventional methods for fabricating foams rely on complex and stochastic processes, making it challenging to achieve precise architectural control of structured porosity. In contrast, AM provides access to a wide range of printable materials, where precise spatial control over structured porosity can be modulated during the fabrication process enabling the production of foam replacement structures (FRS). Current approaches for designing FRS are based on intuitive understanding of their properties or an extensive number of finite element method (FEM) simulations. These approaches, however, are computationally expensive and time consuming. As such, in this work, we present a novel methodology for determining the mechanical compression response of direct ink write (DIW) 3D printed FRS using a simple cross-sectional image. By obtaining measurement data for a relatively small number of samples, an artificial neural network (ANN) was trained, and a computer vision algorithm was used to make inferences about foam compression characteristics from a single cross-sectional image. Finally, a genetic algorithm (GA) was used to solve the inverse design problem, generating the AM printing parameters that an engineer should use to achieve a desired compression response from a DIW printed FRS. The methods developed herein present an avenue for entirely autonomous design and analysis of additively manufactured structures using artificial intelligence.

36 MATERIALS SCIENCE↗
DOE OSTI2020

Robust Online Sequential RVFLNs for Data Modeling of Dynamic Time-Varying Systems with Application of an Ironmaking Blast Furnace

In a world where the increasing complexity of modern industrial processes brings difficulties for accurate mathematical modeling, taking advantage of data has become an efficient solution to complex dynamic process modeling issue. In this paper, we develop a novel robust online sequential version of random vector functional-link networks (RVFLNs) for data-driven modeling of dynamic time-varying system and applied it in a blast furnace (BF) ironmaking process. First, to overcome the time-varying dynamics of process and to enable the RVFLNs to learn online with avoiding data saturation, an improved online sequential version of RVFLNs (OS-RFVLNs) is first presented by online sequential learning with forgetting factor. This improved OS-RVFLNs algorithm is not only suitable for the real-time and large data transfer situation, but also can adjust the sensitivity of the algorithm to different samples with the help of the introduced forgetting factor. Second, since the output weights of the improved OS-RVFLNs as well as other RVFLNs algorithms are obtained by the least squares approach, a robustness problem may occur when the training dataset is contaminated with various outliers. To solve this problem, a Cauchy distribution weighted M-estimator is introduced to improve the robustness of the improved OS- RVFLNs. For this proposed robust OS-RVFLNs (R-OS- RVFLNs), since the weights of different outlier data are properly determined by the Cauchy distribution function, their corresponding contribution on modeling can be properly distinguished. Thus robust and better modeling results can be achieved. Experiments using actual industrial data of BF ironmaking process and comparative studies have demonstrated that the proposed method produces a better estimation accuracy and stronger robustness than other methods.

Blast furnace (BF), Modelling, Dynamic systems↗
DOE OSTI2021

Stellar and Accretion Disk Parameters of the Close Binary HD 50526

We present a photometric and spectroscopic study of HD 50526, an ellipsoidal binary member of the group Double Periodic Variable stars. Performing data mining in photometric surveys and conducting new spectroscopic observations with several spectrographs during 2008–2015, we obtained orbital and stellar parameters of the system. The radial velocities were analyzed with the genetic PIKAIA algorithm, whereas Doppler tomography maps for the Hα and Hβ lines were constructed with the Total Variation Minimization code. An optimized simplex algorithm was used to solve the inverse problem adjusting the light curve with the best stellar parameters for the system. We find an orbital period of 6.ͩ701 ± 0.ͩ001 and a long photometric cycle of 191 ± 2 days. We detected the spectral features of the coldest star and modeled it with a logg=2.79±0.02 dex giant of mass 1.13 ± 0.02 M {sub ⊙} and effective temperature 10500 ± 125 K. In addition, we determine a mass ratio q = 0.206 ± 0.033 and that the hot star is a B-type dwarf of mass 5.48 ± 0.02 M {sub ⊙}. The V-band orbital light curve can be modeled including the presence of an accretion disk around the hotter star. This fills the Roche lobe of the hotter star and has a radius 14.74 ± 0.02 R {sub ⊙} and the temperature at the outer edge is 9400 K. Two bright spots located in the disk account for the global morphology of the light curve. The Doppler tomography maps of Hα and Hβ reveal complex structures of mass fluxes in the system.

79 ASTRONOMY AND ASTROPHYSICS↗