Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,209,664 papers from all fields of science
Search
Sign In
Create Free Account
Iterative method
Known as:
Iterative procedure
, Direct method (computational mathematics)
, Iterative approximation
Expand
In computational mathematics, an iterative method is a mathematical procedure that generates a sequence of improving approximate solutions for a…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
49 relations
Balancing domain decomposition method
Basis (linear algebra)
Coarse space (numerical analysis)
Computational mathematics
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
Coordinated linear beamforming in downlink multi-cell wireless networks
L. Venturino
,
N. Prasad
,
Xiaodong Wang
Asilomar Conference on Signals, Systems and…
2010
Corpus ID: 206823757
We consider the problem of co-channel interference mitigation in a downlink multi-cell wireless network. Assuming that each…
Expand
Highly Cited
2008
Highly Cited
2008
Xetal-II: A 107 GOPS, 600 mW Massively Parallel Processor for Video Scene Analysis
A. Abbo
,
R. Kleihorst
,
+5 authors
M. Heijligers
IEEE Journal of Solid-State Circuits
2008
Corpus ID: 38482104
Xetal-II is a single-instruction multiple-data (SIMD) processor with 320 processing elements. It delivers a peak performance of…
Expand
Highly Cited
2007
Highly Cited
2007
Fairness-Aware Adaptive Resource Allocation Scheme in Multihop OFDMA Systems
ChiSung Bae
,
D. Cho
IEEE Communications Letters
2007
Corpus ID: 11841053
We investigate a fairness-aware adaptive resource allocation scheme for the downlink of multihop OFDMA systems. Assuming that the…
Expand
Highly Cited
2006
Highly Cited
2006
Design of a Statically Balanced Tensegrity Mechanism
M. Schenk
,
J. Herder
,
S. Guest
2006
Corpus ID: 53590259
The combination of static balancing and tensegrity structures has resulted in a new class of mechanisms: Statically Balanced…
Expand
Highly Cited
2004
Highly Cited
2004
Near-Shannon-limit quasi-cyclic low-density parity-check codes
Lei Chen
,
Jun Xu
,
I. Djurdjevic
,
Shu Lin
IEEE Transactions on Communications
2004
Corpus ID: 45108712
This letter presents two classes of quasi-cyclic low-density parity-check codes that perform close to the Shannon limit.
Highly Cited
2003
Highly Cited
2003
Auto-generating Test Sequences Using Model Checkers: A Case Study
M. Heimdahl
,
Sanjai Rayadurgam
,
W. Visser
,
G. Devaraj
,
Jimin Gao
International Workshop on Formal Approaches to…
2003
Corpus ID: 1083617
Use of model-checking approaches for test generation from requirement models have been proposed by several researchers. These…
Expand
Highly Cited
2003
Highly Cited
2003
Low-density parity check codes and iterative decoding for long-haul optical communication systems
B. Vasic
,
I. Djordjevic
,
R. Kostuk
2003
Corpus ID: 10881499
A forward-error correction (FEC) scheme based on low-density parity check (LDPC) codes and iterative decoding using belief…
Expand
Highly Cited
2001
Highly Cited
2001
On the Use of Linear Models for the Design of Water Utilization Systems in Process Plants with a Sin
Miguel Bagajewics
,
M. Savelski
2001
Corpus ID: 3172678
This paper addresses the optimum design of water utilization systems when a single contaminant is present. The application of the…
Expand
Highly Cited
1997
Highly Cited
1997
Symbol-by-symbol MAP demodulation of CPM and PSK signals on Rayleigh flat-fading channels
M. Gertsman
,
J. Lodge
IEEE Transactions on Communications
1997
Corpus ID: 15892320
Demodulation using the symbol-by-symbol maximum a posteriori probability (MAP) algorithm is presented. The algorithm is derived…
Expand
Highly Cited
1972
Highly Cited
1972
Automatic computation of exponentials, logarithms, ratios and square roots
T. C. Chen
1972
Corpus ID: 6881449
It is shown how a relatively simple device can evaluate exponentials, logarithms, ratios and square roots for fraction arguments…
Expand
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)
ACCEPT & CONTINUE