共查询到20条相似文献,搜索用时 31 毫秒
1.
Wilhelm Forst 《Numerische Mathematik》1978,30(2):137-147
Summary Letx
0<x
1<...<x
n–1<x
0+2 be nodes having multiplicitiesv
0,...,v
n–1, 1v
k
r (0k<n). We approximate the evaluation functional
,x fixed, and the integral respectively by linear functionals of the form
and determine optimal weights
for the Favard classesW
r
C
2. In the even case
of optimal interpolation these weights are unique except forr=1,x(x
k
+x
k–1)/2 mod 2. Moreover we get periodic polynomial splinesw
k, j
(0k<n, 0j<v
k
) of orderr such that
are the optimal weights. Certain optimal quadrature formulas are shown to be of interpolatory type with respect to these splines. For the odd case
of optimal interpolation we merely have obtained a partial solution.
Bojanov hat in [4, 5] ähnliche Resultate wie wir erzielt. Um Wiederholungen zu vermeiden, werden Resultate, deren Beweise man bereits in [4, 5] findet, nur zitiert 相似文献
2.
We consider three time-level difference schemes, symmetric in time and space, for the solution of the wave equation,u
tt
=c
2
u
xx
, given by
相似文献
3.
Péter Major 《Probability Theory and Related Fields》1988,77(1):117-128
Summary In this paper we prove the following statement. Given a random walk
,n=1, 2, ... where
1,
2 ... are i.i.d. random variables,
let (n) denote the number of points visited exactly once by this random walk up to timen. We show that there exists some constantC, 0 <C < , such that
with probability 1. The proof applies some arguments analogous to the techniques of the large deviation theory.Research supported by the Hungarian National Foundation for Scientific Research, Grant No # 819/1 相似文献
4.
A. Schinzel 《Monatshefte für Mathematik》1986,102(4):309-337
Letk>1 and let
be non-zero algebraic numbers contained in the field
. It is shown that for almost all, in the sense of density integer vectorsn
1,...,n
k
the polynomial
becomes irreducible over
on dividing by the product of all factorsx–, where is a root of unity.Dedicated to Professor E. Hlawka on the occasion of his seventieth birthday 相似文献
5.
H. Fiedler 《Numerische Mathematik》1987,51(5):571-581
Summary Interpolatory quadrature formulae consist in replacing
by
wherep
f
denotes the interpolating polynomial off with respect to a certain knot setX. The remainder
may in many cases be written as
wherem=n resp. (n+1) forn even and odd, respectively. We determine the asymptotic behaviour of the Peano kernelP
X
(t) forn for the quadrature formulae of Filippi, Polya and Clenshaw-Curtis. 相似文献
6.
P. Major 《Probability Theory and Related Fields》1988,78(3):419-435
Summary Let F
n
(u) denote the empirical distribution function of a sample of i.i.d. random variables with uniform distribution on [0, 1]. Define
, and consider the integrals
where f is a bounded measurable function. We give a good upper bound on the probability
. An analogous estimate is given for multiple integrals with respect to a Poisson process. 相似文献
7.
Prof. Dr. Michael Stieglitz 《Monatshefte für Mathematik》1977,84(3):247-258
Let
be a fixed matrix with elements that are 0 or 1 and letX be a fixed set ofm+1 different knots. The problem is to find necessary and sufficient conditions for (E, X) to guarantee the existence of a quadrature formula with a remainder term of type
for any choice of a weight functionw(t) and satisfyingR(f)=0 forf a polynomial of degree at mostn–1. The result generalizes the corresponding result ofI. J. Schoenberg for the special case of quasi-Lagrange-matricesE. —in case of the existence ofR it is possible to calculate the best quadrature formulaR
* in the sense ofSard by integrating splines of degree 2n–1. But ifE contains onlyn ones it is sufficient to integrate polynomials of degreen–1. 相似文献
8.
Harold Greenberg 《Numerische Mathematik》1980,34(4):349-352
Summary We solve the diophantine equation
for nonnegative variablesx
j
, wherea
j
andL are positive integers. We characterize both the values ofL that lead to solutions and those that do not lead to solutions. We solve the Frobenius problem of finding the largest value ofL for which no solution exists. 相似文献
9.
Summary Let {X
ij; i>0, j>0} be a double sequence of i.i.d. random variables taking values in the d-dimensional integer lattice E
d
. Also let
. Then the range of random walk {S
mn: m>0, n>0} up to time (m, n), denoted by R
mn
, is the cardinality of the set {S
pq: 0
10.
D. Romero 《Journal of Optimization Theory and Applications》1990,66(1):137-147
TheK-dimensional version of two transportation-like problems is posed and efficiently solved. The caseK=2 goes as follows: Given an (m,n)-matrixA of reals, a realm-vectoru, and a realn-vectorv, find a real (m,n)-matrixX minimizing
|