default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTommy Elfving
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j16]Touraj Nikazad
, Mokhtar Abbasi, L. Afzalipour, Tommy Elfving:
A new step size rule for the superiorization method and its application in computerized tomography. Numer. Algorithms 90(3): 1253-1277 (2022)- 2021
- [i1]Mahdi Mirzapour, Andrzej Cegielski, Tommy Elfving:
Convergence and Semi-convergence of a class of constrained block iterative methods. CoRR abs/2111.00344 (2021)
2010 – 2019
- 2018
- [j15]Tommy Elfving, Per Christian Hansen:
Unmatched Projector/Backprojector Pairs: Perturbation and Convergence Analysis. SIAM J. Sci. Comput. 40(1) (2018) - 2017
- [j14]Tommy Elfving, Per Christian Hansen, Touraj Nikazad:
Convergence analysis for column-action methods in image reconstruction. Numer. Algorithms 74(3): 905-924 (2017) - [j13]Tommy Elfving, Per Christian Hansen, Touraj Nikazad:
Erratum to: Convergence analysis for column-action methods in image reconstruction. Numer. Algorithms 74(3): 925 (2017) - 2012
- [j12]Tommy Elfving, Per Christian Hansen, Touraj Nikazad:
Semiconvergence and Relaxation Parameters for Projected SIRT Algorithms. SIAM J. Sci. Comput. 34(4) (2012)
2000 – 2009
- 2009
- [j11]Tommy Elfving, Ingegerd Skoglund:
A direct method for a regularized least-squares problem. Numer. Linear Algebra Appl. 16(8): 649-675 (2009) - 2008
- [j10]Yair Censor, Tommy Elfving, Gabor T. Herman, Touraj Nikazad:
On Diagonally Relaxed Orthogonal Projection Methods. SIAM J. Sci. Comput. 30(1): 473-504 (2008) - 2007
- [j9]Tommy Elfving, Ingegerd Skoglund:
A block-preconditioner for a special regularized least-squares problem. Numer. Linear Algebra Appl. 14(6): 469-484 (2007) - 2006
- [j8]Björn Johansson, Tommy Elfving, Vladimir A. Kozlov, Yair Censor, Per-Erik Forssén, Gösta H. Granlund:
The application of an oblique-projected Landweber method to a model of supervised learning. Math. Comput. Model. 43(7-8): 892-909 (2006) - 2002
- [j7]Yair Censor, Tommy Elfving:
Block-Iterative Algorithms with Diagonally Scaled Oblique Projections for the Linear Feasibility Problem. SIAM J. Matrix Anal. Appl. 24(1): 40-58 (2002)
1990 – 1999
- 1998
- [j6]Åke Björck, Tommy Elfving, Zdenek Strakos:
Stability of Conjugate Gradient and Lanczos Methods for Linear Least Squares Problems. SIAM J. Matrix Anal. Appl. 19(3): 720-736 (1998) - 1997
- [j5]Lars-Erik Andersson, Tommy Elfving:
A Constrained Procrustes Problem. SIAM J. Matrix Anal. Appl. 18(1): 124-139 (1997) - 1995
- [j4]Lars-Erik Andersson, Tommy Elfving:
Best Constrained Approximation in Hilbert Space and Interpolation by Cubic Splines Subject to Obstacles. SIAM J. Sci. Comput. 16(5): 1209-1232 (1995) - 1994
- [j3]Yair Censor, Tommy Elfving:
A multiprojection algorithm using Bregman projections in a product space. Numer. Algorithms 8(2): 221-239 (1994)
1980 – 1989
- 1982
- [j2]Tommy Elfving, Jan-Olof Eklundh:
Some properties of stochastic labeling procedures. Comput. Graph. Image Process. 19(1): 89 (1982) - [j1]Tommy Elfving, Jan-Olof Eklundh:
Some properties of stochastic labeling procedures. Comput. Graph. Image Process. 20(2): 158-170 (1982)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-06 20:31 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
