The Tau method as an analytic tool in the discussion of equivalence results across numerical methods.

*(English)*Zbl 0908.65072Authors’ abstract: A Tau method approximate solution of a given differential equation defined on a compact \([a,b]\) is obtained by adding to the right-hand side of the equation a specific minimal polynomial perturbation term \(H_n(x)\), which plays the role of a representation of zero in \([a,b]\) by elements of a given subspace of polynomials. Neither discretization or orthogonality are involved in this process of approximation. However, there are interesting relations between the Tau method and approximation methods based on the former techniques.

In this paper, we use equivalence results for collocation and the Tau method, contributed recently by the authors together with classical results in the literature, to identify precisely the perturbation term \(H(x)\) which would generate a Tau method approximate solution, identical to that generated by some specific discrete methods over a given mesh \(\Pi\in[a,b]\). Finally, we discuss a technique which solves the inverse problem, that is, to find a discrete perturbed Runge-Kutta scheme which would simulate a prescribed Tau method. We have chosen, as an example, a Tau method which recovers the same approximation as an orthogonal expanion method. In this way, we close the diagram defined by finite difference methods, collocation schemes, spectral techniques and the Tau method through a systematic use of the latter as an analytical tool.

In this paper, we use equivalence results for collocation and the Tau method, contributed recently by the authors together with classical results in the literature, to identify precisely the perturbation term \(H(x)\) which would generate a Tau method approximate solution, identical to that generated by some specific discrete methods over a given mesh \(\Pi\in[a,b]\). Finally, we discuss a technique which solves the inverse problem, that is, to find a discrete perturbed Runge-Kutta scheme which would simulate a prescribed Tau method. We have chosen, as an example, a Tau method which recovers the same approximation as an orthogonal expanion method. In this way, we close the diagram defined by finite difference methods, collocation schemes, spectral techniques and the Tau method through a systematic use of the latter as an analytical tool.

Reviewer: Z.Jackiewicz (Tempe)

##### MSC:

65L60 | Finite element, Rayleigh-Ritz, Galerkin and collocation methods for ordinary differential equations |

65L05 | Numerical methods for initial value problems |

34A34 | Nonlinear ordinary differential equations and systems, general theory |

##### Software:

RODAS
PDF
BibTeX
XML
Cite

\textit{M. K. El-Daou} and \textit{E. L. Ortiz}, Computing 60, No. 4, 365--376 (1998; Zbl 0908.65072)

Full Text:
DOI

##### References:

[1] | Dahlquist, G.: One-leg multistep methods. SIAM J. Numer. Anal.20, 1130–1138 (1983). · Zbl 0529.65048 · doi:10.1137/0720082 |

[2] | El-Daou, M. K., Ortiz, E. L.: A recursive formulation of collocation in terms of canonical polynomials. Computing52, 177–202 (1994). · Zbl 0797.65056 · doi:10.1007/BF02238075 |

[3] | El-Daou, M. K., Ortiz, E. L., Samara, H.: A unified approach to the Tau Method and Chebyshev series expansions techniques. Comput. Math. Appl.25, 73–82 (1992). · Zbl 0777.65051 · doi:10.1016/0898-1221(93)90145-L |

[4] | Hairer, E., Wanner, G.: Solving ordinary differential equations II: Stiff and differential-algebraic problems, pp. 290–292. Berlin, Heidelberg, New York, Tokyo: Springer-Verlag 1991. · Zbl 0729.65051 |

[5] | Lambert, J. D.: Computational methods in ordinary differential equations. New York: J. Wiley 1973. · Zbl 0258.65069 |

[6] | Lanczos, C.: Trigonometric interpolation of empirical and analytical functions. J. Math. Phys.17, 123–199 (1938). · Zbl 0020.01301 |

[7] | Lie, I., Nørsett, S. P.: Superconvergence for multistep collocations. Math Comp.52, 65–79 (1989). · Zbl 0658.65063 · doi:10.1090/S0025-5718-1989-0971403-5 |

[8] | Nørsett, S. P.: Collocation and perturbed collocation methods. In: Watson, G. A. (ed.), Numerical analysis, Dundee 1979, pp. 119–132. Berlin Heidelberg New York: Springer 1980 (Lecture Notes in Mathematics, Vol 773). |

[9] | Nørsett, S. P., Wanner, G.: Perturbed collocation and Runge-Kutte methods. Numer. Math.38, 193–208 (1981). · Zbl 0471.65045 · doi:10.1007/BF01397089 |

[10] | Onumanyi, P., Ortiz, E. L.: Numerical solution of stiff and singularly perturbed boundary value problems with a segmented-adaptive formulation of the Tau Method. Math Comp.43, 189–203 (1984). · Zbl 0574.65091 · doi:10.1090/S0025-5718-1984-0744930-9 |

[11] | Onumanyi P., Awoyemi D. O., Jator S. N., Sirisena U. W.: New linear multi-step methods with continuous coefficients for first order IVPs. J. Nigerian Math. Soc.13, 37–51 (1994). |

[12] | Ortiz E. L.: The Tau method. SIAM J. Numer. Anal.6, 480–492 (1969). · Zbl 0195.45701 · doi:10.1137/0706044 |

[13] | Ortiz E. L., Rodriguez Cañizares F. J.: Remarks on a discrete Tau Method. Imperial College Res. Rep. 1–10 (1972). |

[14] | Wright K.: Some relationships between implicit Runge-Kutta, collocation and Lanczos\(\tau\)-methods and their stability properties. BIT10, 217–227 (1970). · Zbl 0208.41602 · doi:10.1007/BF01936868 |

This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.