Tensor networks for dimensionality reduction and large-scale optimization: Part 2 applications and future perspectives
Part 2 of this monograph builds on the introduction to tensor networks and their operations
presented in Part 1. It focuses on tensor network models for super-compressed higher-order …
presented in Part 1. It focuses on tensor network models for super-compressed higher-order …
Tensor networks for dimensionality reduction and large-scale optimization: Part 1 low-rank tensor decompositions
Modern applications in engineering and data science are increasingly based on
multidimensional data of exceedingly high volume, variety, and structural richness …
multidimensional data of exceedingly high volume, variety, and structural richness …
Low-rank tensor networks for dimensionality reduction and large-scale optimization problems: Perspectives and challenges part 1
Machine learning and data mining algorithms are becoming increasingly important in
analyzing large volume, multi-relational and multi--modal datasets, which are often …
analyzing large volume, multi-relational and multi--modal datasets, which are often …
Tensor numerical methods in quantum chemistry: from Hartree–Fock to excitation energies
V Khoromskaia, BN Khoromskij - Physical Chemistry Chemical Physics, 2015 - pubs.rsc.org
We resume the recent successes of the grid-based tensor numerical methods and discuss
their prospects in real-space electronic structure calculations. These methods, based on the …
their prospects in real-space electronic structure calculations. These methods, based on the …
[图书][B] Structure-preserving doubling algorithms for nonlinear matrix equations
Many numerical approximations rely on a simple iteration, X j+ 1= f (X j), to generate a
sequence {Xj} of approximations to a certain target. A doubling algorithm is an idea to …
sequence {Xj} of approximations to a certain target. A doubling algorithm is an idea to …
Fast optical absorption spectra calculations for periodic solid state systems
We present a method to construct an efficient approximation to the bare exchange and
screened direct interaction kernels of the Bethe–Salpeter Hamiltonian for periodic solid state …
screened direct interaction kernels of the Bethe–Salpeter Hamiltonian for periodic solid state …
Tensor networks for dimensionality reduction, big data and deep learning
A Cichocki - Advances in Data Analysis with Computational …, 2018 - Springer
Large scale multidimensional data are often available as multiway arrays or higher-order
tensors which can be approximately represented in distributed forms via low-rank tensor …
tensors which can be approximately represented in distributed forms via low-rank tensor …
Fast iterative solution of the Bethe–Salpeter eigenvalue problem using low-rank and QTT tensor approximation
In this paper, we propose and study two approaches to approximate the solution of the
Bethe–Salpeter equation (BSE) by using structured iterative eigenvalue solvers. Both …
Bethe–Salpeter equation (BSE) by using structured iterative eigenvalue solvers. Both …
Range-separated tensor format for many-particle modeling
We introduce and analyze the new range-separated (RS) canonical/Tucker tensor format
which aims for numerical modeling of the 3D long-range interaction potentials in …
which aims for numerical modeling of the 3D long-range interaction potentials in …
Some remarks on the complex J-symmetric eigenproblem
The eigenproblem for complex J-symmetric matrices HC=[ACD− AT], A, C= CT, D= DT∈ C
n× n is considered. A proof of the existence of a transformation to the complex J-symmetric …
n× n is considered. A proof of the existence of a transformation to the complex J-symmetric …