Lars Eldén
Professor of Scientific Computing
Book
Matrix Methods in Data Mining and Pattern Recognition, SIAM, April 2007.
Recent papers and talks- New paper: Perturbation Theory and Optimality Conditions for the Best Multilinear Rank Approximation of a Tensor, SIMAX 2011 BIBTEX
- Tech report: Krylov-Type Methods for Tensor Computations (arXiv) BIBTEX (previous version as tech report)
- A numerical solution of a Cauchy problem for an elliptic equation by Krylov subspaces Inverse problems, 2009. BIBTEX
- A Newton-Grassmann method
for computing the best multi-linear rank-(r1, r2, r3)
approximation of a tensor. SIMAX 2009.
BIBTEX - Talk at SIAM Annual Meeting, San Diego, July 2008:
Tensor computations and applications in data mining.
- Talk at ETH, Zürich, October 2008:
Matrix Computations for Pagerank and Related Semantic Graphs
-
Computational Methods for Statistics with Applications
Uppsala September 2011
Docentnämnd
Chair of the "docentnämnd" of LiTH.
Data mining, matrices, etc.
-
New York Times on Data mining and careers, Aug 5,
2009
-
Ed Chang,
Google, on Search engines, matrix computations, and
parallel algorithms
Dangers of bibliometric evaluation of science
Doug Arnold, Integrity Under Attack: The State of Scholarly Publishing
Contact:
Department of Mathematics
Linköping University
SE-581 83 Linköping
Sweden
| Phone: | +46 (0)13 282183 |
| Mobile phone: | +46 (0)760 248842 |
| Email: | lars ;dot; elden AT liu ;dot; se |