Search NASA⌕ Search

SEARCH · Search NASA

Results for “dynamic timing analysis”

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 793 records · Page 44

Validating a Dynamic PWR Safety and Security Model?

Nuclear power plants (NPPs) are assessed for safety and security using separate models that cannot capture how an attacker's decisions and a plant's response unfold together in real time, leaving regulators and operators without a complete picture of true plant vulnerability. Traditional probabilistic risk assessment (PRA) methods treat adversarial events as fixed initiators with predetermined outcomes, and are structurally incapable of representing the time-dependent interplay between physical security events, safety system response, and operator mitigative actions. At Idaho National Laboratory (INL), I contributed to the development and validation of Modeling and Analysis for Safety and Security using the Dynamic EMRALD Framework (MASS-DEF). Where static PRA relies on event-tree logic that cannot evolve mid-scenario, MASS-DEF couples a time-dependent dynamic PRA tool EMRALD (Event Modeling Risk Assessment using Linked Diagrams) with attack simulation software, allowing attacker behavior, plant system states, and operator actions to interact across time. My work focused on validating a general Pressurized Water Reactor (PWR) model. I traced model logic against PWR plant to identified errors in logic and confirm accuracy. I then built and tested attack scenarios against a general PWR model to verify that the model produced expected outcomes across all logical pathways. I also contributed a section to a related technical paper applying the same EMRALD platform to radiation dose modeling. Results show that MASS-DEF can quantitatively demonstrate that many plants exceed their regulatory security thresholds. This demonstrated margin provides a technically defensible basis for reducing the number of guards without compromising regulatory compliance. Physical security costs represent roughly 10% of annual operating budgets, making such reductions directly meaningful to INL's mission of sustaining existing commercial NPPs. This internship strengthened my understanding of nuclear systems, probabilistic modeling, and technical writing, and has solidified my pursuit of a career at a national laboratory.

98 - NUCLEAR DISARMAMENT, SAFEGUARDS, AND PHYSICAL↗

Constraining Numerical Geodynamo Modeling with Surface Observations

Numerical dynamo solutions have traditionally been generated entirely by a set of self-consistent differential equations that govern the spatial-temporal variation of the magnetic field, velocity field and other fields related to dynamo processes. In particular, those solutions are obtained with parameters very different from those appropriate for the Earth s core. Geophysical application of the numerical results therefore depends on correct understanding of the differences (errors) between the model outputs and the true states (truth) in the outer core. Part of the truth can be observed at the surface in the form of poloidal magnetic field. To understand these differences, or errors, we generate new initial model state (analysis) by assimilating sequentially the model outputs with the surface geomagnetic observations using an optimal interpolation scheme. The time evolution of the core state is then controlled by our MoSST core dynamics model. The final outputs (forecasts) are then compared with the surface observations as a means to test the success of the assimilation. We use the surface geomagnetic data back to year 1900 for our studies, with 5-year forecast and 20-year analysis periods. We intend to use the result; to understand time variation of the errors with the assimilation sequences, and the impact of the assimilation on other unobservable quantities, such as the toroidal field and the fluid velocity in the core.

Kuang, Weijia↗

A Right Transfer Access Control Model of Internet of Things Based on Smart Contract

Sensor nodes play a crucial role in the promotion of development of Internet of Things (IoT). Through this transaction, RO defines access control policies in script form based on ABAC's access control model to grant access right. The identity of all users in the model is identified by address. This paper builds a more flexible right transfer access control model by means of combining the Attribute-Based Access Control model (ABAC) and blockchain technology. Owing to the characteristics of ABAC’s attributes and right association, the massive problems of some sensor nodes can be solved. At the same time, for the sake of addressing the dynamic problems such as node access and right transfer, right transfer contract (TS) and access control contract (CS) are employed on the chain to ensure efficient and safe transmission of rights. To solve on-chain storage problems and ensure transparency of the operation, the idea of Rollup in Ethereum expansion is used to upload the final state of protocol policy and right exchange to the chain. Any user can know the policy and current right transfer status at any time. Finally, comparative and security analysis show that the model presented here can solve IoT devices’ massive and dynamic problems more effectively and it is more secure than the traditional models.

Wang, Jiuru↗

Extending the Capabilities of the Mooring Analysis Program: A Survey of Dynamic Mooring Line Theories for Integration into FAST: Preprint

Techniques to model dynamic mooring lines come in various forms. The most widely used models include either a heuristic representation of the physics (such as a Lumped-Mass, LM, system), a Finite-Element Analysis (FEA) discretization of the lines (discretized in space), or a Finite-Difference (FD) model (which is discretized in both space and time). In this paper, we explore the features of the various models, weigh the advantages of each, and propose a plan for implementing one dynamic mooring line model into the open-source Mooring Analysis Program (MAP). MAP is currently used as a module for the FAST offshore wind turbine computer-aided engineering (CAE) tool to model mooring systems quasi-statically, although dynamic mooring capabilities are desired. Based on the exploration in this manuscript, the lumped-mass representation is selected for implementation in MAP based on its simplicity, computational cost, and ability to provide similar physics captured by higher-order models.

17 WIND ENERGY↗

Ionization-induced dynamics of laser-matter interaction in a focused laser pulse: A comparative analysis

We study the laser-matter interaction via optical-field ionization of a medium in a focused ultrashort laser pulse by means of the finite-difference-time-domain modeling of Maxwell's equations. General aspects of the ionization-induced dynamics with TE- and TM-polarized laser pulses are analyzed. It is shown that there are two qualitatively different regimes of the interaction depending on the angle of the laser beam focusing. At comparatively low angles plasma distributions are smooth; however, due to departure from the quasioptical behavior of light rays in self-generated plasma, lateral large-scaled plasma structures can also be produced, leading to additional beam focusing and correspondingly to higher electron densities. At tight focusing, small-scaled plasma structures are generated that strongly influence field distribution, energy deposition, and scattering characteristics. The influence of electron collisions and the Kerr effect are also analyzed.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Nuclear magnetic relaxation, correlation time spectrum, and molecular dynamics in a linear polymer

The pulsed nuclear magnetic resonance (NMR) method at a proton frequency of 25 MHz at temperatures of 22-160{sup o}C is used to detect the transverse magnetization decay in polyisoprene rubbers with various molecular masses, to determine the NMR damping time T{sub 2}, and to measure spin-lattice relaxation time T{sub 1} and time T{sub 2eff} of damping of solid-echo signals under the action of a sequence of MW-4 pulses modified by introducing 180{sup o} pulses. The dispersion dependences of T{sub 2eff} obtained for each temperature are combined into one using the temperature-frequency equivalence principle. On the basis of the combined dispersion dependence of T{sub 2eff} and the data on T{sub 2} and T{sub 1}, the correlation time spectrum of molecular movements is constructed. Analysis of the shape of this spectrum shows that the dynamics of polymer molecules can be described in the first approximation by the Doi-Edwards tube-reptation model.

36 MATERIALS SCIENCE↗

Precursory signatures of protein folding/unfolding: From time series correlation analysis to atomistic mechanisms

Folded conformations of proteins in thermodynamically stable states have long lifetimes. Before it folds into a stable conformation, or after unfolding from a stable conformation, the protein will generally stray from one random conformation to another leading thus to rapid fluctuations. Brief structural changes therefore occur before folding and unfolding events. These short-lived movements are easily overlooked in studies of folding/unfolding for they represent momentary excursions of the protein to explore conformations in the neighborhood of the stable conformation. The present study looks for precursory signatures of protein folding/unfolding within these rapid fluctuations through a combination of three techniques: (1) ultrafast shape recognition, (2) time series segmentation, and (3) time series correlation analysis. The first procedure measures the differences between statistical distance distributions of atoms in different conformations by calculating shape similarity indices from molecular dynamics simulation trajectories. The second procedure is used to discover the times at which the protein makes transitions from one conformation to another. Finally, we employ the third technique to exploit spatial fingerprints of the stable conformations; this procedure is to map out the sequences of changes preceding the actual folding and unfolding events, since strongly correlated atoms in different conformations are different due to bond and steric constraints. The aforementioned high-frequency fluctuations are therefore characterized by distinct correlational and structural changes that are associated with rate-limiting precursors that translate into brief segments. Guided by these technical procedures, we choose a model system, a fragment of the protein transthyretin, for identifying in this system not only the precursory signatures of transitions associated with α helix and β hairpin, but also the important role played by weaker correlations in such protein folding dynamics.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A fast recursive algorithm for molecular dynamics simulation

The present recursive algorithm for solving molecular systems' dynamical equations of motion employs internal variable models that reduce such simulations' computation time by an order of magnitude, relative to Cartesian models. Extensive use is made of spatial operator methods recently developed for analysis and simulation of the dynamics of multibody systems. A factor-of-450 speedup over the conventional O(N-cubed) algorithm is demonstrated for the case of a polypeptide molecule with 400 residues.

Jain, A.↗

Evidence of progress. Measurement of impacts of Australia's S and L program from 1990-2010

Australia first put categorical energy efficiency labels on residential appliances in the mid-1980s, and the first Minimum Energy Performance Standards (MEPS) for refrigerators was implemented in 1999. Updated in 2005, these MEPS were aligned with US 2001 levels. Considered together, these actions set Australia apart as having one of the most aggressive appliance efficiency programs in the world. For these reasons, together with good data on product sales over time, Australia represents a potentially fruitful case study for understanding the dynamics energy efficiency standards and labeling (EES and L) programs impacts on appliance markets. This analysis attempts to distinguish between the impacts of labeling alone as opposed to MEPS, and to probe the time-dependency of such impacts. Fortunately, in the Australian case, detailed market sales data and a comprehensive registration system provides a solid basis for the empirical evaluation of these questions. This paper analyzes Australian refrigerator efficiency data covering the years 1993-2009. Sales data was purchased from a commercial market research organization (in this case, the GfK Group) and includes sales and average price in each year for each appliance model – this can be used to understand broader trends by product class and star rating category, even where data is aggregated. Statistical regression analysis is used to model market introduction and adoption of high efficiency refrigerators according to logistic adoption model formalism, and parameterizes the way in which the Australian programs accelerated adoption of high-efficiency products and phased out others. Through this analysis, the paper presents a detailed, robust and quantitative picture of the impacts of EES and L in the Australian case, but also demonstrates a methodology of the evaluation of program impacts that could form the basis of an international evaluation framework for similar programs in other countries.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Data Locality Enhancement of Dynamic Simulations for Exascale Computing (Final Report)

The development of modern processors exhibits two trends that complicate the optimizations of modern software. The first is the increasing sensitivity of processors' throughput to irregularities in computation. With more processors produced through a massive integration of simple cores, future systems will increasingly favor regular data-level parallel computations, but deviate from the needs of applications with complex patterns. Some evidences are already shown on Graphic Processing Units (GPU): Irregular data accesses (e.g., indirect references A[D[i]]) and conditional branches are limiting many GPU applications' performance at a level an order of magnitude lower than the peak of GPU. The second hardware trend is the growing gap between memory bandwidth and the aggregate speed—that is, the sum of all cores' computing power—of a Chip Multiprocessor (CMP). Despite the capped growth of the peak CPU speed, the aggregate speed of a CMP keeps increasing as more cores get into a single chip. It is expected that by 2018, node concurrency in an exascale system will increase by hundreds of times, whereas, memory bandwidth will expand by only 10 to 20 times. Consequently, data movement and storage is expected to consume more than 70% of the total system power. Bridging this gap is difficult; the complexities of modern CMP memory hierarchy make it even harder: Data cache becomes shared among computing units, and the sharing is often non-uniform—whether two computing units share a cache depends on their proximity and the level of the cache. On the recent IBM Power7 architecture, for instance, four hardware contexts (or SMT threads) in a core share the entire memory hierarchy, all cores in one chip share an on-chip L3 cache, and cores across chips share L3 and main memory through off-chip connections. These two trends complicate the translation of computing power into performance, especially for a program with either intensive data accesses or complex patterns in data accesses or control flow paths. Unfortunately, both attributes present and will persist in a class of important applications. For instance, many scientific simulations deal with a large volume of data. And meanwhile, as most real-world processes are non-uniform and evolving (e.g., the evolution of a galaxy or the process of a drug injection), both the computations and data accesses of these programs tend to be irregular and dynamically changing. Currently, the lack of support to these applications on modern CMP severely limits their performance. On GPU, as our recent study shows and other studies echo, performance enhancement of a factor of integers is possible when memory accesses or control flows are streamlined for a set of GPU applications. On multicore CPU, our studies show that traditional locality enhancement, for being oblivious to the new features of multicore memory hierarchy, may even cause large slowdown to data-intensive dynamic applications. The severity of the issues is expected to worsen as the two hardware trends continue. Some recent studies try to match software with the trends, but in a limited scope or manner. For irregularities on GPU, most studies focus on irregularities analyzable through static analysis (e.g., data accesses in regular loops). Dynamic irregularities are harder to address because the needed analysis and transformations typically have to happen at run time. Some other research resorts to hardware extensions, an actual adoption of which is unclear for the entailed space cost and complexity. For data locality, recent years have seen some exploitations of the new memory hierarchy on multicore for performance, but most of them are on process or thread scheduling, rather than program transformations. Our recent study reveals that program-level transformations may magnify the scheduling benefits by a factor of seven, concluding that program-level transformation should play a central role for data locality enhancement on modern CMP. But research in this direction has been sparse, and most have focused on data layout or cache performance modeling, rather than program transformations to match with the new memory hierarchy features. Overall, it is still an open question how to bridge the gap between dynamic computations and the two prominent properties of modern processors. The goal of this project is to develop a set of techniques and software tools to enhance the matching between memory accesses in dynamic simulations and the prominent features of modern and future CMP, alleviating the memory performance issues for petascale and exascale computing. This report summarizes the discoveries and products produced throughout this project. It includes free launch, a new software approach to overcoming the shortcomings of both methods; coherence-free multiview, an approach that allows multiple views of a single data object to co-exist on GPU memory during a GPU kernel execution; algorithmic optimizations to data analytics problems, especially those that involve lots of distance calculations. Supporting dynamic parallelism is important for GPU to benefit a broad range of applications. There are currently two fundamental ways for programs to exploit dynamic parallelism on GPU: a software-based approach with software-managed worklists, and a hardware-based approach through dynamic subkernel launches. Neither is satisfactory. The former is complicated to program and is often subject to some load imbalance; the latter suffers large runtime overhead. In this work, we propose free launch, a new software approach to overcoming the shortcomings of both methods. It allows programmers to use subkernel launches to express dynamic parallelism. It employs a novel compiler-based code transformation named subkernel launch removal to replace the subkernel launches with the reuse of parent threads. Coupled with an adaptive task assignment mechanism, the transformation reassigns the tasks in the subkernels to the parent threads with a good load balance. The technique requires no hardware extensions, immediately deployable on existing GPUs. It keeps the programming convenience of the subkernel launch-based approach while avoiding its large runtime overhead. Meanwhile, its superior load balancing makes it outperform manual worklist-based techniques by 3X on average. The work was published at the 48th Annual IEEE/ACM International Symposium on Microarchitecture (Micro'2015). A Graphic Processing Unit (GPU) system is typically equipped with many types of memory (e.g., global, constant, texture, shared, cache). Data placement determines what data are placed on which type of memory, essential for GPU memory performance. Prior optimizations of data placement always require a single view of a data object on memory, which limits the optimization effectiveness. In this work, we propose coherence-free multiview, an approach that allows multiple views of a single data object to co-exist on GPU memory during a GPU kernel execution. We demonstrate that under certain conditions, the multiple views can remain incoherent while facilitating enhanced data placement. We present a theorem and some compiler support to ensure the soundness of the usage of coherence-free multiview. We further develop reference-discerning data placement, a new way to enhance data placements on GPU. It enables more flexible data placements by using coherence-free multiview to leverage the slack in coherence requirement of some GPU programs. Experiments on three types of GPU systems show that, with less than 200KB space cost, the new data placement technique can provide a 1.6X average (up to 4.27X) speedup. In addition, we have examined algorithmic optimizations to data analytics problems, especially those that involve lots of distance calculations. Computing distances among data points is an essential part of many important algorithms in data analytics, graph analysis, and other domains. In each of these domains, developers have spent significant manual effort optimizing algorithms, often through novel applications of the triangle equality, in order to minimize the number of distance computations in the algorithms. In this work, we observe that many algorithms across these domains can be generalized as an instance of a generic distance-related abstraction. Based on this abstraction, we derive seven principles for correctly applying the triangular inequality to optimize distance-related algorithms. Guided by the findings, we develop Triangular OPtimizer (TOP), the first software framework that is able to automatically produce optimized algorithms that either matches or outperforms manually designed algorithms for solving distance-related problems. TOP achieves up to 237x speedups and 2.5X on average. The work has been published at the 32nd International Conference on Machine Learning (ICML'15) and the 41st International Conference on Very Large Data Bases (VLDB'15).

42 ENGINEERING↗

Analysis of Flow-System Starting Dynamics of Turbopump-Fed Liquid-Propellant Rocket

Two rocket configurations with turbopump drive were investigated analytically. In one configuration the inlet pressure to the turbine was fixed at the design value. The second configuration employed a "bootstrap" technique for supplying energy to the turbine. An injector was the chief resistance between the pump and the rocket combustion chamber. From the analysis two parameters were developed from which the speed response time of the turbopump, the flow response time, and the maximum dynamic line loss could be evaluated. These parameters were functions of turbopump moment of inertia, design performance of the turbine, and flow-system geometry. The moment of inertia of the turbopump and the ratio of turbine torque at zero speed to design torque had the most influence on the starting dynamics of the flow system. These parameters were also applicable to the bootstrap configuration as long as the inlet pressure to the turbine exceeded half the design value.

Krebs, Richard P.↗

Measurement-informed Dynamic Aggregation of Distribution Systems

This paper proposes a measurement-informed dynamic aggregation methodology in order to create equivalent representations of distribution systems that are compatible with large-scale transmission analysis. By optimizing an equivalent feeder parameters using time-series measurements of active power, reactive power, and voltage at the Point of Interconnection (POI), the approach yields simplified yet dynamically accurate equivalents. Implemented in PSCAD with models of photovoltaic–battery systems, three-phase motors, and static loads, the method employs hybrid differential evolution and bounded least-squares optimization laying the foundation for for real-time state estimation and optimized sensor placement in distribution networks.

Ahmed, Kazi Ishrak [University of Tennessee, Knoxv↗

Sensitivity analysis on chaotic dynamical systems by Non-Intrusive Least Squares Shadowing (NILSS)

This paper develops the Non-Intrusive Least Squares Shadowing (NILSS) method, which computes the sensitivity for long-time averaged objectives in chaotic dynamical systems. In NILSS, we represent a tangent solution by a linear combination of one inhomogeneous tangent solution and several homogeneous tangent solutions. Next, we solve a least squares problem using this representation; thus, the resulting solution can be used for computing sensitivities. NILSS is easy to implement with existing solvers. In addition, for chaotic systems with many degrees of freedom but few unstable modes, NILSS has a low computational cost. NILSS is applied to two chaotic PDE systems: the Lorenz 63 system and a CFD simulation of flow over a backward-facing step. In both cases, the sensitivities computed by NILSS reflect the trends in the long-time averaged objectives of dynamical systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

3-D CFD Simulation and Validation of Oxygen-Rich Hydrocarbon Combustion in a Gas-Centered Swirl Coaxial Injector using a Flamelet-Based Approach

Injector design is a critical part of the development of a rocket Thrust Chamber Assembly (TCA). Proper detailed injector design can maximize propulsion efficiency while minimizing the potential for failures in the combustion chamber. Traditional design and analysis methods for hydrocarbon-fuel injector elements are based heavily on empirical data and models developed from heritage hardware tests. Using this limited set of data produces challenges when trying to design a new propulsion system where the operating conditions may greatly differ from heritage applications. Time-accurate, Three-Dimensional (3-D) Computational Fluid Dynamics (CFD) modeling of combusting flows inside of injectors has long been a goal of the fluid analysis group at Marshall Space Flight Center (MSFC) and the larger CFD modeling community. CFD simulation can provide insight into the design and function of an injector that cannot be obtained easily through testing or empirical comparisons to existing hardware. However, the traditional finite-rate chemistry modeling approach utilized to simulate combusting flows for complex fuels, such as Rocket Propellant-2 (RP-2), is prohibitively expensive and time consuming even with a large amount of computational resources. MSFC has been working, in partnership with Streamline Numerics, Inc., to develop a computationally efficient, flamelet-based approach for modeling complex combusting flow applications. In this work, a flamelet modeling approach is used to simulate time-accurate, 3-D, combusting flow inside a single Gas Centered Swirl Coaxial (GCSC) injector using the flow solver, Loci-STREAM. CFD simulations were performed for several different injector geometries. Results of the CFD analysis helped guide the design of the injector from an initial concept to a tested prototype. The results of the CFD analysis are compared to data gathered from several hot-fire, single element injector tests performed in the Air Force Research Lab EC-1 test facility located at Edwards Air Force Base.

Richardson, Brian↗

An Improved Analysis of Forest Carbon Dynamics using Data Assimilation

There are two broad approaches to quantifying landscape C dynamics - by measuring changes in C stocks over time, or by measuring fluxes of C directly. However, these data may be patchy, and have gaps or biases. An alternative approach to generating C budgets has been to use process-based models, constructed to simulate the key processes involved in C exchange. However, the process of model building is arguably subjective, and parameters may be poorly defined. This paper demonstrates why data assimilation (DA) techniques - which combine stock and flux observations with a dynamic model - improve estimates of, and provide insights into, ecosystem carbon (C) exchanges. We use an ensemble Kalman filter (EnKF) to link a series of measurements with a simple box model of C transformations. Measurements were collected at a young ponderosa pine stand in central Oregon over a 3-year period, and include eddy flux and soil C02 efflux data, litterfall collections, stem surveys, root and soil cores, and leaf area index data. The simple C model is a mass balance model with nine unknown parameters, tracking changes in C storage among five pools; foliar, wood and fine root pools in vegetation, and also fresh litter and soil organic matter (SOM) plus coarse woody debris pools. We nested the EnKF within an optimization routine to generate estimates from the data of the unknown parameters and the five initial conditions for the pools. The efficacy of the DA process can be judged by comparing the probability distributions of estimates produced with the EnKF analysis vs. those produced with reduced data or model alone. Using the model alone, estimated net ecosystem exchange of C (NEE)= -251 f 197g Cm-2 over the 3 years, compared with an estimate of -419 f 29gCm-2 when all observations were assimilated into the model. The uncertainty on daily measurements of NEE via eddy fluxes was estimated at 0.5gCm-2 day-1, but the uncertainty on assimilated estimates averaged 0.47 g Cm-2 day-1, and only exceeded 0.5gC m-2 day-1 on days where neither eddy flux nor soil efflux data were available. In generating C budgets, the assimilation process reduced the uncertainties associated with using data or model alone and the forecasts of NEE were statistically unbiased estimates. The results of the analysis emphasize the importance of time series as constraints. Occasional, rare measurements of stocks have limited use in constraining the estimates of other components of the C cycle. Long time series are particularly crucial for improving the analysis of pools with long time constants, such as SOM, woody biomass, and woody debris. Long-running forest stem surveys, and tree ring data, offer a rich resource that could be assimilated to provide an important constraint on C cycling of slow pools. For extending estimates of NEE across regions, DA can play a further important role, by assimilating remote-sensing data into the analysis of C cycles. We show, via sensitivity analysis, how assimilating an estimate of photosynthesis - which might be provided indirectly by remotely sensed data - improves the analysis of NEE.

Williams, Mathew↗

Time correlations from steady-state expectation values

Recovering properties of correlation functions is typically challenging. On one hand, experimentally, it requires measurements with a temporal resolution finer than the system's dynamics. On the other hand, analytical or numerical analysis requires solving the system evolution. Here, we use recent results of quantum metrology with continuous measurements to derive general lower bounds on the relaxation and second-order correlation times that are both easy to calculate and measure. These bounds are based solely on steady-state expectation values and their derivatives with respect to a control parameter, and can be readily extended to the autocorrelation of arbitrary observables. We validate our method on two examples of critical quantum systems: a critical driven-dissipative resonator, where the bound matches analytical results for the dynamics, and the infinite-range Ising model, where only the steady state is solvable and thus the bound provides information beyond the reach of existing analytical approaches. Our results can be applied to experimentally characterize ultrafast systems, and to theoretically analyze many-body models with dynamics that are analytically or numerically hard.

Górecki, Wojciech [INFN, Pavia]↗

Time correlations from steady-state expectation values

Recovering properties of correlation functions is typically challenging. On one hand, experimentally, it requires measurements with a temporal resolution finer than the system's dynamics. On the other hand, analytical or numerical analysis requires solving the system evolution. Here, we use recent results of quantum metrology with continuous measurements to derive general lower bounds on the relaxation and second-order correlation times that are both easy to calculate and measure. These bounds are based solely on steady-state expectation values and their derivatives with respect to a control parameter, and can be readily extended to the autocorrelation of arbitrary observables. We validate our method on two examples of critical quantum systems: a critical driven-dissipative resonator, where the bound matches analytical results for the dynamics, and the infinite-range Ising model, where only the steady state is solvable and thus the bound provides information beyond the reach of existing analytical approaches. Our results can be applied to experimentally characterize ultrafast systems, and to theoretically analyze many-body models with dynamics that are analytically or numerically hard.

Górecki, Wojciech [INFN, Pavia]↗

Quantum coherent plasmon in silver nanowires: A real-time TDDFT study

A plasmon-like phenomenon, arising from coinciding resonant excitations of different electronic characteristics in 1D silver nanowires, has been proposed based on theoretical linear absorption spectra. Such a molecular plasmon holds the potential for anisotropic nanoplasmonic applications. However, its dynamical nature remains unexplored. In this work, quantum dynamics of longitudinal and transverse excitations in 1D silver nanowires are carried out within the real-time time-dependent density functional theory framework. The anisotropic electron dynamics confirm that the transverse transitions of different electronic characteristics are collective in nature and oscillate in-phase with respect to each other. Analysis of the time evolutions of participating one-electron wave functions suggests that the transverse transitions form a coherent wave packet that gives rise to a strong plasmon resonance at the molecular level.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗