Search NASA⌕ Search

SEARCH · Search NASA

Results for “sparse matrix”

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 217 records · Page 12

FROSch: A Fast and Robust Overlapping Schwarz Domain Decomposition Preconditioner Based on Xpetra in Trilinos

A parallel two-level overlapping Schwarz domain decomposition preconditioner has been integrated into the Trilinos ShyLU-package. The preconditioner uses an energy-minimizing coarse space and can be constructed from an assembled sparse matrix. The software implements variants of the two-level overlapping Schwarz method from [Dohrmann, Klawonn, Widlund, SINUM 2008], where it was denoted Generalized Dryja, Smith, Widlund (GDSW). The implementation is based on [Heinlein, Klawonn, Rheinbach, SISC 2016] but has been improved significantly with respect to efficiency, generality, e.g., for the use of Tpetra instead of Epetra matrices, and its interface.

97 MATHEMATICS AND COMPUTING↗

Hierarchical Task-Data Parallelism using Kokkos and Qthreads

This report describes a new capability for hierarchical task-data parallelism using Sandia's Kokkos and Qthreads, and evaluation of this capability with sparse matrix Cholesky factorization and social network triangle enumeration mini-applications. Hierarchical task-data parallelism consists of a collection of tasks with executes-after dependences where each task contains data parallel operations performed on a team of hardware threads. The collection of tasks and dependences form a directed acyclic graph of tasks - a task DAG. Major challenges of this research and development effort include: portability and performance across multicore CPU; manycore Intel Xeon Phi, and NVIDIA GPU architectures; scalability with respect to hardware concurrency and size of the task DAG; and usability of the application programmer interface (API).

97 MATHEMATICS AND COMPUTING↗

Evaluating Proxy Apps with FPGAs

Field-programmable gate arrays (FPGAs) are becoming more promising for high performance computing (HPC). Unlike fixed hardware specialization, reconfigurability allows FPGAs to be customized for a wide variety of HPC workloads. Our ultimate goal is to understand the viability of FPGAs as accelerators for some of the key HPC codes at LLNL and identify application characteristics that can benefit from the reconfigurability of FPGAs. More specifically, this LDRD project conducted a detailed performance study of FPGAs using sparse matrix computations and identified key optimization techniques to effectively use FPGA hardware resources.

97 MATHEMATICS AND COMPUTING↗

SMALE: Enhancing Scalability of Machine Learning Algorithms on Extreme-Scale Computing Platforms

Deployment and execution of machine learning tasks on extreme-scale computing platforms face several significant technical challenges: 1) High computing cost incurred by dense networks – The computing workload of deep networks with densely-connected topology increases rapidly with the network size, imposing a non-scalable computing model of extreme-scale computing platforms; 2) Non-optimized workload distribution – Many advanced deep learning algorithms, e.g., sparsification and irregular net-work topology, produce very unbalanced workload distribution on extreme-scale computing platforms. The computation efficiency is greatly hindered by the incurred data and computation redundancies as well as long tails of the node with extensive workload; 3) Constraints in data movement and I/O bottle-neck – Inter-node data movement in extreme-scale computing platforms are associated with high energy and latency costs, and subject to the constraints of I/O bandwidth; and 4) Generalization of algorithm realization and acceleration on computing platforms – The large varieties of machine learning algorithms and structures of extreme-scale computing platforms make the derivation of a generalized algorithm realization and acceleration method very challenging, which, however, is the requirement by domain scientists and interested users. We call the above challenges Smale’s Problems in Machine Learning and Understanding for High-Performance Computing Scientific Discovery. The objective of our three-year research project is to develop a holistic innovation set at structure, assembly, and acceleration layers of machine learning algorithms to address the above challenges in algorithm deployment and execution. Three tasks are particularly performed, including: At the algorithm structure level, we investigate the techniques that can structurally sparsify on the topology of deep networks for computing workload reduction. We also study clustering and pruning techniques that can optimize the workload distributions over the extreme-scale computing platforms; At the algorithm assembly level, we derive a unified learning framework for unsupervised transfer learning and dynamic growing capabilities. Novel training methods are also exploited to enhance the training efficiency of the proposed framework; At the algorithm acceleration level, we will develop a series of techniques that can accelerate the computation of sparse matrix operations, which are one of the core executions in deep learning and optimize memory access of the concerned platforms. Our proposed techniques attack the fundamental problems in machine learning algorithms running on extreme-scale computing platforms by vertically integrating the solutions at three closely entangled layers, paving the long-term scaling path of machine learning applications under DOE context. Three tasks corresponding to the above respective research orientations are performed during the three-year project period with our collaborators at ORNL. The outcome of the proposed project is anticipated to form a holistic solution set of novel algorithms and network topologies, efficient training techniques, and fast acceleration methods to promote the computing scalability of the machine learning applications of particular interest to DOE.

97 MATHEMATICS AND COMPUTING↗

Optimizing Dirac Wilson Operator and linear solvers for Intel KNL

Lattice Quantumchromodynamics (QCD) is a powerful tool to numerically access the low energy regime of QCD in a straightforward way with quantifyable uncertainties. In this approach, QCD is discretized on a four dimensional, euclidian space-time grid with millions of degrees of freedom. In modern lattice calculations, most of the work is still spent in solving large, sparse linear systems. This part has two challenges, i.e. optimizing the sparse matrix application as well as BLAS-like kernels used in the linear solver. We are going to present performance optimizations of the Dirac operator (dslash) with and without clover term for recent Intel architectures, including Knights Landing (KNL). Using only a single right hand side, we were able to achieve a good fraction of peak performance for slash, CG and BiCGStab. We will also present a series of experiments we performed on KNL, i.e. running MCDRAM in different modes, enabling or disabling hardware prefetching, using different SoA lengths as well as different sub-NUMA-clustering modes.

Joó, Bálint↗

Interpolation as a means of shift selection for multilevel Monte Carlo with lattice displacements

The calculation of disconnected diagram contributions to physical signals is a computationally expensive task in Lattice QCD. To extract the physical signal, the trace of the inverse Lattice Dirac operator, a large sparse matrix, must be stochastically estimated. Because the variance of the stochastic estimator is typically large, variance reduction techniques must be employed. Multilevel Monte Carlo (MLMC) methods reduce the variance of the trace estimator by utilizing a telescoping sequence of estimators. Frequency Splitting is one such method that uses a sequence of inverses of shifted operators to estimate the trace of the inverse of the lattice Dirac operator, however there is no a priori way to select the shifts that minimize the cost of the multilevel trace estimation. We present a sampling and interpolation scheme that is able to predict the variances associated with Frequency Splitting under displacements of the underlying space time lattice. The interpolation scheme is able to predict the variances to high accuracy and therefore choose shifts that correspond to an approximate minimum of the cost for the trace estimation. We show that Frequency Splitting with the chosen shifts displays significant speedups over multigrid deflation

Whyte, Travis↗

Optimal polynomial based quantum eigenstate filtering with application to solving quantum linear systems

We present a quantum eigenstate filtering algorithm based on quantum signal processing (QSP) and minimax polynomials. The algorithm allows us to efficiently prepare a target eigenstate of a given Hamiltonian, if we have access to an initial state with non-trivial overlap with the target eigenstate and have a reasonable lower bound for the spectral gap. We apply this algorithm to the quantum linear system problem (QLSP), and present two algorithms based on quantum adiabatic computing (AQC) and quantum Zeno effect respectively. Both algorithms prepare the final solution as a pure state, and achieves the near optimal $\mathcal{\tilde{O}}$(dκlog(1/ϵ)) query complexity for a d -sparse matrix, where κ is the condition number, and ϵ is the desired precision. Neither algorithm uses phase estimation or amplitude amplification.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

The Development of a Finite Volume Method for Modeling Sound in Coastal Ocean Environment

: As the rapid growth of marine renewable energy and off-shore wind energy, there have been concerns that the noises generated from construction and operation of the devices may interfere marine animals’ communication. In this research, a underwater sound model is developed to simulate sound prorogation generated by marine-hydrokinetic energy (MHK) devices or offshore wind (OSW) energy platforms. Finite volume and finite difference methods are developed to solve the 3D Helmholtz equation of sound propagation in the coastal environment. For finite volume method, the grid system consists of triangular grids in horizontal plane and sigma-layers in vertical dimension. A 3D sparse matrix solver with complex coefficients is formed for solving the resulting acoustic pressure field. The Complex Shifted Laplacian Preconditioner (CSLP) method is applied to efficiently solve the matrix system iteratively with MPI parallelization using a high performance cluster. The sound model is then coupled with the Finite Volume Community Ocean Model (FVCOM) for simulating sound propagation generated by human activities in a range-dependent setting, such as offshore wind energy platform constructions and tidal stream turbines. As a proof of concept, initial validation of the finite difference solver is presented for two coastal wedge problems. Validation of finite volume method will be reported separately.

Coastal↗

Coupled Modeling of Hydrodynamics and Sound in Coastal Ocean for Renewable Ocean Energy Development

An underwater sound model was developed to simulate sound propagation from marine and hydrokinetic energy (MHK) devices or offshore wind (OSW) energy platforms. Finite difference methods were developed to solve the 3D Helmholtz equation for sound propagation in the coastal environment. A 3D sparse matrix solver with complex coefficients was formed for solving the resulting acoustic pressure field. The Complex Shifted Laplacian Preconditioner (CSLP) method was applied to solve the matrix system iteratively with MPI parallelization using a high performance cluster. The sound model was then coupled with the Finite Volume Community Ocean Model (FVCOM) for simulating sound propagation generated by human activities, such as construction of OSW turbines or tidal stream turbine operations, in a range-dependent setting. As a proof of concept, initial validation of the solver is presented for two coastal wedge problems. This sound model can be useful for evaluating impacts on marine mammals due to deployment of MHK devices and OSW energy platforms.

Long, Wen↗

Co-benefits of global and regional greenhouse gas mitigation for US air quality in 2050

Policies to mitigate greenhouse gas (GHG) emissions will not only slow climate change but can also have ancillary benefits of improved air quality. Here we examine the co-benefits of both global and regional GHG mitigation for US air quality in 2050 at fine resolution, using dynamical downscaling methods, building on a previous global co-benefits study (West et al., 2013). The co-benefits for US air quality are quantified via two mechanisms: through reductions in co-emitted air pollutants from the same sources and by slowing climate change and its influence on air quality, following West et al. (2013). Additionally, we separate the total co-benefits into contributions from domestic GHG mitigation vs. mitigation in foreign countries. We use the Weather Research and Forecasting (WRF) model to dynamically downscale future global climate to the regional scale and the Sparse Matrix Operator Kernel Emissions (SMOKE) program to directly process global anthropogenic emissions to the regional domain, and we provide dynamical boundary conditions from global simulations to the regional Community Multi-scale Air Quality (CMAQ) model. The total co-benefits of global GHG mitigation from the RCP4.5 scenario compared with its reference are estimated to be higher in the eastern US (ranging from 0.6 to 1.0 µg m -3 ) than the west (0–0.4 µg m -3 ) for fine particulate matter (PM 2.5 ), with an average of 0.47 µg m -3 over the US; for O 3 , the total co-benefits are more uniform at 2–5 ppb, with a US average of 3.55 ppb. Comparing the two mechanisms of co-benefits, we find that reductions in co-emitted air pollutants have a much greater influence on both PM 2.5 (96 % of the total co-benefits) and O 3 (89 % of the total) than the second co-benefits mechanism via slowing climate change, consistent with West et al. (2013). GHG mitigation from foreign countries contributes more to the US O 3 reduction (76 % of the total) than that from domestic GHG mitigation only (24 %), highlighting the importance of global methane reductions and the intercontinental transport of air pollutants. For PM 2.5 , the benefits of domestic GHG control are greater (74 % of total). Since foreign contributions to co-benefits can be substantial, with foreign O 3 benefits much larger than those from domestic reductions, previous studies that focus on local or regional co-benefits may greatly underestimate the total co-benefits of global GHG reductions. We conclude that the US can gain significantly greater domestic air quality co-benefits by engaging with other nations to control GHGs.

54 ENVIRONMENTAL SCIENCES↗

Fluid-structure finite-element vibrational analysis

A fluid finite element has been developed for a quasi-compressible fluid. Both kinetic and potential energy are expressed as functions of nodal displacements. Thus, the formulation is similar to that used for structural elements, with the only differences being that the fluid can possess gravitational potential, and the constitutive equations for fluid contain no shear coefficients. Using this approach, structural and fluid elements can be used interchangeably in existing efficient sparse-matrix structural computer programs such as SPAR. The theoretical development of the element formulations and the relationships of the local and global coordinates are shown. Solutions of fluid slosh, liquid compressibility, and coupled fluid-shell oscillation problems which were completed using a temporary digital computer program are shown. The frequency correlation of the solutions with classical theory is excellent.

Feng, G. C.↗

SPAR: Structural-performance analysis and redesign

System of processor programs performs stress, buckling, and vibrational analysis of large linear finite element systems in excess of 50,000 degrees of freedom, while minimizing processing cost, execution time, central memory storage, and secondary data storage requirements. Programs use sparse matrix solution techniques and other computational and data management procedures.

Whetstone, W. D.↗

Structural performance analysis and redesign

Program performs stress buckling and vibrational analysis of large, linear, finite-element systems in excess of 50,000 degrees of freedom. Cost, execution time, and storage requirements are kept reasonable through use of sparse matrix solution techniques, and other computational and data management procedures designed for problems of very large size.

Whetstone, W. D.↗

Substructuring techniques - Status and projections

Substructuring techniques are examined in terms of their application to structural analysis. Attention is given to multilevel substructuring algorithms, hypermatrix and other sparse matrix schemes, automated design systems, and elasto-plastic problems. Applications include use with computing hardware such as CDC STAR-100 and minicomputer systems.

Noor, A. K.↗

The Karhunen-Loeve, discrete cosine, and related transforms obtained via the Hadamard transform

A general class of even/odd transforms is presented that includes the Karhunen-Loeve transform, the discrete cosine transform, the Walsh-Hadamard transform, and other familiar transforms. The more complex even/odd transforms can be computed by combining a simpler even/odd transform with a sparse matrix multiplication. A theoretical performance measure is computed for some even/odd transforms, and two image compression experiments are reported.

Jones, H. W.↗

A Structural Dynamics Approach to the Simulation of Spacecraft Control/Structure Interaction

A relatively simple approach to the analysis of linear spacecraft control/structure interaction problems is presented. The approach uses a commercially available structural system dynamic analysis package for both controller and plant dynamics, thus obviating the need to transfer data between separate programs. The unilateral coupling between components in the control system block diagram is simulated using sparse matrix stiffness and damping elements available in the structural dynamic code. The approach is illustrated with a series of simple tutorial examples of a rigid spacecraft core with flexible appendages.

Young, J. W.↗

Methods for design and evaluation of integrated hardware-software systems for concurrent computation

Research activities and publications are briefly summarized. The major tasks reviewed are: (1) VAX implementation of the PISCES parallel programming environment; (2) Apollo workstation network implementation of the PISCES environment; (3) FLEX implementation of the PISCES environment; (4) sparse matrix iterative solver in PSICES Fortran; (5) image processing application of PISCES; and (6) a formal model of concurrent computation being developed.

Pratt, T. W.↗