共查询到20条相似文献,搜索用时 31 毫秒
1.
Herbert E. Salzer 《Journal of Computational and Applied Mathematics》1976,2(4):241-248
Gauss's (2n+1)-point trigonometric interpolation formula, based upon f(xi), i = 1(1)2n+1, gives a trigonometric sum of the nth order, S2n+1(x = a0 + ∑jn = 1(ajcos jx + bjsin jx), which may be integrated to provide formulas for either direct quadrature or stepwise integration of differential equations having periodic (or near-periodic) solutions. An “orthogonal” trigonometric sum S2r+1(x) is one that satisfies and two other arbitrarily imposable conditions needed to make S2r1(x) unique. Two proofs are given of a fundamental factor theorem for any S2n+1(x) (somewhat different from that for polynomials) from which we derive 2r-point Gaussian-type quadrature formulas, r = [n/2] + 1, which are exact for any S4r?1(x). We have where the nodes xj, j = 1(1)2r, are the zeros of the orthogonal S2r+1(x). It is proven that Aj > 0 and that 2r-1 of the nodes must lie within the interval [a,b], and the remaining node (which may or may not be in [a,b]) must be real. Unlike Legendre polynomials, any [a′,b′] other than a translation of [a,b], requires different and unrelated sets of nodes and weights. Gaussian-type quadrature formulas are applicable to the numerical integration of the Gauss (2n+1)-point interpolation formulas, with extra efficiency when the latter are expressed in barycentric form. S2r+1(x), xjandAj, j = 1(1)2r, were calculated for [a,b] = [0, π/4], 2r = 2 and 4, to single-precision accuracy. 相似文献
2.
M. Neumann 《Linear algebra and its applications》1976,14(1):41-51
In this paper iterative schemes for approximating a solution to a rectangular but consistent linear system Ax = b are studied. Let A?Cm × nr. The splitting A = M ? N is called subproper if R(A) ? R(M) and . Consider the iteration . We characterize the convergence of this scheme to a solution of the linear system. When A?Rm×nr, monotonicity and the concept of subproper regular splitting are used to determine a necessary and a sufficient condition for the scheme to converge to a solution. 相似文献
3.
Jorge L.C Sanz Thomas S Huang 《Journal of Mathematical Analysis and Applications》1984,104(1):302-308
In this paper, the problem of phase reconstruction from magnitude of multidimensional band-limited functions is considered. It is shown that any irreducible band-limited function f(z1…,zn), zi ? , i=1, …, n, is uniquely determined from the magnitude of f(x1…,xn): | f(x1…,xn)|, xi ? , i=1,…, n, except for (1) linear shifts: i(α1z1+…+αn2n+β), β, αi?, i=1,…, n; and (2) conjugation: . 相似文献
4.
Stanley J Benkoski 《Journal of Number Theory》1976,8(2):218-223
If r, k are positive integers, then denotes the number of k-tuples of positive integers (x1, x2, …, xk) with 1 ≤ xi ≤ n and (x1, x2, …, xk)r = 1. An explicit formula for is derived and it is shown that .If S = {p1, p2, …, pa} is a finite set of primes, then 〈S〉 = {p1a1p2a2…psas; pi ∈ S and ai ≥ 0 for all i} and denotes the number of k-tuples (x1, x3, …, xk) with 1 ≤ xi ≤ n and (x1, x2, …, xk)r ∈ 〈S〉. Asymptotic formulas for are derived and it is shown that . 相似文献
5.
C.J.K Batty 《Journal of Functional Analysis》1984,57(3):233-243
Let (A, G, α) be a C1-dynamical system, where G is abelian, and let φ be an invariant state. Suppose that there is a neighbourhood Ω of the identity in and a finite constant κ such that whenever xi lies in a spectral subspace , where . This condition of complete spectral passivity, together with self-adjointness of the left kernel of φ, ensures that φ satisfies the KMS condition for some one-parameter subgroup of G. 相似文献
6.
A technique for the numerical approximation of matrix-valued Riemann product integrals is developed. For a ? x < y ? b, Im(x, y) denotes , and Am(x, y) denotes an approximation of Im(x, y) of the form , where ak and yik are fixed numbers for i = 1, 2,…, m and k = 1, 2,…, N and xik = x + (y ? x)yik. The following result is established. If p is a positive integer, F is a function from the real numbers to the set of w × w matrices with real elements and F(1) exists and is continuous on [a, b], then there exists a bounded interval function H such that, if n, r, and s are positive integers, , then Further, if F(j) exists and is continuous on [a, b] for j = 1, 2,…, p + 1 and A is exact for polynomials of degree less than p + 1 ? j for j = 1, 2,…, p, then the preceding result remains valid when Aj is substituted for Ij. 相似文献
7.
Allen J. Schwenk 《Discrete Mathematics》1977,18(1):71-78
Let denote the polynomial obtained from the cycle index of the symmetric group Z(Sn) by replacing each variable si by f(x1). Let f(x) have a Taylor series with radius of convergence ? of the form f(x)=xk + ak+1xk+1 + ak+2xk+2+? with every a1?0. Finally, let 0<x<1 and let x??. We prove that This limit is used to estimate the probability (for n and p both large) that a point chosen at random from a random p-point tree has degree n + 1. These limiting probabilities are independent of p and decrease geometrically in n, contrasting with the labeled limiting probabilities of .In order to prove the main theorem, an appealing generalization of the principle of inclusion and exclusion is presented. 相似文献
8.
Using results from the theory of B-splines, various inequalities involving the nth order divided differences of a function f with convex nth derivative are proved; notably, , where z is the center of mass . 相似文献
10.
The following commutator identity is proved:. Here S is the n by n matrix of the truncated shift operator S = (Γi,i+1), i = 0, 1,…, n ? 1, and u, v are two polynomials of degree not exceeding n. The reciprocal polynomial f;1 of a polynomial f; of degree ?n is defined by . The commutator identity is closely related to some properties of the Bezoutian matrix of a pair of polynomials; it is used to obtain the Bezoutian matrix in the form of a simple expression in terms of S and S1. To demonstrate the advantage of this expression, we show how it can be used to obtain simple proofs of some interesting corollaries. 相似文献
11.
The system is investigated, where x and y are scalar functions of time (t ? 0), and n space variables , and F and G are nonlinear functions. Under certain hypotheses on F and G it is proved that there exists a unique spherically symmetric solution , which is bounded for r ? 0 and satisfies x(0) >x0, y(0) > y0, x′(0) = 0, y′(0) = 0, and x′ < 0, y′ > 0, ?r > 0. Thus, (x(r), y(r)) represents a time independent equilibrium solution of the system. Further, the linearization of the system restricted to spherically symmetric solutions, around (x(r), y(r)), has a unique positive eigenvalue. This is in contrast to the case n = 1 (i.e., one space dimension) in which zero is an eigenvalue. The uniqueness of the positive eigenvalue is used in the proof that the spherically symmetric solution described is unique. 相似文献
12.
Peter Lancaster 《Linear algebra and its applications》1977,18(3):213-222
The fundamental theorem of the title refers to a spectral resolution for the inverse of a lambda-matrix where the Ai are n×n complex matrices and detAl ≠ 0. In this paper general solutions are formulated for difference equations of the form . The use of these solutions is illustrated i new proof of Franklin's results describing the sums of powers of the eigenvalues of L(λ) (the generalized Newton identities), and in obtaining convergence proofs for the application of Bernoulli's method to the solution of for matrix S. 相似文献
13.
Tom Brylawski 《Discrete Mathematics》1977,18(3):243-252
In “The Slimmest Geometric Lattices” (Trans. Amer. Math. Soc.). Dowling and Wilson showed that if G is a combinatorial geometry of rank r(G) = n, and if X(G) = Σμ(0, x)λr ? r(x) = Σ (?1)r ? kWkλk is the characteristic polynomial of G, then Thus γ(G) ? 2r ? 1 (n+2), where γ(G) = Σwk. In this paper we sharpen these lower bounds for connected geometries: If G is connected, r(G) ? 3, and n(G) ? 2 ((r, n) ≠ (4,3)), then |μ| ? (r? 1)n; and γ ? (2r ? 1 ? 1)(2n + 2). These bounds are all achieved for the parallel connection of an r-point circuit and an (n + 1)point line. If G is any series-parallel network, , and then . Further, if β is the Crapo invariant, then β(G) ? max(1, n ? r + 2). This lower bound is achieved by the parallel connection of a line and a maximal size series-parallel network. 相似文献
14.
J.E Nymann 《Journal of Number Theory》1975,7(4):406-412
Given a set S of positive integers let denote the number of k-tuples 〈m1, …, mk〉 for which and (m1, …, mk) = 1. Also let denote the probability that k integers, chosen at random from , are relatively prime. It is shown that if P = {p1, …, pr} is a finite set of primes and S = {m : (m, p1 … pr) = 1}, then if k ≥ 3 and where d(S) denotes the natural density of S. From this result it follows immediately that as n → ∞. This result generalizes an earlier result of the author's where and S is then the whole set of positive integers. It is also shown that if S = {p1x1 … prxr : xi = 0, 1, 2,…}, then as n → ∞. 相似文献
15.
Let An(ω) be the nxn matrix An(ω)=(aij with aij=ωij, 0?i,j?n?1, ωn=1. For n=rs we show =(Ar?Is)Tsr(Ir?As). When r and s are relatively prime this identity implies a wide class of identities of the form PAn(ω)QT=Ar(ωαs)?As(ωβr). The matrices Psr, Prs, P, and Q are permutation matrices corresponding to the “data shuffling” required in a computer implementation of the FFT, and Tsr is a diagonal matrix whose nonzeros are called “twiddle factors.” We establish these identities and discuss their algorithmic significance. 相似文献
16.
The probability measure of X = (x0,…, xr), where x0,…, xr are independent isotropic random points in n (1 ≤ r ≤ n ? 1) with absolutely continuous distributions is, for a certain class of distributions of X, expressed as a product measure involving as factors the joint probability measure of (ω, ?), the probability measure of p, and the probability measure of . Here ω is the r-subspace parallel to the r-flat η determined by X, ? is a unit vector in ω⊥ with ‘initial’ point at the origin [ω⊥ is the (n ? r)-subspace orthocomplementary to ω], p is the norm of the vector z from the origin to the orthogonal projection of the origin on η, and , where α is a scale factor determined by p. The probability measure for ω is the unique probability measure on the Grassmann manifold of r-subspaces in n invariant under the group of rotations in n, while the conditional probability measure of ? given ω is uniform on the boundary of the unit (n ? r)-ball in ω⊥ with centre at the origin. The decomposition allows the evaluation of the moments, for a suitable class of distributions of X, of the r-volume of the simplicial convex hull of {x0,…, xr} for 1 ≤ r ≤ n. 相似文献
17.
I Herbst 《Journal of Functional Analysis》1982,48(2):224-251
Let , with ? a normalized Gaussian. Suppose ≠ 0 and that has no eigenfunctions in L2(3N. If H1ψ = μψ with μ < infσess(H1), then (ψ, e?itHψ) decays exponentially at a rate governed by the positions of the resonances of H. 相似文献
18.
Adalbert Kerber 《Discrete Mathematics》1978,23(3):319-320
A matrix T=(tik) is introduced, the coefficients of which are defined by , where ai(x) denotes the s the number of i cycles in the element x of the symmetric group Sn. It is shown that these numbers are natural numbers, that they are easy to evaluate, and that they serve very well in order to formulate an infinite number of characterizations of multiply transitive subgroups of symmetric groups in terms of the cycle structure of their elements. 相似文献
19.
Rudolf Wegmann 《Journal of Mathematical Analysis and Applications》1976,56(1):113-132
For an n × n Hermitean matrix A with eigenvalues λ1, …, λn the eigenvalue-distribution is defined by · number {λi: λi ? x} for all real x. Let An for n = 1, 2, … be an n × n matrix, whose entries aik are for i, k = 1, …, n independent complex random variables on a probability space (Ω, , p) with the same distribution Fa. Suppose that all moments | a | k, k = 1, 2, … are finite, a=0 and | a | 2. Let with complex numbers θσ and finite products Pσ of factors A and (= Hermitean conjugate) be a function which assigns to each matrix A an Hermitean matrix M(A). The following limit theorem is proved: There exists a distribution function G0(x) = G1x) + G2(x), where G1 is a step function and G2 is absolutely continuous, such that with probability converges to G0(x) as n → ∞ for all continuity points x of G0. The density g of G2 vanishes outside a finite interval. There are only finitely many jumps of G1. Both, G1 and G2, can explicitly be expressed by means of a certain algebraic function f, which is determined by equations, which can easily be derived from the special form of M(A). This result is analogous to Wigner's semicircle theorem for symmetric random matrices (E. P. Wigner, Random matrices in physics, SIAM Review9 (1967), 1–23). The examples , , , r = 1, 2, …, are discussed in more detail. Some inequalities for random matrices are derived. It turns out that with probability 1 the sharpened form of Schur's inequality for the eigenvalues λi(n) of An holds. Consequently random matrices do not tend to be normal matrices for large n. 相似文献
20.
The usual Sobolev inequality in n, n ? 3, asserts that , with Sn being the sharp constant. This paper is concerned, instead, with functions restricted to bounded domains Ω ? n. Two kinds of inequalities are established: (i) If ? = 0 on ?Ω, then with and with . (ii) If ? ≠ 0 on ?Ω, then with . Some further results and open problems in this area are also presented. 相似文献