Related papers: Efficient third-order iterative algorithms for com…
A fast algorithm (linear in the degrees of freedom) for the solution of linear variable-coefficient rational-order fractional integral and differential equations is described. The approach is related to the ultraspherical method for…
This paper studies proofs of strong convergence of various iterative algorithms for computing the unique zeros of set-valued accretive operators that also satisfy some weak form of uniform accretivity at zero. More precisely, we extract…
Second-order methods, which utilize gradients as well as Hessians to optimize a given function, are of major importance in mathematical optimization. In this work, we prove tight bounds on the oracle complexity of such methods for smooth…
In this paper we consider a class of fourth order nonlinear integro-differential equations with Navier boundary conditions. By the reduction of the problem to operator equation we establish the existence and uniqueness of solution and…
It is well known that using high-order numerical algorithms to solve fractional differential equations leads to almost the same computational cost with low-order ones but the accuracy (or convergence order) is greatly improved, due to the…
We are presenting a method for computing the Fourier coefficients of a given polynomial regression by using the trapezoidal rule for numerical integration. As function basis we use the orthogonal Legendre polynomials. The results are…
We study the problem of zero-order optimization of a strongly convex function. The goal is to find the minimizer of the function by a sequential exploration of its values, under measurement noise. We study the impact of higher order…
This paper presents a means with time complexity of at worst O(n^3) to compute the discrete logarithm on cyclic finite groups of integers modulo p. The algorithm makes use of reduction of the problem to that of finding the concurrent zeros…
Oscillatory second order linear ordinary differential equations arise in many scientific calculations. Because the running times of standard solvers increase linearly with frequency when they are applied to such problems, a variety of…
This work proposes and analyzes a fully discrete numerical scheme for solving the Landau-Lifshitz-Gilbert (LLG) equation, which achieves fourth-order spatial accuracy and third-order temporal accuracy.Spatially, fourth-order accuracy is…
In this paper, we propose new linearly convergent second-order methods for minimizing convex quartic polynomials. This framework is applied for designing optimization schemes, which can solve general convex problems satisfying a new…
An algorithm for computing eigenvalues and eigenfunctions of the angular spheroidal wave equation, based on a known but scarcely used method, is developed. By requiring the regularity of the wave function, represented by its series…
The Riccati equation method is used to establish some global solvability criteria for some classes of second order nonlinear ordinary differential equations. Two oscillation theorems are proved. The results are applied to the Emden - Fowler…
The main subject of this paper is the study of analytic second order linear partial differential equations. We aim to solve the classical equations and some more, in the real or complex analytical case. This is done by introducing methods…
In this paper, an easy-to-implement and computationally effective numerical method based on the new orthogonal hybrid functions is developed to solve system of fractional order differential equations numerically. The new orthogonal hybrid…
The primary focus of this paper is on designing an inexact first-order algorithm for solving constrained nonlinear optimization problems. By controlling the inexactness of the subproblem solution, we can significantly reduce the…
The paper proposes and develops new globally convergent algorithms of the generalized damped Newton type for solving important classes of nonsmooth optimization problems. These algorithms are based on the theory and calculations of…
The maximization of the (generalized) Rayleigh quotient is a central problem in numerical linear algebra. Conventional algorithms for its computation typically rely on matrix-adjoint products, making them sensitive to errors arising from…
In this paper we present an inexact zeroth-order method suitable for the solution nonsmooth and nonconvex stochastic composite optimization problems, in which the objective is split into a real-valued Lipschitz continuous stochastic…
In this paper, we propose a new trigonometric interpolation algorithm and establish relevant convergent properties. The method adjusts an existing trigonometric interpolation algorithm such that it can better leverage Fast Fourier Transform…