English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

SUMMARY  We propose a fast algorithm for mode rank truncation of the result of a bilinear operation on 3‐tensors given in the Tucker or canonical form. If the arguments and the result have mode sizes  n  and mode ranks  r , the computation costs ( nr  3  +  r  4 ). The algorithm is based on the cross approximation of Gram matrices, and the accuracy of the resulted Tucker approximation is limited by square root of the machine precision. We apply the proposed algorithms for the evaluation of the Hadamard square of the electron density and demonstrate that it outperforms previously used methods for this purpose. We also check the accuracy of the resulted Tucker approximation and show that one iteration of the Tucker‐ALS method improves it almost up to the machine precision. Copyright © 2011 John Wiley & Sons, Ltd.

Fast truncation of mode ranks for bilinear tensor operations