Search NASA⌕ Search

SEARCH · Search NASA

Results for “linear solver”

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 361 records · Page 20

Implementation and Optimization of miniGMG - a Compact Geometric Multigrid Benchmark

Multigrid methods are widely used to accelerate the convergence of iterative solvers for linear systems used in a number of different application areas. In this report, we describe miniGMG, our compact geometric multigrid benchmark designed to proxy the multigrid solves found in AMR applications. We explore optimization techniques for geometric multigrid on existing and emerging multicore systems including the Opteron-based Cray XE6, Intel Sandy Bridge and Nehalem-based Infiniband clusters, as well as manycore-based architectures including NVIDIA's Fermi and Kepler GPUs and Intel's Knights Corner (KNC) co-processor. This report examines a variety of novel techniques including communication-aggregation, threaded wavefront-based DRAM communication-avoiding, dynamic threading decisions, SIMDization, and fusion of operators. We quantify performance through each phase of the V-cycle for both single-node and distributed-memory experiments and provide detailed analysis for each class of optimization. Results show our optimizations yield significant speedups across a variety of subdomain sizes while simultaneously demonstrating the potential of multi- and manycore processors to dramatically accelerate single-node performance. However, our analysis also indicates that improvements in networks and communication will be essential to reap the potential of manycore processors in large-scale multigrid calculations.

97 MATHEMATICS AND COMPUTING↗

A Block-Asynchronous Relaxation Method for Graphics Processing Units

In this paper, we analyze the potential of asynchronous relaxation methods on Graphics Processing Units (GPUs). For this purpose, we developed a set of asynchronous iteration algorithms in CUDA and compared them with a parallel implementation of synchronous relaxation methods on CPU-based systems. For a set of test matrices taken from the University of Florida Matrix Collection we monitor the convergence behavior, the average iteration time and the total time-to-solution time. Analyzing the results, we observe that even for our most basic asynchronous relaxation scheme, despite its lower convergence rate compared to the Gauss-Seidel relaxation (that we expected), the asynchronous iteration running on GPUs is still able to provide solution approximations of certain accuracy in considerably shorter time then Gauss- Seidel running on CPUs. Hence, it overcompensates for the slower convergence by exploiting the scalability and the good fit of the asynchronous schemes for the highly parallel GPU architectures. Further, enhancing the most basic asynchronous approach with hybrid schemes – using multiple iterations within the ”subdomain” handled by a GPU thread block and Jacobi-like asynchronous updates across the ”boundaries”, subject to tuning various parameters – we manage to not only recover the loss of global convergence but often accelerate convergence of up to two times (compared to the effective but difficult to parallelize Gauss-Seidel type of schemes), while keeping the execution time of a global iteration practically the same. This shows the high potential of the asynchronous methods not only as a stand alone numerical solver for linear systems of equations fulfilling certain convergence conditions but more importantly as a smoother in multigrid methods. Due to the explosion of parallelism in todays architecture designs, the significance and the need for asynchronous methods, as the ones described in this work, is expected to grow.

97 MATHEMATICS AND COMPUTING↗

Scalability under a Power Bound using the GREMLINs Framework

With the move towards exascale, system and software developers will have to deal with issues of extreme parallelism. The system properties affected most by the increase in node and core count are the shared resources on node and across the system. The increase in parallelism leads to reduced memory and bandwidth when regarding individual cores. Since power is a limiting factor for supercomputers, and power is not fully utilized in current systems, overprovisioning compute resources is a viable approach to maximized power utilization. To maximize system performance in regard to these changing conditions, it is necessary to understand how resource restrictions impact performance and system behavior. For the purpose of understanding anticipated system properties the GREMLINs Framework was developed. The framework gives the opportunity to add power restrictions, hinder memory properties and introduce faults to study resilience, among others. These features give the opportunity to use current petascale technology to study problems system designers and software developers will have to face when moving towards exascale and beyond. This work describes the initial release of the GREMLINs Framework, developed for this work, and shows how it can be used to study the scaling behavior of proxy applications. These proxy applications represent a selection of HPC workloads important to the scientific community. The proxy applications studied are AMG2013, an algebraic multi-grid linear system solver, CoMD, a classical molecular dynamics proxy application and NEKBONE, an application that uses a high order spectral element method to solve the Navier-Stokes equations. The main interest of these studies lies in analysis regarding their power behavior at scale under a power bound. These findings show how the GREMLINs Framework can help systems and software designers to attain better application performance and can also be used as basis for CPU power balancing tools to use power more efficiently.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Data Structures for Extreme Scale Computing

As computing problems of national importance grow, the government meets the increased demand by funding the development of ever larger systems. The overarching goal of the work supported in part by this grant is to increase efficiency of programming and performing computations on these large computing systems. In past work, we have demonstrated that some of these computations once thought to require expensive hardware designs and/or complex, special-purpose programming may be executed efficiently on low-cost commodity cluster computing systems using a general-purpose “latency-tolerant” programming framework. One important developed application of the ideas underlying this framework is graph database technology supporting social network pattern matching used by US intelligence agencies to more quickly identify potential terrorist threats. This database application has been spun out by the Pacific Northwest National Laboratory, a Department of Energy Laboratory, into a commercial start-up, Trovares Inc. We explore an alternative application of the same underlying ideas to a well-studied challenge arising in engineering: solving unstructured sparse linear equations. Solving these equations is key to predicting the behavior of large electronic circuits before they are fabricated. Predicting that behavior ahead of fabrication means that designs can optimized and errors corrected ahead of the expense of manufacture.

42 ENGINEERING↗

FY2022 Q4: Demonstrate multi-turbine simulation with hybrid-structured/unstructured-moving-grid software stack running primarily on GPUs and propose improvements for successful KPP-2 [Poster]

Milestone accomplishments staged the ExaWind team for successful completion of KPP-2 challenge problem in FY23, which requires the simulation on Frontier of at least four MW-scale turbines in an atmospheric boundary layer with at least 20B gridpoints. The ExaWind project and software stack is many faceted, with team members working on multiple areas, including linear-system solvers (Trilinos, hypre, AMReX), overset meshes, turbulence modeling, and in situ visualization, all with an aim for high fidelity predictions and performance portability. This milestone marks significant improvements on many fronts and provides the team with a pathway to exascale wind farm simulations in FY23.

17 WIND ENERGY↗

Multistage CSR Microbunching Gain Development in Transport or Recirculation Arcs

Coherent synchrotron radiation (CSR) induced microbunching instability has been one of the most challenging issues in the design of modern accelerators. A linear Vlasov solver has been developed [1] and applied to investigate the physical processes of microbunching gain amplification for several example lattices [2]. In this paper, by further extending the concept of stage gain as proposed by Huang and Kim [3], we develop a method to characterize the microbunching development in terms of stage orders that allow the quantitative comparison of optics impacts on microbunching gain for different lattices. We find that the microbunching instability in our demonstrated arcs has a distinguishing feature of multistage amplification (e.g, up to 6th stage amplification for our example transport arcs, in contrast to two-stage amplification for a typical 4-dipole bunch compressor chicane). We also try to connect lattice optics pattern with the obtained stage gain functions by a physical interpretation. This Vlasov analysis is validated by ELEGANT [4] tracking results with excellent agreement.

Tsai, C. -Y.↗

DATeS: a highly extensible data assimilation testing suite v1.0

A flexible and highly extensible data assimilation testing suite, named DATeS, is described in this paper. DATeS aims to offer a unified testing environment that allows researchers to compare different data assimilation methodologies and understand their performance in various settings. The core of DATeS is implemented in Python and takes advantage of its object-oriented capabilities. The main components of the package (the numerical models, the data assimilation algorithms, the linear algebra solvers, and the time discretization routines) are independent of each other, which offers great flexibility to configure data assimilation applications. DATeS can interface easily with large third-party numerical models written in Fortran or in C,and with a plethora of external solvers.

97 MATHEMATICS AND COMPUTING↗

The Water Table Model (WTM) (v2.0.1): coupled groundwater and dynamic lake modelling

Abstract. Ice-free land comprises 26 % of the Earth's surface and holds liquid water that delineates ecosystems, affects global geochemical cycling, and modulates sea levels. However, we currently lack the capacity to simulate and predict these terrestrial water changes across the full range of relevant spatial (watershed to global) and temporal (monthly to millennial) scales. To address this knowledge gap, we present the Water Table Model (WTM), which integrates coupled components to compute dynamic lake and groundwater levels. The groundwater component solves the 2D horizontal groundwater flow equation using non-linear equation solvers from the C++ PETSc (Portable, Extensible Toolkit for Scientific Computation) library. The dynamic lake component makes use of the Fill–Spill–Merge (FSM) algorithm to move surface water into lakes, where it may evaporate or affect groundwater flow. In a proof-of-concept application, we demonstrate the continental-scale capabilities of the WTM by simulating the steady-state climate-driven water table for the present day and the Last Glacial Maximum (LGM; 21 000 calendar years before present) across the North American continent. During the LGM, North America stored an additional 14.98 cm of sea-level equivalent (SLE) in lakes and groundwater compared to the climate-driven present-day scenario. We compare the present-day result to other simulations and real-world data. Open-source code for the WTM is available on GitHub and Zenodo.

Callaghan, Kerry L. (ORCID:0000000226740838)↗

Quantifying Uncertainties through Advanced Theoretical Analysis for Image and Signal Reconstruction NLV-02-15, Year 1 of 2

Presentation describes project to (1) adapt accelerated matrix-free linear system solvers for applying new statistical approaches to very large–scale problems, (2) characterize the degree to which new statistical methods are superior to classical methods in respect to the sensitivity to “tuning parameters,” and (3) develop a new mathematical theory and associated numerical methods for computing the point spread function of an x-ray imaging system.

97 MATHEMATICS AND COMPUTING↗

Quantifying Uncertainties Through Advanced Theoretical Analysis for Image and Signal Reconstruction, NLV-02-15, Year 2 of 2

Presentation describes project to (1) adapt accelerated matrix-free linear system solvers for applying new statistical approaches to very large–scale problems, (2) characterize the degree to which new statistical methods are superior to classical methods in respect to the sensitivity to “tuning parameters,” and (3) develop a new mathematical theory and associated numerical methods for computing the point spread function of an x-ray imaging system.

97 MATHEMATICS AND COMPUTING↗

Multistage CSR Microbunching Gain Development in Transport or Recirculation Arcs

Coherent synchrotron radiation (CSR) induced microbunching instability has been one of the most challenging issues in the design of modern accelerators. A linear Vlasov solver has been developed [1] and applied to investigate the physical processes of microbunching gain amplification for several example lattices [2]. In this paper, by further extending the concept of stage gain as proposed by Huang and Kim [3], we develop a method to characterize the microbunching development in terms of stage orders that allow the quantitative comparison of optics impacts on microbunching gain for different lattices. We find that the microbunching instability in our demonstrated arcs has a distinguishing feature of multistage amplification (e.g, up to 6th stage amplification for our example transport arcs, in contrast to two-stage amplification for a typical 4-dipole bunch compressor chicane). We also try to connect lattice optics pattern with the obtained stage gain functions by a physical interpretation. This Vlasov analysis is validated by ELEGANT [4] tracking results with excellent agreement.

Tsai, C. -Y.↗

Preliminary Development of a Drift-Flux Model Based Pin-Resolved Core Thermal-Hydraulic Code for Dedicated Use in Efficient High-Fidelity Neutronics Coupled Calculations

As the high-fidelity multiphysics coupled core calculation becomes more practical with the advent of high-performance computing technology, efficient coupling of a neutronics code with a thermal-hydraulic (T/H) code at the pin level poses a new challenge. The COBRA-TF (CTF) code which is one of the well-known subchannel analysis codes based on the two-fluid, three-field model was coupled with many neutron transport codes such as MPACT, TORTTD, and nTRACER due to the easiness of coupling by its well-established coupling interface. Nevertheless, the calculation efficiency of such coupled codes is not satisfactory because of the heavy computational burden of CTF. The MATRA subchannel analysis code of KAERI which is based on the homogeneous equilibrium model (HEM) was coupled with neutronics codes as well. The choice of the HEM and the marching scheme in MATRA reduces the computational burden significantly. However, the applicability of the HEM for the two-phase flow conditions is limited to normal operating conditions of pressurized water reactors (PWRs) and therefore a better model which would allow wider applicability than HEM is necessary in order to deal with the core states involving nontrivial voiding. The drift-flux model (DFM) which uses 5 equations for two-fluid analyses by adopting the mixture velocity instead of two phasic velocities can be a good compromise between the two-fluid model and the HEM. With the DFM, the computational cost can be reduced and moreover the modeling of the interfacial area constitutive relations can be avoided. The phase separation for the mixture velocity can be incorporated by using the drift-flux parameters, C0 and Vgj, which can be obtained by using empirical formulas. Several subchannel codes such as WOSUB and ASSERT were developed based on the DFM. It was also adopted in some system analysis codes such as RETRAN3D. In the work here, the development of a DFM based pin-resolved T/H analysis code, ESCOT (Efficient Simulator of Core Thermal-hydraulics), is introduced for the use in efficient coupled calculations with a high-fidelity neutronics code. The field equations and the numerical methods are briefly described. Then the efficiency tests of various linear system solvers including the Krylov subspace methods (KSMs) are presented. A test problem is solved by ESCOT, MATRA and CTF for performance comparison and validation. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Implementation of CMFD Acceleration Scheme in PROTEUS-MOC

The PROTEUS-MOC code is a three-dimensional (3D) transport code, which is being developed at Argonne National Laboratory under the DOE-NE's Nuclear Energy Advanced Modeling and Simulation (NEAMS) program. It provides a fully consistent 3D discretization of the transport equation by combining the two-dimensional (2D) method of characteristics (MOC) for the planar direction with the discontinuous Galerkin method for the treatment of the axial variable. PROTEUS-MOC uses the unstructured finite element method (FEM) and thus allows the explicit representation of any extruded geometries. It also has a capability of massively parallel computation in energy group, angle, plane, and space using a top-level GMRES linear algebra solver. For parallel computation in space, it uses an unstructured domain decomposition by adapting METIS. The computational burden for direct heterogeneous core calculations based on unstructured geometries is excessive for practical reactor problems, and hence it is essential to implement an efficient acceleration scheme in PROTEUS-MOC. Recently, the coarse mesh finite difference (CMFD) method, which was originally applied to the nodal diffusion methods, has been successfully applied to the MOC transport solvers, resulting in a remarkable reduction in the number of fission source iterations. In addition, a modified CMFD method has been developed to overcome the limitation of the conventional CMFD that is applicable only to neutronics solvers with a conservative discretization. This CMFD method was derived to be consistent with the FEM, which is based on a nonconservative discretization. In this method, the neutron balance in each coarse mesh is enforced by introducing a pseudo absorption cross section (PAXS), and the well-established alternating solution process of CMFD and transport calculations is employed to accelerate source convergence. This modified CMFD acceleration scheme was adopted in PROTEUS-MOC to accelerate the fission source iteration. Pin-cell and assembly based CMFD schemes have been implemented by defining individual pin cells or assemblies as a coarse mesh. For this, an algorithm to map the finite elements to coarse meshes was developed, and the routines were developed to determine the coupling coefficients and PAXS of the CMFD equations from the transport solution. Preliminary performance tests were carried out using the C5G7 benchmark problem. This paper presents the main features of this CMFD acceleration scheme and the preliminary test results.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Applying Quantum Computing to Simulate Power System Dynamics

Power system dynamics are generally modeled by high dimensional nonlinear differential-algebraic equations due to a large number of generators, loads, and transmission lines. Thus, its computational complexity grows exponentially with the system size. This paper demonstrates the potential use of quantum computing algorithms to model the power system dynamics. Leveraging a symbolic programming framework, we equivalently convert the power system dynamics’ differential algebraic equations (DAEs) into ordinary differential equations (ODEs), where the data of the state vector can be encoded into quantum computers via amplitude encoding. The system's nonlinearity is captured by Taylor polynomial expansion, the quantum state tensor, and Hamiltonian simulation, whereas state variables can be updated by a quantum linear equation solver. Our results show that quantum computing can simulate the dynamics of the power system with high accuracy, whereas its complexity is polynomial in the logarithm of the system dimension. Our work also illustrates the use of scientific machine learning tools for implementing scientific computing concepts, e.g., Taylor expansion, DAEs/ODEs transform, and quantum computing solver, in the field of power engineering.

Tran, Huynh↗

An Asynchronous Task-based Fan-Both Sparse Cholesky Solver

Systems of linear equations arise at the heart of many scientific and engineering applications. Many of these linear systems are sparse; i.e., most of the elements in the coefficient matrix are zero. Direct methods based on matrix factorizations are sometimes needed to ensure accurate solutions. For example, accurate solution of sparse linear systems is needed in shift-invert Lanczos to compute interior eigenvalues. The performance and resource usage of sparse matrix factorizations are critical to time-to-solution and maximum problem size solvable on a given platform. In many applications, the coefficient matrices are symmetric, and exploiting symmetry will reduce both the amount of work and storage cost required for factorization. When the factorization is performed on large-scale distributed memory platforms, communication cost is critical to the performance of the algorithm. At the same time, network topologies have become increasingly complex, so that modern platforms exhibit a high level of performance variability. This makes scheduling of computations an intricate and performance-critical task. In this paper, we investigate the use of an asynchronous task paradigm, one-sided communication and dynamic scheduling in implementing sparse Cholesky factorization (symPACK) on large-scale distributed memory platforms. Our solver symPACK relies on efficient and flexible communication primitives provided by the UPC++ library. Performance evaluation shows good scalability and that symPACK outperforms state-of-the-art parallel distributed memory factorization packages, validating our approach on practical cases.

Jacquelin, Mathias↗

A robust hierarchical solver for ill-conditioned systems with applications to ice sheet modeling

A hierarchical solver is proposed for solving sparse ill-conditioned linear systems in parallel. The solver is based on a modification of the LoRaSp method, but employs a deferred-compression technique, which provably reduces the approximation error and significantly improves efficiency. Moreover, the deferred-compression technique introduces minimal overhead and does not affect parallelism. As a result, the new solver achieves linear computational complexity under mild assumptions and excellent parallel scalability. To demonstrate the performance of the new solver, we focus on applying it to solve sparse linear systems arising from ice sheet modeling. The strong anisotropic phenomena associated with the thin structure of ice sheets creates serious challenges for existing solvers. To address the anisotropy, we additionally developed a customized partitioning scheme for the solver, which captures the strong-coupling direction accurately. In general, the partitioning can be computed algebraically with existing software packages, and thus the new solver is generalizable for solving other sparse linear systems. Our results show that ice sheet problems of about 300 million degrees of freedom have been solved in just a few minutes using a thousand processors.

97 MATHEMATICS AND COMPUTING↗