Low-Rank Updates And A Divide-And-Conquer Method For Linear Matrix Equations
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.
We analyze the recent Multi-index Stochastic Collocation (MISC) method for computing statistics of the solution of a partial differential equation (PDE) with random data, where the random coefficient is parametrized by means of a countable sequence of term ...
Positron Emission Tomography (PET) aims at recovering the metabolic activity of an organ of interest. Established algorithms implemented in contemporary PET scans are based on an approximation of the inverse Radon transform, resulting in a suboptimal estim ...
This thesis uses the idea of lifting (or embedding) a nonlinear controlled dynamical system into an infinite-dimensional space of measures where this system is equivalently described by a linear equation. This equation and problems involving it are subsequ ...
We consider the approximate computation of spectral projectors for symmetric banded matrices. While this problem has received considerable attention, especially in the context of linear scaling electronic structure methods, the presence of small relative s ...
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 ...
We consider the problem of efficiently solving Sylvester and Lyapunov equations of medium and large scale, in case of rank-structured data, i.e., when the coefficient matrices and the right-hand side have low-rank off- diagonal blocks. This comprises probl ...
This paper is concerned with the solution of heterogeneous problems by the interface control domain decomposition (ICDD) method, a strategy introduced for the solution of partial differential equations in computational domains partitioned into subdomains t ...
We analyze the recent Multi-index Stochastic Collocation (MISC) method for computing statistics of the solution of a partial differential equation with random data, where the random coefficient is parametrized by means of a countable sequence of terms in a ...
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 ...
The numerical solution of partial differential equations (PDEs) depending on para- metrized or random input data is computationally intensive. Reduced order modeling techniques, such as the reduced basis methods, have been developed to alleviate this compu ...