Michael Griebel
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Michael Griebel has a total of 24 co-authors. Here are the top co-authors by number of shared publications:
Attila Caglar
9 shared publications- Gerhard Zumbusch
Universität Jena
9 shared publications - Stephan Knapek
TWS Partners GmbH
9 shared publications - Hans-Joachim Bungartz
Universität Stuttgart
7 shared publications - Christoph Zenger
Technische Universität München
6 shared publications Arieh Iserles
1 shared publication
Latest Publications
- Top Cited Papers
- 16 May 2009
- Published by Springer Nature in Constructive Approximation
- Vol. 30 (3) , 653-675
On a Constructive Proof of Kolmogorov’s Superposition Theorem
- 16 May 2009
- Published by Springer Nature in Constructive Approximation
- Vol. 30 (3) , 653-675
Top Cited PapersOn a Constructive Proof of Kolmogorov’s Superposition Theorem
- 1 September 2006
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 417 (2) , 299-300
Curriculum vitae of Friedrich Ludwig Bauer
- 1 September 2006
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 417 (2) , 299-300
Curriculum vitae of Friedrich Ludwig Bauer
- 3 June 2004
- Published by Cambridge University Press (CUP)
Acta Numerica 2004
Acta Numerica surveys annually the most important developments in numerical mathematics and scientific computing. The subjects and authors of the substantive survey articles are chosen by a distinguished international editorial board so as to report the most important and timely developments in a manner accessible to the wider community of professionals with an interest in scientific computing. Acta Numerica volumes have proved to be a valuable tool not only for researchers and professionals wishing to develop their understanding of numerical techniques and algorithms and follow new developments, but also as an advanced teaching aid at colleges and universities. Many of the original articles have been used as the prime resource for graduate courses. This particular volume was originally published in 2004.
- 3 June 2004
- Published by Cambridge University Press (CUP)
Acta Numerica 2004
Acta Numerica surveys annually the most important developments in numerical mathematics and scientific computing. The subjects and authors of the substantive survey articles are chosen by a distinguished international editorial board so as to report the most important and timely developments in a manner accessible to the wider community of professionals with an interest in scientific computing. Acta Numerica volumes have proved to be a valuable tool not only for researchers and professionals wishing to develop their understanding of numerical techniques and algorithms and follow new developments, but also as an advanced teaching aid at colleges and universities. Many of the original articles have been used as the prime resource for graduate courses. This particular volume was originally published in 2004.
- Top Cited Papers
- 1 May 2004
- Published by Cambridge University Press (CUP) in Acta Numerica
- Vol. 13, 147-269
Sparse grids
We present a survey of the fundamentals and the applications of sparse grids, with a focus on the solution of partial differential equations (PDEs). The sparse grid approach, introduced in Zenger (1991), is based on a higher-dimensional multiscale basis, which is derived from a one-dimensional multi-scale basis by a tensor product construction. Discretizations on sparse grids involve $O(N \cdot (\log N)^{d-1})$ degrees of freedom only, where $d$ denotes the underlying problem's dimensionality and where $N$ is the number of grid points in one coordinate direction at the boundary. The accuracy obtained with piecewise linear basis functions, for example, is $O(N^{-2} \cdot (\log N)^{d-1})$ with respect to the $L_{2^-}$ and $L_{\infty}$-norm, if the solution has bounded second mixed derivatives. This way, the curse of dimensionality, i.e., the exponential dependence $O(N^d)$ of conventional approaches, is overcome to some extent. For the energy norm, only $O(N)$ degrees of freedom are needed to give an accuracy of $O(N^{-1})$. That is why sparse grids are especially well-suited for problems of very high dimensionality. The sparse grid approach can be extended to nonsmooth solutions by adaptive refinement methods. Furthermore, it can be generalized from piecewise linear to higher-order polynomials. Also, more sophisticated basis functions like interpolets, prewavelets, or wavelets can be used in a straightforward way. We describe the basic features of sparse grids and report the results of various numerical experiments for the solution of elliptic PDEs as well as for other selected problems such as numerical quadrature and data mining.- 1 May 2004
- Published by Cambridge University Press (CUP) in Acta Numerica
- Vol. 13, 147-269
Top Cited PapersSparse grids
We present a survey of the fundamentals and the applications of sparse grids, with a focus on the solution of partial differential equations (PDEs). The sparse grid approach, introduced in Zenger (1991), is based on a higher-dimensional multiscale basis, which is derived from a one-dimensional multi-scale basis by a tensor product construction. Discretizations on sparse grids involve $O(N \cdot (\log N)^{d-1})$ degrees of freedom only, where $d$ denotes the underlying problem's dimensionality and where $N$ is the number of grid points in one coordinate direction at the boundary. The accuracy obtained with piecewise linear basis functions, for example, is $O(N^{-2} \cdot (\log N)^{d-1})$ with respect to the $L_{2^-}$ and $L_{\infty}$-norm, if the solution has bounded second mixed derivatives. This way, the curse of dimensionality, i.e., the exponential dependence $O(N^d)$ of conventional approaches, is overcome to some extent. For the energy norm, only $O(N)$ degrees of freedom are needed to give an accuracy of $O(N^{-1})$. That is why sparse grids are especially well-suited for problems of very high dimensionality. The sparse grid approach can be extended to nonsmooth solutions by adaptive refinement methods. Furthermore, it can be generalized from piecewise linear to higher-order polynomials. Also, more sophisticated basis functions like interpolets, prewavelets, or wavelets can be used in a straightforward way. We describe the basic features of sparse grids and report the results of various numerical experiments for the solution of elliptic PDEs as well as for other selected problems such as numerical quadrature and data mining. - 1 January 2004
- Published by Springer Nature
- p. 401-422
Anwendungen aus Biochemie und Biophysik
- 1 January 2004
- Published by Springer Nature
- p. 247-322
Gitterbasierte Methoden für langreichweitige Potentiale
- 1 January 2004
- Published by Springer Nature
- p. 247-322
Gitterbasierte Methoden für langreichweitige Potentiale
- 1 January 2004
- Published by Springer Nature
- p. 219-245
Zeitintegrationsverfahren
- 1 January 2004
- Published by Springer Nature
- p. 157-217
Erweiterung auf kompliziertere Potentiale und Moleküle
- 1 January 2004
- Published by Springer Nature
- p. 157-217
Erweiterung auf kompliziertere Potentiale und Moleküle
- 1 January 2004
- Published by Springer Nature
- p. 39-117
Das Linked-Cell-Verfahren für kurzreichweitige Potentiale
- 1 January 2004
- Published by Springer Nature
- p. 39-117
Das Linked-Cell-Verfahren für kurzreichweitige Potentiale