Concept

Tenseur (mathématiques)

Publications associées (59)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

MATHICSE Technical Report : Low-rank tensor approximation for high-order correlation functions of Gaussian random fields

Fabio Nobile, Daniel Kressner, Christine Tobler, Rajesh Kumar

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 ...

MATHICSE2014

Separable Filter Learning with Tensor Decomposition

Bugra Tekin

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 ...

2013

Learning Separable Filters with Shared Parts

Bugra Tekin

2013

The Chu Construction For Complete Atomistic Coatomistic Lattices

Gavin Jay Seal, Boris Ischi

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. ...

Univ Houston2013

Dynamical Approximation By Hierarchical Tucker And Tensor-Train Tensors

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

A convex optimization approach for image recovery from nonlinear measurements in optical interferometry

Yves Wiaux, Rafael Eduardo Carrillo Rangel, Anna Auria Rasclosa

Image recovery in optical interferometry is an ill-posed nonlinear inverse problem arising from incomplete power spectrum and bi-spectrum measurements. We formulate a linear version of the problem for the order-3 tensor formed by the tensor product of the ...

2013

An Error Analysis Of Galerkin Projection Methods For Linear Systems With Tensor Product Structure

Daniel Kressner, Christine Tobler

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

Tensors, Monads And Actions

Gavin Jay Seal

We exhibit sufficient conditions for a monoidal monad T on a monoidal category C to induce a monoidal structure on the Eilenberg-Moore category C^T that represents bimorphisms. The category of actions in C^T is then shown to be monadic over the base catego ...

Mount Allison University2013

Light Field Tensor Recovery

Pierre Vandergheynst, Mahdad Hosseini Kamal

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 ...

2012

Low-rank tensor Krylov subspace methods for parametrized linear systems

Daniel Kressner, Christine Tobler

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