«simpson approximation»
۳۸۱ نتیجهApproximability of Dodgson's rule
It is known that Dodgson’s rule is computationally very demanding. Tideman (1987) suggested an approximation to it but did not investigate how often his approximation selects the Dodgson winner. We show that under the Impartial Culture assumption the probability that the Tideman
Partitions for Optimal Approximations
The Riemann integral can be approximated using partitions and a rule for assigning weighted sums of the function at points determined by the partition. Approximation methods commonly used include endpoint rules, the midpoint rule, the trapezoid rule, Simpson’s rule, and other qua
On Fully Discrete Galerkin Approximations for Partial Integro-differential Equations of Parabolic Type
The subject of this work is the application of fully discrete Galerkin finite element methods to initial-boundary value problems for linear partial integro-differential equations of parabolic type. We investigate numerical schemes based on the Padé discretization with respect to
Phenotype space and kinship assignment for the simpson index
We investigate the computational structure of the biological kinship assignment problem by abstracting away all biological details that are irrelevant to computation. The computational structure depends on phenotype space, which we formally define. We illustrate this approach by
An Euler-Maclaurin-like summation formula for Simpson’s rule
where n is even, h = (b − a)/n, xi = a + ih, and ξ ∈ (a, b). We usually derive (1) using Lagrange polynomials or making the formula exact for f(x) = 1, x, x. A standard exercise for a numerical analysis class is to use the composite Simpson’s rule to approximate an integral with
Numerical Integration Simpson's Rule
Numerical integration is the study of how the numerical value of an integral can be found. Also called quadrature, which refers to nding a square whose area is the same as the area under a curve, it is one of the classical topics of numerical analysis. Of central interest is the
Convexity results and sharp error estimates in approximate multivariate integration
An interesting property of the midpoint rule and trapezoidal rule, which is expressed by the so-called Hermite–Hadamard inequalities, is that they provide one-sided approximations to the integral of a convex function. We establish multivariate analogues of the Hermite–Hadamard in
Continuous Slowing Down Approximation ( CSDA ) ranges of electrons for biomedical materials
Introduction Stopping media are characterized by their stopping power (SP), the inelastic mean free path (IMFP), the continuous slowing down approximation-range (CSDA-range) (R) and the energy straggling parameter. These physical quantities are important for application such as r
Approximate Symbolic Model Checking of Continuous-Time Markov Chains
This paper presents a symbolic model checking algorithm for continuous-time Markov chains for an extension of the continuous stochastic logic CSL of Aziz et al 1]. The considered logic contains a time-bounded until-operator and a novel operator to express steady-state probabiliti
On Weighted Simpson Type Inequalities and Applications
In this paper we establish some weighted Simpson type inequalities and give several applications for the r − moments and the expectation of a continuous random variable. An approximation for Euler’s Beta mapping is given as well.