A recursive formulation of collocation in terms of canonical polynomials (Q1319047): Difference between revisions

For boundary value problems of linear differential operators with polynomial coefficients two related but analytically different techniques are discussed: the collocation method and Ortiz's recursive formulation of the tau method. First the authors show that it is possible to simulate with the tau method collocation approximants for any desired degree in terms of shifted canonical polynomials. In the linear case a collocation approximants of order \(N\) by this approach is shown to require \(O(N)\) arithmetic operations while obtaining the same approximants by the direct approach involves \(O(N^ 3)\). Several linear and nonlinear numerical examples are given to illustrate the new approach.