Search NASA⌕ Search

SEARCH · Search NASA

Results for “Method”

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,045 records · Page 58

A parallel orbital-updating based plane-wave basis method for electronic structure calculations

Highlights: • Propose three parallel orbital-updating based plane-wave basis methods for electronic structure calculations. • These new methods can avoid the generating of large scale eigenvalue problems and then reduce the computational cost. • These new methods allow for two-level parallelization which is particularly interesting for large scale parallelization. • Numerical experiments show that these new methods are reliable and efficient for large scale calculations on modern supercomputers. - Abstract: Motivated by the recently proposed parallel orbital-updating approach in real space method , we propose a parallel orbital-updating based plane-wave basis method for electronic structure calculations, for solving the corresponding eigenvalue problems. In addition, we propose two new modified parallel orbital-updating methods. Compared to the traditional plane-wave methods, our methods allow for two-level parallelization, which is particularly interesting for large scale parallelization. Numerical experiments show that these new methods are more reliable and efficient for large scale calculations on modern supercomputers.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Performance of high-order Godunov-type methods in simulations of astrophysical low Mach number flows

High-order Godunov methods for gas dynamics have become a standard tool for simulating different classes of astrophysical flows. Their accuracy is mostly determined by the spatial interpolant used to reconstruct the pair of Riemann states at cell interfaces and by the Riemann solver that computes the interface fluxes. In most Godunov-type methods, these two steps can be treated independently, so that many different schemes can in principle be built from the same numerical framework. Because astrophysical simulations often test out the limits of what is feasible with the computational resources available, it is essential to find the scheme that produces the numerical solution with the desired accuracy at the lowest computational cost. However, establishing the best combination of numerical options in a Godunov-type method to be used for simulating a complex hydrodynamic problem is a nontrivial task. In fact, formally more accurate schemes do not always outperform simpler and more diffusive methods, especially if sharp gradients are present in the flow. For this work, we used our fully compressible Seven-League Hydro (SLH) code to test the accuracy of six reconstruction methods and three approximate Riemann solvers on two- and three-dimensional (2D and 3D) problems involving subsonic flows only. We considered Mach numbers in the range from 10 −3 to 10 −1 , which are characteristic of many stellar and geophysical flows. In particular, we considered a well-posed, 2D, Kelvin–Helmholtz instability problem and a 3D turbulent convection zone that excites internal gravity waves in an overlying stable layer. Although the different combinations of numerical methods converge to the same solution with increasing grid resolution for most of the quantities analyzed here, we find that (i) there is a spread of almost four orders of magnitude in computational cost per fixed accuracy between the methods tested in this study, with the most performant method being a combination of a low-dissipation Riemann solver and a sextic reconstruction scheme; (ii) the low-dissipation solver always outperforms conventional Riemann solvers on a fixed grid when the reconstruction scheme is kept the same; (iii) in simulations of turbulent flows, increasing the order of spatial reconstruction reduces the characteristic dissipation length scale achieved on a given grid even if the overall scheme is only second order accurate; (iv) reconstruction methods based on slope-limiting techniques tend to generate artificial, high-frequency acoustic waves during the evolution of the flow; and (v) unlimited reconstruction methods introduce oscillations in the thermal stratification near the convective boundary, where the entropy gradient is steep.

79 ASTRONOMY AND ASTROPHYSICS↗

Shock melting method to determine melting curve by molecular dynamics: Cu, Pd, and Al

A melting simulation method, the shock melting (SM) method, is proposed and proved to be able to determine the melting curves of materials accurately and efficiently. The SM method, which is based on the multi-scale shock technique, determines melting curves by preheating and/or prepressurizing materials before shock. This strategy was extensively verified using both classical and ab initio molecular dynamics (MD). First, the SM method yielded the same satisfactory melting curve of Cu with only 360 atoms using classical MD, compared to the results from the Z-method and the two-phase coexistence method. Then, it also produced a satisfactory melting curve of Pd with only 756 atoms. Finally, the SM method combined with ab initio MD cheaply achieved a good melting curve of Al with only 180 atoms, which agrees well with the experimental data and the calculated results from other methods. It turned out that the SM method is an alternative efficient method for calculating the melting curves of materials.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Transconvolution and the virtual positron emission tomograph-A new method for cross calibration in quantitative PET/CT imaging

Purpose: Positron emission tomography (PET)/computed tomography (CT) measurements on small lesions are impaired by the partial volume effect, which is intrinsically tied to the point spread function of the actual imaging system, including the reconstruction algorithms. The variability resulting from different point spread functions hinders the assessment of quantitative measurements in clinical routine and especially degrades comparability within multicenter trials. To improve quantitative comparability there is a need for methods to match different PET/CT systems through elimination of this systemic variability. Consequently, a new method was developed and tested that transforms the image of an object as produced by one tomograph to another image of the same object as it would have been seen by a different tomograph. The proposed new method, termed Transconvolution, compensates for differing imaging properties of different tomographs and particularly aims at quantitative comparability of PET/CT in the context of multicenter trials. Methods: To solve the problem of image normalization, the theory of Transconvolution was mathematically established together with new methods to handle point spread functions of different PET/CT systems. Knowing the point spread functions of two different imaging systems allows determining a Transconvolution function to convert one image into the other. This function is calculated by convolving one point spread function with the inverse of the other point spread function which, when adhering to certain boundary conditions such as the use of linear acquisition and image reconstruction methods, is a numerically accessible operation. For reliable measurement of such point spread functions characterizing different PET/CT systems, a dedicated solid-state phantom incorporating {sup 68}Ge/{sup 68}Ga filled spheres was developed. To iteratively determine and represent such point spread functions, exponential density functions in combination with a Gaussian distribution were introduced. Furthermore, simulation of a virtual PET system provided a standard imaging system with clearly defined properties to which the real PET systems were to be matched. A Hann window served as the modulation transfer function for the virtual PET. The Hann's apodization properties suppressed high spatial frequencies above a certain critical frequency, thereby fulfilling the above-mentioned boundary conditions. The determined point spread functions were subsequently used by the novel Transconvolution algorithm to match different PET/CT systems onto the virtual PET system. Finally, the theoretically elaborated Transconvolution method was validated transforming phantom images acquired on two different PET systems to nearly identical data sets, as they would be imaged by the virtual PET system. Results: The proposed Transconvolution method matched different PET/CT-systems for an improved and reproducible determination of a normalized activity concentration. The highest difference in measured activity concentration between the two different PET systems of 18.2% was found in spheres of 2 ml volume. Transconvolution reduced this difference down to 1.6%. In addition to reestablishing comparability the new method with its parameterization of point spread functions allowed a full characterization of imaging properties of the examined tomographs. Conclusions: By matching different tomographs to a virtual standardized imaging system, Transconvolution opens a new comprehensive method for cross calibration in quantitative PET imaging. The use of a virtual PET system restores comparability between data sets from different PET systems by exerting a common, reproducible, and defined partial volume effect.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

TU-H-206-04: An Effective Homomorphic Unsharp Mask Filtering Method to Correct Intensity Inhomogeneity in Daily Treatment MR Images

Purpose: The daily treatment MRIs acquired on MR-IGRT systems, like diagnostic MRIs, suffer from intensity inhomogeneity issue, associated with B1 and B0 inhomogeneities. An improved homomorphic unsharp mask (HUM) filtering method, automatic and robust body segmentation, and imaging field-of-view (FOV) detection methods were developed to compute the multiplicative slow-varying correction field and correct the intensity inhomogeneity. The goal is to improve and normalize the voxel intensity so that the images could be processed more accurately by quantitative methods (e.g., segmentation and registration) that require consistent image voxel intensity values. Methods: HUM methods have been widely used for years. A body mask is required, otherwise the body surface in the corrected image would be incorrectly bright due to the sudden intensity transition at the body surface. In this study, we developed an improved HUM-based correction method that includes three main components: 1) Robust body segmentation on the normalized image gradient map, 2) Robust FOV detection (needed for body segmentation) using region growing and morphologic filters, and 3) An effective implementation of HUM using repeated Gaussian convolution. Results: The proposed method was successfully tested on patient images of common anatomical sites (H/N, lung, abdomen and pelvis). Initial qualitative comparisons showed that this improved HUM method outperformed three recently published algorithms (FCM, LEMS, MICO) in both computation speed (by 50+ times) and robustness (in intermediate to severe inhomogeneity situations). Currently implemented in MATLAB, it takes 20 to 25 seconds to process a 3D MRI volume. Conclusion: Compared to more sophisticated MRI inhomogeneity correction algorithms, the improved HUM method is simple and effective. The inhomogeneity correction, body mask, and FOV detection methods developed in this study would be useful as preprocessing tools for many MRI-related research and clinical applications in radiotherapy. Authors have received research grants from ViewRay and Varian.

60 APPLIED LIFE SCIENCES↗

Scalable direct Vlasov solver with discontinuous Galerkin method on unstructured mesh.

This paper presents the development of parallel direct Vlasov solvers with discontinuous Galerkin (DG) method for beam and plasma simulations in four dimensions. Both physical and velocity spaces are in two dimesions (2P2V) with unstructured mesh. Contrary to the standard particle-in-cell (PIC) approach for kinetic space plasma simulations, i.e., solving Vlasov-Maxwell equations, direct method has been used in this paper. There are several benefits to solving a Vlasov equation directly, such as avoiding noise associated with a finite number of particles and the capability to capture fine structure in the plasma. The most challanging part of a direct Vlasov solver comes from higher dimensions, as the computational cost increases as N{sup 2d}, where d is the dimension of the physical space. Recently, due to the fast development of supercomputers, the possibility has become more realistic. Many efforts have been made to solve Vlasov equations in low dimensions before; now more interest has focused on higher dimensions. Different numerical methods have been tried so far, such as the finite difference method, Fourier Spectral method, finite volume method, and spectral element method. This paper is based on our previous efforts to use the DG method. The DG method has been proven to be very successful in solving Maxwell equations, and this paper is our first effort in applying the DG method to Vlasov equations. DG has shown several advantages, such as local mass matrix, strong stability, and easy parallelization. These are particularly suitable for Vlasov equations. Domain decomposition in high dimensions has been used for parallelization; these include a highly scalable parallel two-dimensional Poisson solver. Benchmark results have been shown and simulation results will be reported.

99 GENERAL AND MISCELLANEOUS↗

Multirate Exponential Rosenbrock Methods

In this paper we propose a novel class of methods for high-order accurate integration of multirate systems of ordinary differential equation initial-value problems. The proposed methods construct multirate schemes by approximating the action of matrix φ functions within explicit exponential Rosenbrock (ExpRB) methods, thereby called multirate ExpRB (MERB) methods. They consist of the solution to a sequence of modified “fast” initial-value problems, which may themselves be approximated through subcycling any desired initial-value problem solver. In addition to proving how to construct MERB methods from certain classes of ExpRB methods, we provide rigorous convergence analysis of these methods and derive efficient MERB schemes of orders 2 through 6 (the highest-order infinitesimal multirate methods to date). Lastly, we then present numerical simulations to confirm these theoretical convergence rates and to compare the efficiency of MERB methods against other recently introduced high-order multirate methods.

97 MATHEMATICS AND COMPUTING↗

Evaluating Probabilistic Deep Learning Methods for Uncertainty Quantification of Precipitation Bias Correction

Climate models often exhibit biases in their precipitation predictions, particularly underestimating high-intensity events and overestimating low precipitation. Deep learning approaches offer promising solutions, but their epistemic uncertainty associated with a deep learning–based bias correction method has not previously been quantified for reliable downstream climate impact studies. While methods for capturing the epistemic uncertainty in deep learning frameworks exist, there is currently no consensus on the best method. In this work, we compare three uncertainty quantification (UQ) methods—Deep Ensembles (DEns), Monte Carlo Dropout (MCD), and Flipout—by assessing the reliability of their uncertainty estimates using standard measures such as sharpness and calibration. These UQ methods are applied to an existing deep learning precipitation bias correction model known as UFNet: a coupled U-Net and fully connected neural network. The methods utilized to assess the models’ uncertainties are 1) calibration, which ensures that the expected probabilities of the model align with reality and 2) sharpness, which is a measure of the precision of the model’s probabilistic predictions. Of the three UQ methods evaluated, the DEns and MCD methods demonstrated the best-calibrated performance (expected calibration error of 0.36 and 0.35, respectively), compared to Flipout (0.58). In contrast, Flipout had the sharpest predictions and the highest metric performance in bias correcting precipitation—especially for higher-order moments such as kurtosis with a spatial correlation of 72% compared to 32% and 55% spatial correlation for DEns and MCD, respectively. Of the three UQ methods, MCD was found to be the most suitable method for UQ purposes based on its calibration, sharpness, and computational requirements.

Bayesian methods↗

Systematic Quantum Cluster Typical Medium Method for the Study of Localization in Strongly Disordered Electronic Systems

Great progress has been made in recent years towards understanding the properties of disordered electronic systems. In part, this is made possible by recent advances in quantum effective medium methods which enable the study of disorder and electron-electronic interactions on equal footing. They include dynamical mean-field theory and the Coherent Potential Approximation, and their cluster extension, the dynamical cluster approximation. Despite their successes, these methods do not enable the first-principles study of the strongly disordered regime, including the effects of electronic localization. The main focus of this review is the recently developed typical medium dynamical cluster approximation for disordered electronic systems. This method has been constructed to capture disorder-induced localization and is based on a mapping of a lattice onto a quantum cluster embedded in an effective typical medium, which is determined self-consistently. Unlike the average effective medium-based methods mentioned above, typical medium-based methods properly capture the states localized by disorder. The typical medium dynamical cluster approximation not only provides the proper order parameter for Anderson localized states, but it can also incorporate the full complexity of Density-Functional Theory (DFT)-derived potentials into the analysis, including the effect of multiple bands, non-local disorder, and electron-electron interactions. After a brief historical review of other numerical methods for disordered systems, we discuss coarse-graining as a unifying principle for the development of translationally invariant quantum cluster methods. Together, the Coherent Potential Approximation, the Dynamical Mean-Field Theory and the Dynamical Cluster Approximation may be viewed as a single class of approximations with a much-needed small parameter of the inverse cluster size which may be used to control the approximation. We then present an overview of various recent applications of the typical medium dynamical cluster approximation to a variety of models and systems, including single and multiband Anderson model, and models with local and off-diagonal disorder. We then present the application of the method to realistic systems in the framework of the DFT and demonstrate that the resulting method can provide a systematic first-principles method validated by experiment and capable of making experimentally relevant predictions. We also discuss the application of the typical medium dynamical cluster approximation to systems with disorder and electron-electron interactions. Most significantly, we show that in the limits of strong disorder and weak interactions treated perturbatively, that the phenomena of 3D localization, including a mobility edge, remains intact. However, the metal-insulator transition is pushed to larger disorder values by the local interactions. We also study the limits of strong disorder and strong interactions capable of producing moment formation and screening, with a non-perturbative local approximation. Here, we find that the Anderson localization quantum phase transition is accompanied by a quantum-critical fan in the energy-disorder phase diagram.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

The Wave Energy Converter Design Process: Methods Applied in Industry and Shortcomings of Current Practices

Wave energy is among the many renewable energy technologies being researched and developed to address the increasing demand for low-emissions energy. The unique design challenges for wave energy converter design—integrating complex and uncertain technological, economic, and ecological systems, overcoming the structural challenges of ocean deployment, and dealing with complex system dynamics—have lead to a disjointed progression of research and development. There is no common design practice across the wave energy industry and there is no published synthesis of the practices that are used by developers. In this paper, we summarize the methods being employed in WEC design as well as promising methods that have yet to be applied. We contextualize these methods within an overarching design process. We present results from a survey of WEC developers to identify methods that are common in industry. From the review and survey results, we conclude that the most common methods of WEC design are iterative methods in which design parameters are defined, evaluated, and then changed based on evaluation results. This leaves a significant space for improvement of methods that help designers make better-informed decisions prior to sophisticated evaluation, and methods of using the evaluation results to make better design decisions during iteration. Despite the popularity of optimization methods in academic research, they are less common in industry development. We end this paper with a summary of the areas of WEC design in which the testing and development of new methods is necessary, and where more research is required to fully understand the influence of design decisions on WEC performance.

16 TIDAL AND WAVE POWER↗

Hybrid method of deterministic and probabilistic approaches for multigroup neutron transport problem

A hybrid method of deterministic and probabilistic methods is proposed to solve Boltzmann transport equation. The new method uses a deterministic method, Method of Characteristics (MOC), for the fast and thermal neutron energy ranges and a probabilistic method, Monte Carlo (MC), for the intermediate resonance energy range. The hybrid method, in case of continuous energy problem, will be able to take advantage of fast MOC calculation and accurate resonance self shielding treatment of MC method. As a proof of principle, this paper presents the hybrid methodology applied to a multigroup form of Boltzmann transport equation and confirms that the hybrid method can produce consistent results with MC and MOC methods. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Error Propagation for Response Matrix Methods in the Many Node Limit

The response matrix method has been a useful solution method for radiation transport problems for decades. The method is desirable for many reasons. It can be extended to both fixed source and eigenvalue problems. In addition, a key aspect of the method is a shift of computational expense to a precomputation phase. Methods and codes employing response matrix or response matrix-like methods have enjoyed formidable computational efficiency while solving large problems. However, current applications of the method rely on large node sizes and few nodes to maximize computational efficiency. As part of a desire to make these methods more amenable to applications such as parallel computing in the future, the number of nodes in problems may increase, and node size will decrease. The effect of this change has not been well studied except for a few cases. In the past, it was determined that a poor approximation of angular dependence of flux on node interfaces could lead to large error propagation for fixed source problems, but a newer study indicates that changing node sizes as well as number of nodes poses little challenge for response methods in the eigenvalue case. This paper presents the unintuitive result that for response matrix methods increasing the spatial resolution of the problem may dramatically decrease accuracy - this effect is demonstrated on a simple analytic 1-D benchmark problem. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Implicit and Implicit–Explicit Strong Stability Preserving Runge–Kutta Methods with High Linear Order

Strong stability preserving (SSP) time discretizations preserve the monotonicity properties satisfied by the spatial discretization when coupled with the first order forward Euler, under a certain time-step restriction. The search for high order strong stability preserving time-stepping methods with high order and large allowable time-step has been an active area of research. It is known that implicit SSP Runge–Kutta methods exist only up to sixth order; however, if we restrict ourselves to solving only linear autonomous problems, the order conditions simplify and we can find implicit SSP Runge–Kutta methods of any linear order. In the current work we find implicit SSP Runge–Kutta methods with high linear order p lin ≤ 9 and nonlinear orders p = 2,3,4, that are optimal in terms of allowable SSP time-step. Next, we formulate a novel optimization problem for implicit–explicit (IMEX) SSP Runge–Kutta methods and find optimized IMEX SSP Runge–Kutta pairs that have high linear order p lin ≤ 7 and nonlinear orders up to p = 4. Here, we also find implicit methods with large linear stability regions that pair with known explicit SSP Runge–Kutta methods. These methods are then tested on sample problems to demonstrate the sharpness of the SSP coefficient and the typical behavior of these methods on test problems.

97 MATHEMATICS AND COMPUTING↗

Discontinuous Finite Element Quasidiffusion Methods

Here in this paper, two-level methods for solving transport problems in one-dimensional slab geometry based on the quasi-diffusion (QD) method are developed. A linear discontinuous finite element method (LDFEM) is derived for the spatial discretization of the low-order QD (LOQD) equations. It involves special interface conditions at the cell edges based on the idea of QD boundary conditions (BCs). We consider different kinds of QD BCs to formulate the necessary cell-interface conditions. We develop two-level methods with independent discretization of the high-order transport equation and LOQD equations, where the transport equation is discretized using the method of characteristics and the LDFEM is applied to the LOQD equations. We also formulate closures that lead to the discretization consistent with a LDFEM discretization of the transport equation. The proposed methods are studied by means of test problems formulated with the method of manufactured solutions. Numerical experiments are presented demonstrating the performance of the proposed methods. Lastly, we also show that the method with independent discretization has the asymptotic diffusion limit.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Efficient IMEX Runge-Kutta Methods for Nonhydrostatic Dynamics

We develop new implicit-explicit Runge-Kutta (IMEX RK) methods for integrating horizontally explicit, vertically implicit (HEVI) partitionings of nonhydrostatic atmosphere models (HEVI models). These new methods, termed IMKG methods, are IMEX RK methods whose explicit part has optimal or near-optimal stability on the imaginary axis and whose implicit part is I-stable. A specialized stability region is presented for characterizing the stability of IMKG and other IMEX methods integrating HEVI models. Subsequently, we formulate two families of IMEX RK methods to enable deriving IMKG methods with a high explicit stage count for integrating HEVI models with large, stable time-steps. Here, we then derive a HEVI partitioning of the HOMME-NH nonhydrostatic model and use this model to compare the accuracy and efficiency of several IMKG methods with other IMEX RK methods from the literature.

58 GEOSCIENCES↗

Comparative analysis of data collection methods for individualized modeling of radiologists' visual similarity judgments

Rationale and Objectives: We conducted an observer study to investigate how the data collection method affects the efficacy of modeling individual radiologists judgments regarding the perceptual similarity of breast masses on mammograms. Materials and Methods: Institutional review board approval was obtained prior to the study. Six observers of variable experience levels in breast imaging were recruited to assess the perceptual similarity of mammographic masses. The observers subjective judgments were collected using: (i) a rating method, (ii) a preference method, and (iii) a hybrid method combining rating and ranking. Personalized user models were developed with the collected data to predict observers opinions. The relative efficacy of each data collection method was assessed based on the classification accuracy of the resulting user models. Results: The hybrid data collection method produced significantly more accurate individualized user models of perceptual opinions with comparable and sometimes better time efficiency than the other two data collection methods. The user models derived from hybrid data were clearly superior even when developed with a dramatically smaller number of training cases. Conclusions: A hybrid method combining rating and ranking is an intuitive and efficient way for collecting subjective similarity judgments to model human perceptual opinions with a higher accuracy than other more commonly used data collection methods.

breast imaging↗

Spillover as a cause of bias in baseline evaluation methods for demand response programs

Prior research has shown load reduction estimates from residential event-driven demand response programs (e.g., Critical Peak Pricing)using X of the highest Y days with a weather adjustment method are the best performing within the class of currently used baseline methods. However, they are still biased relative to estimates produced from randomized control trials (RCTs), the unbiased “gold standard” evaluation method. In this paper we identify underlying factors that cause some of the bias found in one commonly used baseline method. Rather than simply quantifying bias, our research provides a deeper understanding of what causes the bias and thus can be used to develop more accurate methods that are not subject to these underlying factors. Previous studies have compared various baseline methods relative to each other; however, because all baseline methods are biased, it is impossible to determine the true bias that exists in them. We have access to a unique RCT dataset: the Sacramento Municipal Utility District's study of critical peak pricing. Our analysis of 23 event days over two summers allows us to identify the true bias on load reduction estimates by using the RCT estimates as the unbiased gold standard against which we compare the estimates from the baseline methods. We found that spillover of energy reductions, from hours targeted by a program onto other hours, is one underlying factor that is a major cause of bias in baseline methods. We discuss alternative baseline methods that may not be subject to this same bias.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Petascale turbulence simulation using a highly parallel fast multipole method on GPUs

This paper reports large-scale direct numerical simulations of homogeneous-isotropic fluid turbulence, achieving sustained performance of 1.08 petaflop/s on gpu hardware using single precision. The simulations use a vortex particle method to solve the Navier–Stokes equations, with a highly parallel fast multipole method (fmm) as numerical engine, and match the current record in mesh size for this application, a cube of computational points solved with a spectral method. The standard numerical approach used in this field is the pseudo-spectral method, relying on the fft algorithm as the numerical engine. The particle-based simulations presented in this paper quantitatively match the kinetic energy spectrum obtained with a pseudo-spectral method, using a trusted code. In terms of parallel performance, weak scaling results show the fmm-based vortex method achieving 74% parallel efficiency on 4096 processes (one gpu per mpi process, 3 gpus per node of the tsubame-2.0 system). The fft-based spectral method is able to achieve just 14% parallel efficiency on the same number of mpi processes (using only cpu cores), due to the all-to-all communication pattern of the fft algorithm. The calculation time for one time step was 108 s for the vortex method and 154 s for the spectral method, under these conditions. Computing with 69 billion particles, this work exceeds by an order of magnitude the largest vortex-method calculations to date.

Computer Science↗