Sciweavers

SIAMSC
2010
159views more  SIAMSC 2010»
12 years 11 months ago
The Fast Generalized Gauss Transform
The fast Gauss transform allows for the calculation of the sum of N Gaussians at M points in O(N + M) time. Here, we extend the algorithm to a wider class of kernels, motivated by ...
Marina Spivak, Shravan K. Veerapaneni, Leslie Gree...
SIAMSC
2010
136views more  SIAMSC 2010»
12 years 11 months ago
A Krylov Method for the Delay Eigenvalue Problem
Abstract. The Arnoldi method is currently a very popular algorithm to solve large-scale eigenvalue problems. The main goal of this paper is to generalize the Arnoldi method to the ...
Elias Jarlebring, Karl Meerbergen, Wim Michiels
SIAMSC
2010
118views more  SIAMSC 2010»
12 years 11 months ago
Optimal Explicit Strong-Stability-Preserving General Linear Methods
This paper constructs strong-stability-preserving general linear time-stepping methods that are well suited for hyperbolic PDEs discretized by the method of lines. These methods ge...
Emil M. Constantinescu, Adrian Sandu
SIAMSC
2010
137views more  SIAMSC 2010»
12 years 11 months ago
Accuracy Measures and Fourier Analysis for the Full Multigrid Algorithm
Abstract. The full multigrid (FMG) algorithm is often claimed to achieve so-called discretizationlevel accuracy. In this paper, this notion is formalized by defining a worst-case r...
Carmen Rodrigo, Francisco J. Gaspar, Cornelis W. O...
SIAMSC
2010
132views more  SIAMSC 2010»
12 years 11 months ago
A Fast Time Stepping Method for Evaluating Fractional Integrals
We evaluate the fractional integral I [f](t) = 1 () Z t 0 (t - )-1 f() d, 0 < < 1, at time steps t = t, 2t,
Jing-Rebecca Li
SIAMSC
2010
132views more  SIAMSC 2010»
12 years 11 months ago
Some Improvements for the Fast Sweeping Method
In this paper, we outline two improvements to the fast sweeping method to improve the speed of the method in general and more specifically in cases where the speed is changing rapi...
Stanley Bak, Joyce R. McLaughlin, Daniel Renzi
SIAMSC
2010
130views more  SIAMSC 2010»
12 years 11 months ago
Quasi-Monte Carlo Method for Infinitely Divisible Random Vectors via Series Representations
Infinitely divisible random vector without Gaussian component admits representations of shot noise series. Due to possible slow convergence of the series, they have not been inves...
Junichi Imai, Reiichiro Kawai
SIAMSC
2010
210views more  SIAMSC 2010»
12 years 11 months ago
On Two-Dimensional Sparse Matrix Partitioning: Models, Methods, and a Recipe
We consider two-dimensional partitioning of general sparse matrices for parallel sparse matrix-vector multiply operation. We present three hypergraph-partitioning-based methods, ea...
Ümit V. Çatalyürek, Cevdet Aykana...
SIAMSC
2010
116views more  SIAMSC 2010»
12 years 11 months ago
Optimized Schwarz Waveform Relaxation for the Primitive Equations of the Ocean
In this article we are interested in the derivation of efficient domain decomposition methods for the viscous primitive equations of the ocean. We consider the rotating 3d incompre...
Emmanuel Audusse, Pierre Dreyfuss, Benoit Merlet
SIAMSC
2010
104views more  SIAMSC 2010»
13 years 2 months ago
A New Sobolev Gradient Method for Direct Minimization of the Gross--Pitaevskii Energy with Rotation
Abstract. In this paper we improve traditional steepest descent methods for the direct minimization of the Gross-Pitaevskii (GP) energy with rotation at two levels. We first defi...
Ionut Danaila, Parimah Kazemi