default search action
Alwin Stegeman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [j15]Alwin Stegeman, Lieven De Lathauwer:
Rayleigh Quotient Methods for Estimating Common Roots of Noisy Univariate Polynomials. Comput. Methods Appl. Math. 19(1): 147-163 (2019) - 2017
- [j14]Ignat Domanov, Alwin Stegeman, Lieven De Lathauwer:
On the Largest Multilinear Singular Values of Higher-Order Tensors. SIAM J. Matrix Anal. Appl. 38(4): 1434-1453 (2017) - 2016
- [j13]Alwin Stegeman:
A new method for simultaneous estimation of the factor model parameters, factor scores, and unique parts. Comput. Stat. Data Anal. 99: 189-203 (2016) - 2014
- [j12]Alwin Stegeman:
Finding the limit of diverging components in three-way Candecomp/Parafac - A demonstration of its practical merits. Comput. Stat. Data Anal. 75: 203-216 (2014) - 2013
- [j11]Alwin Stegeman:
A Three-Way Jordan Canonical Form as Limit of Low-Rank Tensor Approximations. SIAM J. Matrix Anal. Appl. 34(2): 624-650 (2013) - 2012
- [j10]Xijing Guo, Sebastian Miron, David Brie, Alwin Stegeman:
Uni-mode and Partial Uniqueness Conditions for CANDECOMP/PARAFAC of Three-Way Arrays with Linearly Dependent Loadings. SIAM J. Matrix Anal. Appl. 33(1): 111-129 (2012) - [j9]Alwin Stegeman:
Candecomp/Parafac: From Diverging Components to a Decomposition in Block Terms. SIAM J. Matrix Anal. Appl. 33(2): 291-316 (2012) - [j8]Alwin Stegeman, Tam T. T. Lam:
Improved Uniqueness Conditions for Canonical Tensor Decompositions with Linearly Dependent Loadings. SIAM J. Matrix Anal. Appl. 33(4): 1250-1271 (2012) - [j7]André L. F. de Almeida, Xavier Luciani, Alwin Stegeman, Pierre Comon:
CONFAC Decomposition Approach to Blind Identification of Underdetermined Mixtures Based on Generating Function Derivatives. IEEE Trans. Signal Process. 60(11): 5698-5713 (2012) - 2011
- [j6]Alwin Stegeman:
On Uniqueness of the Canonical Tensor Decomposition with Some Form of Symmetry. SIAM J. Matrix Anal. Appl. 32(2): 561-583 (2011) - 2010
- [j5]Alwin Stegeman:
On Uniqueness of the nth Order Tensor Decomposition into Rank-1 Terms with Linear Independence in One Mode. SIAM J. Matrix Anal. Appl. 31(5): 2498-2516 (2010)
2000 – 2009
- 2009
- [j4]Alwin Stegeman, André L. F. de Almeida:
Uniqueness Conditions for Constrained Three-Way Factor Decompositions with Linearly Dependent Loadings. SIAM J. Matrix Anal. Appl. 31(3): 1469-1490 (2009) - [c1]Alwin Stegeman, Pierre Comon:
Subtracting a best rank-1 approximation may increase tensor rank. EUSIPCO 2009: 505-509 - 2008
- [j3]Alwin Stegeman:
Low-Rank Approximation of Generic p˟q˟2 Arrays and Diverging Components in the Candecomp/Parafac Model. SIAM J. Matrix Anal. Appl. 30(3): 988-1007 (2008) - [j2]Alwin Stegeman, Lieven De Lathauwer:
A Method to Avoid Diverging Components in the Candecomp/Parafac Model for Generic I˟J˟2 Arrays. SIAM J. Matrix Anal. Appl. 30(4): 1614-1638 (2008) - 2006
- [j1]Alwin Stegeman, Jos M. F. ten Berge:
Kruskal's condition for uniqueness in Candecomp/Parafac when ranks and k. Comput. Stat. Data Anal. 50(1): 210-220 (2006)
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-04-24 22:53 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint