Abstract
An algorithm for approximating numerical solution to Korteweg-de Vries (KdV) and Korteweg-de Vries-Burger’s (KdVB) equations in B-polynomials (Bernstein polynomial basis) is introduced. The algorithm expands the desired solution in terms of B-polynomials over a closed interval [a, b], and then makes use of the orthonormal relation of B-polynomials with its dual basis to determine the expansion coefficients to construct a solution. Matrix formulation is used throughout the entire procedure. Numerical results obtained using the current algorithm are compared with existing analytical results. Excellent agreement is found between the exact and approximate solutions.
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.
