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 23 Next

Displaying 441 – 460 of 497

Showing per page

Explicit estimation of error constants appearing in non-conforming linear triangular finite element method

Xuefeng Liu, Fumio Kikuchi (2018)

Applications of Mathematics

The non-conforming linear ( P 1 ) triangular FEM can be viewed as a kind of the discontinuous Galerkin method, and is attractive in both the theoretical and practical purposes. Since various error constants must be quantitatively evaluated for its accurate a priori and a posteriori error estimates, we derive their theoretical upper bounds and some computational results. In particular, the Babuška-Aziz maximum angle condition is required just as in the case of the conforming P 1 triangle. Some applications...

Explicit finite element error estimates for nonhomogeneous Neumann problems

Qin Li, Xuefeng Liu (2018)

Applications of Mathematics

The paper develops an explicit a priori error estimate for finite element solution to nonhomogeneous Neumann problems. For this purpose, the hypercircle over finite element spaces is constructed and the explicit upper bound of the constant in the trace theorem is given. Numerical examples are shown in the final section, which implies the proposed error estimate has the convergence rate as 0 . 5 .

Explicit two-step Runge-Kutta methods

Zdzisław Jackiewicz, Rosemary Anne Renaut, Marino Zennaro (1995)

Applications of Mathematics

The explicit two-step Runge-Kutta (TSRK) formulas for the numerical solution of ordinary differential equations are analyzed. The order conditions are derived and the construction of such methods based on some simplifying assumptions is described. Order barriers are also presented. It turns out that for order p ≤ 5 the minimal number of stages for explicit TSRK method of order p is equal to the minimal number of stages for explicit Runge-Kutta method of order p - 1 . Numerical results are presented which...

Explizite Konstruktion von linearen Mehrschrittblockverfahren

Reiner Vanselow (1983)

Aplikace matematiky

In der vorliegenden Arbeit wird für lineare Mehrschrittblock verfahren zur numerischen Lösung von Anfangswertaufgaben eine explizite Konstruktionsmöglichkeit angegeben. Sie ermöglicht es, zu einem gegebenen Stabilitätspolynom ohne Lösung eines linearen Gleichungssystems die Koefizienten des zugehörigen Blockverfahrens zu berechnen.

Exponential convergence of hp quadrature for integral operators with Gevrey kernels

Alexey Chernov, Tobias von Petersdorff, Christoph Schwab (2011)

ESAIM: Mathematical Modelling and Numerical Analysis

Galerkin discretizations of integral equations in ℝ d require the evaluation of integrals I = ∫ S ( 1 ) ∫ S ( 2 ) g ( x , y ) d y d x where S(1),S(2) are d-simplices and g has a singularity at x = y. We assume that g is Gevrey smooth for x ≠ y and satisfies bounds for the derivatives which allow algebraic singularities at x = y. This holds for kernel functions commonly occurring in integral equations. We construct a family of quadrature rules 𝒬 N using N function evaluations of g which achieves exponential convergence |I – 𝒬 N | ≤C exp(–rNγ) with...

Exponential convergence of hp quadrature for integral operators with Gevrey kernels

Alexey Chernov, Tobias von Petersdorff, Christoph Schwab (2011)

ESAIM: Mathematical Modelling and Numerical Analysis

Galerkin discretizations of integral equations in ℝ d require the evaluation of integrals I = ∫ S ( 1 ) ∫ S ( 2 ) g ( x , y ) d y d x where S(1),S(2) are d-simplices and g has a singularity at x = y. We assume that g is Gevrey smooth for x ≠ y and satisfies bounds for the derivatives which allow algebraic singularities at x = y. This holds for kernel functions commonly occurring in integral equations. We construct a family of quadrature rules 𝒬 N using N function evaluations of g which achieves exponential convergence |I – 𝒬 N | ≤C exp(–rNγ) with...

Exponential expressivity of ReLU k neural networks on Gevrey classes with point singularities

Joost A. A. Opschoor, Christoph Schwab (2024)

Applications of Mathematics

We analyze deep Neural Network emulation rates of smooth functions with point singularities in bounded, polytopal domains D ⊂ ℝ d , d = 2 , 3 . We prove exponential emulation rates in Sobolev spaces in terms of the number of neurons and in terms of the number of nonzero coefficients for Gevrey-regular solution classes defined in terms of weighted Sobolev scales in D , comprising the countably-normed spaces of I. M. Babuška and B. Q. Guo. As intermediate result, we prove that continuous, piecewise polynomial high...

Exponential inequalities for VLMC empirical trees

Antonio Galves, Véronique Maume-Deschamps, Bernard Schmitt (2008)

ESAIM: Probability and Statistics

A seminal paper by Rissanen, published in 1983, introduced the class of Variable Length Markov Chains and the algorithm Context which estimates the probabilistic tree generating the chain. Even if the subject was recently considered in several papers, the central question of the rate of convergence of the algorithm remained open. This is the question we address here. We provide an exponential upper bound for the probability of incorrect estimation of the probabilistic tree, as a function...

Exponential smoothing and resampling techniques in time series prediction

Maria Manuela Neves, Clara Cordeiro (2010)

Discussiones Mathematicae Probability and Statistics

Time series analysis deals with records that are collected over time. The objectives of time series analysis depend on the applications, but one of the main goals is to predict future values of the series. These values depend, usually in a stochastic manner, on the observations available at present. Such dependence has to be considered when predicting the future from its past, taking into account trend, seasonality and other features of the data. Some of the most successful forecasting methods are...

Currently displaying 441 – 460 of 497