Search NASA⌕ Search

SEARCH · Search NASA

Results for “pseudospectral”

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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

A pseudospectral implicit particle-in-cell method with exact energy and charge conservation

The standard particle-in-cell (PIC) method employs explicit finite-difference (FD) methods (e.g. the leap-frog scheme) for both spatial and temporal integrations. Here, we employ a pseudospectral method for solving the Poisson equation and a fully implicit time integration to achieve exact energy conservation. The advantage of a pseudospectral field solver is its spectral accuracy in solving field solutions. Earlier studies of implicit time integration of PIC FD equations can enforce exact energy exchange between field and particles, resulting in exact energy-conserving schemes. Here, we prove that the exact energy conservation property can be carried over to the pseudospectral scheme. Simultaneously, we provide a solution to ensure a pseudospectral charge continuity equation. We demonstrate the new scheme in a 2D electrostatic PIC code. In conclusion, theoretical results are confirmed via numerical examples.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
NASA NTRS2013

SpF: Enabling Petascale Performance for Pseudospectral Dynamo Models

Pseudospectral (PS) methods possess a number of characteristics (e.g., efficiency, accuracy, natural boundary conditions) that are extremely desirable for dynamo models. Unfortunately, dynamo models based upon PS methods face a number of daunting challenges, which include exposing additional parallelism, leveraging hardware accelerators, exploiting hybrid parallelism, and improving the scalability of global memory transposes. Although these issues are a concern for most models, solutions for PS methods tend to require far more pervasive changes to underlying data and control structures. Further, improvements in performance in one model are difficult to transfer to other models, resulting in significant duplication of effort across the research community.We have developed an extensible software framework for pseudospectral methods called SpF that is intended to enable extreme scalability and optimal performance. High-level abstractions provided by SpF unburden applications of the responsibility of managing domain decomposition and load balance while reducing the changes in code required to adapt to new computing architectures. The key design concept in SpF is that each phase of the numerical calculation is partitioned into disjoint numerical kernels that can be performed entirely in-processor. The granularity of domain-decomposition provided by SpF is only constrained by the data-locality requirements of these kernels. SpF builds on top of optimized vendor libraries for common numerical operations such as transforms, matrix solvers, etc., but can also be configured to use open source alternatives for portability. SpF includes several alternative schemes for global data redistribution and is expected to serve as an ideal testbed for further research into optimal approaches for different network architectures.In this presentation, we will describe the basic architecture of SpF as well as preliminary performance data and experience with adapting legacy dynamo codes. We will conclude with a discussion of planned extensions to SpF that will provide pseudospectral applications with additional flexibility with regard to time integration, linear solvers, and discretization in the radial direction.

Pseudospectral (PS)↗
NASA NTRS2014

Using SpF to Achieve Petascale for Legacy Pseudospectral Applications

Pseudospectral (PS) methods possess a number of characteristics (e.g., efficiency, accuracy, natural boundary conditions) that are extremely desirable for dynamo models. Unfortunately, dynamo models based upon PS methods face a number of daunting challenges, which include exposing additional parallelism, leveraging hardware accelerators, exploiting hybrid parallelism, and improving the scalability of global memory transposes. Although these issues are a concern for most models, solutions for PS methods tend to require far more pervasive changes to underlying data and control structures. Further, improvements in performance in one model are difficult to transfer to other models, resulting in significant duplication of effort across the research community. We have developed an extensible software framework for pseudospectral methods called SpF that is intended to enable extreme scalability and optimal performance. Highlevel abstractions provided by SpF unburden applications of the responsibility of managing domain decomposition and load balance while reducing the changes in code required to adapt to new computing architectures. The key design concept in SpF is that each phase of the numerical calculation is partitioned into disjoint numerical kernels that can be performed entirely inprocessor. The granularity of domain decomposition provided by SpF is only constrained by the datalocality requirements of these kernels. SpF builds on top of optimized vendor libraries for common numerical operations such as transforms, matrix solvers, etc., but can also be configured to use open source alternatives for portability. SpF includes several alternative schemes for global data redistribution and is expected to serve as an ideal testbed for further research into optimal approaches for different network architectures. In this presentation, we will describe our experience in porting legacy pseudospectral models, MoSST and DYNAMO, to use SpF as well as present preliminary performance results provided by the improved scalability.

DYNAMO↗
NASA NTRS1984

A pseudospectral Legendre method for hyperbolic equations with an improved stability condition

A new pseudospectral method is introduced for solving hyperbolic partial differential equations. This method uses different grid points than previously used pseudospectral methods: in fact the grid are related to the zeroes of the Legendre polynomials. The main advantage of this method is that the allowable time step is proportional to the inverse of the number of grid points 1/N rather than to 1/n(2) (as in the case of other pseudospectral methods applied to mixed initial boundary value problems). A highly accurate time discretization suitable for these spectral methods is discussed.

Tal-Ezer, H.↗
NASA NTRS1986

A pseudospectral Legendre method for hyperbolic equations with an improved stability condition

A new pseudospectral method is introduced for solving hyperbolic partial differential equations. This method uses different grid points than previously used pseudospectral methods: in fact the grid points are related to the zeroes of the Legendre polynomials. The main advantage of this method is that the allowable time step is proportional to the inverse of the number of grid points 1/N rather than to 1/n(2) (as in the case of other pseudospectral methods applied to mixed initial boundary value problems). A highly accurate time discretization suitable for these spectral methods is discussed.

Tal-Ezer, Hillel↗
NASA NTRS1981

Pseudospectral method for problems with nonperiodic boundary conditions

The capability of the pseudospectral technique and the time integration scheme for the time dependent nonperiodic problem is demonstrated. Significant improvements are shown in the accuracy for calculation of the two dimensional time dependent advection diffusion equation. The pseudospectral method is a viable alternative to the finite difference methods for the equation of the spatial deriviations.

Lee, H. N.↗
NASA NTRS1981

The stability of pseudospectral-Chebyshev methods

The pseudospectral-Chebyshev methods are shown to be convergent in variable coefficient problems and, in some cases, hyperbolic problems. The analysis demonstrates that the rate of convergence is greater for finite difference methods or the finite element method. For a single first-order hyperbolic equation, the method is seen as remaining stable even when the coefficient changes sign, although in this case it is specified that care must be taken to have adequate spatial resolution. It is noted that this fact, combined with the fact that collocation methods are easy to apply in the nonlinear case, shows that the pseudospectral method is in general preferable to the Galerkin or Tau methods.

Gottlieb, D.↗
DOE OSTI2023

Real-time control of connected vehicles in signalized corridors using pseudospectral convex optimization

Recent advances in Connected and Automated Vehicle (CAV) technologies have opened up new opportunities to enable safe, efficient, and sustainable transportation systems. However, developing reliable and rapid speed control algorithms in highly dynamic environments with complex inter-vehicle interactions and nonlinear vehicle dynamics is still a daunting task. In this paper, we develop a novel speed control method for CAVs to produce optimal speed profiles that minimize the fuel consumption and avoid idling at signalized intersections. To this end, an optimal control problem is formulated using the information of the upcoming traffic signal to adapt vehicles' speeds to avoid frequent stop-and-go driving patterns. Here, by applying the pseudospectral discretization method and the sequential convex programming method, the computational efficiency is greatly improved, enabling potential real-time on-vehicle applications. In addition, the algorithm is implemented under a model predictive control framework to ensure online control with instant response for collision avoidance and robust vehicle coordination. The proposed algorithm is verified through numerical simulations of three different traffic scenarios. The convergence and accuracy of the proposed approach are demonstrated by comparing with a popular nonlinear solver. Furthermore, the benefit of the proposed method in both traffic mobility and fuel efficiency is validated using the speed profile determined from a traffic following model in a simulation software as the baseline.

42 ENGINEERING↗
DOE OSTI2023

Pseudospectral convex optimization for on-ramp merging control of connected vehicles

It can be a daunting task for human drivers to merge into highways because of the intricate vehicle negotiations and potential risk within limited time and space. Connected vehicle (CV) technologies could be a solution to this problem and offer many benefits to the road safety, traffic mobility, and energy efficiency. However, real-time optimal control of CVs is still an open challenge, due to the nonlinear vehicle dynamics, non-convex fuel consumption model, and highly dynamic uncertain inter-vehicle interactions. To tackle these issues, a novel real-time optimal control approach that balances the computational efficiency and solution optimality is proposed for the purpose of onboard application. To this end, the pseudospectral collocation method is integrated with a sequential convex programming approach to develop two new optimization algorithms, which are implemented within a model predictive control (MPC) framework to allow for real-time generation of optimal merging speed profiles. One algorithm leverages the line search technique to improve convergence, and the other benefits from the trust region method for better computational efficiency. The optimality and convergence process of both proposed algorithms are investigated by comparing their solutions with a popular non-linear solver. Furthermore, simulation results show that the proposed methods outperform the benchmark in terms of computational cost, fuel consumption, and traffic efficiency. In particular, the proposed fuel-economy merging rule can save 57.1% fuel consumption on average on four different traffic volumes. Meanwhile, the proposed optimal control algorithms can reduce 2.2% travel time on average comparing to the “first-in-first-out” merging rule.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2025

Accelerating magnonic simulations with the pseudospectral Landau-Lifshitz equation

The pseudospectral Landau-Lifshitz (PS-LL) model can describe atomic-scale magnetic exchange interactions within a continuum framework. This is achieved by employing a convolution kernel that models the nonlocal interaction in a grid-independent manner. Even though the PS-LL was originally introduced to address atomic exchange, any nonlocal kernel can be modeled. In the field of magnonics, the dipole field is fundamental to describe the dispersion relation of magnons, the quasiparticle representation of angular momentum. Because dipole-dipole interactions are long-range, numerical approaches typically rely on convolutions. Here, we demonstrate that the PS-LL model can be used to perform magnonic simulations with a single convolution kernel derived from analytical solutions. We demonstrate a twofold increase in computational speed compared with the full dipole calculation. This approach is valid insofar as the excitations are linear, which is typically the case for magnons. Our results have the potential to accelerate magnonic research, particularly for the inverse design method, where several simulations must be performed to achieve the desired outcome.

Mathematics and computing↗
DOE OSTI2026

Relativistic Exact Two-Component Theory in the Generalized Pseudospectral Representation

We present a formulation and implementation of exact two-component (X2C) relativistic theory in the generalized pseudospectral representation. When combined with the Hartree-Fock-Slater framework, this approach enables efficient and accurate treatments of scalar-relativistic and spin-orbit effects in atomic electronic structures without the computational overhead of four-component methods. Benchmark calculations across light and heavy elements demonstrate that the our X2C scheme yields substantially more accurate relativistic corrections to core-electron binding energies than perturbational Breit-Pauli treatments while converging more rapidly with respect to basis size. The method provides an improved computational framework for modeling ultrafast x-ray-induced processes in heavy-element systems.

Wang, Xubo↗
DOE OSTI2024

Pseudospectral Landau-Lifshitz description of magnetization dynamics

Magnetic materials host a wealth of nonlinear dynamics, textures, and topological defects. This is possible due to the competition between strong nonlinearity and dispersion, which act at the atomic scale, as well as long-range interactions. However, these features are difficult to study analytically and numerically because of the vastly different temporal and spatial scales involved. Here, in this work, we present a pseudospectral approach for the Landau-Lifshitz equation that invokes energy and momentum conservation embodied in the magnon dispersion relation to accurately describe both atomic and continuum limits. Furthermore, this approach enables analytical study at every scale. We show the applicability of this model in both the continuum and atomic limit by investigating modulational instability and ultrafast evolution of magnetization due to transient grating, respectively, in a one-dimensional ferromagnetic chain with perpendicular magnetic anisotropy. This model provides the possibility of grid-independent multiscale numerical approaches that will enable the description of singularities within a single framework.

1-dimensional spin chains↗
DOE OSTI2024

Pseudospectral particle-in-cell formulation with arbitrary charge and current-density time dependencies for the modeling of relativistic plasmas

This paper introduces a formulation of the particle-in-cell (PIC) method for the modeling of relativistic plasmas, that leverages the ability of the pseudospectral analytical time-domain solver (PSATD) to handle arbitrary time dependencies of the charge and current densities during one PIC cycle (applied to second-order polynomial dependencies here). Here, the formulation is applied to a modified set of Maxwell's equations that was proposed earlier in the context of divergence cleaning, and to recently proposed extensions of the PSATD-PIC algorithm. Detailed analysis and testings revealed that, under some condition, the formulation can expand the range of numerical parameters under which PIC simulations are stable and accurate when modeling relativistic plasmas such as, e.g., plasma-based particle accelerators.

43 PARTICLE ACCELERATORS↗
DOE OSTI2022

Real-Time On-Ramp Merging Control of Connected and Automated Vehicles using Pseudospectral Convex Optimization

Highway on-ramp merging can be a challenging task for human drivers due to the complex vehicle negotiations and interactions in limited time and space. Connected and automated vehicles (CAVs) have great potential to address the problem and offer many benefits in terms of safety, traffic efficiency, and fuel economy. However, real-time optimal control of CAVs still faces many challenges, including nonlinear dynamics, complex inter-vehicle interactions, and a highly dynamic and uncertain traffic environment. To address these challenges, we develop a novel control approach that balances the solution optimality and computational efficiency to determine optimal merging speed profiles in real time. Specifically, by employing a pseudospectral method and a sequential convex programming approach, two algorithms are proposed and implemented within the model predictive control (MPC) framework to enable real-time generation of optimal solutions for potential on-vehicle applications. The convergence and optimality of the proposed algorithms are validated by comparing with a general-purpose solver under different traffic scenarios.

Shi, Yang↗
NASA NTRS1981

Stability of pseudospectral and finite-difference methods for variable coefficient problems

It is shown that pseudospectral approximation to a special class of variable coefficient one-dimensional wave equations is stable and convergent even though the wave speed changes sign within the domain. Computer experiments indicate similar results are valid for more general problems. Similarly, computer results indicate that the leapfrog finite-difference scheme is stable even though the wave speed changes sign within the domain. However, both schemes can be asymptotically unstable in time when a fixed spatial mesh is used.

Gottlieb, D.↗
NASA NTRS1983

Pseudospectral solution of two-dimensional gas-dynamic problems

Chebyshev pseudospectral methods are used to compute two dimensional smooth compressible flows. Grid refinement tests show that spectral accuracy can be obtained. Filtering is not needed if resolution is sufficiently high and if boundary conditions are carefully prescribed.

Kopriva, D. A.↗
NASA NTRS1984

Modeling of unsteady small disturbance transonic flow using parametric differentiation, pseudospectral analysis and finite-differencing

A procedure for solving the nonlinear unsteady small disturbance transonic equation is formulated. This procedure is a synthesis of a pseudospectral method, parametric differentiation, and finite differencing. It is equally applicable to lifting and nonlifting airfoils. The procedure is particularly well suited to aeroelastic stability studies that may require a set of affine solutions.

Brown, M.↗
NASA NTRS1985

The eigenvalues of the pseudospectral Fourier approximation to the operator sin (2x) d/dx

It is shown that the eigenvalues Z sub i of the pseudospectral Fourier approximation to the operator sin(2x) curly d/curly dx satisfy (R sub e) (Z sub i) = + or - 1 or (R sub e)(Z sub I) = 0. Whereas this does not prove stability for the Fourier method, applied to the hyperbolic equation U sub t = sin (2x)(U sub x) - pi x pi; it indicates that the growth in time of the numerical solution is essentially the same as that of the solution to the differential equation.

Tal-Ezer, H.↗