Related papers: Efficient third-order iterative algorithms for com…
We introduce a new numerical method, based on Bernoulli polynomials, for solving multiterm variable-order fractional differential equations. The variable-order fractional derivative was considered in the Caputo sense, while the…
We present some formulas for the computation of the zeros of the integral-degree associated Legendre functions with respect to the order.
In this paper, we propose a first second-order scheme based on arbitrary non-Euclidean norms, incorporated by Bregman distances. They are introduced directly in the Newton iterate with regularization parameter proportional to the square…
The work in this paper is four-fold. Firstly, we introduce an alternative approach to solve fractional ordinary differential equations as an expected value of a random time process. Using the latter, we present an interesting numerical…
The object of the present work is to present the new classes of third-order and fourth-order iterative methods for solving nonlinear equations. Our third-order method includes methods of Weerakoon \cite{Weerakoon}, Homeier \cite{Homeier2},…
In this paper, using the similarity method, we construct particular solutions with singularities for degenerate high-order equations. The considered equations have singularities of the first and second kind. Particular solutions are…
We present numerical solutions for differential equations by expanding the unknown function in terms of Chebyshev polynomials and solving a system of linear equations directly for the values of the function at the extrema (or zeros) of the…
This paper addresses black-box smooth optimization problems, where the objective and constraint functions are not explicitly known but can be queried. The main goal of this work is to generate a sequence of feasible points converging…
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…
There exists a huge number of numerical methods that iteratively construct approximations to the solution $y(x)$ of an ordinary differential equation (ODE) $y'(x)=f(x,y)$ starting from an initial value $y_0=y(x_0)$ and using a finite…
We discuss a recursive family of iterative methods for the numerical approximation of roots of nonlinear functions in one variable. These methods are based on Newton-Cotes closed quadrature rules. We prove that when a quadrature rule with…
In this paper we develop a systematic reduction procedure for determining intermediate integrals of second order hyperbolic equations so that exact solutions of the second order PDEs under interest can be obtained by solving first order…
This paper proposes a novel iterative algorithm to compute the stabilizing solution of regime-switching stochastic game-theoretic Riccati differential equations with periodic coefficients. The method decomposes the original complex…
The Riccati equation method is used to establish an oscillatory and a non oscillatory criteria for nonhomogeneous linear systems of two first-order ordinary differential equations. It is shown that the obtained oscillatory criterion is a…
We present a novel numerical method, called {\tt Jacobi-predictor-corrector approach}, for the numerical solution of fractional ordinary differential equations based on the polynomial interpolation and the Gauss-Lobatto quadrature w.r.t.…
We consider second order explicit and implicit two-step time-discrete schemes for wave-type equations. We derive optimal order aposteriori estimates controlling the time discretization error. Our analysis, has been motivated by the need to…
The numerical evaluation of statistics plays a crucial role in statistical physics and its applied fields. It is possible to evaluate the statistics for a stochastic differential equation with Gaussian white noise via the corresponding…
A fast and weakly stable method for computing the zeros of a particular class of hypergeometric polynomials is presented. The studied hypergeometric polynomials satisfy a higher order differential equation and generalize Laguerre…
We develop the Akhiezer iteration, a generalization of the classical Chebyshev iteration, for the inner product-free, iterative solution of indefinite linear systems using orthogonal polynomials for measures supported on multiple, disjoint…
Recently Ahmadi et al. (2021) and Tagliaferro (2022) proposed some iterative methods for the numerical solution of linear systems which, under the classical hypothesis of strict diagonal dominance, typically converge faster than the Jacobi…