Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 234,671,018 papers from all fields of science
Search
Sign In
Create Free Account
Chebyshev iteration
In numerical linear algebra, the Chebyshev iteration is aniterative method for determining the solutions of a system of linear equations. The method…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
11 relations
Biconjugate gradient method
Conjugate gradient method
Gauss–Seidel method
Generalized minimal residual method
Expand
Broader (1)
Numerical linear algebra
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Modeling Addressing Over-Solving in Multiphysics Codes with Nested Solvers
J. Senecal
2017
Corpus ID: 44190968
Examples of multiphysics problems in the field of nuclear engineering are numerous. For light water reactors the coupling of…
Expand
2017
2017
808 “ Time ”-parallel diffusion-based correlation operators
A. Weaver
,
S. Gürol
,
J. Tshimanga
,
M. Chrust
,
A. Piacentini
2017
Corpus ID: 189893629
Correlation operators based on the solution of an implicitly formulated diffusion equation can be implemented numerically using…
Expand
2013
2013
Inversion Velocity Analysis via Differential Semblance Optimization in the Depth-oriented Extension
Yujin Liu
,
W. Symes
,
Yin Huang
,
Zhenchun Li
2013
Corpus ID: 5309201
Migration velocity analysis (MVA) is an approach to solve a partially linearized variant of the waveform inversion problem, i.e…
Expand
2012
2012
Iterative Methods and Partitioning Techniques for Large Sparse Problems in Network Analysis
Verena Kuhlemann
2012
Corpus ID: 18467679
The analysis of networks is an important aspect in many fields. Here we consider three different topics: the numerical solution…
Expand
2011
2011
A ug 2 01 0 Approaching optimality for solving SDD linear systems ∗
Ioannis Koutis
,
Gary Peng
2011
Corpus ID: 265099027
We present an algorithm that on input of an n-vertex m-edge weighted graph G and a value k, produces an incremental sparsifier…
Expand
2009
2009
A Parallel Refined Block Arnoldi Algorithm for Large Unsymmetric Matrices
Tao Zhao
,
Xue-bin Chi
,
Jinrong Jiang
,
Jun Liu
,
Zhonghua Lu
IEEE International Conference on High Performance…
2009
Corpus ID: 16165936
This paper proposed a parallel refined block Arnoldi method for computing a few eigenvalues with largest or smallest real parts…
Expand
2007
2007
Accelerated Solution of Non-Linear Flow Problems using Chebyshev Iteration Polynomial Based RK Recursions
A. Lorber
,
G. Carey
,
S. Bova
,
C. H. Harl
2007
Corpus ID: 15180794
2006
2006
Random Walk on Fixed Spheres for Laplace and Lamé equations
K. Sabelfeld
,
I. Shalimova
,
A. Levykin
Monte Carlo Methods Appl.
2006
Corpus ID: 207438112
The Random Walk on Fixed Spheres (RWFS) introduced in our paper [25], and further developed in [26], is presented in details for…
Expand
2004
2004
Discrete random walk on large spherical grids generated by spherical means for PDEs *
K. Sabelfeld
,
I. Shalimova
,
A. Levykin
Monte Carlo Methods Appl.
2004
Corpus ID: 27287963
A new general stochastic-deterministic approach for a numerical solution of boundary value problems of potential and elasticity…
Expand
2000
2000
Iterative implementations of linear receivers for spatial diversity channels
Monica Navarro
,
A. Grant
Vehicular Technology Conference Fall . IEEE VTS…
2000
Corpus ID: 17548056
We investigate iterative implementations of linear receivers for spatial diversity channels This work has been motivated by…
Expand