Publications related to On multiscale methods in Petrov-Galerkin formulation

Discrete Optimal Transport with Independent Marginals is #P-Hard

Daniel Kuhn, Soroosh Shafieezadeh Abadeh, Bahar Taskesen

We study the computational complexity of the optimal transport problem that evaluates the Wasser- stein distance between the distributions of two K-dimensional discrete random vectors. The best known algorithms for this problem run in polynomial time in th ...

2022

Efficient algorithms for wave problems

Boris Bonev

Wave phenomena manifest in nature as electromagnetic waves, acoustic waves, and gravitational waves among others.Their descriptions as partial differential equations in electromagnetics, acoustics, and fluid dynamics are ubiquitous in science and engineeri ...

EPFL2021

Local approximation of the Maximum Cut in regular graphs

Etienne Michel François Bamas

This paper is devoted to the distributed complexity of finding an approximation of the maximum cut (MAXCUT) in graphs. A classical algorithm consists in letting each vertex choose its side of the cut uniformly at random. This does not require any communica ...

ELSEVIER2020

Fast assembly of Galerkin matrices for 3D solid laminated composites using finite element and isogeometric discretizations

Pablo Antolin Sanchez

This work presents a novel methodology for speeding up the assembly of stiffness matrices for laminate composite 3D structures in the context of isogeometric and finite element discretizations. By splitting the involved terms into their in-plane and out-of ...

2020

Local Approximation of the Maximum Cut in Regular Graphs

Etienne Michel François Bamas

This paper is devoted to the distributed complexity of finding an approximation of the maximum cut in graphs. A classical algorithm consists in letting each vertex choose its side of the cut uniformly at random. This does not require any communication and ...

SPRINGER INTERNATIONAL PUBLISHING AG2019

Fast assembly of Galerkin matrices for 3D solid laminated composites using finite element and isogeometric discretizations

Pablo Antolin Sanchez

This work presents a novel methodology for speeding up the assembly of stiffness matrices for laminate composite 3D structures in the context of isogeometric and finite element discretizations. By splitting the involved terms into their in-plane and out-of ...

2019

An FFT-based Numerical Method for Elasto-Plastic Contact

Jean-François Molinari, Guillaume Anciaux, Lucas Henri Galilée Frérot

Contact of rough surfaces is of prime importance in the study of friction and wear. Numerical simulations are well suited for this non-linear problem, but natural surfaces being fractal [1], they have high discretization requirements. There is therefore a ...

2018

Super Resolution Phase Retrieval for Sparse Signals

Martin Vetterli, Juri Ranieri, Gilles Baechler, Amina Chebira, Miranda Krekovic

In a variety of fields, in particular those involving imaging and optics, we often measure signals whose phase is missing or has been irremediably distorted. Phase retrieval attempts to recover the phase information of a signal from the magnitude of its Fo ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2018

K-Adaptability in Two-Stage Distributionally Robust Binary Programming

Daniel Kuhn, Grani Adiwena Hanasusanto, Wolfram Wiesemann

We propose to approximate two-stage distributionally robust programs with binary recourse decisions by their associated K-adaptability problems, which pre-select K candidate second-stage policies here-and-now and implement the best of these policies once t ...

Elsevier Science Bv2016

Exact Algorithms for $ L ^{ 1 } $ -TV Regularization of Real-Valued or Circle-Valued Signals

Michaël Unser, Martin Kurt Storath

We consider

L ^{ 1 }

-TV regularization of univariate signals with values on the real line or on the unit circle. While the real data space leads to a convex optimization problem, the problem is nonconvex for circle-valued data. In this paper, we deriv ...

SIAM2016

On multiscale methods in Petrov-Galerkin formulation

Graph Chatbot

Chat with Graph Search

Discrete Optimal Transport with Independent Marginals is #P-Hard

Efficient algorithms for wave problems

Local approximation of the Maximum Cut in regular graphs

Fast assembly of Galerkin matrices for 3D solid laminated composites using finite element and isogeometric discretizations

Local Approximation of the Maximum Cut in Regular Graphs

Fast assembly of Galerkin matrices for 3D solid laminated composites using finite element and isogeometric discretizations

An FFT-based Numerical Method for Elasto-Plastic Contact

Super Resolution Phase Retrieval for Sparse Signals

K-Adaptability in Two-Stage Distributionally Robust Binary Programming

Exact Algorithms for $ L ^{ 1 } $ -TV Regularization of Real-Valued or Circle-Valued Signals

Efficient algorithms for wave problems

Local Approximation of the Maximum Cut in Regular Graphs

Fast assembly of Galerkin matrices for 3D solid laminated composites using finite element and isogeometric discretizations

Exact Algorithms for $ L ^{ 1 } $ -TV Regularization of Real-Valued or Circle-Valued Signals

Discrete Optimal Transport with Independent Marginals is #P-Hard

Local approximation of the Maximum Cut in regular graphs

K-Adaptability in Two-Stage Distributionally Robust Binary Programming

Fast assembly of Galerkin matrices for 3D solid laminated composites using finite element and isogeometric discretizations

An FFT-based Numerical Method for Elasto-Plastic Contact

Super Resolution Phase Retrieval for Sparse Signals