Abstract
A mixed problem and its approximation in an abstract framework are considered. They are proved to be well posed if and only if several inf-sup conditions are satisfied. These results are applied to the Stokes equations in a square, formulated in Chebyshev weighted Sobolev spaces and their approximations. Two kinds of spectral discretizations are analyzed: a Galerkin method and a collocation method at the Chebyshev nodes.
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.
