Abstract
Actual calculations carried out on SPP with the use of the REDUCE system made it possible to completely clarify the statement of the inverse problem for the two-dimensional discrete Schrödinger equation. The corresponding symmetric pentadiagonal matrix can be reconstructed from the given spectrum and first k components for all basis eigenvectors. A simple formula is obtained to determine k. The developed algorithm for solving the inverse problem is unstable. Newton iterations do not always converge.
Similar content being viewed by others
REFERENCES
Serdyukova, S.I., Solving Large Systems of Polynomial Equations Using REDUCE, Programmirovanie, 2000, no. 1, pp. 41-43.
Serdyukova, S.I., Inverse Problem for Symmetric Tridiagonal Matrices. Calculation of the System of Discrete Orthogonal Polynomials with Arbitrary Weight, Russ. J. Numer. Anal. Math. Modeling, 1993, vol. 8, no. 3, pp. 245-263.
Hearn, A.C., REDUCE User's Manual, Version 3.6, Santa Monica, CA, 1995.
Serdyukova, S.I., Inverse Problem for the Two-Dimensional Discrete Schrödinger Equation, Preprint of Joint Inst. for Nuclear Res., Dubna, 2000, no. P11-2000-57.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Serdyukova, S.I. Solution of the Inverse Problem for the Two-Dimensional Discrete Schrödinger Equation Using REDUCE. Programming and Computer Software 27, 4–5 (2001). https://doi.org/10.1023/A:1007122416559
Issue Date:
DOI: https://doi.org/10.1023/A:1007122416559