Add to ORKGIn this paper, we propose some algorithms to solve the system of linear equations arising from the finite difference discretization on sparse grids. For this, we will use the multilevel structure of the sparse grid space or its full grid subspaces, respectively
Mit Hilfe von Dünnen Gittern können Funktionen in mehreren Veränderlichen mit einer Anzahl von Freih...
Sparse grids are a recently introduced new technique for discretizing partial differential equations...
AbstractA multilevel method for the iterative solution of large sparse linear systems is introduced....
textabstractIn this paper, we propose some algorithms to solve the system of linear equations arisin...
We propose some algorithms to solve the system of linens equations arising from the finite differenc...
In this paper we describe methods to approximate functions and differential operators on adaptive sp...
Abstract — In this paper we describe methods to approximate functions and dif-ferential operators on...
In the recent decade, there has been growing interest in the numerical treatment of high-dimensional...
Our goal is to present an elementary approach to the analysis and programming of sparse grid finite ...
getragenen Sonderforschungsbereiches 611 an der Universität Bonn ent-standen und als Manuskript verv...
Sparse grids (Zenger, C. (1990) Sparse grids. Parallel Algorithms for Partial Differential Equations...
The technique of sparse grids allows to overcome the curse of dimensionality, which prevents the use...
We consider the solution of elliptic problems on the tensor product of two physical domains as for e...
We show that the logarithmic factor in the standard error estimate for sparse finite element (FE) sp...
Departing from Mulder's semi-coarsening technique for first order PDEs, the notion of a grid of grid...
Mit Hilfe von Dünnen Gittern können Funktionen in mehreren Veränderlichen mit einer Anzahl von Freih...
Sparse grids are a recently introduced new technique for discretizing partial differential equations...
AbstractA multilevel method for the iterative solution of large sparse linear systems is introduced....
textabstractIn this paper, we propose some algorithms to solve the system of linear equations arisin...
We propose some algorithms to solve the system of linens equations arising from the finite differenc...
In this paper we describe methods to approximate functions and differential operators on adaptive sp...
Abstract — In this paper we describe methods to approximate functions and dif-ferential operators on...
In the recent decade, there has been growing interest in the numerical treatment of high-dimensional...
Our goal is to present an elementary approach to the analysis and programming of sparse grid finite ...
getragenen Sonderforschungsbereiches 611 an der Universität Bonn ent-standen und als Manuskript verv...
Sparse grids (Zenger, C. (1990) Sparse grids. Parallel Algorithms for Partial Differential Equations...
The technique of sparse grids allows to overcome the curse of dimensionality, which prevents the use...
We consider the solution of elliptic problems on the tensor product of two physical domains as for e...
We show that the logarithmic factor in the standard error estimate for sparse finite element (FE) sp...
Departing from Mulder's semi-coarsening technique for first order PDEs, the notion of a grid of grid...
Mit Hilfe von Dünnen Gittern können Funktionen in mehreren Veränderlichen mit einer Anzahl von Freih...
Sparse grids are a recently introduced new technique for discretizing partial differential equations...
AbstractA multilevel method for the iterative solution of large sparse linear systems is introduced....