Skip to main content
SpringerLink
Log in

Building Z-Permuted Matrices in the QTT Format

  • INFORMATION SCIENCE
  • Published:
Computational Mathematics and Mathematical Physics Aims and scope Submit manuscript

Abstract

The paper presents a method for building matrices in the QTT format, the columns and rows of which are reordered in a special way, by z-permutation. To obtain a matrix in this permutation, a new operation in the QTT (Quantized Tensor Train) format, z-kron, is introduced. This reordering allows one to reduce the QTT ranks of the approximation of the stiffness matrix, which makes it possible to accelerate the convergence of the numerical solution of the system. For example, when solving the Dirichlet problem for Poisson’s equation by the finite element method (FEM), where the QTT format is used to store the coefficient matrix, reordering the rows and columns in a coefficients matrix with dimensions \(n \times n\), where \(n = {{4}^{d}}\), makes it possible to prevent the exponential in \(d\) growth of ranks.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1.
Fig. 2.
Fig. 3.

Similar content being viewed by others

REFERENCES

  1. G. Morton, A Computer Oriented Geodetic Data Base and a New Technique In File Sequencing (International Business Machines Company, Ottawa, 1966).

    Google Scholar 

  2. V. Kazeev and C. Schwab, “Quantized tensor-structured finite elements for second-order elliptic PDEs in two dimensions,” Numer. Math. 1 (138), 133–190 (2018).

    Article  MathSciNet  Google Scholar 

  3. L. Markeeva, I. Tsybulin, and I. Oseledets, “QTT-isogeometric solver in two dimensions,” (2018). arXiv:1802.02839.

  4. V. Kazeev and B. Khoromskij, “Low-rank explicit QTT representation of the Laplace operator and its inverse,” SIAM J. Matrix Anal. Appl. 33 (3), 742–758 (2012).

    Article  MathSciNet  Google Scholar 

  5. V. Kazeev, O. Reichmann, and C. Schwab, “Low-rank tensor structure of linear diffusion operators in the TT and QTT formats,” Linear Algebra Appl. 11 (438), 4204–4221 (2013).

    Article  MathSciNet  Google Scholar 

  6. M. Bachmayr and V. Kazeev, “Stability of low-rank tensor representations and structured multilevel preconditioning for elliptic PDEs,” Found. Comput. Math. 20, 1175–1236 (2020).

    Article  MathSciNet  Google Scholar 

  7. I. Oseledets, “Tensor-train decomposition,” SIAM J. Sci. Comput. 33 (5), 2295–2317 (2011).

    Article  MathSciNet  Google Scholar 

  8. W. De Launey and J. Seberry, “The strong Kronecker product,” J. Comb. Theory 66 (2), 192–213 (1994).

    Article  MathSciNet  Google Scholar 

  9. G. Strang and G. Fix, An Analysis of the Finite Element Method (Prentice Hall, Englewood Cliffs, NJ, 1973).

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Skolkovo Institute of Science and Technology, 143026, Moscow, Russia

    L. B. Markeeva

  2. Yandex, 119021, Moscow, Russia

    I. V. Tsybulin

Authors
  1. L. B. Markeeva
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. I. V. Tsybulin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to L. B. Markeeva.

Additional information

Translated by E. Chernokozhin

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Markeeva, L.B., Tsybulin, I.V. Building Z-Permuted Matrices in the QTT Format. Comput. Math. and Math. Phys. 60, 2108–2115 (2020). https://doi.org/10.1134/S096554252012009X

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S096554252012009X

Keywords:

Search

Navigation