Efficient scattering calculations in complex backgrounds
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.
This paper presents a novel approach to capture light field in camera arrays based on the tensor recovery framework. Light fields are acquired by a linear array of cameras with overlapping field of view. We represent the light fields in shape of a tensor t ...
Gaussian random fields are widely used as building blocks for modeling stochastic processes. This paper is concerned with the efficient representation of d-point correlations for such fields, which in turn enables the representation of more general stochas ...
We extend results on the dynamical low-rank approximation for the treatment of time-dependent matrices and tensors (Koch and Lubich; see [SIAM J. Matrix Anal. Appl., 29 (2007), pp. 434-454], [SIAM J. Matrix Anal. Appl., 31 (2010), pp. 2360-2375]) to the re ...
Society for Industrial and Applied Mathematics2013
Learned image features can provide great accuracy in many Computer Vision tasks. However, when the convolution filters used to learn image features are numerous and not separable, feature extraction becomes computationally de- manding and impractical to us ...
Learned image features can provide great accuracy in many Computer Vision tasks. However, when the convolution filters used to learn image features are numerous and not separable, feature extraction becomes computationally demanding and impractical to use ...
The Chu construction is used to define a *-autonomous structure on a category of complete atomistic coatomistic lattices. This construction leads to a new tensor product that is compared with a certain number of other existing tensor products. ...
An analysis of a multiscale symmetric interior penalty discontinuous Galerkin finite element method for the numerical discretization of elliptic problems with multiple scales is proposed. This new method, first described in [A. Abdulle, C.R. Acad. Sci. Par ...
We consider linear systems A(alpha)x(alpha) - b(alpha) depending on possibly many parameters alpha = (alpha(1), ... , alpha(p)). Solving these systems simultaneously for a standard discretization of the parameter range would require a computational effort ...
Society for Industrial and Applied Mathematics2011
This article discusses an efficient implementation of tensors of arbitrary rank by using some of the idioms introduced by the recently published C++ ISO Standard (C++11). With the aims at providing a basic building block for high-performance computing, a s ...
Recent results on the convergence of a Galerkin projection method for the Sylvester equation are extended to more general linear systems with tensor product structure. In the Hermitian positive definite case, explicit convergence bounds are derived for Gal ...
Society for Industrial and Applied Mathematics2013
