SIAM Journal on Scientific Computing · 2014 · 80 citations · 23 references
ComputingComputational EngineeringComputational GeometryComputational MechanicsComputational PhysicsConvergence AnalysisIntegral EquationsNumerical AlgorithmsNumerical AnalysisNumerical IntegrationNumerical Methods For Differential EquationsComposite QuadratureLinear InterpolationNumerical Methods For Integral EquationsPrecisionQuadrature RulesRational InterpolationVolterra EquationsVolterra Integral Equations
We introduce two direct quadrature methods based on linear rational interpolation for solving general Volterra integral equations of the second kind. The first, deduced by a direct application of linear barycentric rational quadrature given in former work, is shown to converge at the same rate as the rational quadrature rule but is costly on long integration intervals. The second, based on a composite version of this quadrature rule, loses one order of convergence but is much cheaper. Both require only a sample of the involved functions at equispaced nodes and yield an infinitely smooth solution of most classical examples with machine precision.
23
An Introduction to Numerical Analysis
F. S., Kendall Atkinson · Mathematics of Computation · 1990 · 3.1K citations
Barycentric Lagrange Interpolation
Jean‐Paul Berrut, Lloyd N. Trefethen · SIAM Review · 2004 · 1.2K citations
Is Gauss Quadrature Better than Clenshaw–Curtis?
Lloyd N. Trefethen · SIAM Review · 2008 · 631 citations