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… 
2015
2015
Characterizing the evolution of seismicity rate of early aftershocks can yield important information about earthquake nucleation… 
2009
2009
Image reconstruction from incomplete projections is a key problem in image reconstruction.In this paper,based on least-square… 
2008
2008
Reinforcement learning (RL) is a widely used paradigm for learning control. Computing exact RL solutions is generally only… 
2007
2007
It is no accident that Peter Landweber’s career closely matches the striking unification of algebra and topology provided by the… 
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… 
2001
2001
Abstract Tchebychev iteration may be used for acceleration convergence of an iterative algorithm to solve a general linear system… 
1993
1993
This paper discusses the various algorithms that have been proposed to solve the linear system arising in the radiosity method…