Publication

Sur quelques inclusions différentielles de premier et de deuxième ordre

2004
Theses

Abstract

The principal subject of this thesis is the study of some Dirichlet problems related to differential inclusions of first and second order. We have studied the two following problems : where E ⊂ R2×2 is a compact isotropic set and where We show some existence theorems of W1,∞ and W2,∞ solutions respectively. Moreover we have studied a minimization problem : the computation of α(p, q, r) defined by

Official source

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

2004
Theses

Abstract

Official source

Related concepts (25)

Computation

A computation is any type of arithmetic or non-arithmetic calculation that is well-defined. Common examples of computations are mathematical equations and computer algorithms. Mechanical or electronic devices (or, historically, people) that perform computations are known as computers. The study of computation is the field of computability, itself a sub-field of computer science. The notion that mathematical statements should be ‘well-defined’ had been argued by mathematicians since at least the 1600s, but agreement on a suitable definition proved elusive.

Theory of computation

In theoretical computer science and mathematics, the theory of computation is the branch that deals with what problems can be solved on a model of computation, using an algorithm, how efficiently they can be solved or to what degree (e.g., approximate solutions versus precise ones). The field is divided into three major branches: automata theory and formal languages, computability theory, and computational complexity theory, which are linked by the question: "What are the fundamental capabilities and limitations of computers?".

Model of computation

In computer science, and more specifically in computability theory and computational complexity theory, a model of computation is a model which describes how an output of a mathematical function is computed given an input. A model describes how units of computations, memories, and communications are organized. The computational complexity of an algorithm can be measured given a model of computation. Using a model allows studying the performance of algorithms independently of the variations that are specific to particular implementations and specific technology.

Related publications (20)

Sur quelques inclusions différentielles de premier et de deuxième ordre

Chat with Graph Search

Accelerated Solvers for Neutral Particle Dynamics in Plasma Simulation

Boundary simulations in realistic wall geometry with the GBS code

SBB Reuss hydroelectric cascade