Results 1 to 10 of about 770,509 (245)
A Low-Complexity Massive MIMO Precoding Algorithm Based on Chebyshev Iteration
IEEE Access, 2017 Precoding algorithm is used to transmit signals effectively and to reduce the interferences from other user terminals in the massive multiple-input-multiple-output (MIMO) systems. In order to decrease the computational complexity of the precoding matrix,
Chi Zhang +5 more
doaj +3 more sources
The Chebyshev iteration revisited [PDF]
Parallel Computing, 2002 SAM Research Report, 2000 ...
Martin H. Gutknecht, Stefan Röllin
semanticscholar +5 more sources
Some Results on Iterative Proximal Convergence and Chebyshev Center [PDF]
Journal of Function Spaces, 2021 In this paper, we prove a sufficient condition that every nonempty closed convex bounded pair M,N in a reflexive Banach space B satisfying Opial’s condition has proximal normal structure.
Laishram Shanjit +3 more
doaj +4 more sources
AIMS Mathematics, 2023 A new eighth-order Chebyshev-Halley type iteration is proposed for solving nonlinear equations and matrix sign function. Basins of attraction show that several special cases of the new method are globally convergent.
Xiaofeng Wang , Ying Cao
doaj +3 more sources
Chebyshev iteration methods for integral equations of the second kind. [PDF]
Mathematics of Computation, 1970 In this paper the numerical solution of Fredholm integral equations of the second kind using an iterative method in which the solution is represented by a Chebyshev series is discussed. A description of a technique of Chebyshev reduction of the norm of the kernel for use in cases when the iterations converge slowly or not at all is also given. Finally,
T. W. Sag
semanticscholar +3 more sources
State Transition Matrix for Perturbed Orbital Motion Using Modified Chebyshev Picard Iteration [PDF]
The Journal of the astronautical sciences, 2015 The Modified Chebyshev Picard Iteration (MCPI) method has recently proven to be highly efficient for a given accuracy compared to several commonly adopted numerical integration methods, as a means to solve for perturbed orbital motion.
Julie L. Read +4 more
semanticscholar +3 more sources
Preconditioned Nonlinear Iterations for Overlapping Chebyshev Discretizations with Independent Grids [PDF]
SIAM Journal on Scientific Computing, 2020 The additive Schwarz method is usually presented as a preconditioner for a PDE linearization based on overlapping subsets of nodes from a global discretization. It has previously been shown how to apply Schwarz preconditioning to a nonlinear problem.
Kevin W. Aiton, Tobin A. Driscoll
+7 more sources
Chebyshev acceleration of iterative refinement [PDF]
Numerical Algorithms, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
M. Arioli, JA Scott
openalex +3 more sources
ON THE STABILITY OF THE CHEBYSHEV ITERATIVE METHOD
DYNAMICS OF SYSTEMS, MECHANISMS AND MACHINES, 2023 Numerical solution of the systems of linear equations (linear system), especially in case of nonstationary problems, takes a significant part of computer time. Normally, for solving linear system the applied program packages use either Chebyshev iterative method (wave linear problems etc.), which requires setting the optimal parameter, or gradient ...
Y. N. Zakharov, А. И. Зимин
openalex +2 more sources
A Higher Order Chebyshev-Halley-Type Family of Iterative Methods for Multiple Roots [PDF]
Mathematics, 2019 The aim of this paper is to introduce new high order iterative methods for multiple roots of the nonlinear scalar equation; this is a demanding task in the area of computational mathematics and numerical analysis. Specifically, we present a new Chebyshev&
Ramandeep Behl +3 more
doaj +2 more sources