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 577 records · Page 32

Hybrid Finite Element--Spectral Method for the Fractional Laplacian: Approximation Theory and Efficient Solver

Here, a numerical scheme is presented for approximating fractional order Poisson problems in two and three dimensions. The scheme is based on reformulating the original problem posed over $\Omega$ on the extruded domain $\mathcal{C}=\Omega\times[0,\infty)$ following. The resulting degenerate elliptic integer order PDE is then approximated using a hybrid FEM-spectral scheme. Finite elements are used in the direction parallel to the problem domain $\Omega$, and an appropriate spectral method is used in the extruded direction. The spectral part of the scheme requires that we approximate the true eigenvalues of the integer order Laplacian over $\Omega$. We derive an a priori error estimate which takes account of the error arising from using an approximation in place of the true eigenvalues. We further present a strategy for choosing approximations of the eigenvalues based on Weyl's law and finite element discretizations of the eigenvalue problem. The system of linear algebraic equations arising from the hybrid FEM-spectral scheme is decomposed into blocks which can be solved effectively using standard iterative solvers such as multigrid and conjugate gradient. Numerical examples in two and three dimensions suggest that the approach is quasi-optimal in terms of complexity.

97 MATHEMATICS AND COMPUTING↗

BAM: bias assignment method to generate mock catalogues

Combining the statistics of dark matter tracers from a high-resolution cosmological N-body simulation and the dark matter density field calculated from down-sampled initial conditions using efficient structure formation solvers, we extract the halo-bias relation on a mesh of a 3$h^{-1}$ Mpc cell side resolution as a function of properties of the dark matter density field (e.g. local density, cosmic web type), automatically including stochastic, deterministic, local and non-local components. We use this information to sample the halo density field, accounting for ignored dependencies through an iterative process. By construction, our approach reaches ~1% accuracy in the majority of the k-range up to the Nyquist frequency without systematic deviations for power spectra (about $k ~ 1h$ Mpc -1 ) using either particle mesh or Lagrangian perturbation theory based solvers. When using phase-space mapping to compensate the low resolution of the approximate gravity solvers, our method reproduces the bispectra of the reference within 10% precision studying configurations tracing the quasi-non-linear regime. BAM has the potential to become a standard technique to produce mock halo and galaxy catalogues for future galaxy surveys and cosmological studies being highly accurate, efficient and parameter free.

79 ASTRONOMY AND ASTROPHYSICS↗

Combined, nonlinear aerodynamic and structural method for the aeroelastic design of a three-dimensional wing in supersonic flow

An iterative procedure for the static aeroelastic design of a flexible wing at supersonic speeds has been developed. The procedure combines a nonlinear, full-potential solver (NCOREL) with an equivalent plate structural analysis method. The NCOREL method yields significantly improved aerodynamic estimates compared to linear theory. The equivalent plate structural analysis method demonstrates an order of magnitude reduction in computer memory and execution time compared to finite-element methods. A highly swept wing is analyzed at high lift using this aeroelastic procedure. The results indicate that the wing deforms favorably due to aerodynamic loading and, consequently, that the inviscid drag levels do not vary at the required lift coefficient although the angle of attack varies significantly. A sensitivity analysis of the type required for optimization studies was also performed with the aeroelastic design procedure.

Pittman, J. L.↗

A global multilevel atmospheric model using a vector semi-Lagrangian finite-difference scheme. I - Adiabatic formulation

An adiabatic global multilevel primitive equation model using a two time-level, semi-Lagrangian semi-implicit finite-difference integration scheme is presented. A Lorenz grid is used for vertical discretization and a C grid for the horizontal discretization. The momentum equation is discretized in vector form, thus avoiding problems near the poles. The 3D model equations are reduced by a linear transformation to a set of 2D elliptic equations, whose solution is found by means of an efficient direct solver. The model (with minimal physics) is integrated for 10 days starting from an initialized state derived from real data. A resolution of 16 levels in the vertical is used, with various horizontal resolutions. The model is found to be stable and efficient, and to give realistic output fields. Integrations with time steps of 10 min, 30 min, and 1 h are compared, and the differences are found to be acceptable.

Bates, J. R.↗

Comparison of spherical harmonics method and discrete ordinates method for radiative transfer in a turbulent jet flame

Here, in this study, we systematically compared the accuracy and computational cost of two popular solution methods for the radiative transfer equation (RTE): the spherical harmonics method (P N ) and the discrete ordinates method (DOM). We first investigated convergence characteristics of different orders of P N and DOM in a series of 1D homogeneous configurations with varying optical thicknesses. Both solvers perform better for optically thicker cases. The accuracy of P N methods increases with its order, , but the gain in accuracy reduces with the increase in , i.e., improvement of P 7 over P 5 is less than that of P 3 over P 1 . This decreasing trend becomes more prominent as the optical thickness decreases. On the other hand, DOM’s accuracy increases almost linearly with the increase in the number of ordinates (or polar angles in this study) in all cases. While comparing the directional profile of radiative intensity, both solvers perform better when the radiative intensity is more isotropic. These solvers were then connected with a full spectrum k-distribution (FSK) spectral model and used to perform radiation-coupled simulations of a turbulent jet flame in an axi-symmetric cylindrical domain. Results obtained from P 1 to P 7 approximations for P N , and 2 x 4, 4 x 4, 4 x 8, 8 x 8 finite angles for DOM are compared with that from an optically thin model, and a reference solution from line-by-line (LBL) photon Monte Carlo (PMC) method. The choice of radiation solver shows a noticeable impact on the temperature distribution of the flame. The P N solvers lead to slightly higher radiant fractions and the DOM solvers lead to slightly lower radiant fractions than the PMC benchmark solution. Finally, the computational costs of each of these solvers are also reported and an intermittent evaluation / time blending scheme to improve the computational efficiency of radiation solvers in radiation-coupled simulations are also demonstrated.

42 ENGINEERING↗

On the Development of an Efficient Parallel Hybrid Solver with Application to Acoustically Treated Aero-Engine Nacelles

A finite element solution to the convected Helmholtz equation in a nonuniform flow is used to model the noise field within 3-D acoustically treated aero-engine nacelles. Options to select linear or cubic Hermite polynomial basis functions and isoparametric elements are included. However, the key feature of the method is a domain decomposition procedure that is based upon the inter-mixing of an iterative and a direct solve strategy for solving the discrete finite element equations. This procedure is optimized to take full advantage of sparsity and exploit the increased memory and parallel processing capability of modern computer architectures. Example computations are presented for the Langley Flow Impedance Test facility and a rectangular mapping of a full scale, generic aero-engine nacelle. The accuracy and parallel performance of this new solver are tested on both model problems using a supercomputer that contains hundreds of central processing units. Results show that the method gives extremely accurate attenuation predictions, achieves super-linear speedup over hundreds of CPUs, and solves upward of 25 million complex equations in a quarter of an hour.

Watson, Willie R.↗

A graphics processing unit accelerated sparse direct solver and preconditioner with block low rank compression

We present the GPU implementation efforts and challenges of the sparse solver package STRUMPACK. The code is made publicly available on github with a permissive BSD license. STRUMPACK implements an approximate multifrontal solver, a sparse LU factorization which makes use of compression methods to accelerate time to solution and reduce memory usage. Multiple compression schemes based on rank-structured and hierarchical matrix approximations are supported, including hierarchically semi-separable, hierarchically off-diagonal butterfly, and block low rank. Here, in this paper, we present the GPU implementation of the block low rank (BLR) compression method within a multifrontal solver. Our GPU implementation relies on highly optimized vendor libraries such as cuBLAS and cuSOLVER for NVIDIA GPUs, rocBLAS and rocSOLVER for AMD GPUs and the Intel oneAPI Math Kernel Library (oneMKL) for Intel GPUs. Additionally, we rely on external open source libraries such as SLATE (Software for Linear Algebra Targeting Exascale), MAGMA (Matrix Algebra on GPU and Multi-core Architectures), and KBLAS (KAUST BLAS). SLATE is used as a GPU-capable ScaLAPACK replacement. From MAGMA we use variable sized batched dense linear algebra operations such as GEMM, TRSM and LU with partial pivoting. KBLAS provides efficient (batched) low rank matrix compression for NVIDIA GPUs using an adaptive randomized sampling scheme. The resulting sparse solver and preconditioner runs on NVIDIA, AMD and Intel GPUs. Interfaces are available from PETSc, Trilinos and MFEM, or the solver can be used directly in user code. We report results for a range of benchmark applications, using the Perlmutter system from NERSC, Frontier from ORNL, and Aurora from ALCF. For a high frequency wave equation on a regular mesh, using 32 Perlmutter compute nodes, the factorization phase of the exact GPU solver is about 6.5× faster compared to the CPU-only solver. The BLR-enabled GPU solver is about 13.8× faster than the CPU exact solver. For a collection of SuiteSparse matrices, the STRUMPACK exact factorization on a single GPU is on average 1.9× faster than NVIDIA’s cuDSS solver.

97 MATHEMATICS AND COMPUTING↗

Simulations of bypass transition for spatially evolving disturbances

The spatial evolution of disturbances in plane Poiseuille flow and zero pressure gradient boundary layer flow is considered. For disturbances governed by the linearized equations, potential for significant transient growth of the amplitude is demonstrated. The maximum amplification occurs for disturbances with zero or near zero frequencies. Spatial numerical simulations of the transition scenario involving a pair of oblique waves has been conducted for both flows. A fully spectral solver using a simple but efficient fringe region technique allowed the flows to be computed with high resolution into the fully turbulent domain. A modal decomposition of the simulation results indicates that non-linear excitation of the transient growth is responsible for the rapid emergence of low-frequency structures. Physically, this corresponds to streaky flow structures, as seen from the results of a numerical amplitude expansion. Thus, this spatial transition scenario has been found to be similar to the corresponding temporal one. In the boundary layer simulations the streaks are seen to break down from what appears to be a secondary instability.

Lundbladh, A.↗

Cross-verification of neoclassical transport solutions from XGCa against NEO

Radial neoclassical transport from the global gyrokinetic code XGC has been cross-verified against the local drift-kinetic neoclassical code NEO in NEO's local regime using a Grad-Shafranov equilibrium with a circular boundary. XGC shows excellent agreement with NEO, except for a difference of approximately 10% in the ion heat flux. Close investigation reveals that this difference is due to the simplification in NEO to use the same Coulomb logarithm ln Λ to represent all particle species, while XGC uses different formulas for collisions between different species. When XGC uses NEO's Coulomb logarithm, excellent agreement in the ion heat flux is recovered. Here, the present work not only crossverifies the equation solvers in two codes, but also verifies that the gyrokinetic and the drift-kinetic equations agree and that the linearized and nonlinear Coulomb collision operators agree in the mild gradient, local regime.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Observation of synergy between lower hybrid waves at two frequencies in EAST

Synergistic effects between two frequencies of lower hybrid (LH) waves—operating at 2.45 and 4.6 GHz—were observed in experiment on EAST for the first time. At low density (ne,lin≈2.0×1019 m−3), simultaneous injection of a 65/35 mix of 2.45/4.6 GHz power achieved an lower hybrid current drive efficiency that was 25% higher than what should be expected from the linear combination of the two sources. The experiment was interpreted with time-dependent simulations, using the equilibrium and transport solver TRANSP, coupled with the ray-tracing code GENRAY and the Fokker–Planck solver CQL3D. For each discharge, profiles of current and hard x-rays from simulation and measurement agree within uncertainties. An examination of the electron distribution function indicates that the LH synergy is supported by the increased width of the LH resonance plateau in the simultaneous injection case compared to independent injection.

Choi, W. (ORCID:0000000268912300)↗

Exploring the growth index γ L : Insights from different CMB dataset combinations and approaches

In this study we investigate the growth index γ L , which characterizes the growth of linear matter perturbations, while analysing different cosmological datasets. We compare the approaches implemented by two different patches of the cosmological solver : and __. In our analysis we uncover a deviation of the growth index from its expected Λ CDM value of 0.55 when utilizing the Planck dataset, both in the case and in the __ case, but in opposite directions. This deviation is accompanied by a change in the direction of correlations with derived cosmological parameters. However, the incorporation of cosmic microwave background lensing data helps reconcile γ L with its Λ -cold dark matter value in both cases. Conversely, the alternative ground-based telescopes Atacama Cosmology Telescope and South Pole Telescope consistently yield growth index values in agreement with γ L = 0.55 . We conclude that the presence of the A lens problem in the Planck dataset contributes to the observed deviations, underscoring the importance of additional datasets in resolving these discrepancies. Published by the American Physical Society 2024

Astronomy & Astrophysics↗

Parallel-in-Time Solution of Scalar Nonlinear Conservation Laws

Here, we consider the parallel-in-time solution of scalar nonlinear conservation laws in one spatial dimension. The equations are discretized in space with a conservative finite-volume method using weighted essentially nonoscillatory (WENO) reconstructions, and in time with high-order explicit Runge–Kutta methods. The solution of the global, discretized space-time problem is sought via a nonlinear iteration that uses a novel linearization strategy in cases of nondifferentiable equations. Under certain choices of discretization and algorithmic parameters, the nonlinear iteration coincides with Newton’s method, although, more generally, it is a preconditioned residual correction scheme. At each nonlinear iteration, the linearized problem takes the form of a certain discretization of a linear conservation law over the space-time domain in question. An approximate parallel-in-time solution of the linearized problem is computed with a single multigrid reduction-in-time (MGRIT) iteration; however, any other effective parallel-in-time method could be used in its place. The MGRIT iteration employs a novel coarse-grid operator that is a modified conservative semi-Lagrangian discretization and generalizes those we have developed previously for nonconservative scalar linear hyperbolic problems. Numerical tests are performed for the inviscid Burgers and Buckley–Leverett equations. For many test problems, the solver converges in just a handful of iterations with a convergence rate independent of mesh resolution, including problems with (interacting) shocks and rarefactions.

97 MATHEMATICS AND COMPUTING↗

Observation of synergy between lower hybrid waves at two frequencies in EAST

Synergistic effects between two frequencies of lower hybrid (LH) waves—operating at 2.45 and 4.6 GHz—were observed in experiment on EAST for the first time. At low density (n_e,lin ≈ 2.0 × 10^19m^−3), simultaneous injection of a 65/35 mix of 2.45 GHz/4.6 GHz power achieved an LHCD efficiency that was 25% higher than what should be expected from the linear combination of the two sources. The experiment was interpreted with time-dependent simulations, using the equilibrium and transport solver TRANSP, coupled with the ray-tracing code GENRAY and the Fokker-Planck solver CQL3D. For each discharge, profiles of current and hard x-ray from simulation and measurement agree within uncertainties. An examination of the electron distribution function indicates that the LH synergy is supported by the increased width of the LH resonance plateau in the simultaneous injection case compared to independent injection.

Lower hybrid synergy↗

Rapid Optimization of Total Variation with Applications in Imaging, Additive Manufacturing, and Qualification

Total Variation optimization penalizes the gradient of a control variable or state. While this work focuses on image processing in particular, it has also found applications in inverse problems and topology optimization. In image processing, the goal is to maintain faithfulness to the original image while denoising and/or deblurring. Additionally, bilevel optimization over the spatially varying regularization weights can illuminate interfaces such as damage regions and other anomalies. We will address two fundamental challenges with TV-optimization: (i) the typical slow convergence of existing TV-optimization methods, and (ii) the selection of spatially varying TV parameters to promote interface detection. Additionally, we will apply such techniques to image data collected in additive manufacturing. In said context, stochasticity in build events induces flaws in the manufactured piece, compromising the integrity of said part. There is a critical need for in-situ monitoring to spot anomalies once they form, and in this setting we apply our total variation and hyperparameter solvers. We will develop a customized algorithm based on for extreme-scale TV-optimization that achieves super-linear or quadratic-convergence, a critical property for real-time, image-by-image analysis. A worst-case outcome is a preprocessing step that enhances image quality in-situ, specifically for out-of-focus and noisy images.

36 MATERIALS SCIENCE↗

A Nonlinear Modal Aeroelastic Solver for FUN3D

A nonlinear structural solver has been implemented internally within the NASA FUN3D computational fluid dynamics code, allowing for some new aeroelastic capabilities. Using a modal representation of the structure, a set of differential or differential-algebraic equations are derived for general thin structures with geometric nonlinearities. ODEPACK and LAPACK routines are linked with FUN3D, and the nonlinear equations are solved at each CFD time step. The existing predictor-corrector method is retained, whereby the structural solution is updated after mesh deformation. The nonlinear solver is validated using a test case for a flexible aeroshell at transonic, supersonic, and hypersonic flow conditions. Agreement with linear theory is seen for the static aeroelastic solutions at relatively low dynamic pressures, but structural nonlinearities limit deformation amplitudes at high dynamic pressures. No flutter was found at any of the tested trajectory points, though LCO may be possible in the transonic regime.

Goldman, Benjamin D.↗

A Framework for Mesh-Geometry Associativity during Mesh Adaptation

A framework has been developed for describing how a computational mesh is associated to the geometry model it discretizes. The target application of this framework is surface mesh adaptation in a CFD flow solver. The framework, called MeshLink, consists of two components. First, a schema has been defined for describing the one-to-many associativity of a surface mesh to the geometry model entities to which it is attached. Second, a high-level library provides a kernel-agnostic wrapper for providing the necessary geometry queries to an application (e.g., mesher, flow solver). Both the schema and library are provided freely and openly. MeshLink’s ability to support solution mesh adaptation on linear and curved meshes for a high-order flow solution is demonstrated on several test cases relevant to the aerospace and automotive industries.

mesh adaptation↗

Gravitational Self-force Errors of Poisson Solvers on Adaptively Refined Meshes

An error in the gravitational force that the source of gravity induces on itself (a self-force error) violates both the conservation of linear momentum and the conservation of energy. If such errors are present in a self-gravitating system and are not sufficiently random to average out, the obtained numerical solution will become progressively more unphysical with time: the system will acquire or lose momentum and energy due to numerical effects. In this paper, we demonstrate how self-force errors can arise in the case where self-gravity is solved on an adaptively refined mesh when the refinement is nonuniform. Here, we provide the analytical expression for the self-force error and numerical examples that demonstrate such self-force errors in idealized settings. We also show how these errors can be corrected to an arbitrary order by straightforward addition of correction terms at the refinement boundaries.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Optimizing multigrid reduction-in-time and Parareal coarse-grid operators for linear advection

Parallel-in-time methods, such as multigrid reduction-in-time (MGRIT) and Parareal, provide an attractive option for increasing concurrency when simulating time-dependent partial differential equations (PDEs) in modern high-performance computing environments. While these techniques have been very successful for parabolic equations, it has often been observed that their performance suffers dramatically when applied to advection-dominated problems or purely hyperbolic PDEs using standard rediscretization approaches on coarse grids. In this paper, we apply MGRIT or Parareal to the constant-coefficient linear advection equation, appealing to existing convergence theory to provide insight into the typically nonscalable or even divergent behavior of these solvers for this problem. To overcome these failings, we replace rediscretization on coarse grids with improved coarse-grid operators that are computed by applying optimization techniques to approximately minimize error estimates from the convergence theory. Therefore, one of our main findings is that, in order to obtain fast convergence as for parabolic problems, coarse-grid operators should take into account the behavior of the hyperbolic problem by tracking the characteristic curves. Our approach is tested for schemes of various orders using explicit or implicit Runge–Kutta methods combined with upwind-finite-difference spatial discretizations. In all cases, we obtain scalable convergence in just a handful of iterations, with parallel tests also showing significant speed-ups over sequential time-stepping.

97 MATHEMATICS AND COMPUTING↗