Related papers: A numerical algorithm for solving the coupled Schr…
Permutations can be represented as linear combinations of natural numbers with different powers. In this paper, its coefficient matrix and inverse matrix is derived, and the results show the coefficient matrix is a lower triangular matrix…
In this work we discuss the possibility to reduce the computational complexity of modal methods, i.e. methods based on eigenmodes expansion, from the third power to the second power of the number of eigenmodes. The proposed approach is…
In the present work, firstly, we use a minimax equality to prove the existence of a solution of certain system of varitional equations and we provide a numerical approximation of such a solution. Then, we propose a numerical method to solve…
We consider the problem of numerically solving the Schr\"odinger equation with a potential that is quasi periodic in space and time. We introduce a numerical scheme based on a newly developed multi-time scale and averaging technique. We…
In this note, we present an algorithm that yields many new methods for constructing doubly stochastic and symmetric doubly stochastic matrices for the inverse eigenvalue problem. In addition, we introduce new open problems in this area that…
The theory of matrix splitting is a useful tool for finding solution of rectangular linear system of equations, iteratively. The purpose of this paper is two-fold. Firstly, we revisit theory of weak regular splittings for rectangular…
Finding the inverse of a matrix is an open problem especially when it comes to engineering problems due to their complexity and running time (cost) of matrix inversion algorithms. An optimum strategy to invert a matrix is, first, to reduce…
This paper proposes an efficient method for computing partial eigenvalues of large sparse matrices what can be called the inexact inverse power method (IIPM). It is similar to the inexact Rayleigh quotient method and inexact Jacobi-Davidson…
Utilizing an ${\it ansatz}$ for the eigenfunctions, we arrive at an exact closed form solution to the Schr\"{o}dinger equation with the inverse-power potential, $V(r)=ar^{-4}+br^{-3}+cr^{-2}+dr^{-1}$ in two dimensions, where the parameters…
We give an algorithm for reversion of formal power series, based on an efficient way to implement the Lagrange inversion formula. Our algorithm requires $O(n^{1/2}(M(n) + MM(n^{1/2})))$ operations where $M(n)$ and $MM(n)$ are the costs of…
The inverse of a large matrix can often be accurately approximated by a polynomial of degree significantly lower than the order of the matrix. The iteration polynomial generated by a run of the GMRES algorithm is a good candidate, and its…
In this work the numerical solution of acoustic tomography problem based on the iterative and functional-analytical algorithms is considered. The mathematical properties of these algorithms were previously described in works of R.G.Novikov…
We present an iterative algorithm to compute numerical approximations of the potential for the Schr\"odinger operator from scattering data. Four different types of scattering data are used as follows: fixed energy, fixed incident angle,…
Many problems in machine learning and statistics can be formulated as (generalized) eigenproblems. In terms of the associated optimization problem, computing linear eigenvectors amounts to finding critical points of a quadratic function…
This paper is concerned with the inverse problem to recover a compactly supported Schr{\"o}dinger potential given the differential scattering cross section, i.e. the modulus, but not the phase of the scattering amplitude. To compensate for…
In power system dynamic simulation, up to 90% of the computational time is devoted to solve the network equations, i.e., a set of linear equations. Traditional approaches are based on sparse LU factorization, which is inherently sequential.…
Employing the phase-space representation of second order ordinary differential equations we developed a method to find the eigenvalues and eigenfunctions of the 1-dimensional time independent Schr\"odinger equation for quantum model…
In this paper, we introduce a novel approach to solve the many-body Schrodinger equation by the tensor neural network. Based on the tensor product structure, we can do the direct numerical integration by using fixed quadrature points for…
This paper proposes and analyzes a new weak Galerkin method for the eigenvalue problem by using the shifted-inverse power technique. A high order lower bound can be obtained at a relatively low cost via the proposed method. The error…
Inverse iteration is known to be an effective method for computing eigenvectors corresponding to simple and well-separated eigenvalues. In the non-symmetric case, the solution of shifted Hessenberg systems is a central step. Existing…