Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  present a method for solving the reaction-diffusion equation with general potential in free space. It is based on the approximation of the Feynman-Kac formula by a sequence of convolutions on sequentially diminishing grids. For computation of the convolutions  propose a fast algorithm based on the low-rank approximation of the Hankel matrices. The algorithm has complexity of O ( n r M log ? M + n r 2 M ) flops and requires O ( M r ) floating-point numbers in memory, where n is the dimension of the integral, r ? n , and M is the mesh size in one dimension. The presented technique can be generalized to the higher-order diffusion processes.
['Mikhail S. Litsarev', 'Ivan V. Oseledets']
I am writing a research paper on a idea A low-rank approach to the computation of path integrals
[{"from": "human", "value": "I am writing a research paper on a idea A low-rank approach to the computation of path integrals"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  present a method for solving the reaction-diffusion equation with general potential in free space. It is based on the approximation of the Feynman-Kac formula by a sequence of convolutions on sequentially diminishing grids. For computation of the convolutions  propose a fast algorithm based on the low-rank approximation of the Hankel matrices. The algorithm has complexity of O ( n r M log ? M + n r 2 M ) flops and requires O ( M r ) floating-point numbers in memory, where n is the dimension of the integral, r ? n , and M is the mesh size in one dimension. The presented technique can be generalized to the higher-order diffusion processes."}]