Publication

Local discontinuous Galerkin methods for fractional ordinary differential equations

Publications associées (32)

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

Node-weighted network design and maximum sub-determinants

Carsten Moldenhauer

We consider the Node-weighted Steiner Forest problem on planar graphs. Demaine et al. showed that a generic primal-dual algorithm gives a 6-approximation. We present two different proofs of an approximation factor of~

3

. Then, we draw a connection to Goem ...

EPFL2014

Local discontinuous Galerkin methods for fractional ordinary differential equations

Graph Chatbot

Chattez avec Graph Search

Combinatorial Algorithm for Restricted Max-Min Fair Allocation

Node-weighted network design and maximum sub-determinants

On the Configuration LP for Maximum Budgeted Allocation

MATHICSE Technical Report : Convergence of quasi-optimal sparse grid approximation of Hilbert-valued functions: application to random elliptic PDEs

Opaque Sets

Approximation Properties Of Sobolev Splines And The Construction Of Compactly Supported Equivalents

Bounding the Polynomial Approximation Errors of Frequency Response Functions

On the optimal polynomial approximation of stochastic PDEs by Galerkin and Collocation methods

Polynomial Approximations for Continuous Linear Programs

New Results in the Theory of Linear and Integer Programming

New Results in the Theory of Linear and Integer Programming

Combinatorial Algorithm for Restricted Max-Min Fair Allocation

Opaque Sets

Node-weighted network design and maximum sub-determinants

Approximation Properties Of Sobolev Splines And The Construction Of Compactly Supported Equivalents

On the optimal polynomial approximation of stochastic PDEs by Galerkin and Collocation methods

Bounding the Polynomial Approximation Errors of Frequency Response Functions

On the Configuration LP for Maximum Budgeted Allocation

Polynomial Approximations for Continuous Linear Programs

MATHICSE Technical Report : Convergence of quasi-optimal sparse grid approximation of Hilbert-valued functions: application to random elliptic PDEs