Krylov subspace methods for linear systems with tensor product structure
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
In this paper we give a survey on various multiscale methods for the numerical solution of second order hyperbolic equations in highly heterogenous media. We concentrate on the wave equation and distinguish between two classes of applications. First we dis ...
The numerical solution of partial differential equations on high-dimensional domains gives rise to computationally challenging linear systems. When using standard discretization techniques, the size of the linear system grows exponentially with the number ...
In this paper we review various numerical homogenization methods for monotone parabolic problems with multiple scales. The spatial discretisation is based on finite element methods and the multiscale strategy relies on the heterogeneous multiscale method. ...
Solar energy has seen tremendous advances in the past years. For thin film photovoltaics, which use less of the expensive semiconductor materials, insufficient light absorption can be a limiting factor. It is hoped that by using diffractive optics to impro ...
We propose a novel combination of the reduced basis method with low-rank tensor techniques for the efficient solution of parameter-dependent linear systems in the case of several parameters. This combination, called rbTensor, consists of three ingredients. ...
The matrix Sylvester equation for congruence, or T-Sylvester equation, has recently attracted considerable attention as a consequence of its close relation to palindromic eigenvalue problems. The theory concerning T-Sylvester equations is rather well under ...
The numerical solution of partial differential equations on high-dimensional domains gives rise to computationally challenging linear systems. When using standard discretization techniques, the size of the linear system grows exponentially with the number ...
We previously introduced a preconditioner that has proven effective for hp-FEM dis- cretizations of various challenging elliptic and hyperbolic problems. The construc- tion is inspired by standard nested dissection, and relies on the assumption that the Sc ...
The focus of this thesis is on developing efficient algorithms for two important problems arising in model reduction, estimation of the smallest eigenvalue for a parameter-dependent Hermitian matrix and solving large-scale linear matrix equations, by extra ...
This work is concerned with the numerical solution of large-scale linear matrix equations A1XB1T++AKXBKT=C. The most straightforward approach computes XRmxn from the solution of an mn x mn linear system, typically limiting the feasible values of m,n to a f ...
