Skip to search formSkip to main contentSkip to account menu

Iterative method

Known as: Iterative procedure, Direct method (computational mathematics), Iterative approximation 
In computational mathematics, an iterative method is a mathematical procedure that generates a sequence of improving approximate solutions for a… 
Wikipedia (opens in a new tab)

Related topics

Related topics

49 relations
Balancing domain decomposition methodBasis (linear algebra)Coarse space (numerical analysis)Computational mathematics

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
E-SmallTalker: A Distributed Mobile System for Social Networking in Physical Proximity
Small talk is an important social lubricant that helps people, especially strangers, initiate conversations and make friends with… 
Highly Cited
2010
Highly Cited
2010
Coordinated linear beamforming in downlink multi-cell wireless networks
We consider the problem of co-channel interference mitigation in a downlink multi-cell wireless network. Assuming that each… 
Highly Cited
2007
Highly Cited
2007
Fairness-Aware Adaptive Resource Allocation Scheme in Multihop OFDMA Systems
We investigate a fairness-aware adaptive resource allocation scheme for the downlink of multihop OFDMA systems. Assuming that the… 
Highly Cited
2006
Highly Cited
2006
Design of a Statically Balanced Tensegrity Mechanism
The combination of static balancing and tensegrity structures has resulted in a new class of mechanisms: Statically Balanced… 
Highly Cited
2006
Highly Cited
2006
Iterative joint time-variant channel estimation and multi-user detection for MC-CDMA
Joint time-variant channel estimation and multi-user detection are key building-blocks for wireless broadband communication for… 
Highly Cited
2004
Highly Cited
2004
Near-Shannon-limit quasi-cyclic low-density parity-check codes
This letter presents two classes of quasi-cyclic low-density parity-check codes that perform close to the Shannon limit. 
Highly Cited
1997
Highly Cited
1997
Symbol-by-symbol MAP demodulation of CPM and PSK signals on Rayleigh flat-fading channels
Demodulation using the symbol-by-symbol maximum a posteriori probability (MAP) algorithm is presented. The algorithm is derived… 
Highly Cited
1992
Highly Cited
1992
Ordering Methods for Preconditioned Conjugate Gradient Methods Applied to Unstructured Grid Problems
It is well known that the ordering of the unknowns can have a significant effect on the convergence of preconditioned conjugate… 
Highly Cited
1988
Highly Cited
1988
Optimal rejection of persistent disturbances, robust stability, and mixed sensitivity minimization
The problem of optimal disturbance rejection of bounded persistent disturbances is solved in the general nonsquare case. The… 
Highly Cited
1972
Highly Cited
1972
Automatic computation of exponentials, logarithms, ratios and square roots
It is shown how a relatively simple device can evaluate exponentials, logarithms, ratios and square roots for fraction arguments… 
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)