𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On a faster parallel implementation of the split-step Fourier method

✍ Scribed by J. Sánchez-Curto; P. Chamorro-Posada

Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
428 KB
Volume
34
Category
Article
ISSN
0167-8191

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A split-step Fourier method for the comp
A split-step Fourier method for the complex modified Korteweg-de Vries equation
✍ G.M. Muslu; H.A. Erbay 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 806 KB

In this study, the complex modified Korteweg-deVries (CMKdV) equation is solved numerically by three different split-step Fourier schemes. The main difference among the three schemes is in the order of the splitting approximation used to factorize the exponential operator. The space variable is disc

A parallel implementation of the PROMETH
A parallel implementation of the PROMETHEE method
✍ Luis C. Dias; João P. Costa; João N. Clímaco 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 952 KB

The obtainment of a result from a decision support system is usually preceded by a structuring of the decision situation and followed by a robustness analysis phase. In this last phase the decision makers (DMs) observe the impact of changing the parameters of the decision model built during structur

A new fourth-order Fourier–Bessel split-
A new fourth-order Fourier–Bessel split-step method for the extended nonlinear Schrödinger equation
✍ Patrick L. Nash 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 441 KB

Fourier split-step techniques are often used to compute soliton-like numerical solutions of the nonlinear Schro ¨dinger equation. Here, a new fourth-order implementation of the Fourier split-step algorithm is described for problems possessing azimuthal symmetry in 3 + 1-dimensions. This implementati

A Faster Implementation of a Parallel Tr
A Faster Implementation of a Parallel Tree Contraction Scheme and Its Application on Distance-Hereditary Graphs
✍ Sun-yuan Hsieh; Chin-Wen Ho; Tsan-sheng Hsu; Ming-Tat Ko; Gen-Huey Chen 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 261 KB

We consider a parallel tree contraction scheme which in each contraction phase Ž . Ž . removes leaves and nodes in the maximal chains. Let T n and P n denote the time and processor complexity required to compute the all nearest smaller values Ž . ANSV and the minimum of n values for input elements d