Skip to search formSkip to main contentSkip to account menu

Landweber iteration

The Landweber iteration or Landweber algorithm is an algorithm to solve ill-posed linear inverse problems, and it has been extended to solve non… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Eigen-based algorithms are very effective and stable in signal combining. However, the major problem is the heavy computational… 
2015
2015
The aim of this paper is to present a modification of the visualization process of finding the roots of a given complex… 
2009
2009
Node localization plays a critical role in wireless sensor networks(WSN). The ill-posed problem caused by measurement error in… 
2008
2008
Reinforcement learning (RL) is a widely used paradigm for learning control. Computing exact RL solutions is generally only… 
2008
2008
The paper presents two methods for the extraction of depth information from planar recorded data of 3D (three - dimensional… 
Review
2007
Review
2007
The set of all words in the alphabet {l, r) forms the full binary tree T. If x E T then xl and xr are the left and the right… 
2004
2004
  • H. Eo
  • 2004
  • Corpus ID: 16795054
We present a differential fixpoint iteration method, to be used in static analysis of programs. Computing a static program… 
2002
2002
A new approach called D-Q iteration (DQIT) for synthesizing robust H/sub /spl infin// controllers is proposed to avoid D-scale… 
2001
2001
Abstract Tchebychev iteration may be used for acceleration convergence of an iterative algorithm to solve a general linear system…