Marcus J. Grote
ETH Zurich
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Marcus J. Grote.
Siam Journal on Applied Mathematics | 2000
Marcus J. Grote; Joseph B. Keller
An exact nonreflecting boundary condition is derived for the time-dependent elastic wave equation in three space dimensions. This condition holds on a spherical surface
SIAM Journal on Scientific Computing | 2001
Oliver Bröker; Marcus J. Grote; Carsten Mayer; Arnold Reusken
\mathcal B
Applied Numerical Mathematics | 2002
Oliver Bröker; Marcus J. Grote
, outside of which the medium is assumed to be linear, homogeneous, isotropic, and source-free. It is local in time, nonlocal on
International Journal of Numerical Modelling-electronic Networks Devices and Fields | 2000
Marcus J. Grote
\mathcal B
Physica D: Nonlinear Phenomena | 2001
Mark T. Dibattista; Andrew J. Majda; Marcus J. Grote
, and involves only first derivatives of the solution. Therefore it can be combined easily with any numerical method in the interior region.
Nonlinearity | 2000
Marcus J. Grote; Andrew J. Majda
Sparse approximate inverses are considered as smoothers for multigrid. They are based on the SPAI-Algorithm [M. J. Grote and T. Huckle, SIAM J. Sci. Comput., 18 (1997), pp. 838--853], which constructs a sparse approximate inverse M of a matrix A by minimizing I -MA in the Frobenius norm. This yields a new hierarchy of smoothers: SPAI-0, SPAI-1, SPAI
Archive | 2000
Andrew J. Majda; Marcus J. Grote; Michael G. Shefter
(\varepsilon)
Journal of Computational Physics | 2000
Marcus J. Grote
. Advantages of SPAI smoothers over classical smoothers are inherent parallelism, possible local adaptivity, and improved robustness. The simplest smoother, SPAI-0, is based on a diagonal matrix M. It is shown to satisfy the smoothing property for symmetric positive definite problems. Numerical experiments show that SPAI-0 smoothing is usually preferable to damped Jacobi smoothing. For the SPAI-1 smoother the sparsity pattern of M is that of A; its performance is typically comparable to that of Gauss--Seidel smoothing; however, both the computation and the application of the smoother remain inherently parallel. In more difficult situations, where the simpler SPAI-0 and SPAI-1 smoothers are not adequate, the SPAI
Technical Report / Department of Computer Science, ETH Zurich | 2000
Oliver Bröker; Marcus J. Grote; Carsten Mayer
(\varepsilon)
Archive | 2005
Andrew J. Majda; Rafail V. Abramov; Marcus J. Grote
smoother provides a natural procedure for improvement where needed. Numerical examples illustrate the usefulness of SPAI smoothing.