Search NASA⌕ Search

SEARCH · Search NASA

Results for “linear system”

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 1,297 records · Page 72

Complex Version of High Performance Computing LINPACK Benchmark (HPL)

This paper describes our effort for enhancing the performance of the AORSA fusion energy simulation program through the use of High Performance Linpack (HPL) benchmark, commonly used in ranking the top 500 supercomputers. The algorithm used by HPL, enhanced by a set of tuning options, is more effective than that found in the ScaLAPACK library. However, HPL is configured as a benchmark, and only for real-valued coefficients. We therefore converted HPL for use within an application program that generates complex coefficient linear systems. The result is a significant increase in performance of the solver when simulating the highest resolution experiments thus far configured, achieving 87.5 TFLOPS on over 20,000 processors on the Cray XT4.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Domain decomposition approaches for accelerating contour integration eigenvalue solvers for symmetric eigenvalue problems

This work discusses techniques for computing a few selected eigenvalue–eigenvector pairs of large and sparse symmetric matrices. A recently developed class of techniques to solve this type of problems is based on integrating the matrix resolvent operator along a complex contour that encloses the interval containing the eigenvalues of interest. This paper considers such contour integration techniques from a domain decomposition viewpoint and proposes two schemes. The first scheme can be seen as an extension of domain decomposition linear system solvers in the framework of contour integration methods for eigenvalue problems, such as FEAST. The second scheme focuses on integrating the resolvent operator primarily along the interface region defined by adjacent subdomains. A parallel implementation of the proposed schemes is described, and results on distributed computing environments are reported. These results show that domain decomposition approaches can lead to reduced run times and improved scalability.

97 MATHEMATICS AND COMPUTING↗

Recursive integral method with Cayley transformation

Summary The recently developed RIM (recursive integral method) finds eigenvalues in a region of the complex plane. It computes an indicator to test if the region contains eigenvalues using an approximate spectral projection. If the indicator shows that the region contains eigenvalues, it is subdivided into smaller regions, which are then recursively tested and subdivided until any eigenvalues are isolated to a specified precision. We propose an enhancement to RIM that uses Cayley transformations and Arnoldi's method to greatly decrease the number of factorizations required to solve the linear systems that arise from a discretized contour integral to compute the indicator, which substantially reduces the computational cost. We demonstrate the efficacy of our method with numerical examples and compare with the implicitly restarted Arnoldi method, as implemented in eigs in MATLAB.

Huang, R.↗

Improving solve time of aggregation-based adaptive AMG

In this paper, we propose improving the solve time of a bootstrap algebraic multigrid (AMG) designed previously by the authors. This is achieved by incorporating the information, a set of algebraically smooth vectors, generated by the bootstrap algorithm, in a single hierarchy by using sufficiently large aggregates, and these aggregates are compositions of aggregates already built throughout the bootstrap algorithm. The modified AMG method has good convergence properties and shows significant reduction in both memory and solve time. These savings with respect to the original bootstrap AMG are illustrated on some difficult (for standard AMG) linear systems arising from discretization of scalar and vector function elliptic partial differential equations in both 2D and 3D.

97 MATHEMATICS AND COMPUTING↗

Parallel performance of algebraic multigrid domain decomposition

Algebraic multigrid (AMG) is a widely used scalable solver and preconditioner for large-scale linear systems resulting from the discretization of a wide class of elliptic PDEs. While AMG has optimal computational complexity, the cost of communication has become a significant bottleneck that limits its scalability as processor counts continue to grow on modern machines. This article examines the design, implementation, and parallel performance of a novel algorithm, algebraic multigrid domain decomposition (AMG-DD), designed specifically to limit communication. The goal of AMG-DD is to provide a low-communication alternative to standard AMG V-cycles by trading some additional computational overhead for a significant reduction in communication cost. Numerical results show that AMG-DD achieves superior accuracy per communication cost compared with AMG, and speedup over AMG is demonstrated on a large GPU cluster.

97 MATHEMATICS AND COMPUTING↗

Multistage mixed precision iterative refinement

Abstract Low precision arithmetic, in particular half precision (16‐bit) floating point arithmetic, is now available in commercial hardware. Using lower precision can offer significant savings in computation and communication costs with proportional savings in energy. Motivated by this, there has been a renewed interest in mixed precision iterative refinement schemes for solving linear systems , and new variants of GMRES‐based iterative refinement have been developed. Each particular variant with a given combination of precisions leads to different condition number‐based constraints for convergence of the backward and forward errors, and each has different performance costs. The constraints for convergence given in the literature are, as an artifact of the analyses, often overly strict in practice, and thus could lead a user to select a more expensive variant when a less expensive one would have sufficed. In this work, we develop a multistage mixed precision iterative refinement solver which aims to combine existing mixed precision approaches to balance performance and accuracy and improve usability. For a user‐specified initial combination of precisions, the algorithm begins with the least expensive approach and convergence is monitored via inexpensive computations with quantities produced during the iteration. If slow convergence or divergence is detected using particular stopping criteria, the algorithm switches to use a more expensive, but more reliable variant. A novel aspect of our approach is that, unlike existing implementations, our algorithm first attempts to use “stronger” GMRES‐based solvers for the solution update before resorting to increasing the precision(s). In some scenarios, this can avoid the need to refactorize the matrix in higher precision. We perform extensive numerical experiments on a variety of random dense problems and problems from real applications which confirm the benefits of the multistage approach.

Oktay, Eda↗

An embedded mesh method using piecewise constant multipliers with stabilization: mathematical and numerical aspects

An embedded mesh method using piecewise constant multipliers originally proposed by Puso et al. (CMAME, 2012) is analyzed here to determine effects of the pressure stabilization term and small cut cells. The approach is implemented for transient dynamics using the central difference scheme for the time discretization. It is shown that the resulting equations of motion are a stable linear system with a condition number independent of mesh size. Furthermore, we show that the constraints and the stabilization terms can be recast as non-proportional damping such that the time integration of the scheme is provably stable with a critical time step computed from the undamped equations of motion. Effects of small cuts are discussed throughout the presentation. A mesh study is conducted to evaluate the effects of the stabilization on the discretization error and conditioning and is used to recommend an optimal value for stabilization scaling parameter. Several nonlinear problems are also analyzed and compared with comparable conforming mesh results. Finally, we show several demanding problems highlighting the robustness of the proposed approach.

42 ENGINEERING↗

A least-squares finite element method based on the Helmholtz decomposition for hyperbolic balance laws

In this paper, a least-squares finite element method for scalar nonlinear hyperbolic balance laws is proposed and studied. The approach is based on a formulation that utilizes an appropriate Helmholtz decomposition of the flux vector and is related to the standard notion of a weak solution. This relationship, together with a corresponding connection to negative-norm least-squares, is described in detail. As a consequence, an important numerical conservation theorem is obtained, similar to the famous Lax–Wendroff theorem. The numerical conservation properties of the method in this paper do not fall precisely in the framework introduced by Lax and Wendroff, but they are similar in spirit as they guarantee that when L 2 convergence holds, the resulting approximations approach a weak solution to the hyperbolic problem. The least-squares functional is continuous and coercive in an H -1 -type norm, but not L 2 -coercive. Nevertheless, the L 2 convergence properties of the method are discussed. Convergence can be obtained either by an explicit regularization of the functional, that provides control of the L 2 norm, or by properly choosing the finite element spaces, providing implicit control of the L 2 norm. Numerical results for the inviscid Burgers equation with discontinuous source terms are shown, demonstrating the L 2 convergence of the obtained approximations to the physically admissible solution. The numerical method utilizes a least-squares functional, minimized on finite element spaces, and a Gauss–Newton technique with nested iteration. Finally, we believe that the linear systems encountered with this formulation are amenable to multigrid techniques and combining the method with adaptive mesh refinement would make this approach an efficient tool for solving balance laws (this is the focus of a future study).

97 MATHEMATICS AND COMPUTING↗

Solving a Large Scale Thermal Radiation Problem Using an Interoperable Executive Library Framework on Petascale Supercomputers

We present a novel methodology to compute the transient thermal condi- tion of a set of objects in an open space environment. The governing energy equa- tion and the convective energy transfer are solved by the sparse iterative solvers. The average radiating energy on a set of surfaces is represented by a linear system of the radiosity equations, which is factorized by an out-of-core parallel Cholesky decomposition solver. The coupling and interplay of the direct radiosity solver us- ing GPUs and the CPU-based sparse solver are handled by a light weight software integrator called Interoperable Executive Library (IEL). IEL manages the distribu- tion of data and memory, coordinates communication among parallel processes, and also directs execution of the set of loosely coupled physics tasks as warranted by the thermal condition of the simulated object and its surrounding environment.

Wong, Kwai↗

Leading-color two-loop amplitudes for four partons and a $\textit{W}$ boson in QCD

We present the leading-color two-loop QCD corrections for the scattering of four partons and a W boson, including its leptonic decay. The amplitudes are assembled from the planar two-loop helicity amplitudes for four partons and a vector boson decaying to a lepton pair, which are also used to determine the planar two-loop amplitudes for four partons and a $Z/γ^\ast$ boson with a leptonic decay. The analytic expressions are obtained by setting up a dedicated Ansatz and constraining the free parameters from numerical samples obtained within the framework of numerical unitarity. The large linear systems that must be solved to determine the analytic expressions are constructed to be in Vandermonde form. Such systems can be very efficiently solved, bypassing the bottleneck of Gaussian elimination. Our results are expressed in a basis of one-mass pentagon functions, which opens the possibility of their efficient numerical evaluation.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Numerical algorithms for water waves with background flow over obstacles and topography

Abstract We present two accurate and efficient algorithms for solving the incompressible, irrotational Euler equations with a free surface in two dimensions with background flow over a periodic, multiply connected fluid domain that includes stationary obstacles and variable bottom topography. One approach is formulated in terms of the surface velocity potential while the other evolves the vortex sheet strength. Both methods employ layer potentials in the form of periodized Cauchy integrals to compute the normal velocity of the free surface, are compatible with arbitrary parameterizations of the free surface and boundaries, and allow for circulation around each obstacle, which leads to multiple-valued velocity potentials but single-valued stream functions. We prove that the resulting second-kind Fredholm integral equations are invertible, possibly after a physically motivated finite-rank correction. In an angle-arclength setting, we show how to avoid curve reconstruction errors that are incompatible with spatial periodicity. We use the proposed methods to study gravity-capillary waves generated by flow around several elliptical obstacles above a flat or variable bottom boundary. In each case, the free surface eventually self-intersects in a splash singularity or collides with a boundary. We also show how to evaluate the velocity and pressure with spectral accuracy throughout the fluid, including near the free surface and solid boundaries. To assess the accuracy of the time evolution, we monitor energy conservation and the decay of Fourier modes and compare the numerical results of the two methods to each other. We implement several solvers for the discretized linear systems and compare their performance. The fastest approach employs a graphics processing unit (GPU) to construct the matrices and carry out iterations of the generalized minimal residual method (GMRES).

Ambrose, David M.↗

Multiscale two-stage solver for Biot’s poroelasticity equations in subsurface media

In this paper, we propose a two-stage preconditioner for accelerating the iterative solution by a Krylov subspace method of Biot’s poroelasticity equations based on a displacement-pressure formulation. The spatial discretization combines a finite element method for mechanics and a finite volume approach for flow. The fully implicit backward Euler scheme is used for time integration. The result is a 2 × 2 block linear system for each timestep. The preconditioning operator is obtained by applying a two-stage scheme. The first stage is a global preconditioner that employs multiscale basis functions to construct coarse-scale coupled systems using a Galerkin projection. This global stage is effective at damping low-frequency error modes associated with long-range coupling of the unknowns. The second stage is a local block-triangular smoothing preconditioner, which is aimed at high-frequency error modes associated with short-range coupling of the variables. Lastly, various numerical experiments are used to demonstrate the robustness of the proposed solver.

58 GEOSCIENCES↗

Approximate inverse-based block preconditioners in poroelasticity

We focus on the fully implicit solution of the linear systems arising from a three-field mixed finite element approximation of Biot’s poroleasticity equations. The objective is to develop algebraic block preconditioners for the efficient solution of such systems by Krylov subspace methods. In this work, we investigate the use of approximate inverse-based techniques to decouple the native system of equations and obtain explicit sparse approximations of the Schur complements related to the physics-based partitioning of the unknowns by field type. Here, the proposed methods are tested in various numerical experiments including real-world applications dealing with petroleum and geotechnical engineering.

54 ENVIRONMENTAL SCIENCES↗

A smeared crack modeling framework accommodating multi-directional fracture at finite strains

A generic smeared crack modeling framework predicated on the deformation gradient decomposition (DGD) approach is proposed for use in dynamic fracture problems at finite strains, accommodating failure along multiple mutually orthogonal fracture planes embedded within an independently defined bulk material model. Within this constitutive framework, the traction equilibrium conditions imposed at each failure surface are used to determine the associated crack displacements stored as internal state variables. In general, the enforcement of interfacial equilibrium entails the implicit solution of a non-linear system of equations within the constitutive update procedure. However, if inertial effects arising due to the relative motion of the fractured material are incorporated within the model, the traction equilibrium conditions are shown to give rise to corresponding dynamic equations of motion governing the time-evolution of the crack opening displacements. For dynamic problems, an explicit time-integration procedure is devised to efficiently update the material state, subject to a set of internal frictionless contact constraints to prevent material inversion. Finally, the efficacy of the proposed modeling framework is investigated through several benchmark dynamic fracture problems run within the explicit finite element code DYNA3D.

42 ENGINEERING↗

SLAC Microresonator Radio Frequency (SMuRF) Electronics for Read Out of Frequency-Division-Multiplexed Cryogenic Sensors

Large arrays of cryogenic sensors for various imaging applications ranging across x-ray, gamma-ray, cosmic microwave background, mm/sub-mm, as well as particle detection increasingly rely on superconducting microresonators for high multiplexing factors. These microresonators take the form of microwave SQUIDs that couple to transition-edge sensors or microwave kinetic inductance detectors. In principle, such arrays can be read out with vastly scalable software-defined radio using suitable FPGAs, ADCs and DACs. In this work, we share plans and show initial results for SLAC Microresonator Radio Frequency (SMuRF) electronics, a next-generation control and readout system for superconducting microresonators. SMuRF electronics are unique in their implementation of specialized algorithms for closed-loop tone tracking, which consists of fast feedback and feedforward to each resonator’s excitation parameters based on transmission measurements. Closed-loop tone tracking enables improved system linearity, a significant increase in sensor count per readout line, and the possibility of overcoupled resonator designs for enhanced dynamic range. Low-bandwidth prototype electronics were used to demonstrate closed-loop tone tracking on twelve 300-kHz-wide microwave SQUID resonators, spaced at ~ 6 MHz with center frequencies ~ 5–6 GHz. We achieve multi-kHz tracking bandwidth and demonstrate that the noise floor of the electronics is subdominant to the noise intrinsic in the multiplexer.

47 OTHER INSTRUMENTATION↗

Simons Observatory Microwave SQUID Multiplexing Readout: Cryogenic RF Amplifier and Coaxial Chain Design

The Simons Observatory (SO) is an upcoming polarization-sensitive cosmic microwave background experiment on the Cerro Toco Plateau (Chile) with large overlap with other optical and infrared surveys (e.g., DESI, LSST, HSC). To enable the readout of O(10,000) detectors in each of the four telescopes of SO, we will employ the microwave SQUID multiplexing technology. With a targeted multiplexing factor of O(1000), microwave SQUID multiplexing has never been deployed on the scale needed for SO. Here we present the design of the cryogenic coaxial cable and RF component chain that connects room temperature readout electronics to superconducting resonators that are coupled to transition edge sensor bolometers operating at sub-Kelvin temperatures. We describe design considerations including cryogenic RF component selection, system linearity, noise, and thermal power dissipation.

47 OTHER INSTRUMENTATION↗