Abstract
We have defined and established the superconvergence of the Sloan iterate obtained from a polynomial Galerkin approximation for solving the generalized airfoil equation. When all the integrals involved are evaluated by using Gaussian quadratures with the same number of nodes as basis elements, the resulting discrete Sloan iterate becomes the Nyström approximation obtained by using the same rules. From this it follows that the discrete Sloan iterate v̂ n and the discrete Galerkin approximation v n agree at the quadrature nodes. Thus v̂ n converges no faster locally than v n . For practical purposes, computational superconvergence does not occur.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.