Related papers: Error Bounds for the Numerical Integration of Func…
Numerical solutions of differential equations are usually not smooth functions. However, they should resemble the smoothness of the corresponding real solutions in one way or another. In two of our recent papers, a kind of spacial…
This paper studies explicit and theoretical bounds for several interesting quantities in number theory, conditionally on the Generalized Riemann Hypothesis. Specifically, we improve the existing explicit bounds for the least quadratic…
We explore the use of correlation with simple functions to get lower bounds for arithmetic quantities. In particular, we apply this idea to the power moments of the error term when counting visible lattice points in large spheres.
Rigid, hard and soft problems and results in arithmetic geometry are presented. "Soft" and "hard" in our paper are limited to the framework of solutions of quadratic forms over rings of integers of local and global fields, the…
We improve the $L^p(\mathbb{R}^n)$ bounds on Stein's square function to the best-known range of the Fourier restriction problem when $n\geq4$. Applications including certain local smoothing estimates are also discussed.
The article is devoted to the investigation of smoothness of functions $f(x_1,...,x_m)$ of variables $x_1,...,x_m$ in infinite fields with non-trivial multiplicative ultra-norms, where $m\ge 2$. Theorems about classes of smoothness $C^n$ or…
Classical trust region methods were designed to solve problems in which function and gradient information are exact. This paper considers the case when there are bounded errors (or noise) in the above computations and proposes a simple…
We study the arithmetic (real) function f=g*1, with g "essentially bounded" and supported over the integers of [1,Q]. In particular, we obtain non-trivial bounds, through f "correlations", for the "Selberg integral" and the "symmetry…
The implementation of the finite element method for linear elliptic equations requires to assemble the stiffness matrix and the load vector. In general, the entries of this matrix-vector system are not known explicitly but need to be…
Using a recent method developed by Mahatab, we obtain an improved $\Omega$-bound for the error term arising in lattice counting problem of bodies of revolution in $\mathbb R^3$ around a coordinate axis and having smooth boundary with…
In the first part of this study, a convex-constrained penalized formulation was studied for a class of constant modulus (CM) problems. In particular, the error bound techniques were shown to play a vital role in providing exact penalization…
We present a family of high order trapezoidal rule-based quadratures for a class of singular integrals, where the integrand has a point singularity. The singular part of the integrand is expanded in a Taylor series involving terms of…
The methods commonly used for numerical differentiation, such as the "center-difference formula" and "four-points formula" are unusable in simulations or real-time data analysis because they require knowledge of the future. In Bard'11, an…
The seminal result of Johnson and Lindenstrauss on random embeddings has been intensively studied in applied and theoretical computer science. Despite that vast body of literature, we still lack of complete understanding of statistical…
We present a systematic computational framework for generating positive quadrature rules in multiple dimensions on general geometries. A direct moment-matching formulation that enforces exact integration on polynomial subspaces yields…
We review recent results on analytical properties (monotonicity and bounds) for ratios of contiguous functions of hypergeometric type. The cases of parabolic cylinder functions and modified Bessel functions have been discussed with…
Seiberg-Witten theory leads to a delicate interplay between Riemannian geometry and smooth topology in dimension four. In particular, the scalar curvature of any metric must satisfy certain non-trivial estimates if the manifold in question…
A general lower bound is developed for the minimax risk when estimating an arbitrary functional. The bound is based on testing two composite hypotheses and is shown to be effective in estimating the nonsmooth functional…
We give a criterion for bounding the homological finiteness length of certain HF-groups. This is used in two distinct contexts. Firstly, the homological finiteness length of a non-uniform lattice on a locally finite n-dimensional…
We discuss notions of Gauss curvature and mean curvature for polyhedral surfaces. The discretizations are guided by the principle of preserving integral relations for curvatures, like the Gauss/Bonnet theorem and the mean-curvature force…