Lars Eldén
Professor of Scientific Computing
Member of the editorial board of BIT Numerical Mathematics
Recent book
Matrix Methods in Data Mining and Pattern Recognition, SIAM, April 2007.
Recent papers and talks- Talk at The 48th Annual Meeting of the Association for Computational Linguistics, Uppsala, Sweden, July 2010: Computing Word Senses by Semantic Mirroring and Spectral Partitioning
- Talk at The Third International Conference on Structured Matrices and Tensors: Computing Low-Rank Approximations of Sparse Tensors using Krylov Methods
- Tech report: Stability and regularization of a backward parabolic PDE with variable coefficients
- 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
Linköping and Uppsala September and October 2008 -
Matrix methods in data mining.
Castro Urdiales, Spain, July 2008
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 2484842 |
| Email: | lars ;dot; elden AT liu ;dot; se |