Skip to search formSkip to main contentSkip to account menu

Chebyshev iteration

In numerical linear algebra, the Chebyshev iteration is aniterative method for determining the solutions of a system of linear equations. The method… 
Wikipedia (opens in a new tab)

Related topics

Related topics

11 relations
Biconjugate gradient methodConjugate gradient methodGauss–Seidel methodGeneralized minimal residual method

Broader (1)

Numerical linear algebra

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2020
2020
Fast matrix inversion methods based on Chebyshev and Newton iterations for zero forcing precoding in massive MIMO systems
In massive MIMO (mMIMO) systems, large matrix inversion is a challenging problem due to the huge volume of users and antennas… 
2017
2017
A Low-Complexity Massive MIMO Precoding Algorithm Based on Chebyshev Iteration
Precoding algorithm is used to transmit signals effectively and to reduce the interferences from other user terminals in the… 
2017
2017
Modeling Addressing Over-Solving in Multiphysics Codes with Nested Solvers
Examples of multiphysics problems in the field of nuclear engineering are numerous. For light water reactors the coupling of… 
2012
2012
Iterative Methods and Partitioning Techniques for Large Sparse Problems in Network Analysis
The analysis of networks is an important aspect in many fields. Here we consider three different topics: the numerical solution… 
2008
2008
Convergence theorem for the Chebyshev iteration under weak condition
By using majorizing function,a widely convergence theorem for the Chebyshev iteration in Banach space was established which would… 
2007
2007
A New Implementation of Symplectic Runge-Kutta Methods
We propose a “Newton-Taylor” iteration for solving the implicit equations of symplectic Runge-Kutta methods, using the Jacobian… 
2006
2006
Random Walk on Fixed Spheres for Laplace and Lamé equations
The Random Walk on Fixed Spheres (RWFS) introduced in our paper [25], and further developed in [26], is presented in details for… 
2004
2004
Discrete random walk on large spherical grids generated by spherical means for PDEs *
A new general stochastic-deterministic approach for a numerical solution of boundary value problems of potential and elasticity… 
2000
2000
Iterative implementations of linear receivers for spatial diversity channels
We investigate iterative implementations of linear receivers for spatial diversity channels This work has been motivated by… 
1976
1976
Accelerated Iterative Methods for the Solution of Tridiagonal Systems on Parallel Computers
Iterative methods for the solution of tridiagonal systems are considered, and a new iteration is presented, whose rate of… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)