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”
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.
Deploying temporary networks for upscaling of sparse network stations
Explore the source record for details and available documents.
Evan J. Coopersmith↗
A simultaneous coordinate relaxation algorithm for large, sparse matrix eigenvalue problems
An algorithm is proposed for a scheme of simultaneous coordinate relaxation. A variant of root-shifting coordinate relaxation, this procedure consists of iterating several vectors at the same time, instead of one at a time. Results of application of the algorithm to test matrices are discussed. For many matrix eigenvalue problems for which coordinate relaxation is a viable approach, the present algorithm is more effective than previous implementations of coordinate relaxation. Total central processor operations should be decreased due to significantly improved convergence.
Raffenetti, R. C.↗
Improvements in sparse matrix operations of NASTRAN
A "nontransmit" packing routine was added to NASTRAN to allow matrix data to be refered to directly from the input/output buffer. Use of the packing routine permits various routines for matrix handling to perform a direct reference to the input/output buffer if data addresses have once been received. The packing routine offers a buffer by buffer backspace feature for efficient backspacing in sequential access. Unlike a conventional backspacing that needs twice back record for a single read of one record (one column), this feature omits overlapping of READ operation and back record. It eliminates the necessity of writing, in decomposition of a symmetric matrix, of a portion of the matrix to its upper triangular matrix from the last to the first columns of the symmetric matrix, thus saving time for generating the upper triangular matrix. Only a lower triangular matrix must be written onto the secondary storage device, bringing 10 to 30% reduction in use of the disk space of the storage device.
Harano, S.↗
Preliminary results in implementing a model of the world economy on the CYBER 205: A case of large sparse nonsymmetric linear equations
A brief description of the Model of the World Economy implemented at the Institute for Economic Analysis is presented, together with our experience in converting the software to vector code. For each time period, the model is reduced to a linear system of over 2000 variables. The matrix of coefficients has a bordered block diagonal structure, and we show how some of the matrix operations can be carried out on all diagonal blocks at once.
Szyld, D. B.↗
Measurement of optical modulation functions in sparsely sampled mosaic focal plane arrays
It is pointed out that the measurement of optical modulation functions for detectors in focal plane arrays may be somewhat more difficult under 'full-up' systems conditions as compared to ideal laboratory conditions. An idealized optical modulation test arrangement is considered along with a full-up scanned system involving an earth mapper in polar orbit. In testing the system in full-up condition, a problem arises with respect to the acquisition of knife edge response data. In order to overcome this problem, a preferred method is developed for obtaining KER data on a single scan. A special 'phased edge' reticle is developed for use in the test set-up. Attention is given to aspects of knife edge reconstruction.
Young, J. B.↗
Output statistics of laser anemometers in sparsely seeded flows
It is noted that until very recently, research on this topic concentrated on the particle arrival statistics and the influence of the optical parameters on them. Little attention has been paid to the influence of subsequent processing on the measurement statistics. There is also controversy over whether the effects of the particle statistics can be measured. It is shown here that some of the confusion derives from a lack of understanding of the experimental parameters that are to be controlled or known. A rigorous framework is presented for examining the measurement statistics of such systems. To provide examples, two problems are then addressed. The first has to do with a sample and hold processor, the second with what is called a saturable processor. The sample and hold processor converts the output to a continuous signal by holding the last reading until a new one is obtained. The saturable system is one where the maximum processable rate is arrived at by the dead time of some unit in the system. At high particle rates, the processed rate is determined through the dead time.
Edwards, R. V.↗
Satellite-derived synoptic climatology in data-sparse regions
Synoptic-scale 'moisture bursts' are defined, based on infrared GOES imagery, and their synoptic climatology is developed. Quantitative analysis of satellite-derived individual channel radiance data and vertical eigenfunctions of complete channel data yield rich structural detail; these details do not appear in FGGE analyses in regions void of conventional meteorological data.
Mcguirk, J. P.↗
Communications oriented programming of parallel iterative solutions of sparse linear systems
Parallel algorithms are developed for a class of scientific computational problems by partitioning the problems into smaller problems which may be solved concurrently. The effectiveness of the resulting parallel solutions is determined by the amount and frequency of communication and synchronization and the extent to which communication can be overlapped with computation. Three different parallel algorithms for solving the same class of problems are presented, and their effectiveness is analyzed from this point of view. The algorithms are programmed using a new programming environment. Run-time statistics and experience obtained from the execution of these programs assist in measuring the effectiveness of these algorithms.
Patrick, M. L.↗
A sparse matrix algorithm on the Boolean vector machine
VLSI technology is being used to implement a prototype Boolean Vector Machine (BVM), which is a large network of very small processors with equally small memories that operate in SIMD mode; these use bit-serial arithmetic, and communicate via cube-connected cycles network. The BVM's bit-serial arithmetic and the small memories of individual processors are noted to compromise the system's effectiveness in large numerical problem applications. Attention is presently given to the implementation of a basic matrix-vector iteration algorithm for space matrices of the BVM, in order to generate over 1 billion useful floating-point operations/sec for this iteration algorithm. The algorithm is expressed in a novel language designated 'BVM'.
Wagner, Robert A.↗
Fault diagnosis in sparse multiprocessor systems
The problem of fault diagnosis in multiprocessor systems is considered under a uniformly probabilistic model in which processors are faulty with probability p. This work focuses on minimizing the number of tests that must be conducted in order to correctly diagnose the state of every processor in the system with high probability. A diagnosis algorithm that can correctly diagnose the state of every processor with probability approaching one in a class of systems performing slightly greater than a linear number of tests is presented. A nearly matching lower bound on the number of tests required to achieve correct diagnosis in arbitrary systems is also proven. The number of tests required under this probabilistic model is shown to be significantly less than under a bounded-size fault set model. Because the number of tests that must be conducted is a measure of the diagnosis overhead, these results represent a dramatic improvement in the performance of system-level diagnosis technique.
Blough, Douglas M.↗
LANZ: Software solving the large sparse symmetric generalized eigenproblem
A package, LANZ, for solving the large symmetric generalized eigenproblem is described. The package was tested on four different architectures: Convex 200, CRAY Y-MP, Sun-3, and Sun-4. The package uses a Lanczos' method and is based on recent research into solving the generalized eigenproblem.
Jones, Mark T.↗
Sparsely-sampled phase-insensitive two-dimensional arrays: Spatial interpolation and signal-dependent aperture
Explore the source record for details and available documents.
Patrick H. Johnston↗
Efficient packing of patterns in sparse distributed memory by selective weighting of input bits
When a set of patterns is stored in a distributed memory, any given storage location participates in the storage of many patterns. From the perspective of any one stored pattern, the other patterns act as noise, and such noise limits the memory's storage capacity. The more similar the retrieval cues for two patterns are, the more the patterns interfere with each other in memory, and the harder it is to separate them on retrieval. A method is described of weighting the retrieval cues to reduce such interference and thus to improve the separability of patterns that have similar cues.
Kanerva, Pentti↗
Identification of aerospace acoustic sources using sparse distributed associative memory
A pattern recognition system has been developed to classify five different aerospace acoustic sources. In this paper the performance of two new classifiers, an associative memory classifier and a neural network classifier, is compared to the performance of a previously designed system. Sources are classified using features calculated from the time and frequency domain. Each classifier undergoes a training period where it learns to classify sources correctly based on a set of known sources. After training the classifier is tested with unknown sources. Results show that over 96 percent of sources were identified correctly with the new associative memory classifier. The neural network classifier identified over 81 percent of the sources correctly.
Scott, E. A.↗
Potential, velocity, and density fields from sparse and noisy redshift-distance samples - Method
A method for recovering the three-dimensional potential, velocity, and density fields from large-scale redshift-distance samples is described. Galaxies are taken as tracers of the velocity field, not of the mass. The density field and the initial conditions are calculated using an iterative procedure that applies the no-vorticity assumption at an initial time and uses the Zel'dovich approximation to relate initial and final positions of particles on a grid. The method is tested using a cosmological N-body simulation 'observed' at the positions of real galaxies in a redshift-distance sample, taking into account their distance measurement errors. Malmquist bias and other systematic and statistical errors are extensively explored using both analytical techniques and Monte Carlo simulations.
Dekel, Avishai↗
Solving Large Sparse Symmetric Eigenproblems
LANZ program implements sophisticated algorithm based on simple Lanczos method for solving generalized eigenvalue problem. Uses dynamic shifting to improve efficiency and reliability of basic Lanczos algorithm. Written in FORTRAN 77 and C language.
Jones, Mark T.↗
Totally parallel multilevel algorithms for sparse elliptic systems
The fastest known algorithms for the solution of a large elliptic boundary value problem on a massively parallel hypercube all require O(log(n)) floating point operations and O(log(n)) distance-1 communications, if massively parallel is defined to mean a number of processors proportional to the size n of the problem. The Totally Parallel Multilevel Algorithm (TPMA) that has, as special cases, four of these fast algorithms is described. These four algorithms are Parallel Superconvergent Multigrid (PSMG), Robust Multigrid, the Fast Fourier Transformation (FFT) based Spectral Algorithm, and Parallel Cyclic Reduction. The algorithm TPMA, when described recursively, has four steps: (1) project to a collection of interlaced, coarser problems at the next lower level; (2) apply TPMA, recursively, to each of these lower level problems, solving directly at the lowest level; (3) interpolate these approximate solutions to the finer grid, and to verage them to form an approximate solution on this grid; and (4) refine this approximate solution with a defect-correction step, using a local approximate inverse. Choice of the projection operator (P), the interpolation operator (Q), and the smoother (S) determines the class of problems on which TPMA is most effective. There are special cases in which the first three steps produce an exact solution, and the smoother is not needed (e.g., constant coefficient operators).
Frederickson, Paul O.↗