Combining electrochemistry and data-sparse Gaussian process regression for lithium-ion battery hybrid modeling
Explore the source record for details and available documents.
Jackson Fogelquist↗
SEARCH · Engineering Papers
Results for “sparse Gaussian process”
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.
Towards the True Hybrid: Physics-Informed Trainable Models for Prognostics and Health Management
Explore the source record for details and available documents.
Physics-Informed Machine Learning↗
Supercomputing on massively parallel bit-serial architectures
Research on the Goodyear Massively Parallel Processor (MPP) suggests that high-level parallel languages are practical and can be designed with powerful new semantics that allow algorithms to be efficiently mapped to the real machines. For the MPP these semantics include parallel/associative array selection for both dense and sparse matrices, variable precision arithmetic to trade accuracy for speed, micro-pipelined train broadcast, and conditional branching at the processing element (PE) control unit level. The preliminary design of a FORTRAN-like parallel language for the MPP has been completed and is being used to write programs to perform sparse matrix array selection, min/max search, matrix multiplication, Gaussian elimination on single bit arrays and other generic algorithms. A description is given of the MPP design. Features of the system and its operation are illustrated in the form of charts and diagrams.
Iobst, Ken↗
Characterizing Spatiotemporal Uncertainty in Interpolated Meteorological Data
Interpolated meteorological data invariably contain errors. These errors have structure in time and space, particularly autocorrelation, which can cause the effects of errors to compound when model outputs are aggregated temporally or spatially. One way to account for this uncertainty is with a probabilistic model from which samples can be drawn that are coherent with respect to underlying spatial and temporal covariance structure. This work describes a probabilistic method for spatial interpolation of point-wise meteorological time series. Observational data from weather stations are generally sparse in space and dense in time (but sometimes missing). The method works by projecting time series onto orthogonal basis vectors and spatially interpolating each resulting component independently. Under suitable assumptions, and data transformations to better satisfy those assumptions, Gaussian process regression provides a complete description of the joint predictive distribution over a Gaussian random field. Spatiotemporally coherent realizations are generated as the sum of conditional (spatial) simulations of each orthogonal (temporal) component. Data-derived and generic orthogonal bases are considered. In addition to spatial interpolation, imputation of missing observational data is examined. The method is applied using near-surface air temperature over the Western United States and validated by comparing theoretical versus actual coverage of predictive distributions and analyzing the degree to which spatial and temporal covariance structure is reproduced. Computational considerations, relating to conditional simulation of random fields, are also addressed.
Conor T Doherty↗
Algorithms for solving large sparse systems of simultaneous linear equations on vector processors
Very efficient algorithms for solving large sparse systems of simultaneous linear equations have been developed for serial processing computers. These involve a reordering of matrix rows and columns in order to obtain a near triangular pattern of nonzero elements. Then an LU factorization is developed to represent the matrix inverse in terms of a sequence of elementary Gaussian eliminations, or pivots. In this paper it is shown how these algorithms are adapted for efficient implementation on vector processors. Results obtained on the CYBER 200 Model 205 are presented for a series of large test problems which show the comparative advantages of the triangularization and vector processing algorithms.
David, R. E.↗
Gaussian Process Regression Method for Costing SmallSat Bus Capabilities
NASA is responding to the growing interest in, andcapabilities of, small satellites for science applications with an increasingnumber and frequency of Announcements of Opportunityfor small satellite space missions. Estimating the probabilitythat these mission concepts will fit within the small cost capsof these opportunities is largely driven by the probability thatone of the burgeoning number of small satellite providers will beable to meet the payload’s accommodation requirements withinthe budget for the spacecraft. JPL has collected a databasecontaining technical specifications and cost of commerciallyavailable Smallsat buses across various vendors. The primarypurpose of the database is for use in JPL’s Team X architecturestudies to inform cost estimates of a spacecraft bus which fitsthe customer’s technical requirements for their payload andmission. Customer needs are often unique and don’t alignperfectly with an off-the-shelf commercial spacecraft bus, whichmotivates the need to develop a cost model across the continuoustechnical parameter space.Al’s Bus Cost Distribution Estimator (ABCDE) uses Gaussianprocess regression (GPR) to predict commercial Smallsat spacecraftbus cost based on a subset of a customer’s technicalrequirements (payload mass, payload power, delta V, pointingcontrol, and downlink rate). GPR is implemented in ABCDE asa Bayesian method which fits an implied multivariate regressionon the technical parameters and uses kriging to intentionally“overfit” the residuals. Overfitting the residuals allows costestimates to collapse in uncertainty closer to the data pointswhile maintaining larger uncertainty intervals in regions of parameterspace with fewer data records. The data used to fit thismodel is sensitive and represents cost estimates for off-the-shelfcommercial buses. GPR simultaneously protects the sensitivityof the database and uses the sparse nature of the database toaccount for uncertainty in cost in a useful way. For a givenset of customer technical requirements, the tool provides a costestimate distribution, the percentiles of which can be interpretedas a confidence level of finding a commercial bus under a specifiedcost cap. ABCDE dramatically pushes the boundaries ofspacecraft cost estimation models due to its Bayesian methodology(accounting for the maximum uncertainty in the underlyingregression), the mathematically advanced kriging methodology,and the novelty of its application in Team X architecture tradestudies.
Austin, Alex↗
Efficient Implementation of an Optimal Interpolator for Large Spatial Data Sets
Scattered data interpolation is a problem of interest in numerous areas such as electronic imaging, smooth surface modeling, and computational geometry. Our motivation arises from applications in geology and mining, which often involve large scattered data sets and a demand for high accuracy. The method of choice is ordinary kriging. This is because it is a best unbiased estimator. Unfortunately, this interpolant is computationally very expensive to compute exactly. For n scattered data points, computing the value of a single interpolant involves solving a dense linear system of size roughly n x n. This is infeasible for large n. In practice, kriging is solved approximately by local approaches that are based on considering only a relatively small'number of points that lie close to the query point. There are many problems with this local approach, however. The first is that determining the proper neighborhood size is tricky, and is usually solved by ad hoc methods such as selecting a fixed number of nearest neighbors or all the points lying within a fixed radius. Such fixed neighborhood sizes may not work well for all query points, depending on local density of the point distribution. Local methods also suffer from the problem that the resulting interpolant is not continuous. Meyer showed that while kriging produces smooth continues surfaces, it has zero order continuity along its borders. Thus, at interface boundaries where the neighborhood changes, the interpolant behaves discontinuously. Therefore, it is important to consider and solve the global system for each interpolant. However, solving such large dense systems for each query point is impractical. Recently a more principled approach to approximating kriging has been proposed based on a technique called covariance tapering. The problems arise from the fact that the covariance functions that are used in kriging have global support. Our implementations combine, utilize, and enhance a number of different approaches that have been introduced in literature for solving large linear systems for interpolation of scattered data points. For very large systems, exact methods such as Gaussian elimination are impractical since they require 0(n(exp 3)) time and 0(n(exp 2)) storage. As Billings et al. suggested, we use an iterative approach. In particular, we use the SYMMLQ method, for solving the large but sparse ordinary kriging systems that result from tapering. The main technical issue that need to be overcome in our algorithmic solution is that the points' covariance matrix for kriging should be symmetric positive definite. The goal of tapering is to obtain a sparse approximate representation of the covariance matrix while maintaining its positive definiteness. Furrer et al. used tapering to obtain a sparse linear system of the form Ax = b, where A is the tapered symmetric positive definite covariance matrix. Thus, Cholesky factorization could be used to solve their linear systems. They implemented an efficient sparse Cholesky decomposition method. They also showed if these tapers are used for a limited class of covariance models, the solution of the system converges to the solution of the original system. Matrix A in the ordinary kriging system, while symmetric, is not positive definite. Thus, their approach is not applicable to the ordinary kriging system. Therefore, we use tapering only to obtain a sparse linear system. Then, we use SYMMLQ to solve the ordinary kriging system. We show that solving large kriging systems becomes practical via tapering and iterative methods, and results in lower estimation errors compared to traditional local approaches, and significant memory savings compared to the original global system. We also developed a more efficient variant of the sparse SYMMLQ method for large ordinary kriging systems. This approach adaptively finds the correct local neighborhood for each query point in the interpolation process.
Memarsadeghi, Nargess↗