Efficient computation of Wigner-Eisenbud functions
From MaRDI portal
(Redirected from Publication:463032)
Recommendations
- Efficient computation of the discrete pseudo-Wigner distribution
- Fast computation of the ambiguity function and the Wigner distribution on arbitrary line segments
- Efficient numerical approximation of the effective Hamiltonian
- The efficient computation of certain determinants arising in the treatment of Schrödinger's equations
- A time-recursive algorithm for the computation of auto-ambiguity function and the Wigner distribution
- Efficient algorithm for computing QFT bounds
- Efficient approximation algorithm for the Schrödinger–Possion system
- Coherent-state path-integral calculation of the Wigner function
- Discrete Wigner functions and the phase space representation of quantum computers
Cites work
- scientific article; zbMATH DE number 1852575 (Why is no real title available?)
- scientific article; zbMATH DE number 3193574 (Why is no real title available?)
- A method for numerical integration on an automatic computer
- Is Gauss Quadrature Better than Clenshaw–Curtis?
- New families of algorithms for solving nonlinear circuit equations
- On Eisenbud's and Wigner's \(R\)-matrix: A general approach
- Principles of Fourier analysis
Cited in
(5)- Efficient algorithm for computing QFT bounds
- Fast and accurate evaluation of Wigner \(3j\), \(6j\), and \(9j\) symbols using prime factorization and multiword integer arithmetic
- Eigensolutions of the Wigner-Eisenbud problem for a cylindrical nanowire within finite volume method
- Efficient wavefunction propagation by minimizing accumulated action
- \(R\)-matrix theory with Dirichlet boundary conditions for integrable electron waveguides
This page was built for publication: Efficient computation of Wigner-Eisenbud functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q463032)