LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

On the Algebraic Construction of Sparse Multilevel Approximations of Elliptic Tensor Product Problems

Photo from archive.org

We consider the solution of elliptic problems on the tensor product of two physical domains as for example present in the approximation of the solution covariance of elliptic partial differential… Click to show full abstract

We consider the solution of elliptic problems on the tensor product of two physical domains as for example present in the approximation of the solution covariance of elliptic partial differential equations with random input. Previous sparse approximation approaches used a geometrically constructed multilevel hierarchy. Instead, we construct this hierarchy for a given discretized problem by means of the algebraic multigrid method. Thereby, we are able to apply the sparse grid combination technique to problems given on complex geometries and for discretizations arising from unstructured grids, which was not feasible before. Numerical results show that our algebraic construction exhibits the same convergence behaviour as the geometric construction, while being applicable even in black-box type PDE solvers.

Keywords: construction; construction sparse; tensor product; algebraic construction; sparse multilevel

Journal Title: Journal of Scientific Computing
Year Published: 2019

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.