Publications associées à On multiscale methods in Petrov-Galerkin formulation

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.

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

Chattez avec 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

An FFT-based Numerical Method for Elasto-Plastic Contact

Discrete Optimal Transport with Independent Marginals is #P-Hard

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

K-Adaptability in Two-Stage Distributionally Robust Binary Programming

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

Super Resolution Phase Retrieval for Sparse Signals

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