2013 is now in its full rights, so it is time to go on with research.
With Christian Lubich we have finished a paper on a very efficient time-stepping scheme for the dynamical low-rank approximation — so-called KLS-scheme, which is remarkably simple but efficient to compute the dynamics on low-rank manifolds. It presents a full analysis for the two-dimensional case, with multidimensional case (TT-format) in progress.
One more old paper on explicit representations of simple functions in tensor formats is published in the Constructive Approximation!
Our paper on the new time-stepping scheme based on the QTT-format has been published in SISC!
Four papers are in progress : on the block eigenvalue solver in the TT-format, on the dynamical low-rank approximation, on the tensor structure of the wavelet tensor train matrix and on the fast solution of the Stokes problem in tensor format. Hope to finish them soon.
Also, I put some time to get an implementation of the TT-Toolbox in Python. The preliminary version (ttpy 0.1) is available on the github. Please take a look on it, if you are interested.
We have recently put the publications of our research group at the Institute of Numerical Mathematics RAS on the web. The list is not yet full, but is close. Check it!
This paper with Dmitry Savostyanov published in the end of 2011 in the Proceedings of 7th International Workshop on Multidimensional Systems (nDS), doi: 10.1109/nDS.2011.6076873 is about fast adaptive methods for the approximation of high-dimensional arrays by cross-type methods (such methods are quite popular for matrices).
The method of TT-ranks adaptation is based on the DMRG-scheme, which is a “universal tool” for TT-methods. A prototype implementation (quite messy, but working) is available in the
Github repository of the TT-Toolbox. To make it work, you should install the
TT-Toolbox itself.
Dynamical low-rank approximation is a rather new and important topic, which was studied by Lubich and Koch for low-rank matrices and low-rank (in the sense of Tucker format) tensor decomposition. Such kind of techniques were well known in physics in chemistry, going back to Dirac-Frenkel principle, and MCTDH method for the computation of quantum molecular vibrations. It was interesting to extend this approach to the TT-format.
We did it in our recent paper Efficient time-stepping scheme for dynamics on TT-manifolds , which is published as a preprint in MIS MPI Leipzig. In fact, we managed to provide an efficient numerical scheme for the computation of the TT-dynamics. The MATLAB implementation will be soon included in the development github repository of the TT-Toolbox.
TT-Toolbox (TT=Tensor Train) Version 2.2
TT(Tensor Train) format is an efficient way for low-parametric
representation of high-dimensional tensors. The TT-Toolbox
is a MATLAB implementation of basic operations with
tensors in TT-format. It includes:
* tt_tensor and tt_matrix classes for storing vectors and operators
* Basic linear algebra subroutines (addition, matrix-by-vector product,
elementwise multiplication and many others) using standard MATLAB syntax,
linear complexity in the dimension, reshape function
* Fast rounding procedure with a prescribed accuracy
* Advanced approximation and solution techniques:
* Approximate solution of linear systems and eigenvalue problems
* Cross methods to approximate “black-box” tensors
* Wavelet tensor train decomposition
* Construction of basic operators and functions (Laplace operator, function of a TT-tensor)
* Computation of maximal and minimal elements of a tensor
* and several others
New in Version 2.2
* Better documentation
* Mixed QTT-Tucker format (qtt_tucker class)
* reshape function for a TT-tensor/TT-matrix
* dmrg_cross method for black-box tensor approximation
* Convolution in QTT-format
You can get it here: TT-Toolbox 2.2.
Read the rest of this entry »
Google mycitations service looks great. Here is mine
I decided to by on a twitter also (now posts only in Russian, but who knows
)
oseledetsivan