2014/11/10 by Charles Schwartz, Schwartz, Charles
Engineering · Physics and Astronomy · #Advanced Numerical Methods in Computational Mathematics #Model Reduction and Neural Networks #Scientific Research and Discoveries #physics.atom-ph #physics.comp-ph #quant-ph
paper · pdf · doi:10.48550/arxiv.1411.2965
8 pages
arxiv created 2014/11/10 · arxiv updated 2014/11/13
The most common method for calculating accurate numerical solutions for complicated linear differential equations - for example, finding eigenvalues and eigenfunctions of the Schrodinger equation for many-electron atoms - is the variational method with some convenient basis of functions. This leads to a finite matrix representation of the operators involved; and standard numerical operations - such as Gaussian elimination - may be employed. When the basis functions are not orthogonal, one expects substantial loss of numerical accuracy in those matrix manipulations; and so multiple-precision arithmetic is often required for useful results. In this paper, for the first time, we offer a way to estimate the rate at which numerical cancellations will grow in severity as one increases the basis size. For the familiar case of using simple power series, xn, n<N as the basis instead of orthogonal polynomials, we predict a loss of about 2N bits or 4N bits of numerical accuracy.