Richardson and Chebyshev Iterative Methods by Using G-frames
In this paper, we design some iterative schemes for solving operator equation $ Lu=f $, where $ L:Hrightarrow H $ is a bounded, invertible and self-adjoint operator on a separable Hilbert space $ H $. In this concern, Richardson and Chebyshev iterative methods are two outstanding as well as long-standing ones. They can be implemented in different ways
Hassan Jamali, Mohsen Kolahdouz
openaire +3 more sources
Using Chebyshev’s polynomials for solving Fredholm integral equations of the second kind
The main problem with the Newton method is the computation of the inverse of the first derivative of the operator involved at each iteration step. Thus, when we want to apply the Newton method directly to solve an integral equation, the existence of the
José Antonio Ezquerro +1 more
doaj +1 more source
Bulbs of Period Two in the Family of Chebyshev-Halley Iterative Methods on Quadratic Polynomials
The parameter space associated to the parametric family of Chebyshev-Halley on quadratic polynomials shows a dynamical richness worthy of study. This analysis has been initiated by the authors in previous works. Every value of the parameter belonging to the same connected component of the parameter space gives rise to similar dynamical behavior.
Alicia Cordero +2 more
openaire +6 more sources
ON SURFACE FRACTURE OF RAIL HEADS
Purpose. The formation of crack-like defects in rails of railway tracks is a serious problem for engineering practice because of the danger of creating emergency situations.
O. P. Datsyshyn +2 more
doaj +1 more source
Correction to "Eigenvectors of the successive over-relaxation process, and its combination with Chebyshev semi-iteration", by G. J. Tee [PDF]
openalex +1 more source
Robots are coming to help us in different harsh environments such as deep sea or coal mine. Waste landfill is the place like these with casualty risk, gas poisoning, and explosion hazards.
Peng Chen +4 more
doaj +1 more source
Polynomial Tensor Sketch for Element-wise Function of Low-Rank Matrix [PDF]
This paper studies how to sketch element-wise functions of low-rank matrices. Formally, given low-rank matrix A = [Aij] and scalar non-linear function f, we aim for finding an approximated low-rank representation of the (possibly high-rank) matrix [f(Aij)
Han, Insu, Avron, Haim, Shin, Jinwoo
core +4 more sources
The convergence of inexact Chebyshev and Richardson iterative methods for solving linear systems
Zur Lösung von \(Ax=b\) wird A gemäß \(A=M-N\) aufgespalten. Unter der Voraussetzung, daß \(M^{-1}A\) diagonalähnlich ist wird vorausgesetzt, daß das Spektrum von \(M^{-1}A\) in der rechten Halbebene liegt und sich in einer zur reellen Achse symmetrischen Ellipse befindet.
Golub, Gene H., Overton, Michael L.
openaire +3 more sources
Improved Chebyshev series ephemeris generation capability of GTDS [PDF]
An improved implementation of the Chebyshev ephemeris generation capability in the operational version of the Goddard Trajectory Determination System (GTDS) is described.
Jacintho, J. J., Liu, S. Y., Rogers, J.
core +1 more source
Consensus acceleration in multi-agent systems with the Chebyshev semi-iterative method
We consider the fundamental problem of reaching consensus in multiagent systems. To date, the consensus problem has been typically solved with decentralized algorithms based on graph Laplacians. However, the convergence of these algorithms is often too slow for many important multiagent applications, and thus they are increasingly being combined with ...
Cavalcante, R. L. G. +2 more
openaire +4 more sources

