Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “error vector”

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 145 records · Page 8
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

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↗
DOE OSTI2021

Solar Transposition Modeling via Deep Neural Networks With Sky Images

This article presents a notable advance toward the development of a new method of increasing the single-axis tracking photovoltaic (PV) system power output by improving the determination and near-term prediction of the optimum module tilt angle. The tilt angle of the plane receiving the greatest total irradiance changes with Sun position and atmospheric conditions including cloud formation and movement, aerosols, and particulate loading, as well as varying albedo within a module's field of view. In this article, we present a multi-input convolutional neural network that can create a profile of plane-of-array irradiance versus surface tilt angle over a full 180° arc from horizon to horizon. As input, the neural network uses the calculated solar position and clear-sky irradiance values, along with sky images. The target irradiance values are provided by the multiplanar irradiance sensor (MPIS). In order to account for varying irradiance conditions, the MPIS signal is normalized by the theoretical clear-sky global horizontal irradiance. Using this information, the neural network outputs an N -dimensional vector, where N is the number of points to approximate the MPIS curve via Fourier resampling. The output vector of the model is smoothed with a Gaussian kernel to account for error in the downsamping and subsequent upsampling steps, as well as to smooth the unconstrained output of the model. Furthermore, these profiles may be used to perform near-term prediction of angular irradiance, which can then inform the movement of a PV tracker.

42 ENGINEERING↗
DOE OSTI2016

Particle-image Velocimetry Sensitivity through Automatic Differentiation

A commonly encountered difficulty in modern experimental fluid dynamics experiments is the need for full-flow visualization and measurement; traditional techniques such as hot-wire probes and laser Doppler velocimetry cannot provide such information without difficult scanning procedures. Particle-image velocimetry (PIV) is a measurement technique which can overcome this spatial limitation to provide real-time three-dimensional fluid velocity vectors for an entire plane within the flow, as opposed to a single point that is provided by other measurement techniques. To accomplish this, a PIV system seeds the fluid flow with tracer particles; these must have nearly the same density as that of the fluid and a high drag coefficient to ensure that they follow the fluid flow without deviation. A laser is sent through optics to expand its beam into a sheet which illuminates the plane of interest in the fluid. The particles reflect more light than the fluid, and their image is recorded using a high speed camera. Due to limitations in bandwidth, video cannot be taken fast enough to be useful, and instead pairs of images are captured with a known separation in time. The illuminated particles will move between the two images taken by the camera, and their relative motion can be used to compute the fluid velocity at that point. When a single camera is used, only two-dimensional velocity vectors can be computed, but with the addition of another camera this can be improved to full three-dimensional vectors. The flow's time evolution can be measured by taking series of image pairs and processing each pair to get the velocity field at the time between each image pair. Only the two-dimensional version will be considered in this work. To compute the velocity vectors of the flow, the images are broken up into interrogation regions, usually in a uniform grid. In the most basic PIV algorithm, corresponding regions in the image pairs are cross-correlated to compute the most likely displacement from one image to the next. This is used since the cross correlation will achieve a maximum value when the two interrogation regions line up the best. The location of the peak in the correlation map and scaling information for the optical setup is used to compute the particle displacement from one image to the next. This process is similar to holding two semi-transparent images and moving one until they match as well as possible. Sub-pixel displacements between images can be obtained by fitting a Gaussian function to the correlation peak. Knowing the displacement vector for each set of interrogation regions in the image pair, it is a simple matter to divide by the time gap between the two images to compute the fluid velocity at the point in time and space. Since there are many interrogation regions in each image pair, the velocity field for a sheet is sampled according to the arrangement of the interrogation regions. The sensitivity of the final computed vector to the input images is difficult to compute, and has led most considerations of uncertainty in the PIV field to apply Monte Carlo methods and correlations to quantify the systematic and random errors which result from application of various PIV algorithms. In this work, automatic differentiation (AD) has been used to trace the dependence of velocity vectors computed using the correlation-peak PIV algorithm back to the input values given to an artificial image generator. These initial results form the foundation for continued work in the application of AD to algorithms in PIV. They demonstrate that AD methods can be successfully applied to PIV algorithms without undue complexity. The derivatives of each individual vector with regard to the coefficients of the velocity field used to create the artificial images can be computed and the statistics of them considered collectively, or correlated between each other to quantify the effectiveness of a PIV algorithm. With the initial implementation complete, adding extra algorithms is relatively simple and considerable data can be generated for analysis. It is hoped that application of these methods can lead to improved PIV algorithms which demonstrate better sensitivity to small variations in particle displacement. While these methods can be used as an analysis tool for refinement of new algorithms, computation of actual resultant vector sensitivities to input images' individual pixels is the next logical step of this work. Such information will be analyzed with experimental data to produce a better understanding of how output vectors' uncertainty relates to the actual image pairs, and lead to automatic bad vector removal. (authors)

42 ENGINEERING↗
DOE OSTI2026

Fast and Accurate Intersections on a Sphere

We introduce a fast, high-precision algorithm for calculating intersections between great circle arcs and lines of constant latitude on the unit sphere. We first propose a simplified intersection point formula with improved speed and numerical robustness over the ones traditionally implemented in geoscience software. We then show how algorithms based on the concept of error-free transformations (EFT) can be applied to evaluate this formula within a relative error bound that is on the order of machine precision. Here, we demonstrate that, with a vectorized and parallelized implementation, this enhanced accuracy is achieved with no compute time overhead compared to a direct calculation in hardware floating point, making our algorithm suitable for performance-sensitive applications like regridding of high-resolution climate data. In contrast, evaluating our formula using high-precision data types like quadruple precision and arbitrary precision, or using the robust intersection computation routines from the Computational Geometry Algorithms Library, leads to significant computational overhead, especially since these alternatives inhibit vectorization. More generally, our work demonstrates how EFT techniques can be combined and extended to implement nontrivial geometric calculations with high accuracy and speed.

Environmental sciences↗
DOE OSTI2025

Pyrrole‐Imine Macrocycle: Self‐Organizing Cross‐Reactive Anion Receptor and Sensor

Self-organizing macrocyclic receptor-sensors for phosphorus oxyanions, phosphates, and phosphonates comprising imine moieties were prepared by condensation of dipyrrolylmethane dicarbaldehyde with diethylene triamine. The incorporation of flexible ethylene moieties endows the macrocycle with unprecedented flexibility and ability to accommodate numerous phosphorus oxyanions from orthophosphate to large anions such as ATP or phosphonate glyphosate. The anion binding was elucidated by NMR titrations, low-temperature NMR, and NOESY NMR. The incorporation of dansyl fluorophore enables sensing of anions using the fluorescence signal, whereas the changes in fluorescence intensity, width of the fluorescence band, and position of the maxima are analyte-specific and useful in recognition and identification of eleven different P-oxyanions in water. The affinity (K assoc ) for Na + salts was H 2 PO 4 − ≈ Methylphosphonate > H 2 P 2 O 7 2− > Phenylphosphonate- > Glyphosate 2− > AMP 2− > ADP 2− > ATP 2− . Interestingly, phosphonates, including methylphosphonate and glyphosate anions, were also found to display a strong affinity (K assoc ∼10 6 M −1 ) while halides, nitrate, carbonates, or hydrogen sulfate did not show a significant affinity. The determined fluorescence spectral parameters were used to classify the 12 analytes (11 anions and water) using Linear Discriminant Analysis (LDA). Quantification was performed using LDA and Support Vector Machine (SVM), and the phosphonate concentrations in unknown samples were determined with an error of 3.5% or lower.

anions↗
DOE OSTI2014

Numerical approximation of the Schrödinger equation with the electromagnetic field by the Hagedorn wave packets

In this paper, we approximate the semi-classical Schrödinger equation in the presence of electromagnetic field by the Hagedorn wave packets approach. By operator splitting, the Hamiltonian is divided into the modified part and the residual part. The modified Hamiltonian, which is the main new idea of this paper, is chosen by the fact that Hagedorn wave packets are localized both in space and momentum so that a crucial correction term is added to the truncated Hamiltonian, and is treated by evolving the parameters associated with the Hagedorn wave packets. The residual part is treated by a Galerkin approximation. We prove that, with the modified Hamiltonian only, the Hagedorn wave packets dynamics give the asymptotic solution with error O(ε{sup 1/2}), where ε is the scaled Planck constant. We also prove that, the Galerkin approximation for the residual Hamiltonian can reduce the approximation error to O(ε{sup k/2}), where k depends on the number of Hagedorn wave packets added to the dynamics. This approach is easy to implement, and can be naturally extended to the multidimensional cases. Unlike the high order Gaussian beam method, in which the non-constant cut-off function is necessary and some extra error is introduced, the Hagedorn wave packets approach gives a practical way to improve accuracy even when ε is not very small.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2016

Cosmology from cosmic shear with Dark Energy Survey Science Verification data

We present the first constraints on cosmology from the Dark Energy Survey (DES), using weak lensing measurements from the preliminary Science Verification (SV) data. We use 139 square degrees of SV data, which is less than 3% of the full DES survey area. Using cosmic shear 2-point measurements over three redshift bins we find σ 8 (m=0.3) 0.5 = 0:81 ± 0:06 (68% confidence), after marginalising over 7 systematics parameters and 3 other cosmological parameters. Furthermore, we examine the robustness of our results to the choice of data vector and systematics assumed, and find them to be stable. About 20% of our error bar comes from marginalising over shear and photometric redshift calibration uncertainties. The current state-of-the-art cosmic shear measurements from CFHTLenS are mildly discrepant with the cosmological constraints from Planck CMB data. Our results are consistent with both datasets. Our uncertainties are ~30% larger than those from CFHTLenS when we carry out a comparable analysis of the two datasets, which we attribute largely to the lower number density of our shear catalogue. We investigate constraints on dark energy and find that, with this small fraction of the full survey, the DES SV constraints make negligible impact on the Planck constraints. The moderate disagreement between the CFHTLenS and Planck values of σ 8 (Ω m =0.3) 0.5 is present regardless of the value of w.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2014

WE-D-9A-02: Automated Landmark-Guided CT to Cone-Beam CT Deformable Image Registration

Purpose: The anatomical changes that occur between the simulation CT and daily cone-beam CT (CBCT) are investigated using an automated landmark-guided deformable image registration (LDIR) algorithm with simultaneous intensity correction. LDIR was designed to be accurate in the presence of tissue intensity mismatch and heavy noise contamination. Method: An auto-landmark generation algorithm was used in conjunction with a local small volume (LSV) gradient matching search engine to map corresponding landmarks between the CBCT and planning CT. The LSVs offsets were used to perform an initial deformation, generate landmarks, and correct local intensity mismatch. The landmarks act as stabilizing controlpoints in the Demons objective function. The accuracy of the LDIR algorithm was evaluated on one synthetic case with ground truth and data of ten head and neck cancer patients. The deformation vector field (DVF) accuracy was accessed using a synthetic case. The Root mean square error of the 3D canny edge (RMSECE), mutual information (MI), and feature similarity index metric (FSIM) were used to access the accuracy of LDIR on the patient data. The quality of the corresponding deformed contours was verified by an attending physician. Results: The resulting 90 percentile DVF error for the synthetic case was within 5.63mm for the original demons algorithm, 2.84mm for intensity correction alone, 2.45mm using controlpoints without intensity correction, and 1.48 mm for the LDIR algorithm. For the five patients the mean RMSECE of the original CT, Demons deformed CT, intensity corrected Demons CT, control-point stabilized deformed CT, and LDIR CT was 0.24, 0.26, 0.20, 0.20, and 0.16 respectively. Conclusion: LDIR is accurate in the presence of multimodal intensity mismatch and CBCT noise contamination. Since LDIR is GPU based it can be implemented with minimal additional strain on clinical resources. This project has been supported by a CPRIT individual investigator award RP11032.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2019

Scalable Matrix-Free Adaptive Product-Convolution Approximation for Locally Translation-Invariant Operators

We present an adaptive grid matrix-free operator approximation scheme based on a "product-convolution" interpolation of convolution operators. This scheme is appropriate for operators that are locally translation-invariant, even if these operators are high rank or full rank. Such operators arise in Schur complement methods for solving partial differential equations (PDEs), as Hessians in PDE-constrained optimization and inverse problems, as integral operators, as covariance operators, and as Dirichlet-to-Neumann maps. Constructing the approximation requires computing the impulse responses of the operator to point sources centered on nodes in an adaptively refined grid of sample points. A randomized a posteriori error estimator drives the adaptivity. Once constructed, the approximation can be efficiently applied to vectors using the fast Fourier transform. The approximation can be efficiently converted to hierarchical matrix (H-matrix) format, then inverted or factorized using scalable H-matrix arithmetic. The quality of the approximation degrades gracefully as fewer sample points are used, allowing cheap lower quality approximations to be used as preconditioners. Furthermore, this yields an automated method to construct preconditioners for locally translation-invariant Schur complements. We directly address issues related to boundaries and prove that our scheme eliminates boundary artifacts. We test the scheme on a spatially varying blurring kernel, on the nonlocal component of an interface Schur complement for the Poisson operator, and on the data misfit Hessian for an advection dominated advection-diffusion inverse problem. Numerical results show that the scheme outperforms existing methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Regime Characterization of Offshore Wind Resource Using Unsupervised Learning

Predictability of wind resource conditions is critical for offshore wind design and operations. While many studies of extreme wind conditions focus on specific events such as low-level jets or ramps, these rely on threshold definitions that limit generality. Here we present a data-driven framework that combines principal component analysis (PCA), self-organizing maps (SOM), and k-means clustering to classify wind resource conditions as typical and anomalous from climatological data. Anomalies are defined not by fixed thresholds but by flagging samples located far from SOM node centers inside the baseline SOM structure. This reframes extremes as rare ebents and hence, likely difficult to anticipate by numerical weather prediction models. We applied this approach to 23 years (2000–2022) of hourly profiles from the NOW-23 hindcast model at the Humboldt Wind Energy Area. Classification is conducted on a feature space consisting of 10 m wind speed and direction, bulk shear and veer across 30–270 m, and a low-level jet index. Dimensionality reduction is achieved through PC. A 2 × 3 OM lattice trained on the PCA vectors identified six baseline regimes spanning weak to strong flow states. High quantization-error profiles are identified and re-clustered into four anomalous regimes. The baseline regimes exhibited clear seasonal and diurnal cycles. Meanwhile, the anomalous regimes represented <10 % of all hours but showed distinct combinations of speed, shear, and veer, when compared to the baseline regimes. Anomalous regimes are typically short-lived (~few hours), yet their transitions can lead to hub-height wind changes of −18 to +9 m s -1 . For a representative 15 MW turbine, these shifts imply rapid swings in capacity factor from near-full output to negligible generation. Validation with lidar buoy data showed 51% agreement in SOM labels across ~6,000 overlapping hours, with most mismatches confined to adjacent speed classes. HRRR comparisons further revealed that anomalous regimes were disproportionately associated with forecast biases exceeding 5 m s -1 . Together, these results reframe extremes in offshore wind from absolute maxima or minima to weather states that are difficult to anticipate from models.

17 WIND ENERGY↗
DOE OSTI2016

Modeling the Swift BAT trigger algorithm with machine learning

To draw inferences about gamma-ray burst (GRB) source populations based on Swift observations, it is essential to understand the detection efficiency of the Swift burst alert telescope (BAT). This study considers the problem of modeling the Swift/BAT triggering algorithm for long GRBs, a computationally expensive procedure, and models it using machine learning algorithms. A large sample of simulated GRBs from Lien et al. is used to train various models: random forests, boosted decision trees (with AdaBoost), support vector machines, and artificial neural networks. The best models have accuracies of ≳97% (≲3% error), which is a significant improvement on a cut in GRB flux, which has an accuracy of 89.6% (10.4% error). These models are then used to measure the detection efficiency of Swift as a function of redshift z, which is used to perform Bayesian parameter estimation on the GRB rate distribution. We find a local GRB rate density of n{sub 0}∼0.48{sub −0.23}{sup +0.41} Gpc{sup −3} yr{sup −1} with power-law indices of n{sub 1}∼1.7{sub −0.5}{sup +0.6} and n{sub 2}∼−5.9{sub −0.1}{sup +5.7} for GRBs above and below a break point of z{sub 1}∼6.8{sub −3.2}{sup +2.8}. This methodology is able to improve upon earlier studies by more accurately modeling Swift detection and using this for fully Bayesian model fitting.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2025

Optical galaxy cluster mock catalogs with realistic projection effects: Validations with the SDSS clusters

Galaxy clusters identified in optical imaging surveys suffer from projection effects: Physically unassociated galaxies along a cluster’s line of sight can be counted as its members and boost the observed richness (the number of cluster members). To model the impact of projection on cluster cosmology analyses, we apply a halo occupation distribution model to 𝑁-body simulations to simulate the red galaxies contributing to cluster members, and we use the number of galaxies in a cylinder along the line of sight (counts in cylinders) to model the impact of projection on cluster richness. We compare three projection models: uniform, quadratic, and Gaussian, and we convert between them by matching their effective cylinder volumes. We validate our mock catalogs using SDSS redMaPPer clusters’ data vectors, including counts vs richness, stacked lensing signal, spectroscopic redshift distribution of member galaxies, and richness remeasured on a redshift grid. We find the former two are insensitive to the projection model, while the latter two favor a quadratic projection model with a width of ≈180 ℎ −1 Mpc (equivalent to the volume of a uniform model with a width of 100 ℎ −1 Mpc and a Gaussian model with a width of 110 ℎ −1 Mpc, or a Gaussian redshift error of 0.04). Furthermore, our framework provides an efficient and flexible way to model optical cluster data vectors, paving the way for a simulation-based joint analysis for clusters, galaxies, and shear.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2016

WE-AB-207A-04: Random Undersampled Cone Beam CT: Theoretical Analysis and a Novel Reconstruction Method

Purpose: Reducing x-ray exposure and speeding up data acquisition motived studies on projection data undersampling. It is an important question that for a given undersampling ratio, what the optimal undersampling approach is. In this study, we propose a new undersampling scheme: random-ray undersampling. We will mathematically analyze its projection matrix properties and demonstrate its advantages. We will also propose a new reconstruction method that simultaneously performs CT image reconstruction and projection domain data restoration. Methods: By representing projection operator under the basis of singular vectors of full projection operator, matrix representations for an undersampling case can be generated and numerical singular value decomposition can be performed. We compared properties of matrices among three undersampling approaches: regular-view undersampling, regular-ray undersampling, and the proposed random-ray undersampling. To accomplish CT reconstruction for random undersampling, we developed a novel method that iteratively performs CT reconstruction and missing projection data restoration via regularization approaches. Results: For a given undersampling ratio, random-ray undersampling preserved mathematical properties of full projection operator better than the other two approaches. This translates to advantages of reconstructing CT images at lower errors. Different types of image artifacts were observed depending on undersampling strategies, which were ascribed to the unique singular vectors of the sampling operators in the image domain. We tested the proposed reconstruction algorithm on a Forbid phantom with only 30% of the projection data randomly acquired. Reconstructed image error was reduced from 9.4% in a TV method to 7.6% in the proposed method. Conclusion: The proposed random-ray undersampling is mathematically advantageous over other typical undersampling approaches. It may permit better image reconstruction at the same undersampling ratio. The novel algorithm suitable for this random-ray undersampling was able to reconstruct high-quality images.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2022

Methods for Determining the Infrared Complex Refractive Indices n (λ) and k (λ) from Organic Solid Powders: Comparison of a Sucrose Single Crystal and a Pressed Pellet

There exists a need to measure optical constants n and k for many materials, especially organic solids in the infrared spectral region, but at present, there are only two established methods for making such measurements: single-angle (SA) reflectance and infrared spectroscopic ellipsometry (IRSE). The former derives the n/k vectors via measurement of the change in the amplitude of light reflected from the sample and then uses the Kramers–Kronig transform, while the latter measures the change in polarization of the reflected light from the sample to derive n/k. Here we make a direct comparison between the n/k vectors derived from SA measurements of a sucrose single crystal and the n/k values obtained after the crystal had been crushed, ground to powder, and pressed into a pellet form. The pellet was measured not only by SA but also via the IRSE method, and we found that pressing specular-quality pellets was critical, especially for the SA data. The n/k values of this typical organic molecule all agree to within 0.04 root-mean-square error, confirming that a pressed pellet can be used instead of a crystal to derive the intrinsic n/k vectors. In conclusion, this result is important for the many organic materials that, unlike sugar, do not have centimeter-sized crystals readily available.

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

A block matching-based registration algorithm for localization of locally advanced lung tumors

Purpose: To implement and evaluate a block matching-based registration (BMR) algorithm for locally advanced lung tumor localization during image-guided radiotherapy. Methods: Small (1 cm{sup 3}), nonoverlapping image subvolumes (“blocks”) were automatically identified on the planning image to cover the tumor surface using a measure of the local intensity gradient. Blocks were independently and automatically registered to the on-treatment image using a rigid transform. To improve speed and robustness, registrations were performed iteratively from coarse to fine image resolution. At each resolution, all block displacements having a near-maximum similarity score were stored. From this list, a single displacement vector for each block was iteratively selected which maximized the consistency of displacement vectors across immediately neighboring blocks. These selected displacements were regularized using a median filter before proceeding to registrations at finer image resolutions. After evaluating all image resolutions, the global rigid transform of the on-treatment image was computed using a Procrustes analysis, providing the couch shift for patient setup correction. This algorithm was evaluated for 18 locally advanced lung cancer patients, each with 4–7 weekly on-treatment computed tomography scans having physician-delineated gross tumor volumes. Volume overlap (VO) and border displacement errors (BDE) were calculated relative to the nominal physician-identified targets to establish residual error after registration. Results: Implementation of multiresolution registration improved block matching accuracy by 39% compared to registration using only the full resolution images. By also considering multiple potential displacements per block, initial errors were reduced by 65%. Using the final implementation of the BMR algorithm, VO was significantly improved from 77% ± 21% (range: 0%–100%) in the initial bony alignment to 91% ± 8% (range: 56%–100%;p < 0.001). Left-right, anterior-posterior, and superior-inferior systematic BDE were 3.2, 2.4, and 4.4 mm, respectively, with random BDE of 2.4, 2.1, and 2.7 mm. Margins required to include both localization and delineation uncertainties ranged from 5.0 to 11.7 mm, an average of 40% less than required for bony alignment. Conclusions: BMR is a promising approach for automatic lung tumor localization. Further evaluation is warranted to assess the accuracy and robustness of BMR against other potential localization strategies.

62 RADIOLOGY AND NUCLEAR MEDICINE↗
DOE OSTI2014

Adaptive h -refinement for reduced-order models: ADAPTIVE h -refinement for reduced-order models

Our work presents a method to adaptively refine reduced-order models a posteriori without requiring additional full-order-model solves. The technique is analogous to mesh-adaptive h-refinement: it enriches the reduced-basis space online by ‘splitting’ a given basis vector into several vectors with disjoint support. The splitting scheme is defined by a tree structure constructed offline via recursive k-means clustering of the state variables using snapshot data. This method identifies the vectors to split online using a dual-weighted-residual approach that aims to reduce error in an output quantity of interest. The resulting method generates a hierarchy of subspaces online without requiring large-scale operations or full-order-model solves. Furthermore, it enables the reduced-order model to satisfy any prescribed error tolerance regardless of its original fidelity, as a completely refined reduced-order model is mathematically equivalent to the original full-order model. Experiments on a parameterized inviscid Burgers equation highlight the ability of the method to capture phenomena (e.g., moving shocks) not contained in the span of the original reduced basis.

42 ENGINEERING↗
DOE OSTI2023

Dimension Reduction and Redundancy Removal through Successive Schmidt Decompositions

Quantum computers are believed to have the ability to process huge data sizes, which can be seen in machine learning applications. In these applications, the data, in general, are classical. Therefore, to process them on a quantum computer, there is a need for efficient methods that can be used to map classical data on quantum states in a concise manner. On the other hand, to verify the results of quantum computers and study quantum algorithms, we need to be able to approximate quantum operations into forms that are easier to simulate on classical computers with some errors. Motivated by these needs, in this paper, we study the approximation of matrices and vectors by using their tensor products obtained through successive Schmidt decompositions. We show that data with distributions such as uniform, Poisson, exponential, or similar to these distributions can be approximated by using only a few terms, which can be easily mapped onto quantum circuits. The examples include random data with different distributions, the Gram matrices of iris flower, handwritten digits, 20newsgroup, and labeled faces in the wild. Similarly, some quantum operations, such as quantum Fourier transform and variational quantum circuits with a small depth, may also be approximated with a few terms that are easier to simulate on classical computers. Furthermore, we show how the method can be used to simplify quantum Hamiltonians: In particular, we show the application to randomly generated transverse field Ising model Hamiltonians. The reduced Hamiltonians can be mapped into quantum circuits easily and, therefore, can be simulated more efficiently.

97 MATHEMATICS AND COMPUTING↗