Analytical high-dimensional operators in canonical polyadic finite basis representation (CP-FBR)

Author:

Nadoveza Nataša1ORCID,Panadés-Barrueta Ramón L.2ORCID,Shi Lei1ORCID,Gatti Fabien1ORCID,Peláez Daniel1ORCID

Affiliation:

1. Université Paris-Saclay, CNRS, Institut des Sciences Moléculaires d’Orsay 1 , 91405 Orsay, France

2. Faculty of Chemistry and Food Chemistry, Technische Universität Dresden 2 , 01069 Dresden, Germany

Abstract

In the present work, we introduce a simple means of obtaining an analytical (i.e., grid-free) canonical polyadic (CP) representation of a multidimensional function that is expressed in terms of a set of discrete data. For this, we make use of an initial CP guess, even not fully converged, and a set of auxiliary basis functions [finite basis representation (FBR)]. The resulting CP-FBR expression constitutes the CP counterpart of our previous Tucker sum-of-products-FBR approach. However, as is well-known, CP expressions are much more compact. This has obvious advantages in high-dimensional quantum dynamics. The power of CP-FBR lies in the fact that it requires a grid much coarser than the one needed for the dynamics. In a subsequent step, the basis functions can be interpolated to any desired density of grid points. This is useful, for instance, when different initial conditions (e.g., energy content) of a system are to be considered. We show the application of the method to bound systems of increased dimensionality: H2 (3D), HONO (6D), and CH4 (9D).

Funder

Université Paris-Saclay

Institut de Chimie

Publisher

AIP Publishing

Subject

Physical and Theoretical Chemistry,General Physics and Astronomy

Cited by 1 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3