Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Semiconvergence and Relaxation Parameters for Projected SIRT Algorithms
Linköping University, Department of Mathematics, Computational Mathematics. Linköping University, The Institute of Technology.
Technical University of Denmark, Lyngby, Denmark.
Iran University of Science and Technology, Narmak, Tehran, Iran .
2012 (English)In: SIAM Journal on Scientific Computing, ISSN 1064-8275, E-ISSN 1095-7197, Vol. 34, no 4, A2000-A2017 p.Article in journal (Refereed) Published
Abstract [en]

We give a detailed study of the semiconvergence behavior of projected nonstationary simultaneous iterative reconstruction technique (SIRT) algorithms, including the projected Landweber algorithm. We also consider the use of a relaxation parameter strategy, proposed recently for the standard algorithms, for controlling the semiconvergence of the projected algorithms. We demonstrate the semiconvergence and the performance of our strategies by examples taken from tomographic imaging.

Place, publisher, year, edition, pages
Society for Industrial and Applied Mathematics , 2012. Vol. 34, no 4, A2000-A2017 p.
Keyword [en]
projected Landweber iteration, simultaneous iterative reconstruction technique, relaxation parameters, semiconvergence, nonnegativity constraints, tomographic imaging
National Category
Natural Sciences
Identifiers
URN: urn:nbn:se:liu:diva-85613DOI: 10.1137/110834640ISI: 000310475700007OAI: oai:DiVA.org:liu-85613DiVA: diva2:571888
Note

Funding Agencies|Danish Research Council for Technology and Production Sciences|274-07-0065|

Available from: 2012-11-26 Created: 2012-11-26 Last updated: 2017-12-07

Open Access in DiVA

fulltext(388 kB)445 downloads
File information
File name FULLTEXT01.pdfFile size 388 kBChecksum SHA-512
4adb2c1024316b21acb3797ffa1e462e2c0f07632b3e0d5f9488fe80d7197e0d194eb4c871c25eea7305fc1c653f29836d315e32a4db9f0fa031c1655f2f9609
Type fulltextMimetype application/pdf

Other links

Publisher's full text

Search in DiVA

By author/editor
Elfving, Tommy
By organisation
Computational MathematicsThe Institute of Technology
In the same journal
SIAM Journal on Scientific Computing
Natural Sciences

Search outside of DiVA

GoogleGoogle Scholar
Total: 445 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 124 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf