Probability and Pathwise Order of Convergence of a Semidiscrete Scheme for the Stochastic Manakov Equation

2014 ◽  
Vol 52 (1) ◽  
pp. 533-553 ◽  
Author(s):  
Maxime Gazeau
Axioms ◽  
2021 ◽  
Vol 10 (2) ◽  
pp. 47
Author(s):  
A. Torres-Hernandez ◽  
F. Brambila-Paz ◽  
U. Iturrarán-Viveros ◽  
R. Caballero-Cruz

In the following paper, we present a way to accelerate the speed of convergence of the fractional Newton–Raphson (F N–R) method, which seems to have an order of convergence at least linearly for the case in which the order α of the derivative is different from one. A simplified way of constructing the Riemann–Liouville (R–L) fractional operators, fractional integral and fractional derivative is presented along with examples of its application on different functions. Furthermore, an introduction to Aitken’s method is made and it is explained why it has the ability to accelerate the convergence of the iterative methods, in order to finally present the results that were obtained when implementing Aitken’s method in the F N–R method, where it is shown that F N–R with Aitken’s method converges faster than the simple F N–R.


Mathematics ◽  
2021 ◽  
Vol 9 (11) ◽  
pp. 1242
Author(s):  
Ramandeep Behl ◽  
Sonia Bhalla ◽  
Eulalia Martínez ◽  
Majed Aali Alsulami

There is no doubt that the fourth-order King’s family is one of the important ones among its counterparts. However, it has two major problems: the first one is the calculation of the first-order derivative; secondly, it has a linear order of convergence in the case of multiple roots. In order to improve these complications, we suggested a new King’s family of iterative methods. The main features of our scheme are the optimal convergence order, being free from derivatives, and working for multiple roots (m≥2). In addition, we proposed a main theorem that illustrated the fourth order of convergence. It also satisfied the optimal Kung–Traub conjecture of iterative methods without memory. We compared our scheme with the latest iterative methods of the same order of convergence on several real-life problems. In accordance with the computational results, we concluded that our method showed superior behavior compared to the existing methods.


2021 ◽  
pp. 1-10
Author(s):  
Nejmeddine Chorfi

The aim of this work is to highlight that the adaptivity of the time step when combined with the adaptivity of the spectral mesh is optimal for a semi-linear parabolic equation discretized by an implicit Euler scheme in time and spectral elements method in space. The numerical results confirm the optimality of the order of convergence. The later is similar to the order of the error indicators.


2000 ◽  
Vol 99 (3) ◽  
pp. 1234-1243
Author(s):  
A. Basalykas ◽  
O. Yanushkevichiene

1999 ◽  
Vol 10 (1) ◽  
pp. 1-25 ◽  
Author(s):  
Q. DU ◽  
J. REMSKI

When a thin layer of normal (non-superconducting) material is placed between layers of superconducting material, a superconducting-normal-superconducting junction is formed. This paper considers a model for the junction based on the Ginzburg–Landau equations as the thickness of the normal layer tends to zero. The model is first derived formally by averaging the unknown variables in the normal layer. Rigorous convergence is then established, as well as an estimate for the order of convergence. Numerical results are shown for one-dimensional junctions.


2014 ◽  
Vol 2014 ◽  
pp. 1-6 ◽  
Author(s):  
Tahereh Eftekhari

Based on iterative methods without memory of eighth-order convergence proposed by Thukral (2012), some iterative methods with memory and high efficiency index are presented. We show that the order of convergence is increased without any additional function evaluations. Numerical comparisons are made to show the performance of the presented methods.


Sign in / Sign up

Export Citation Format

Share Document