On the numerical solution of the equation and its discretizations, I Export

@article{citeulike:2854023, abstract = {Summary The equation indicated in the title is the simplest representative of the class of nonlinear equations of Monge-Ampere type. Equations with such nonlinearities arise in dynamic meteorology, geometric optics, elasticity and differential geometry. In some special cases heuristic procedures for numerical solution are available, but in order for them to be successful a good initial guess is required. For a bounded convex domain, nonnegativef and Dirichlet data we consider a special discretization of the equation based on its geometric interpretation. For the discrete version of the problem we propose an iterative method that produces a monotonically convergent sequence. No special information about an initial guess is required, and to initiate the iterates a routine step is made. The method is self-correcting and is structurally suitable for a parallel computer. The computer program modules and several examples are presented in two appendices.}, author = {Oliker, V. I. and Prussner, L. D.}, citeulike-article-id = {2854023}, citeulike-linkout-0 = {http://dx.doi.org/10.1007/BF01396762}, doi = {10.1007/BF01396762}, journal = {Numerische Mathematik}, keywords = {convex, monge-ampere, numerical}, month = {May}, number = {3}, pages = {271--293}, posted-at = {2008-06-01 08:48:35}, priority = {2}, title = {On the numerical solution of the equation and its discretizations, I}, url = {http://dx.doi.org/10.1007/BF01396762}, volume = {54}, year = {1989} }

TY - JOUR ID - citeulike:2854023 L3 - citeulike-article-id:2854023 N2 - Summary The equation indicated in the title is the simplest representative of the class of nonlinear equations of Monge-Ampere type. Equations with such nonlinearities arise in dynamic meteorology, geometric optics, elasticity and differential geometry. In some special cases heuristic procedures for numerical solution are available, but in order for them to be successful a good initial guess is required. For a bounded convex domain, nonnegativef and Dirichlet data we consider a special discretization of the equation based on its geometric interpretation. For the discrete version of the problem we propose an iterative method that produces a monotonically convergent sequence. No special information about an initial guess is required, and to initiate the iterates a routine step is made. The method is self-correcting and is structurally suitable for a parallel computer. The computer program modules and several examples are presented in two appendices. IS - 3 JF - Numerische Mathematik EP - 293 TI - On the numerical solution of the equation and its discretizations, I VL - 54 SP - 271 KW - convex KW - monge-ampere KW - numerical AU - Oliker, VI AU - Prussner, LD PY - 1989/05/01/ UR - http://dx.doi.org/10.1007/BF01396762 ER -