Explicit digital inversive pseudorandom numbers
Explicit estimation of error constants appearing in non-conforming linear triangular finite element method
The non-conforming linear () 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 triangle. Some applications...
Explicit expressions for the coordinates of foci and vertices of a quadric in dependence on the coefficients of its Cartesian equations
Explicit finite element error estimates for nonhomogeneous Neumann problems
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 .
Explicit Finite Element Schemes for First Order Symmetric Hyperbolic Systems.
Explicit inverse of an interval matrix with unit midpoint.
Explicit Runge-Kutta Formulas with Increased Stability Boundaries.
Explicit solution for an infinite dimensional generalized inverse eigenvalue problem.
Explicit two-step Runge-Kutta methods
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 the minimal number of stages for explicit TSRK method of order is equal to the minimal number of stages for explicit Runge-Kutta method of order . Numerical results are presented which...
Explizite Konstruktion von linearen Mehrschrittblockverfahren
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.
Exploring the fractal parameters of urban growth and form with wave-spectrum analysis.
Exponential convergence of hp quadrature for integral operators with Gevrey kernels
Galerkin discretizations of integral equations in require the evaluation of integrals where S(1),S(2) are d-simplices and g has a singularity at x = y. We assume that g is Gevrey smooth for xy 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 using N function evaluations of g which achieves exponential convergence |I – | ≤C exp(–rNγ) with...
Exponential convergence of hp quadrature for integral operators with Gevrey kernels
Galerkin discretizations of integral equations in require the evaluation of integrals where S(1),S(2) are d-simplices and g has a singularity at x = y. We assume that g is Gevrey smooth for xy 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 using N function evaluations of g which achieves exponential convergence |I – | ≤C exp(–rNγ) with...
Exponential expressivity of neural networks on Gevrey classes with point singularities
We analyze deep Neural Network emulation rates of smooth functions with point singularities in bounded, polytopal domains , . 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 , 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 functions as boundary layer functions.
Exponential inequalities for VLMC empirical trees
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 Multistep Methods for Ordinary Differential Equations
Exponential representation of solutions of ordinary differential equations
Exponential smoothing and resampling techniques in time series prediction
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...
Exponential sums and the distribution of inversive congruential pseudorandom numbers with prime-power modulus