Comments on: “A comparison of global methods for linear two-point boundary value problems” (Math. Comp. 29 (1975), no. 132, 1007–1019) by R. D. Russell and J. M. Varah
Open Access
- 1 January 1977
- journal article
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 31 (140), 916-921
- https://doi.org/10.1090/s0025-5718-1977-0501939-4
Abstract
A more careful count of the operations involved in solving the linear system associated with collocation of a two-point boundary value problem using rough splines reverses results recently reported by others in this journal. In addition, it is observed that the use of the technique of "condensation of parameters" can decrease the computer storage required. Furthermore, the use of a particular highly localized basis can also reduce the setup time when the mesh is irregular. Finally, operation counts are roughly estimated for the solution of certain linear systems associated with two competing collocation methods; namely, collocation with smooth splines and collocation of the equivalent first order system with continuous piecewise polynomials.Keywords
This publication has 7 references indexed in Scilit:
- A Comparison of Collocation and Finite Differences for Two-Point Boundary Value ProblemsSIAM Journal on Numerical Analysis, 1977
- A Comparison of Global Methods for Linear Two-Point Boundary Value ProblemsMathematics of Computation, 1975
- A comparison of global methods for linear two-point boundary value problemsMathematics of Computation, 1975
- Collocation for systems of boundary value problemsNumerische Mathematik, 1974
- The Application of Implicit Runge-Kutta and Collocation Methods to Boundary-Value ProblemsMathematics of Computation, 1974
- The application of implicit Runge-Kutta and collection methods to boundary-value problemsMathematics of Computation, 1974
- Collocation at Gaussian PointsSIAM Journal on Numerical Analysis, 1973