scientific article; zbMATH DE number 3881806
[For the entire collection see Zbl 0536.00008.] This paper deals with the numerical solution of boundary value problems of order 2m. The method of variation of constants combined with a spline approximation for the derivative of coefficients is used. This method is suggested to construct a fast algorithm for the numerical solution of a system of 2m equations (the number of operations is \(m^ 3\) and 2m integrations are used). The computational effort at the given point is proportional to \(m^ 3+2mN\), where N is the number of points that are used by the spline approximation. Under the assumption that the solution of the boundary value problem exists it is shown on several examples that the mentioned algorithm is a fast algorithm.
- A decoupled direct method for the solution of ordinary boundary value problems
- A fast algorithm for linear least-squares smoothing and boundary value problems using number-theoretic transforms
- Improving performance when solving high-order and mixed-order boundary value problems in ODEs
- Spline petrov-galerkin methods with quadrature
- Fast variants of the NSC-RKHS algorithm for solving linear boundary value problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3216063)