Abstract
Efficient direct solvers based on the Chebyshev–Galerkin methods for second- and fourth-order equations are presented. They are based on appropriate base functions for the Galerkin formulation that lead to discrete systems with special structured matrices that can be efficiently inverted. Numerical results indicate that the direct solvers presented in this paper are significantly more accurate and efficient than those based on the Chebyshev-tau method.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
