An engineering expose of numerical integration of ordinary differential equations
Error analyses for numerically integrating first order ordinary differential equations
SEARCH · Search NASA
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.
Error analyses for numerically integrating first order ordinary differential equations
In this paper, we report on a fast second-order numerical integrator to solve the Lorentz force equations of a relativistic charged particle in electromagnetic fields. This numerical integrator shows less numerical error than the popular Boris algorithm in tracking the relativistic particle subject to electric and magnetic space-charge fields and requires less number of operations than another recently proposed relativistic integrator.
Adaptive numerical integration program for IBM 1620 II
Numerical integration is a basic step in the implementation of more complex numerical algorithms suitable, for example, to solve ordinary and partial differential equations. The straightforward extension of a one-dimensional integration rule to a multidimensional grid by the tensor product of the spatial directions is deemed to be practically infeasible beyond a relatively small number of dimensions, e.g., three or four. In fact, the computational burden in terms of storage and floating point operations scales exponentially with the number of dimensions. This phenomenon is known as the curse of dimensionality and motivated the development of alternative methods such as the Monte Carlo method. The tensor product approach can be very effective for high-dimensional numerical integration if we can resort to an accurate low-rank tensor-train representation of the integrand function. In this work, we discuss this approach and present numerical evidence showing that it is very competitive with the Monte Carlo method in terms of accuracy and computational costs up to several hundredths of dimensions if the integrand function is regular enough and a sufficiently accurate low-rank approximation is available.
Numerical integration based on definition of Riemann integral, describing application to nonlinear integral equations of isotropic scattering of radiation in plane parallel atmosphere
Numerical integration methods for the solution of initial value problems for ordinary vector differential equations may be modelled as discrete time feedback systems. The stability criteria discovered in modern control theory are applied to these systems and criteria involving the routine, the step size and the differential equation are derived. Linear multistep, Runge-Kutta, and predictor-corrector methods are all investigated.
We discuss quantum algorithms that calculate numerical integrals and descriptive statistics of stochastic processes. With either of two distinct approaches, one obtains an exponential speed increase in comparison to the fastest known classical deterministic algotithms and a quadratic speed increase incomparison to classical Monte Carlo methods.
Self-starting multistep methods for numerical integration of ordinary differential equations
Accumulation of errors using numerical integration methods for solving celestial equations of motion
Operational unification of finite difference methods for numerical integration of ordinary differential equations
Predictor-corrector algorithm applicable to numerical integration of satellite orbits in multirevolution steps
Numerical integration methods for computing flow of gas in chemical nonequilibrium behind normal shock wave
Cowell numerical integration and satellite orbit calculation
Numerical integration orbits and Brouwer and modified Brouwer orbits
Algorithm for use in estimating accumulated numerical integration errors
Digital simulation for error analysis of numerical integration schemes
Error growth and stability analyzed for numerical integration of differential equations in chemical kinetics
We present our experience in porting optimized CUDA implementations to oneAPI. We focus on the use case of numerical integration, particularly the CUDA implementations of PAGANI and $m$-Cubes. We faced several challenges that caused performance degradation in the oneAPI ports. These include differences in utilized registers per thread, compiler optimizations, and mappings of CUDA library calls to oneAPI equivalents. After addressing those challenges, we tested both the PAGANI and m-Cubes integrators on numerous integrands of various characteristics. To evaluate the quality of the ports, we collected performance metrics of the CUDA and oneAPI implementations on the Nvidia V100 GPU. We found that the oneAPI ports often achieve comparable performance to the CUDA versions, and that they are at most 10% slower.