High-accuracy Tridiagonal Finite Difference Approximations for Non-linear Two-point Boundary Value Problems

We discuss the construction of finite difference approximationsfor the non-linear two-point boundary value problem: y" = f(x,y), y(a)=A, y(b)=B. In the case of linear differential equations,the resulting finite difference schemes lead to tridiagonallinear systems. Approximations of orders higher than four involvederivatives of f. While several approximations of a particularorder are possible, we obtain the "simplest" of these approximationsleading to two high-accuracy methods of orders six and eight.These two methods are described and their convergence is established;numerical results are given to illustrate the order of accuracyachieved.     

The Cardinality of Sets of k -Independent Vectors over Finite Fields

A set of vectors is k-independent if all its subsets with no more than k elements are linearly independent. We obtain a result concerning the maximal possible cardinality Ind _q (n, k) of a k-independent set of vectors in the n-dimensional vector space F _q ⁿ over the finite field F _q of order q. Namely, we give a necessary and sufficient condition for Ind _q (n, k) = n + 1. We conclude with some pertinent remarks re applications of our results to codes, graphs and hypercubes.     

多套函数有限元逼近与拟协调板元

继[1]、[2]的工作,本文根据多套函数有限元逼近的思想,建立了唐立民等人[3]、[4]提出的拟协调板元的数学基础.     

Complementary Sets of Finite Sets

Subsets 𝒜, 𝒮 of an additive group G are complementary if 𝒜 + 𝒮 = G. When 𝒜 is of finite cardinality ∣𝒜∣, and G is ℤ or ℝ, we give sufficient conditions for the existence of a complementary set 𝒮 with “density” not much larger than 1/∣𝒜∣. Supported in part by NSF DMS-0074531. Received February 14, 2002; in revised form July 18, 2002 RID="a" ID="a" Dedicated to Professor Edmund Hlawka on the occasion of his 85th birthday     

Complementary Sets of Finite Sets

Subsets 𝒜, 𝒮 of an additive group G are complementary if 𝒜 + 𝒮 = G. When 𝒜 is of finite cardinality ∣𝒜∣, and G is ℤ or ℝ, we give sufficient conditions for the existence of a complementary set 𝒮 with “density” not much larger than 1/∣𝒜∣.     

Finite Sets as Complements of Finite Unions of Convex Sets

Suppose S?? ^d is a set of (finite) cardinality n, whose complement can be written as the union of k convex sets. It is perhaps intuitively appealing that when n is large k must also be large. This is true, as is shown here. First the case in which the convex sets must also be open is considered, and in this case a family of examples yields an upper bound, while a simple application of a theorem of Björner and Kalai yields a lower bound. Much cruder estimates are then obtained when the openness restriction is dropped. For a given set S the problem of determining the smallest number of convex sets whose union is ? ^d ?S is shown to be equivalent to the problem of finding the chromatic number of a certain (infinite) hypergraph ? _S . We consider the graph \(\mathcal {G}_{S}\) whose edges are the 2-element edges of ? _S , and we show that, when d=2, for any sufficiently large set S, the chromatic number of \(\mathcal{G}_{S}\) will be large, even though there exist arbitrarily large finite sets S for which \(\mathcal{G}_{S}\) does not contain large cliques.     

A Method for Calculating Best Non-linear Chebyshev Approximations

A method for solving continuous non-linear Chebyshev approximationproblems is presented and illustrated by examples.     

Translating Finite Sets into Convex Sets

Let X be a reflexive Banach space, and let C X be a closed,convex and bounded set with empty interior. Then, for every > 0, there is a nonempty finite set F X with an arbitrarilysmall diameter, such that C contains at most .|F| points ofany translation of F. As a corollary, a separable Banach spaceX is reflexive if and only if every closed convex subset ofX with empty interior is Haar null. 2000 Mathematics SubjectClassification 46B20 (primary), 28C20 (secondary).     

Non-linear Stochastic Finite Element

This paper investigates the uncertainty of physically non-linear problems by modeling the elastic random material parameters as stochastic fields. For its stochastic discretization a polynomial chaos (PC) is used to expand the coefficients into deterministic and stochastic parts. Then, from experimental data for an adhesive material the distribution of the random variables, i.e. Young's modulus E(θ), the static yield point Y₀ and the nonlinear hardening parameters q and b, are known. In the numerical example the distribution of the stresses obtained by the PC based SFEM and Monte Carlo simulation is compared. (© 2015 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Self-Concordant Barriers for Convex Approximations of Structured Convex Sets

We show how to approximate the feasible region of structured convex optimization problems by a family of convex sets with explicitly given and efficient (if the accuracy of the approximation is moderate) self-concordant barriers. This approach extends the reach of the modern theory of interior-point methods, and lays the foundation for new ways to treat structured convex optimization problems with a very large number of constraints. Moreover, our approach provides a strong connection from the theory of self-concordant barriers to the combinatorial optimization literature on solving packing and covering problems.     

Characterizations of Sets of Finite Perimeter Using Heat Kernels in Metric Spaces

The overarching goal of this paper is to link the notion of sets of finite perimeter (a concept associated with N^1,1-spaces) and the theory of heat semigroups (a concept related to N^1,2-spaces) in the setting of metric measure spaces whose measure is doubling and supports a 1-Poincaré inequality. We prove a characterization of sets of finite perimeter in terms of a short time behavior of the heat semigroup in such metric spaces. We also give a new characterization of BV functions in terms of a near-diagonal energy in this general setting.     

On Finite Difference Sets

We establish a lower estimate of the cardinality of finite difference sets in the three dimensional Euclidean space R3 by showing that ¦A - A¦ 4.5 ¦A¦ -9 for every three dimensional finite set A. In addition, we describe the structure of two and three dimensional sets with the smallest cardinality of the difference set.     

Factorised Preconditionings of Successive Approximations in Finite Precision

This paper examines the possibility of using the method of successive approximations for the approximate solution of a large system of linear equations with a dense, noncontraction, and ill-conditioned matrix. Using Krasnosel'skii's method of transformation of linear operator equations and functional calculi, the procedure of factorised preconditionings of successive approximations is developed and analysed in the finite precision arithmetic. Numerical results of computational experiments are presented to demonstrate the practicability of the proposed approach.This revised version was published online in October 2005 with corrections to the Cover Date.     

I m -Quasi Upward Sets,with Their Best Approximations

The main purpose of this article is to introduce particular subsets of R ^I , which are not necessarily convex, and we call them I _m -quasi upward, or I _m -quasi downward. We show that these sets can be translated to downward or upward sets. We introduce the connection of these sets with downward and upward subsets of R ^I , and discuss the best approximation of these sets. Also we introduce embedded I _m -quasi upward and embedded I _m -quasi downward subsets of a normed space X.     

Grasping Infinity by Finite Sets

We show that the existence of an infinite set can be reduced to the existence of finite sets “as big as we will”, provided that a multivalued extension of the relation of equipotence is admitted. In accordance, we modelize the notion of infinite set by a fuzzy subset representing the class of (finite) wide sets.     

The Cardinality of Sets of <Emphasis Type="Italic">k</Emphasis>-Independent Vectors over Finite Fields

A set of vectors is k-independent if all its subsets with no more than k elements are linearly independent. We obtain a result concerning the maximal possible cardinality Ind _q (n, k) of a k-independent set of vectors in the n-dimensional vector space F _q ⁿ over the finite field F _q of order q. Namely, we give a necessary and sufficient condition for Ind _q (n, k) = n + 1. We conclude with some pertinent remarks re applications of our results to codes, graphs and hypercubes. Supported, in part by grants EP/C000285, NSF-DMS-0439734 and NSF-DMS-0555839. S. B. Damelin thanks the Institute for Mathematics and Applications for their hospitality.     

A Review of Finite Approximations,Archimedean and Non-Archimedean

We give a review of finite approximations of quantum systems, both in an Archimedean and a non-Archimedean setting. Proofs will generally be omitted. In the Appendix we present some numerical results.