The DEPOSIT computer code based on the low rank approximations

DOI10.1016/J.CPC.2014.06.012MaRDI QIDQ525877zbMATH OpenOpenAlexFDO

Authors Mikhail S. Litsarev, Ivan Oseledets

Publication date 5 May 2017

Published in Computer Physics Communications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1403.4068

zbMATH Keywords

low-rank approximationexponential sumsseparated representation2D cross3D integrationdeposited energyelectron lossion-atom collisions

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to numerical analysis (65-04) Numerical computation of matrix exponential and similar matrix functions (65F60)

Abstract: We present an efficient technique based on low-rank separated approximations for the computation of three-dimensional integrals in the computer code DEPOSIT that describes ion-atomic collision processes. Implementation of this technique decreases the total computational time by a factor of 1000. The general concept can be applied to more complicated models.

Recommendations

• Fast low‐rank approximations of multidimensional integrals in ion‐atomic collisions modelling
• On the Compression of Low Rank Matrices
• Cross approximation in tensor electron density computations
• Dynamical Low‐Rank Approximation
• A cross-product approach for low-rank approximations of large matrices

Cited in

(2)

• Fast low‐rank approximations of multidimensional integrals in ion‐atomic collisions modelling
• A low-rank approach to the computation of path integrals

Describes a project that uses

Uses Software

• DEPOSIT

This page was built for publication: The DEPOSIT computer code based on the low rank approximations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q525877)