Search NASA⌕ Search

SEARCH · Search NASA

Results for “subspace method”

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 91 records · Page 5

A parallel additive Schwarz preconditioned Jacobi-Davidson algorithm for polynomial eigenvalue problems in quantum dot simulation

We develop a parallel Jacobi-Davidson approach for finding a partial set of eigenpairs of large sparse polynomial eigenvalue problems with application in quantum dot simulation. A Jacobi-Davidson eigenvalue solver is implemented based on the Portable, Extensible Toolkit for Scientific Computation (PETSc). The eigensolver thus inherits PETSc's efficient and various parallel operations, linear solvers, preconditioning schemes, and easy usages. The parallel eigenvalue solver is then used to solve higher degree polynomial eigenvalue problems arising in numerical simulations of three dimensional quantum dots governed by Schroedinger's equations. We find that the parallel restricted additive Schwarz preconditioner in conjunction with a parallel Krylov subspace method (e.g. GMRES) can solve the correction equations, the most costly step in the Jacobi-Davidson algorithm, very efficiently in parallel. Besides, the overall performance is quite satisfactory. We have observed near perfect superlinear speedup by using up to 320 processors. The parallel eigensolver can find all target interior eigenpairs of a quintic polynomial eigenvalue problem with more than 32 million variables within 12 minutes by using 272 Intel 3.0 GHz processors.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Uncertainty Quantification, Sensitivity Analysis, and Data Assimilation for Nuclear Systems Simulation

Reliable evaluation of nuclear data will play a major role in reduction of nuclear systems simulation uncertainties via the use of advanced sensitivity analysis (SA), uncertainty quantification (UQ), and data assimilation (DA) methodologies. This follows since nuclear data have proven to constitute a major source of neutronics uncertainties. This paper will overview the use of the Efficient Subspace Method (ESM), developed at NCSU, to overcome one of the main deficiencies of existing methodologies for SA/UQ/DA, that is the ability to handle codes with large input and output (I/O) data streams, where neither the forward nor the adjoint approach alone are appropriate. We demonstrate the functionality of ESM for an LWR core, a boiling water reactor, and a fast reactor benchmark experiment, the ZPR6/7A assembly. This work demonstrates the capability of adjusting cross section data thereby providing guidance to cross section evaluation efforts by identification of key cross sections and associated energy ranges that contribute the most to the propagated core attributes uncertainties.

99 GENERAL AND MISCELLANEOUS↗

Fast-forwarding quantum simulation with real-time quantum Krylov subspace algorithms

Quantum subspace diagonalization (QSD) algorithms have emerged as a competitive family of algorithms that avoid many of the optimization pitfalls associated with parameterized quantum circuit algorithms. While the vast majority of the QSD algorithms have focused on solving the eigenpair problem for ground, excited-state, and thermal observable estimation, there has been a lot less work in considering QSD algorithms for the problem of quantum dynamical simulation. In this work, we propose several quantum Krylov fast-forwarding (QKFF) algorithms capable of predicting long-time dynamics well beyond the coherence time of current quantum hardware. Our algorithms use real-time evolved Krylov basis states prepared on the quantum computer and a multi-reference subspace method to ensure convergence towards high-fidelity, long-time dynamics. In particular, we show that the proposed multi-reference methodology provides a systematic way of trading off circuit depth with classical post-processing complexity. Further, we also demonstrate the efficacy of our approach through numerical implementations for several quantum chemistry problems including the calculation of the auto-correlation and dipole moment correlation functions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Loschmidt-echo approach to error estimation in Krylov-subspace approximation

The Krylov subspace method is a traditional approach to approximate quantum evolution, allowing us to treat systems with large Hilbert spaces. Despite its popularity, current bounds typically overestimate the error, which translates into more expensive simulation routines. Here, in this paper, we tackle this problem by realizing that the error can be understood as a Loschmidt echo in a one-dimensional (1D) noninteracting tight-binding Hamiltonian. We show that the different time regimes of the approximation can be understood using simple physical ideas. More importantly, we obtain computationally cheap error bounds that describe with high precision the actual error in the approximation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Stochastic quantum Krylov protocol with double-factorized Hamiltonians

Here we propose a class of randomized quantum Krylov diagonalization (rQKD) algorithms capable of solving the eigenstate estimation problem with modest quantum resource requirements. Compared to previous real-time evolution quantum Krylov subspace methods, our approach expresses the time evolution operator e –i$\widehat{H}$$\tau$ as a linear combination of unitaries and subsequently uses a stochastic sampling procedure to reduce circuit depth requirements. While our methodology applies to any Hamiltonian with fast-forwardable subcomponents, we focus on its application to the explicitly double-factorized electronic-structure Hamiltonian. To demonstrate the potential of the proposed rQKD algorithm on near-term quantum devices, we provide numerical benchmarks for a variety of molecular systems with circuit-based state-vector simulators including the effects of sampling noise, achieving ground-state energy errors of less than 1 kcal mol -1 with circuit depths orders of magnitude shallower than those required for low-rank deterministic Trotter-Suzuki decompositions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Sparsity-Independent Lyapunov Exponent in the Sachdev-Ye-Kitaev Model

The saturation of a recently proposed universal bound on the Lyapunov exponent has been conjectured to signal the existence of a gravity dual. This saturation occurs in the low-temperature limit of the dense Sachdev-Ye-Kitaev (SYK) model, N Majorana fermions with q body ( q > 2 ) infinite-range interactions. We calculate certain out-of-time-order correlators (OTOCs) for N ≤ 64 fermions for a highly sparse SYK model and find no significant dependence of the Lyapunov exponent on sparsity up to near the percolation limit where the Hamiltonian breaks up into blocks. This provides strong support to the saturation of the Lyapunov exponent in the low-temperature limit of the sparse SYK. A key ingredient to reaching N = 64 is the development of a novel quantum spin model simulation library that implements highly optimized matrix-free Krylov subspace methods on graphical processing units. This leads to a significantly lower simulation time as well as vastly reduced memory usage over previous approaches, while using modest computational resources. Strong sparsity-driven statistical fluctuations require both the use of a much larger number of disorder realizations with respect to the dense limit and a careful finite size scaling analysis. The saturation of the bound in the sparse SYK points to the existence of a gravity analog that would enlarge substantially the number of field theories with this feature. Published by the American Physical Society 2024

Physics↗

A Shift Selection Strategy for Parallel Shift-invert Spectrum Slicing in Symmetric Self-consistent Eigenvalue Computation

The central importance of large-scale eigenvalue problems in scientific computation necessitates the development of massively parallel algorithms for their solution. Recent advances in dense numerical linear algebra have enabled the routine treatment of eigenvalue problems with dimensions on the order of hundreds of thousands on the world’s largest supercomputers. In cases where dense treatments are not feasible, Krylov subspace methods offer an attractive alternative due to the fact that they do not require storage of the problem matrices. However, demonstration of scalability of either of these classes of eigenvalue algorithms on computing architectures capable of expressing massive parallelism is non-trivial due to communication requirements and serial bottlenecks, respectively. In this work, we introduce the SISLICE method: a parallel shift-invert algorithm for the solution of the symmetric self-consistent field (SCF) eigenvalue problem. The SISLICE method drastically reduces the communication requirement of current parallel shift-invert eigenvalue algorithms through various shift selection and migration techniques based on density of states estimation and k-means clustering, respectively. This work demonstrates the robustness and parallel performance of the SISLICE method on a representative set of SCF eigenvalue problems and outlines research directions that will be explored in future work.

97 MATHEMATICS AND COMPUTING↗

Exploring the Sensitivity of Photosynthesis and Stomatal Resistance Parameters in a Land Surface Model

Abstract Land surface models, like the Common Land Model component of the ParFlow integrated hydrologic model (PF-CLM), are used to estimate transpiration from vegetated surfaces. Transpiration rates quantify how much water moves from the subsurface through the plant and into the atmosphere. This rate is controlled by the stomatal resistance term in land surface models. The Ball–Berry stomatal resistance parameterization relies, in part, on the rate of photosynthesis, and together these equations require the specification of 20 input parameters. Here, the active subspace method is applied to 2100 year-long PF-CLM simulations, forced by atmospheric data from California, Colorado, and Oklahoma, to identify which input parameters are important and how they relate to three quantities of interest: transpiration, stomatal resistance from the sunlit portion of the canopy, and stomatal resistance from the shaded portion. The slope (mp) and intercept (bp) parameters associated with the Ball–Berry parameterization are consistently important for all locations, along with five parameters associated with ribulose bisphosphate carboxylase/oxygenase (RuBisCO)- and light-limited rates of photosynthesis [CO2 Michaelis–Menten constant at 25°C (kc25), maximum ratio of oxygenation to carboxylation (ocr), quantum efficiency at 25°C (qe25), maximum rate of carboxylation at 25°C (vcmx25), and multiplier in the denominator of the equation used to compute the light-limited rate of photosynthesis (wj1)]. The importance of these input parameters, quantified by the active variable weight, and the relationship between the input parameters and quantities of interest vary seasonally and diurnally. Input parameter values influence transpiration rates most during midday, summertime hours when fluxes are large. This research informs model users about which photosynthesis and stomatal resistance parameters should be more carefully selected. Quantifying sensitivities associated with the stomatal resistance term is necessary to better understand transpiration estimates from land surface models.

54 ENVIRONMENTAL SCIENCES↗

Understanding performance variability in standard and pipelined parallel Krylov solvers

In this work, we collect data from runs of Krylov subspace methods and pipelined Krylov algorithms in an effort to understand and model the impact of machine noise and other sources of variability on performance. We find large variability of Krylov iterations between compute nodes for standard methods that is reduced in pipelined algorithms, directly supporting conjecture, as well as large variation between statistical distributions of runtimes across iterations. Based on these results, we improve upon a previously introduced nondeterministic performance model by allowing iterations to fluctuate over time. We present our data from runs of various Krylov algorithms across multiple platforms as well as our updated non-stationary model that provides good agreement with observations. We also suggest how it can be used as a predictive tool.

97 MATHEMATICS AND COMPUTING↗

Generalized Perturbation Theory-Free Sensitivity Analysis for Eigenvalue Problems

Generalized perturbation theory (GPT) has been recognized as the most computationally efficient approach for performing sensitivity analysis for models with many input parameters, which renders forward sensitivity analysis computationally overwhelming. In critical systems, GPT involves the solution of the adjoint form of the eigenvalue problem with a response-dependent fixed source. Although conceptually simple to implement, most neutronics codes that can solve the adjoint eigenvalue problem do not have a GPT capability unless envisioned during code development. We introduce in this manuscript a reduced-order modeling approach based on subspace methods that requires the solution of the fundamental adjoint equations but allows the generation of response sensitivities without the need to set up GPT equations, and that provides an estimate of the error resulting from the reduction. Moreover, the new approach solves the eigenvalue problem independently of the number or type of responses. This allows for an efficient computation of sensitivities when many responses are required. This paper introduces the theory and implementation details of the GPT-free approach and describes how the errors could be estimated as part of the analysis. The applicability is demonstrated by estimating the variations in the flux distribution everywhere in the phase space of a fast critical sphere and a high-temperature gas-cooled reactor prismatic lattice. The variations generated by the GPT-free approach are benchmarked to the exact variations generated by direct forward perturbations.

99 GENERAL AND MISCELLANEOUS↗

Initial Exploration of the Use of Mixed Precision in Iterative Solvers (B639388 Subcontract Quarter I Report)

The first quarter of the project was primarily spent identifying potential projects at the intersection of finite precision analysis, mixed precision computation, and Krylov subspace methods. We summarize our findings in the remainder of the document. Other activities include attending biweekly xSDK meetings as well as contributing material to the technical report and journal versions of the multiprecision landscape paper. The subsequent quarter will be spent selecting a subset of the described projects to focus on, performing initial numerical experiments to evaluate the potential for the use of mixed precision, and developing initial theoretical analysis.

97 MATHEMATICS AND COMPUTING↗

Quantification of Back-End Nuclear Fuel Cycle Metrics Uncertainties Due to Cross Sections

This work examines uncertainties in the back end fuel cycle metrics of isotopic composition, decay heat, radioactivity, and radiotoxicity. Most advanced fuel cycle scenarios, including the ones represented in this work, are limited by one or more of these metrics, so that quantification of them becomes of great importance in order to optimize or select one of these scenarios. Uncertainty quantification, in this work, is performed by propagating cross-section covariance data, and later number density covariance data, through a reactor physics and depletion code sequence. Propagation of uncertainty is performed primarily via the Efficient Subspace Method (ESM). ESM decomposes the covariance data into singular pairs and perturbs input data along independent directions of the uncertainty and only for the most significant values of that uncertainty. Results of these perturbations being collected, ESM directly calculates the covariance of the observed output posteriori. By exploiting the rank deficient nature of the uncertainty data, ESM works more efficiently than traditional stochastic sampling, but is shown to produce equivalent results. ESM is beneficial for very detailed models with large amounts of input data that make stochastic sampling impractical. In this study various fuel cycle scenarios are examined. Simplified, representative models of pressurized water reactor (PWR) and boiling water reactor (BWR) fuels composed of both uranium oxide and mixed oxides are examined. These simple models are intended to give a representation of the uncertainty that can be associated with open uranium oxide fuel cycles and closed mixed oxide fuel cycles. The simplified models also serve as a demonstration to show that ESM and stochastic sampling produce equivalent results, because these models require minimum computer resources and have amounts of input data small enough such that either method can be quickly implemented and a numerical experiment performed. The simplified models are followed by more rigorous reactor physics and depletion models showing a PWR uranium oxide fuel and various metal fast reactor fuels composed of transuranics. The more rigorous models include multi-group cross sections, multiple burnup steps, neutron transport calculations to update cross sections, and multi-scale multi-physics code sequences to simulate a complete fuel lifetime. Finally, the fast reactor and PWR fuels are combined in a closed fast reactor recycle fuel cycle, and uncertainties on the resulting equilibrium cycle examined.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Materials Design using an Active Subspace-based Batch Bayesian Optimization Approach

Integrated computational materials engineering (ICME) calls for integrating simulation tools and/or experiments to develop new materials and materials systems. However, implementation of ICME approaches is challenging mainly due to the considerable computational expense of such frameworks and large dimensionality of the design space. Addressing these challenges is thus critical to the success of ICME initiatives. We present here a specific Bayesian optimization framework designed to address these two challenges. In particular, we propose an active subspace batch Bayesian optimization framework. The framework makes use of dimension reduction via the active subspace method and makes use of the ability to query in parallel via the batch Bayesian optimization approach. Here, the integration of these techniques leads to significant efficiency improvements while maintaining accuracy.

36 MATERIALS SCIENCE↗

Equation-Free Coarse Control of Distributed Parameter Systems via Local Neural Operators

The control of high-dimensional distributed parameter systems (DPS) remains a challenge when explicit coarse-grained equations are unavailable. Classical equation-free (EF) approaches rely on fine-scale simulators treated as black-box timesteppers. However, repeated simulations for steady-state computation, linearization, and control design are often computationally prohibitive, or the microscopic timestepper may not even be available, leaving us with data as the only resource. We propose a data-driven alternative that uses local neural operators, trained on spatiotemporal microscopic/mesoscopic data, to obtain efficient short-time solution operators. These surrogates are employed within Krylov subspace methods to compute coarse steady and unsteady-states, while also providing Jacobian information in a matrix-free manner. Krylov-Arnoldi iterations then approximate the dominant eigenspectrum, yielding reduced models that capture the open-loop slow dynamics without explicit Jacobian assembly. Both discrete-time Linear Quadratic Regulator (dLQR) and pole-placement (PP) controllers are based on this reduced system and lifted back to the full nonlinear dynamics, thereby closing the feedback loop.

93B52, 93C20, 47N70, 65J15, 65M32, 68T07, 68T20, 6↗

A Shift Selection Strategy for Parallel Shift-Invert Spectrum Slicing in Symmetric Self-Consistent Eigenvalue Computation

The central importance of large scale eigenvalue problems in scientific computation necessitates the development massively parallel algorithms for their solution. Recent advances in dense numerical linear algebra have enabled the routine treatment of eigenvalue problems with dimensions on the order of hundreds of thousands on the world's largest supercomputers. In cases where dense treatments are not feasible, Krylov subspace methods offer an attractive alternative due to the fact that they do not require storage of the problem matrices. However, demonstration of scalability of either of these classes of eigenvalue algorithms on computing architectures capable of expressing excessive parallelism is non-trivial due to communication requirements and serial bottlenecks, respectively. In this work, we introduce the SISLICE method: a parallel shift-invert algorithm for the solution of the symmetric self-consistent field (SCF) eigenvalue problem. The SISLICE method drastically reduces the communication requirement of current parallel shift-invert eigenvalue algorithms through various shift selection and migration techniques based on density of states estimation and k-means clustering, respectively. This work demonstrates the robustness and parallel performance of the SISLICE method on a representative set of SCF eigenvalue problems and outlines research directions which will be explored in future work.

97 MATHEMATICS AND COMPUTING↗

Valence : A Massively Parallel Implementation of the Variational Subspace Valence Bond Method

This work describes the software package, Valence, for the calculation of molecular energies using the variational subspace valence bond (VSVB) method. VSVB is an ab initio electronic structure method based on nonorthogonal orbitals. Important features of practical value include high parallel scalability, wave functions that can be constructed automatically by combining orbitals from previous calculations, and ground and excited states that can be modeled with a single configuration or determinant. Here, the open-source software package includes tools to generate wave functions, a database of generic orbitals, example input files, and a library build intended for integration with other packages. We also present the interface to an external software package, enabling the computation of optimized molecular geometries and vibrational frequencies.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Two-Level Least Squares Methods in Krylov Subspaces

Two-level least squares acceleration approaches are applied to the Chebyshev acceleration method and the restarted conjugate residual method in solving systems of linear algebraic equations with sparse unsymmetric coefficient matrices arising from finite volume or finite element approximations of boundary-value problems on irregular grids. Application of the proposed idea to other iterative restarted processes also is considered. The efficiency of the algorithms suggested is investigated numerically on a set of model Dirichlet problems for the convection-diffusion equation.

97 MATHEMATICS AND COMPUTING↗

On Coarse Grid Correction Methods in Krylov Subspaces

Two approaches using coarse grid correction in the course of a certain Krylov iterative process are presented. The aim of the correction is to accelerate the iterations. These approaches are based on an approximation of the function sought for by simple basis functions having finite supports. Additional acceleration can be achieved if the iterative process is restarted and the approximate solution is refined. In this case, the resulting process turns out to be a two-level preconditioned method. The influence of different parameters of the iterative process on its convergence is demonstrated by numerical results.

97 MATHEMATICS AND COMPUTING↗