Abstract
Convergent numerical schemes for degenerate elliptic partial differential equations are constructed and implemented. Simple conditions are identified which ensure that nonlinear finite difference schemes are monotone and nonexpansive in the maximum norm. Explicit schemes endowed with an explicit CFL condition are built for time-dependent equations and are used to solve stationary equations iteratively. Explicit and implicit formulations of monotonicity for first- and second-order equations are unified. Bounds on orders of accuracy are established. An example of a scheme which is stable, but nonmonotone and nonconvergent, is presented. Schemes for Hamilton--Jacobi equations, obstacle problems, one-phase free boundary problems, and stochastic games are built and computational results are presented.
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.