Related papers: On "Upper error bounds for quadrature formulas on …
This paper reinforces numerical iterated integration developed by Muhammad--Mori in the following two points: 1) the approximation formula is modified so that it can achieve a better convergence rate in more general cases, and 2) explicit…
The numerical integration of an analytical function $f(x)$ using a finite set of equidistant points can be performed by quadrature formulas like the Newton-Cotes. Unlike Gaussian quadrature formulas however, higher-order Newton-Cotes…
In recent years, the success of deep learning has inspired many researchers to study the optimization of general smooth non-convex functions. However, recent works have established pessimistic worst-case complexities for this class…
Motivated by a recent work of Ache and Chang concerning the sharp Sobolev trace inequality and Lebedev-Milin inequalities of order four on the Euclidean unit ball, we derive such inequalities on the Euclidean unit ball for higher order…
Approximation theory plays a central role in numerical analysis, undergoing continuous evolution through a spectrum of methodologies. Notably, Lebesgue, Weierstrass, Fourier, and Chebyshev approximations stand out among these methods.…
State-of-the-art methods in convex and non-convex optimization employ higher-order derivative information, either implicitly or explicitly. We explore the limitations of higher-order optimization and prove that even for convex optimization,…
The paper deals with an extremal problem for bounded harmonic functions in the unit ball of $\mathbf{R}^4$. We solve the generalized Khavinson problem in $\mathbf{R}^4$. This precise problem was formulated by G. Kresin and V. Maz'ya for…
It is disproved the Tokareva's conjecture that any balanced boolean function of appropriate degree is a derivative of some bent function. This result is based on new upper bounds for the numbers of bent and plateaued functions.
We present a new fractional Taylor formula for singular functions whose Caputo fractional derivatives are of bounded variation. It bridges and ``interpolates" the usual Taylor formulas with two consecutive integer orders. This enables us to…
We revisit the general framework introduced by Fazylab et al. (SIAM J. Optim. 28, 2018) to construct Lyapunov functions for optimization algorithms in discrete and continuous time. For smooth, strongly convex objective functions, we relax…
We derive the optimal input states and the optimal quantum measurements for estimating the unitary action of a given symmetry group, showing how the optimal performance is obtained with a suitable use of entanglement. Optimality is defined…
The paper establishes the Krein and Koplienko trace formulas for multivariable operator functions on symmetrically normed ideals of bounded operators. Results are proved for self-adjoint and maximal dissipative operators. They cover both…
Formulae for the value of a harmonic function at the center of a rectangle are found that involve boundary integrals. The central value of a harmonic function is shown to be well approximated by the mean value of the function on the…
Minimizing loss functions is central to machine-learning training. Although first-order methods dominate practical applications, higher-order techniques such as Newton's method can deliver greater accuracy and faster convergence, yet are…
We prove Euler-Lagrange fractional equations and sufficient optimality conditions for problems of the calculus of variations with functionals containing both fractional derivatives and fractional integrals in the sense of Riemann-Liouville.
We give a definition of integration by quadratures of first-order ordinary differential equations, and recover a little known result by Maximovic which states that a first-order ordinary differential equation can be integrated by…
We prove that the optimal error of recovery in the $L_2$ norm of functions from a class $\bF$ can be bounded above by the value of the Kolmogorov width of $\bF$ in the uniform norm. We demonstrate on a number of examples of $\bF$ from…
In this note, we present an eighth-order derivative-free family of iterative methods for nonlinear equations. The proposed family shows optimal eight-order of convergence in the sense of the Kung and Traub conjecture \cite{5} and is based…
The problem of distributed function computation is studied, where functions to be computed is not necessarily symbol-wise. A new method to derive a converse bound for distributed computing is proposed; from the structure of functions to be…
This note considers the momentum method by Polyak and the accelerated gradient method by Nesterov, both without line search but with fixed step length applied to strictly convex quadratic functions assuming that exact gradients are used and…