Displaying 21 – 40 of 681

Showing per page

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...

A propagation theorem for a class of microfunctions

Andrea D'Agnolo, Giuseppe Zampieri (1990)

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

Let A be a closed set of M R n , whose conormai cones x + y x * A , x A , have locally empty intersection. We first show in §1 that dist x , A , x M A is a C 1 function. We then represent the n microfunctions of C A | X , X C n , using cohomology groups of O X of degree 1. By the results of § 1-3, we are able to prove in §4 that the sections of C A | X π ˙ - 1 x 0 , x 0 A , satisfy the principle of the analytic continuation in the complex integral manifolds of H ϕ i C i = 1 , , m , ϕ i being a base for the linear hull of γ x 0 * A in T x 0 * M ; in particular we get Γ A × M T * M X C A | X A × M T ˙ * M X = 0 . When A is a half space with C ω -boundary,...

A pure smoothness condition for Radó’s theorem for α -analytic functions

Abtin Daghighi, Frank Wikström (2016)

Czechoslovak Mathematical Journal

Let Ω n be a bounded, simply connected -convex domain. Let α + n and let f be a function on Ω which is separately C 2 α j - 1 -smooth with respect to z j (by which we mean jointly C 2 α j - 1 -smooth with respect to Re z j , Im z j ). If f is α -analytic on Ω f - 1 ( 0 ) , then f is α -analytic on Ω . The result is well-known for the case α i = 1 , 1 i n , even when f a priori is only known to be continuous.

A Riccati equation arising in a boundary control problem for distributed parameters

Franco Flandoli (1982)

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

Si prova resistenza locale della soluzione di una equazione di Riccati che si incontra in un problema di controllo ottimale. In ipotesi di regolarità per il costo si prova resistenza globale. Il problema astratto considerato è il modello di alcuni problemi di controllo ottimale governati da equazioni paraboliche con controllo sulla frontiera.

Currently displaying 21 – 40 of 681