Numerical approximation of equations involving minimal/maximal operators by successive solution of obstacle problems

Let Ω⊂R2 be a polygonal domain, and let Li, i=1,2, be two elliptic operators of the form Liu(x):=−div(Aix∇u(x))+cixu(x)−fix.Motivated by the results in Blanc et al. (2016), we propose a numerical iterative method to compute the numerical approximation to the solution of the minimal problem minL1u,L2...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Agnelli, J.P., Kaufmann, U., Rossi, J.D.
Formato: JOUR
Materias:
Acceso en línea:http://hdl.handle.net/20.500.12110/paper_03770427_v342_n_p133_Agnelli
Aporte de:
id todo:paper_03770427_v342_n_p133_Agnelli
record_format dspace
spelling todo:paper_03770427_v342_n_p133_Agnelli2023-10-03T15:31:30Z Numerical approximation of equations involving minimal/maximal operators by successive solution of obstacle problems Agnelli, J.P. Kaufmann, U. Rossi, J.D. Maximal operators Numerical approximations Obstacle problems Iterative methods Elliptic operator Minimal problems Numerical approximations Numerical iterative methods Obstacle problems Polygonal domain Convergence of numerical methods Let Ω⊂R2 be a polygonal domain, and let Li, i=1,2, be two elliptic operators of the form Liu(x):=−div(Aix∇u(x))+cixu(x)−fix.Motivated by the results in Blanc et al. (2016), we propose a numerical iterative method to compute the numerical approximation to the solution of the minimal problem minL1u,L2u=0in Ω,u=0on ∂Ω.The convergence of the method is proved, and numerical examples illustrating our results are included. © 2018 Elsevier B.V. JOUR info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by/2.5/ar http://hdl.handle.net/20.500.12110/paper_03770427_v342_n_p133_Agnelli
institution Universidad de Buenos Aires
institution_str I-28
repository_str R-134
collection Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA)
topic Maximal operators
Numerical approximations
Obstacle problems
Iterative methods
Elliptic operator
Minimal problems
Numerical approximations
Numerical iterative methods
Obstacle problems
Polygonal domain
Convergence of numerical methods
spellingShingle Maximal operators
Numerical approximations
Obstacle problems
Iterative methods
Elliptic operator
Minimal problems
Numerical approximations
Numerical iterative methods
Obstacle problems
Polygonal domain
Convergence of numerical methods
Agnelli, J.P.
Kaufmann, U.
Rossi, J.D.
Numerical approximation of equations involving minimal/maximal operators by successive solution of obstacle problems
topic_facet Maximal operators
Numerical approximations
Obstacle problems
Iterative methods
Elliptic operator
Minimal problems
Numerical approximations
Numerical iterative methods
Obstacle problems
Polygonal domain
Convergence of numerical methods
description Let Ω⊂R2 be a polygonal domain, and let Li, i=1,2, be two elliptic operators of the form Liu(x):=−div(Aix∇u(x))+cixu(x)−fix.Motivated by the results in Blanc et al. (2016), we propose a numerical iterative method to compute the numerical approximation to the solution of the minimal problem minL1u,L2u=0in Ω,u=0on ∂Ω.The convergence of the method is proved, and numerical examples illustrating our results are included. © 2018 Elsevier B.V.
format JOUR
author Agnelli, J.P.
Kaufmann, U.
Rossi, J.D.
author_facet Agnelli, J.P.
Kaufmann, U.
Rossi, J.D.
author_sort Agnelli, J.P.
title Numerical approximation of equations involving minimal/maximal operators by successive solution of obstacle problems
title_short Numerical approximation of equations involving minimal/maximal operators by successive solution of obstacle problems
title_full Numerical approximation of equations involving minimal/maximal operators by successive solution of obstacle problems
title_fullStr Numerical approximation of equations involving minimal/maximal operators by successive solution of obstacle problems
title_full_unstemmed Numerical approximation of equations involving minimal/maximal operators by successive solution of obstacle problems
title_sort numerical approximation of equations involving minimal/maximal operators by successive solution of obstacle problems
url http://hdl.handle.net/20.500.12110/paper_03770427_v342_n_p133_Agnelli
work_keys_str_mv AT agnellijp numericalapproximationofequationsinvolvingminimalmaximaloperatorsbysuccessivesolutionofobstacleproblems
AT kaufmannu numericalapproximationofequationsinvolvingminimalmaximaloperatorsbysuccessivesolutionofobstacleproblems
AT rossijd numericalapproximationofequationsinvolvingminimalmaximaloperatorsbysuccessivesolutionofobstacleproblems
_version_ 1807317915104444416