ImprovedSCF convergence acceleration

1982 ◽  
Vol 3 (4) ◽  
pp. 556-560 ◽  
Author(s):  
P. Pulay
2001 ◽  
Vol 3 (1) ◽  
pp. 6
Author(s):  
Mikhail D. Mikhailov ◽  
Renato M. Cotta

1993 ◽  
Vol 179 (2) ◽  
pp. 111-115 ◽  
Author(s):  
V. Papageorgiou ◽  
B. Grammaticos ◽  
A. Ramani

2013 ◽  
Vol 2013 ◽  
pp. 1-13 ◽  
Author(s):  
Arnak Poghosyan

We consider the convergence acceleration of the Krylov-Lanczos interpolation by rational correction functions and investigate convergence of the resultant parametric rational-trigonometric-polynomial interpolation. Exact constants of asymptotic errors are obtained in the regions away from discontinuities, and fast convergence of the rational-trigonometric-polynomial interpolation compared to the Krylov-Lanczos interpolation is observed. Results of numerical experiments confirm theoretical estimates and show how the parameters of the interpolations can be determined in practice.


2020 ◽  
Vol 62 (3) ◽  
pp. 30-38
Author(s):  
Achilleas Marinakis ◽  
Panagiotis J. Papakanellos ◽  
George Fikioris

1995 ◽  
Vol 38 (3) ◽  
pp. 495-510 ◽  
Author(s):  
C. Brezinski ◽  
A. Salam

Sequence transformations are extrapolation methods. They are used for the purpose of convergence acceleration. In the scalar case, such algorithms can be obtained by two different approaches which are equivalent. The first one is an elimination approach based on the solution of a system of linear equations and it makes use of determinants. The second approach is based on the notion of annihilation difference operators. In this paper, these two approaches are generalized to the matrix and the vector cases.


Sign in / Sign up

Export Citation Format

Share Document