SIAM Journal on Numerical Analysis · 2014 · 76 citations · 68 references
ComputingComputer ScienceMathematicsAlgorithmsScientific ComputingTheory Of ComputationMatrix ComputationNumerical AlgorithmsNumerical AnalysisNumerical IntegrationNumerical Methods For Differential EquationsRoot FindingAnalytic ApproximationsComputational Linear AlgebraMeromorphic FunctionsNumerical Methods For Integral EquationsPolynomial InterpolationRational Function ComputationRational InterpolationRoot Finding Algorithms
Let $f(z)$ be an analytic or meromorphic function in the closed unit disk sampled at the $n$th roots of unity. Based on these data, how can we approximately evaluate $f(z)$ or $f^{(m)}(z)$ at a point $z$ in the disk? How can we calculate the zeros or poles of $f$ in the disk? These questions exhibit in the purest form certain algorithmic issues that arise across computational science in areas including integral equations, partial differential equations, and large-scale linear algebra. We analyze some of the possibilities and emphasize the distinction between algorithms based on polynomial or rational interpolation and those based on trapezoidal rule approximations of Cauchy integrals. We then show how these developments apply to the problem of computing the eigenvalues in the disk of a matrix of large dimension. Finally we highlight the power of rational in comparison with polynomial approximations for some of these problems.
68
Linear scaling electronic structure methods
Stefan Goedecker · Reviews of Modern Physics · 1999 · 1.4K citations
Natural Sciences, Materials Science, Computational Chemistry +16
Barycentric Lagrange Interpolation
Jean‐Paul Berrut, Lloyd N. Trefethen · SIAM Review · 2004 · 1.2K citations
Fourth-Order Time-Stepping for Stiff PDEs
Aly-Khan Kassam, Lloyd N. Trefethen · SIAM Journal on Scientific Computing · 2005 · 944 citations