The Chebyshev Polynomial Method of Iteration [PDF]
, 1967 In this report the practical use of he Chebyshev polynomial method of iteration is discusses. The convergence behavior of the Chebyshev method is given and a numerical strategy is described which can be used to estimate the required acceleration parameters. Numerical examples are discussed.
L. A. Hageman
openalex +4 more sources
ChASE: Chebyshev Accelerated Subspace iteration Eigensolver for sequences of Hermitian eigenvalue problems [PDF]
ACM Transactions on Mathematical Software, 2018 Solving dense Hermitian eigenproblems arranged in a sequence with direct solvers fails to take advantage of those spectral properties which are pertinent to the entire sequence, and not just to the single problem.
Jan Winkelmann +2 more
openalex +2 more sources
Modified Chebyshev‐Picard Iteration Methods for Station‐Keeping of Translunar Halo Orbits [PDF]
, 2012 The halo orbits around the Earth-Moon libration point provide a great candidate orbit for a lunar communication satellite, where the satellite remains above the horizon on the far side of the Moon being visible from the Earth at all times.
Xiaoli Bai, John L. Junkins
openalex +2 more sources
Applied SciencesMassive multiple input–multiple output (M-MIMO) is a promising and pivotal technology in contemporary wireless communication systems that can effectively enhance link reliability and data throughput, especially in uplink scenarios. Even so, the receiving
Yung-Ping Tu, Guan-Hong Liu
doaj +2 more sources
Fast matrix inversion methods based on Chebyshev and Newton iterations for zero forcing precoding in massive MIMO systems [PDF]
EURASIP Journal on Wireless Communications and Networking, 2020 In massive MIMO (mMIMO) systems, large matrix inversion is a challenging problem due to the huge volume of users and antennas. Neumann series (NS) and successive over relaxation (SOR) are two typical methods that solve such a problem in linear precoding.
Sherief Hashima, Osamu Muta
doaj +2 more sources
Chebyshev acceleration of iterative refinement
, 2011 We analyse how variants of the Chebyshev algorithm can be used to accelerate the iterative refinement procedure without loss of numerical stability and at a computational cost at each iteration that is only marginally greater than that of iterative refinement.
Arioli, Mario, J. A. Scott
openalex +2 more sources
Multisegment Scheme Applications to Modified Chebyshev Picard Iteration Method for Highly Elliptical Orbits [PDF]
, 2015 A modified Chebyshev Picard iteration method is proposed for solving orbit propagation initial/boundary value problems. Cosine sampling techniques, known as Chebyshev-Gauss-Lobatto (CGL) nodes, are used to reduce Runge’s phenomenon that plagues many ...
Donghoon Kim +2 more
openalex +2 more sources
Chebyshev iteration for the problem with nonlocal boundary condition
Lietuvos Matematikos Rinkinys, 2004 We considered Poisson differential equation with Dirichlet boundary conditions and one nonlocal boundary condition. Finite-difference scheme was investigated for this problem.
Mifodijus Sapagovas +2 more
doaj +4 more sources
Deep Unfolding of Chebyshev Accelerated Iterative method for Massive MIMO Detection [PDF]
IEEE Access, 2023 The zero-forcing (ZF) and minimum mean square error (MMSE) based detectors can approach optimal performance in the uplink of massive multiple-input multiple-output (MIMO) systems. However, they require inverting a matrix whose complexity is cubic in relation to the matrix dimension.
Salah Berra +3 more
openalex +4 more sources
A numerical approach to fractional Volterra–Fredholm integro-differential problems using shifted Chebyshev spectral collocation [PDF]
Scientific ReportsThis study presents an innovative numerical framework for addressing initial value problems (IVPs) in linear fractional Volterra–Fredholm integro-differential equations (FVFIDEs).
Maha M. Hamood +2 more
doaj +2 more sources