Extracting resonance poles from numerical scattering data: type-II Pad\`e reconstruction

• URL: http://arxiv.org/abs/2204.05822v1
• Date: Tue, 12 Apr 2022 14:05:55 GMT
• Title: Extracting resonance poles from numerical scattering data: type-II Pad\`e reconstruction
• Authors: D. Sokolovski, E. Akhmatskaya and S.K.Sen
• Abstract summary: We present a FORTRAN 77 code for evaluation of resonance pole positions and residues of a numerical scattering matrix element. The code has the capability of adding non-analytical noise to the numerical data in order to select "true" physical poles. It has been successfully tested on several models, as well as theF+H2->HF+H,F+HD->HF +D,Cl+HCl->ClH+Cl and H+D2->HD+D reactions.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We present a FORTRAN 77 code for evaluation of resonance pole positions and residues of a numerical scattering matrix element in the complex energy (CE) as well as in the complex angular momentum (CAM) planes. Analytical continuation of the S-matrix element is performed by constructing a type-II Pad\'e approximant from given physical values [Bessis et al (1994); Vrinceanu et al (2000); Sokolovski and Msezane (2004)] . The algorithm involves iterative "preconditioning" of the numerical data by extracting its rapidly oscillating potential phase component. The code has the capability of adding non-analytical noise to the numerical data in order to select "true" physical poles, investigate their stability and evaluate the accuracy of the reconstruction. It has an option of employing multiple-precision (MPFUN) package [Bailey (1993)] developed by D. H. Bailey wherever double precision calculations fail due to a large number of input partial wave (energies) involved. The package has been successfully tested on several models, as well as theF+H2->HF+H,F+HD->HF +D,Cl+HCl->ClH+Cl and H+D2->HD+D reactions. Some detailed examples are given in the text. PACS:34.50.Lf,34.50.Pi

Related papers

• Precision measurement of Cs($nF_J$) quantum defects and calculations of scalar and tensor polarizabilities of the $nS_{1/2}$, $nP_J$ ,$nD_J$ , and $nF_J$ series [0.0]
  We present absolute frequency measurements of the $|6S_1/2, F = 3rangle rightarrow nF_5/2,7/2(n = 28-68)$ Rydberg series to measure the spectrum of $133$Cs.<n>By globally fitting the absolute-frequency measurements to the modified Ritz formula, we determine the quantum defects of the $nF_5/2$ and $nF_7/2$ series.<n>The results will be useful for calculating properties of $133$Cs such as collision and decay rates
  arXiv  Detail & Related papers  (2025-06-04T15:21:51Z)
• Faster randomized partial trace estimation [17.697674095200284]
  We develop randomized matrix-free algorithms for estimating partial traces. We apply our algorithm to study the thermodynamics of several Heisenberg spin systems.
  arXiv  Detail & Related papers  (2023-10-18T22:20:09Z)
• On the Size and Approximation Error of Distilled Sets [57.61696480305911]
  We take a theoretical view on kernel ridge regression based methods of dataset distillation such as Kernel Inducing Points. We prove that a small set of instances exists in the original input space such that its solution in the RFF space coincides with the solution of the original data. A KRR solution can be generated using this distilled set of instances which gives an approximation towards the KRR solution optimized on the full input data.
  arXiv  Detail & Related papers  (2023-05-23T14:37:43Z)
• Score-based Diffusion Models in Function Space [140.792362459734]
  Diffusion models have recently emerged as a powerful framework for generative modeling. We introduce a mathematically rigorous framework called Denoising Diffusion Operators (DDOs) for training diffusion models in function space. We show that the corresponding discretized algorithm generates accurate samples at a fixed cost independent of the data resolution.
  arXiv  Detail & Related papers  (2023-02-14T23:50:53Z)
• Importance sampling for stochastic quantum simulations [68.8204255655161]
  We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients. We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage. Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
  arXiv  Detail & Related papers  (2022-12-12T15:06:32Z)
• WeakIdent: Weak formulation for Identifying Differential Equations using Narrow-fit and Trimming [5.027714423258538]
  We propose a general and robust framework to recover differential equations using a weak formulation. For each sparsity level, Subspace Pursuit is utilized to find an initial set of support from the large dictionary. The proposed method gives a robust recovery of the coefficients, and a significant denoising effect which can handle up to $100%$ noise-to-signal ratio.
  arXiv  Detail & Related papers  (2022-11-06T14:33:22Z)
• Near-optimal fitting of ellipsoids to random points [68.12685213894112]
  A basic problem of fitting an ellipsoid to random points has connections to low-rank matrix decompositions, independent component analysis, and principal component analysis. We resolve this conjecture up to logarithmic factors by constructing a fitting ellipsoid for some $n = Omega(, d2/mathrmpolylog(d),)$. Our proof demonstrates feasibility of the least squares construction of Saunderson et al. using a convenient decomposition of a certain non-standard random matrix.
  arXiv  Detail & Related papers  (2022-08-19T18:00:34Z)
• An Accurate Pentadiagonal Matrix Solution for the Time-Dependent Schr\"{o}dinger Equation [2.480301925841752]
  We invoke the highly accurate five-point stencil to discretize the wave function onto an Implicit-Explicit pentadiagonal Crank-Nicolson scheme. It is demonstrated that the resultant solutions are significantly more accurate than the standard ones.
  arXiv  Detail & Related papers  (2022-05-26T16:16:56Z)
• Computing quantum correlation functions by Importance Sampling method based on path integrals [0.0]
  An importance sampling method based on Generalized Feynman-Kac method has been used to calculate the mean values of quantum observables from quantum correlation functions. Although the initial results are encouarging, more experimentation will be needed to improve the other existing numerical results.
  arXiv  Detail & Related papers  (2022-04-27T10:47:32Z)
• Numerical Regge pole analysis of resonance structures in state-to-state reactive differential cross sections [0.0]
  This is the third (and the last) code in a collection of three programs dedicated to the analysis of numerical data, obtained in an accurate simulation of an atom-diatom chemical reaction. Our purpose is to provide a detailed description of a FORTRAN code for complex angular momentum (CAM) analysis of the resonance effects in reactive angular scattering. The package has been successfully tested on the representative models, as well as the F + H2->HF+H benchmark reaction.
  arXiv  Detail & Related papers  (2022-04-12T12:59:38Z)
• Prediction and compression of lattice QCD data using machine learning algorithms on quantum annealer [4.987315310656657]
  We present regression and compression algorithms for lattice QCD data. In the regression algorithm, we encode the correlation between the input and output variables into a sparse coding machine learning algorithm. In the compression algorithm, we define a mapping from lattice QCD data of floating-point numbers to the binary coefficients that closely reconstruct the input data.
  arXiv  Detail & Related papers  (2021-12-03T19:04:35Z)
• Computing molecular excited states on a D-Wave quantum annealer [52.5289706853773]
  We demonstrate the use of a D-Wave quantum annealer for the calculation of excited electronic states of molecular systems. These simulations play an important role in a number of areas, such as photovoltaics, semiconductor technology and nanoscience.
  arXiv  Detail & Related papers  (2021-07-01T01:02:17Z)
• Deep-learning of Parametric Partial Differential Equations from Sparse and Noisy Data [2.4431531175170362]
  In this work, a new framework, which combines neural network, genetic algorithm and adaptive methods, is put forward to address all of these challenges simultaneously. A trained neural network is utilized to calculate derivatives and generate a large amount of meta-data, which solves the problem of sparse noisy data. Next, genetic algorithm is utilized to discover the form of PDEs and corresponding coefficients with an incomplete candidate library. A two-step adaptive method is introduced to discover parametric PDEs with spatially- or temporally-varying coefficients.
  arXiv  Detail & Related papers  (2020-05-16T09:09:57Z)
• Improved guarantees and a multiple-descent curve for Column Subset Selection and the Nystr\"om method [76.73096213472897]
  We develop techniques which exploit spectral properties of the data matrix to obtain improved approximation guarantees. Our approach leads to significantly better bounds for datasets with known rates of singular value decay. We show that both our improved bounds and the multiple-descent curve can be observed on real datasets simply by varying the RBF parameter.
  arXiv  Detail & Related papers  (2020-02-21T00:43:06Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.