default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEric Evert
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j6]Ignat Domanov, Nico Vervliet
, Eric Evert, Lieven De Lathauwer:
Decomposition of a Tensor into Multilinear Rank-\({(M_{{r}},N_{{r}},\cdot )}\) Terms. SIAM J. Matrix Anal. Appl. 45(3): 1310-1334 (2024)- 2023
- [j5]Eric Evert, Yi Fu, J. William Helton, John Yin:
Empirical Properties of Optima in Free Semidefinite Programs. Exp. Math. 32(3): 477-501 (2023) - [j4]Eric Evert, Lieven De Lathauwer:
On Best Low Rank Approximation of Positive Definite Tensors. SIAM J. Matrix Anal. Appl. 44(2): 867-893 (2023) - 2022
- [j3]Eric Evert, Michiel Vandecappelle, Lieven De Lathauwer:
A Recursive Eigenspace Computation for the Canonical Polyadic Decomposition. SIAM J. Matrix Anal. Appl. 43(1): 274-300 (2022) - [j2]Eric Evert, Lieven De Lathauwer:
Guarantees for Existence of a Best Canonical Polyadic Approximation of a Noisy Low-Rank Tensor. SIAM J. Matrix Anal. Appl. 43(1): 328-369 (2022) - [j1]Eric Evert, Michiel Vandecappelle, Lieven De Lathauwer:
Canonical Polyadic Decomposition via the Generalized Schur Decomposition. IEEE Signal Process. Lett. 29: 937-941 (2022)
Conference and Workshop Papers
- 2024
- [c3]Aditya Bhaskara, Eric Evert, Vaidehi Srinivas, Aravindan Vijayaraghavan:
New Tools for Smoothed Analysis: Least Singular Value Bounds for Random Matrices with Dependent Entries. STOC 2024: 375-386 - 2023
- [c2]Eric Evert, Nico Vervliet, Ignat Domanov, Lieven De Lathauwer:
Uniqueness Result and Algebraic Algorithm for Decomposition into Multilinear Rank- $(M_{r}, N_{r}, \cdot)$ Terms and Joint Block Diagonalization. CAMSAP 2023: 206-210 - 2022
- [c1]Eric Evert, Michiel Vandecappelle, Lieven De Lathauwer:
CPD Computation via Recursive Eigenspace Decompositions. ICASSP 2022: 9067-9071
Informal and Other Publications
- 2024
- [i4]Aditya Bhaskara, Eric Evert, Vaidehi Srinivas, Aravindan Vijayaraghavan:
New Tools for Smoothed Analysis: Least Singular Value Bounds for Random Matrices with Dependent Entries. CoRR abs/2405.01517 (2024) - 2022
- [i3]Eric Evert, Michiel Vandecappelle, Lieven De Lathauwer:
Canonical Polyadic Decomposition via the generalized Schur decomposition. CoRR abs/2202.11414 (2022) - 2021
- [i2]Eric Evert, Lieven De Lathauwer:
Guarantees for existence of a best canonical polyadic approximation of a noisy low-rank tensor. CoRR abs/2112.08283 (2021) - [i1]Eric Evert, Michiel Vandecappelle, Lieven De Lathauwer:
A recursive eigenspace computation for the Canonical Polyadic decomposition. CoRR abs/2112.08303 (2021)
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-10-07 22:16 CEST 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:
