Unité

Calcul scientifique et quantification de l'incertitude - Chaire CADMOS

Laboratoire

Publications associées (798)

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

Common Information Components Analysis

Michael Christoph Gastpar, Erixhen Sula

Wyner's common information is a measure that quantifies and assesses the commonality between two random variables. Based on this, we introduce a novel two-step procedure to construct features from data, referred to as Common Information Components Analysis ...

MDPI2021

Fast and multiscale formation of isogeometric matrices of microstructured geometric models

Pablo Antolin Sanchez, Thibaut Hirschler

The matrix formation associated to high-order discretizations is known to be numerically demanding. Based on the existing procedure of interpolation and lookup, we design a multiscale assembly procedure to reduce the exorbitant assembly time in the context ...

SPRINGER2021

Mean-Covariance Robust Risk Measurement

Daniel Kuhn, Damir Filipovic, Viet Anh Nguyen, Soroosh Shafieezadeh Abadeh

We introduce a universal framework for mean-covariance robust risk measurement and portfolio optimization. We model uncertainty in terms of the Gelbrich distance on the mean-covariance space, along with prior structural information about the population dis ...

2021

Strictly Real Fundamental Theorem Of Algebra Using Polynomial Interlacing

Soham Basu

Without resorting to complex numbers or any advanced topological arguments, we show that any real polynomial of degree greater than two always has a real quadratic polynomial factor, which is equivalent to the fundamental theorem of algebra. The proof uses ...

CAMBRIDGE UNIV PRESS2021

Functional Tucker Approximation Using Chebyshev Interpolation

Daniel Kressner, Christoph Max Strössner

This work is concerned with approximating a trivariate function defined on a tensor-product domain via function evaluations. Combining tensorized Chebyshev interpolation with a Tucker decomposition of low multilinear rank yields function approximations tha ...

SIAM PUBLICATIONS2021

Decentralized Proximal Gradient Algorithms With Linear Convergence Rates

Ali H. Sayed, Kun Yuan, Sulaiman A S A E Alghunaim

This article studies a class of nonsmooth decentralized multiagent optimization problems where the agents aim at minimizing a sum of local strongly-convex smooth components plus a common nonsmooth term. We propose a general primal-dual algorithmic framewor ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2021

Computation of Al-Salam Carlitz and Askey-Wilson moments using Motzkin paths

Gaspard Ohlmann

In this paper we study the moments of polynomials from the Askey scheme, and we focus on Askey-Wilson polynomials. More precisely, we give a combinatorial proof for the case where d = 0. Their values have already been computed by Kim and Stanton in 2015, h ...

ELECTRONIC JOURNAL OF COMBINATORICS2021

A numerical algorithm based on probing to find optimized transmission conditions

Tommaso Vanzan

Optimized Schwarz Methods (OSMs) are based on optimized transmission conditions along the interfaces between the subdomains. Optimized transmission conditions are derived at the theoretical level, using techniques developed in the last decades. The hypothe ...

Springer-Verlag2021

Adaptive Approximation of Shapes

We consider scalar-valued shape functionals on sets of shapes which are small perturbations of a reference shape. The shapes are described by parameterizations and their closeness is induced by a Hilbert space structure on the parameter domain. We justify ...

TAYLOR & FRANCIS INC2021

On the asymptotic optimality of spectral coarse spaces

Tommaso Vanzan

This paper is concerned with the asymptotic optimality of spectral coarse spaces for two-level iterative methods. Spectral coarse spaces, namely coarse spaces obtained as the span of the slowest modes of the used one-level smoother, are known to be very ef ...

Springer-Verlag2021