All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 8 Next

Displaying 141 – 160 of 259

Showing per page

On the convergence of generalized polynomial chaos expansions

Oliver G. Ernst, Antje Mugler, Hans-Jörg Starkloff, Elisabeth Ullmann (2012)

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

A number of approaches for discretizing partial differential equations with random data are based on generalized polynomial chaos expansions of random variables. These constitute generalizations of the polynomial chaos expansions introduced by Norbert Wiener to expansions in polynomials orthogonal with respect to non-Gaussian probability measures. We present conditions on such measures which imply mean-square convergence of generalized polynomial chaos expansions to the correct limit and complement...

On the convergence of generalized polynomial chaos expansions

Oliver G. Ernst, Antje Mugler, Hans-Jörg Starkloff, Elisabeth Ullmann (2011)

ESAIM: Mathematical Modelling and Numerical Analysis

A number of approaches for discretizing partial differential equations with random data are based on generalized polynomial chaos expansions of random variables. These constitute generalizations of the polynomial chaos expansions introduced by Norbert Wiener to expansions in polynomials orthogonal with respect to non-Gaussian probability measures. We present conditions on such measures which imply mean-square convergence of generalized polynomial...

On the convergence of SCF algorithms for the Hartree-Fock equations

Eric Cancès, Claude Le Bris (2010)

ESAIM: Mathematical Modelling and Numerical Analysis

The present work is a mathematical analysis of two algorithms, namely the Roothaan and the level-shifting algorithms, commonly used in practice to solve the Hartree-Fock equations. The level-shifting algorithm is proved to be well-posed and to converge provided the shift parameter is large enough. On the contrary, cases when the Roothaan algorithm is not well defined or fails in converging are exhibited. These mathematical results are confronted to numerical experiments performed by chemists.

On the Convergence of the Approximate Free Boundary for the Parabolic Obstacle Problem

Paola Pietra, Claudio Verdi (1985)

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

Si discretizza il problema dell'ostacolo parabolico con differenze all'indietro nel tempo ed elementi finiti lineari nello spazio e si dimostrano stime dell'errore per la frontiera libera discreta.

On the convergence of the stochastic Galerkin method for random elliptic partial differential equations

Antje Mugler, Hans-Jörg Starkloff (2013)

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

In this article we consider elliptic partial differential equations with random coefficients and/or random forcing terms. In the current treatment of such problems by stochastic Galerkin methods it is standard to assume that the random diffusion coefficient is bounded by positive deterministic constants or modeled as lognormal random field. In contrast, we make the significantly weaker assumption that the non-negative random coefficients can be bounded strictly away from zero and infinity by random...

On the convergence rate of approximation schemes for Hamilton-Jacobi-Bellman equations

Guy Barles, Espen Robstad Jakobsen (2002)

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

Using systematically a tricky idea of N.V. Krylov, we obtain general results on the rate of convergence of a certain class of monotone approximation schemes for stationary Hamilton-Jacobi-Bellman equations with variable coefficients. This result applies in particular to control schemes based on the dynamic programming principle and to finite difference schemes despite, here, we are not able to treat the most general case. General results have been obtained earlier by Krylov for finite difference...

On the convergence rate of approximation schemes for Hamilton-Jacobi-Bellman Equations

Guy Barles, Espen Robstad Jakobsen (2010)

ESAIM: Mathematical Modelling and Numerical Analysis

Using systematically a tricky idea of N.V. Krylov, we obtain general results on the rate of convergence of a certain class of monotone approximation schemes for stationary Hamilton-Jacobi-Bellman equations with variable coefficients. This result applies in particular to control schemes based on the dynamic programming principle and to finite difference schemes despite, here, we are not able to treat the most general case. General results have been obtained earlier by Krylov for finite...

On the domain geometry dependence of the LBB condition

Evgenii V. Chizhonkov, Maxim A. Olshanskii (2010)

ESAIM: Mathematical Modelling and Numerical Analysis

The LBB condition is well-known to guarantee the stability of a finite element (FE) velocity - pressure pair in incompressible flow calculations. To ensure the condition to be satisfied a certain constant should be positive and mesh-independent. The paper studies the dependence of the LBB condition on the domain geometry. For model domains such as strips and rings the substantial dependence of this constant on geometry aspect ratios is observed. In domains with highly anisotropic substructures...

On the effect of numerical integration in the finite element solution of an elliptic problem with a nonlinear Newton boundary condition

Ondřej Bartoš, Miloslav Feistauer, Filip Roskovec (2019)

Applications of Mathematics

This paper is concerned with the analysis of the finite element method for the numerical solution of an elliptic boundary value problem with a nonlinear Newton boundary condition in a two-dimensional polygonal domain. The weak solution loses regularity in a neighbourhood of boundary singularities, which may be at corners or at roots of the weak solution on edges. The main attention is paid to the study of error estimates. It turns out that the order of convergence is not dampened by the nonlinearity...

Currently displaying 141 – 160 of 259