A Certain Class of Weighted Approximations for Integrable Functions and Applications

A certain class of weighted approximations, which extends the results of Masjed-Jamei [6] is introduced for integrable functions and some of upper bounds are obtained for the absolute value of the errors of such approximations in two L¹[a, b] and L^∞[a, b] spaces. As the main motivation for introducing the aforesaid class, it is shown that many new inequalities can be generated from the given error bounds. Some illustrative examples are presented in this sense. Moreover, by using the obtained error bounds, a nonstandard type of three-point weighted quadrature rules is introduced and its error bounds are computed.     

A note on the perturbation bound of the Drazin inverse

A perturbation bound for the Drazin inverse A^D with Ind(A+E)=1 has recently been developed. However, those upper bounds are not satisfied since it is not tight enough. In this paper, a sharper upper bounds for ||(A+E)^#−A^D|| with weaker conditions is derived. That new bound is also a generalization of a new general upper bound of the group inverse. We also derive a new expression of the Drazin inverse (A+E)^D with Ind(A+E)>1 and the corresponding upper bound of ||(A+E)^D−A^D|| in a special case. Numerical examples are given to illustrate the sharpness of the new bounds.     

Some refined bounds for the perturbation of the orthogonal projection and the generalized inverse

In this paper, we consider the perturbation of the orthogonal projection and the generalized inverse for an n × n matrix A and present some perturbation bounds for the orthogonal projections on the rang spaces of A and A^?, respectively. A combined bound for the orthogonal projection on the rang spaces of A and A^? is also given. The proposed bounds are sharper than the existing ones. From the combined bounds of the orthogonal projection on the rang spaces of A and A^?, we derived new perturbation bounds for the generalized inverse, which always improve the existing ones. The combined perturbation bound for the orthogonal projection and the generalized inverse is also given. Some numerical examples are given to show the advantage of the new bounds.     

A probabilistic approach to the first Dirichlet eigenvalue on non-compact Riemannian manifold

By using diffusion process with absorbing boundary, some lower bounds are obtained for the first Dirichlet eigenvalue of operator Δ+∇h on a non-compact complete Riemannian manifold. The resulting estimates contain McKean's estimate for ∇h=0. Moreover, the first Dirichlet eigenvalue for elliptic operators onR ^d and the first mixed eigenvalue are also studied. Some examples show that our estimates can be sharp even for ∇h≠0. Research supported in part by NFSC and the State Education Commission of China     

Improvement of the formal and numerical estimation of the constant in some Markov-Bernstein inequalities

Some methods of numerical analysis, used for obtaining estimations of zeros of polynomials, are studied again, more especially in the case where the zeros of these polynomials are all strictly positive, distinct and real. They give, in particular, formal lower and upper bounds for the smallest zero. Thanks to them, we produce new formal lower and upper bounds of the constant in Markov-Bernstein inequalities in L ² for the norm corresponding to the Laguerre and Gegenbauer inner products. In fact, since this constant is the inverse of the square root of the smallest zero of a polynomial, we give formal lower and upper bounds of this zero. Moreover, a new sufficient condition is given in order that a polynomial has some complex zeros. This revised version was published online in June 2006 with corrections to the Cover Date.     

On extremal problems on classes of functions defined by integral moduli of continuity

We obtain lower bounds for solutions of some extremal problems on classes of functions W ^rH₁^ω with integral modulus of continuity ω(t). Some of these bounds are regarded as exact. Dneprodzerzhinsk Technical University, Dneprodzerzhinsk. Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 49, No. 11. pp. 1499–1503, November, 1997.     

Semidiscrete Galerkin method for equations of motion arising in Kelvin‐Voigt model of viscoelastic fluid flow

Finite element Galerkin method is applied to equations of motion arising in the Kelvin–Voigt model of viscoelastic fluids for spatial discretization. Some new a priori bounds which reflect the exponential decay property are obtained for the exact solution. For optimal L^∞( L ²) estimate in the velocity, a new auxiliary operator which is based on a modification of the Stokes operator is introduced and analyzed. Finally, optimal error bounds for the velocity in L^∞( L ²) as well as in L^∞( H )‐norms and the pressure in L^∞(L²)‐norm are derived which again preserves the exponential decay property. © 2012 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2013     

On lower bounds on the size of designs in compact symmetric spaces of rank 1

The concept of t-designs in compact symmetric spaces of rank 1 is a generalization of the theory of classical t-designs. In this paper we obtain new lower bounds on the cardinality of designs in projective compact symmetric spaces of rank 1. With one exception our bounds are the first improvements of the classical bounds by more than one. We use the linear programming technique and follow the approach we have proposed for spherical codes and designs. Some examples are shown and compared with the classical bounds.     

Symmetric Weighing Matrices Constructed using Group Matrices

A weighing matrix of order n and weight m² is a square matrix M of order n with entries from {-1,0,+1} such that MM^T=m²I where I is the identity matrix of order n. If M is a group matrix constructed using a group of order n, M is called a group weighing matrix. Recently, group weighing matrices were studied intensively, especially when the groups are cyclic and abelian. In this paper, we study the abelian group weighing matrices that are symmetric, i.e.M^T=M. Some new examples are found. Also we obtain a few exponent bounds on abelian groups that admit symmetric group weighing matrices. In particular, we prove that there is no symmetric abelian group weighing matrices of order 2p^r and weight p² where p is a prime and p≥ 5.Communicated by: K.T. Arasu     

Bounds and perturbation bounds for the matrix exponential

Some new types of bounds and perturbation bounds, based on the Jordan normal form, for the matrix exponential are derived. These bounds are compared to known bounds, both theoretically and by numerical examples. Some recent results on the matrix exponential and the logarithmic norm are also included.     

Complete Systems of Lines on a Hermitian Surface over a Finite Field

The aim is to find the maximum size of a set of mutually ske lines on a nonsingular Hermitian surface in PG(3, q) for various values of q. For q = 9 such extremal sets are intricate combinatorial structures intimately connected ith hemisystems, subreguli, and commuting null polarities. It turns out they are also closely related to the classical quartic surface of Kummer. Some bounds and examples are also given in the general case.     

New degree bounds for polynomial threshold functions

A real multivariate polynomial p(x ₁, …, x _n ) is said to sign-represent a Boolean function f: {0,1} ⁿ →{−1,1} if the sign of p(x) equals f(x) for all inputs x∈{0,1} ⁿ . We give new upper and lower bounds on the degree of polynomials which sign-represent Boolean functions. Our upper bounds for Boolean formulas yield the first known subexponential time learning algorithms for formulas of superconstant depth. Our lower bounds for constant-depth circuits and intersections of halfspaces are the first new degree lower bounds since 1968, improving results of Minsky and Papert. The lower bounds are proved constructively; we give explicit dual solutions to the necessary linear programs.     

Matrices, moments and quadrature II; How to compute the norm of the error in iterative methods

In this paper, we study the numerical computation of the errors in linear systems when using iterative methods. This is done by using methods to obtain bounds or approximations of quadratic formsu ^T A ⁻¹ u whereA is a symmetric positive definite matrix andu is a given vector. Numerical examples are given for the Gauss-Seidel algorithm. Moreover, we show that using a formula for theA-norm of the error from Dahlquist, Golub and Nash [1978] very good bounds of the error can be computed almost for free during the iterations of the conjugate gradient method leading to a reliable stopping criterion. The work of the first author was partially supported by NSF Grant CCR-950539.     

Liouville–Green (WKB) asymptotics for almost-diagonal linear second-order matrix difference equations

A Liouville–Green (or WKB) asymptotic approximation theory is developed for a class of almost-diagonal (‘asymptotically diagonal’) linear second-order matrix difference equations. Rigorous and explicitly computable bounds for the error terms are obtained, the asymptotics being made with respect to both, the index and some parameter affecting the equation. The case of the associated inhomogeneous equations is also considered in detail. Some examples and a number of applications are presented for the purpose of illustration.     

Some bounds for the deviation and interpolation points in Chebyshev approximation

Some bounds are given for the deviation and interpolation points of a functionf based on bounds forf ⁽ⁿ⁺²⁾/f ⁽ⁿ⁺¹⁾. These bounds are in terms of the deviation and interpolation points ofe ^vx , –1 x 1, wherev is a parameter. The behavior of these points asv is also discussed.The results of this paper are contained in the second author's Master's thesis submitted to the University of Wyoming in May 1969.     

Some new error bounds for linear complementarity problems of H-matrices

Some new error bounds for linear complementarity problems of H-matrices are presented based on the preconditioned technique. Numerical examples show that these bounds are better than some existing ones.     

A simpler and tighter redundant Klee–Minty construction

By introducing redundant Klee–Minty examples, we have previously shown that the central path can be bent along the edges of the Klee–Minty cubes, thus having 2 ⁿ −2 sharp turns in dimension n. In those constructions the redundant hyperplanes were placed parallel with the facets active at the optimal solution. In this paper we present a simpler and more powerful construction, where the redundant constraints are parallel with the coordinate-planes. An important consequence of this new construction is that one of the sets of redundant hyperplanes is touching the feasible region, and N, the total number of the redundant hyperplanes is reduced by a factor of n ², further tightening the gap between iteration-complexity upper and lower bounds.     

Comparison of Exit Moment Spectra for Extrinsic Metric Balls

We prove explicit upper and lower bounds for the L ¹-moment spectra for the Brownian motion exit time from extrinsic metric balls of submanifolds P ^m in ambient Riemannian spaces N ⁿ . We assume that P and N both have controlled radial curvatures (mean curvature and sectional curvature, respectively) as viewed from a pole in N. The bounds for the exit moment spectra are given in terms of the corresponding spectra for geodesic metric balls in suitably warped product model spaces. The bounds are sharp in the sense that equalities are obtained in characteristic cases. As a corollary we also obtain new intrinsic comparison results for the exit time spectra for metric balls in the ambient manifolds N ⁿ themselves.     

A posteriori error estimates for a compressible Stokes system

A linearized compressible viscous Stokes system is considered. The a posteriori error estimates are defined and compared with the true error. They are shown to be globally upper and locally lower bounds for the true error of the finite element solution. Some numerical examples are given, showing an efficiency of the estimator. © 2004 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 20: 412–431, 2004.     

Bounding Ramsey numbers through large deviation inequalities

We develop a new approach for proving lower bounds for various Ramsey numbers, based on using large deviation inequalities. This approach enables us to obtain the bounds for the off-diagonal Ramsey numbers R(K^r, K^k), r ≤ k, that match the best known bounds, obtained through the local lemma. We discuss also the bounds for a related Ramsey-type problem and show, for example, that there exists a K⁴-free graph G on n vertices in which every cn^3/5 log^1/2 n vertices span a copy of K³. © 1995 John Wiley & Sons, Inc.