Page 1

Displaying 1 – 15 of 15

Showing per page

A comparison theorem for the Levi equation

Giovanna Citti (1993)

Atti della Accademia Nazionale dei Lincei. Classe di Scienze Fisiche, Matematiche e Naturali. Rendiconti Lincei. Matematica e Applicazioni

We prove a strong comparison principle for the solution of the Levi equation L ( u ) = i = 1 n ( ( 1 + u t 2 ) ( u x i x i + u y i y i ) + ( u x i 2 + u y i 2 ) u t t + 2 ( u y i - u x i u t ) u x i t - 2 ( u x i + u y i u t ) u y i t + k ( x , y , t ) ( 1 + | D u | 2 ) 3 / 2 = 0 , applying Bony Propagation Principle.

A priori convergence of the greedy algorithm for the parametrized reduced basis method

Annalisa Buffa, Yvon Maday, Anthony T. Patera, Christophe Prud’homme, Gabriel Turinici (2012)

ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique

The convergence and efficiency of the reduced basis method used for the approximation of the solutions to a class of problems written as a parametrized PDE depends heavily on the choice of the elements that constitute the “reduced basis”. The purpose of this paper is to analyze the a priori convergence for one of the approaches used for the selection of these elements, the greedy algorithm. Under natural hypothesis on the set of all solutions to the problem obtained when the parameter varies, we...

A priori convergence of the Greedy algorithm for the parametrized reduced basis method

Annalisa Buffa, Yvon Maday, Anthony T. Patera, Christophe Prud’homme, Gabriel Turinici (2012)

ESAIM: Mathematical Modelling and Numerical Analysis

The convergence and efficiency of the reduced basis method used for the approximation of the solutions to a class of problems written as a parametrized PDE depends heavily on the choice of the elements that constitute the “reduced basis”. The purpose of this paper is to analyze the a priori convergence for one of the approaches used for the selection of these elements, the greedy algorithm. Under natural hypothesis on the set of all solutions to the problem obtained when the parameter varies, we...

A priori convergence of the Greedy algorithm for the parametrized reduced basis method

Annalisa Buffa, Yvon Maday, Anthony T. Patera, Christophe Prud’homme, Gabriel Turinici (2012)

ESAIM: Mathematical Modelling and Numerical Analysis

The convergence and efficiency of the reduced basis method used for the approximation of the solutions to a class of problems written as a parametrized PDE depends heavily on the choice of the elements that constitute the “reduced basis”. The purpose of this paper is to analyze the a priori convergence for one of the approaches used for the selection of these elements, the greedy algorithm. Under natural hypothesis on the set of all solutions to the problem obtained when the parameter varies, we...

An Age and Spatially Structured Population Model for Proteus Mirabilis Swarm-Colony Development

Ph. Laurençot, Ch. Walker (2008)

Mathematical Modelling of Natural Phenomena

Proteus mirabilis are bacteria that make strikingly regular spatial-temporal patterns on agar surfaces. In this paper we investigate a mathematical model that has been shown to display these structures when solved numerically. The model consists of an ordinary differential equation coupled with a partial differential equation involving a first-order hyperbolic aging term together with nonlinear degenerate diffusion. The system is shown to admit global weak solutions.

An existence result for nonlinear evolution equations of second order

Dimitrios A. Kandilakis (1996)

Discussiones Mathematicae, Differential Inclusions, Control and Optimization

In this paper we consider a second order differential equation involving the difference of two monotone operators. Using an auxiliary equation, a priori bounds and a compactness argument we show that the differential equation has a local solution. An example is also presented in detail.

Currently displaying 1 – 15 of 15

Page 1