Fast Algorithms for the Solution of Eigenfunction Problems for One-Dimensional Self-Adjoint Linear Differential Operators
YALE UNIV NEW HAVEN CT DEPT OF COMPUTER SCIENCE
Pagination or Media Count:
We cite techniques that immediately yield theoretically efficient algorithms for computing solutions to eigenfunction problems for self-adjoint linear differential operators of any finite order acting on real-valued functions on the interval these algorithms incur computational costs that are nearly optimally small, to within factors that are constant multiples of small powers of the logarithm of the problem size. However, the factors in the computational costs are in general too large for practical applications the algorithms would appear to require careful, detailed optimizations for each particular application in order to be useful in practice.
- Numerical Mathematics
- Theoretical Mathematics