Files
MeltMind/references/2026-11-17/phase1-physics/physics_obstacle_identity.json

89 lines
28 KiB
JSON
Raw Permalink Blame History

This file contains ambiguous Unicode characters
This file contains Unicode characters that might be confused with other characters. If you think that this is intentional, you can safely ignore this warning. Use the Escape button to reveal them.
{
"search_id": "search_e65cf74c424328c32bc678b2e79f51c5",
"results": [
{
"url": "https://arxiv.org/abs/1404.1370",
"title": "[1404.1370] An L1 Penalty Method for General Obstacle Problems",
"publish_date": "2014-04-04",
"excerpts": [
"Cornell University\narXiv submission will be down for maintenance beginning 14:00 EDT Tuesday June 30th. The site should otherwise remain in operation.\nLearn about arXiv becoming an independent nonprofit.\nWe gratefully acknowledge support from the Simons Foundation, member institutions , and all contributors. Donate\narxiv logo > math > arXiv:1404.1370\nHelp | Advanced Search\nAll fields Title Author Abstract Comments Journal reference ACM classification MSC classification Report number arXiv identifier DOI ORCID arXiv author ID Help pages Full text\nSearch\narXiv logo\nGO\n\nquick links\n\n* Login\n* Help Pages\n* About\n\nMathematics > Numerical Analysis\n\narXiv:1404.1370 (math)\n[Submitted on 4 Apr 2014]\n\nTitle: An L1 Penalty Method for General Obstacle Problems\n\nAuthors: Giang Tran , Hayden Schaeffer , William M. Feldman , Stanley J. Osher\nView PDF\nAbstract: We construct an efficient numerical scheme for solving obstacle problems in divergence form. The numerical method is based on a reformulation of the obstacle in terms of an L1-like penalty on the variational problem. The reformulation is an exact regularizer in the sense that for large (but finite) penalty parameter, we recover the exact solution. Our formulation is applied to classical elliptic obstacle problems as well as some related free boundary problems, for example the two-phase membrane problem and the Hele-Shaw model. One advantage of the proposed method is that the free boundary inherent in the obstacle problem arises naturally in our energy minimization without any need for problem specific or complicated discretization. In addition, our scheme also works for nonlinear variational inequalities arising from convex minimization problems.\n* Comments: | 20 pages, 18 figures\n* Subjects: | Numerical Analysis (math.NA)\n* Cite as: | arXiv:1404.1370 [math.NA]\n* | (or arXiv:1404.1370v1 [math.NA] for this version)\n* | doi.org/10.48550/arXiv.1404.1370 Focus to learn more arXiv-issued DOI via DataCite\n\nSubmission history\n\nFrom: Giang Tran [ view email ] [v1] Fri, 4 Apr 2014 18:40:37 UTC (298 KB)\nFull-text links:\n\nAccess Paper:\n\n* View PDF\n* TeX Source\nview license\n\nCurrent browse context:\n\nmath.NA\n< prev | next >\nnew | recent | 2014-04\nChange to browse by:\ncs cs.NA math\n\nReferences & Citations"
]
},
{
"url": "https://epubs.siam.org/doi/10.1137/140963303",
"title": "An $L^1$ Penalty Method for General Obstacle Problems",
"publish_date": null,
"excerpts": [
"An $L^1$ Penalty Method for General Obstacle Problems\nWe construct an efficient numerical scheme for solving obstacle problems in divergence form. The numerical method is based on a reformulation of the"
]
},
{
"url": "https://openalex.org/works/W2093346147",
"title": "An $L^1$ Penalty Method for General Obstacle Problems",
"publish_date": null,
"excerpts": [
"description: 2015 article in SIAM Journal on Applied Mathematics by Tran, Schaeffer, Feldman and 1 other; 36 citations; open access title: An $L^1$ Penalty Method for General Obstacle Problems image: openalex.org/brand-assets/openalex-mark-square.png\n\nWork\nAdd to collection\n\nAn $L^1$ Penalty Method for General Obstacle Problems\n\nHTML PDF\nDetailsLocations\nYear: 2015\nType: article\nAbstract: We construct an efficient numerical scheme for solving obstacle problems in divergence form. The numerical method is based on a reformulation of the obstacle in terms of an $L^1$-like penalty on the variational problem. The reformulation is an exact regularizer in the sense that for a large (but finite) penalty parameter, we recover the exact solution. Our formulation is applied to classical elliptic obstacle problems as well as some related free boundary problems, for example, the two-phase membrane problem and the Hele--Shaw model. One advantage of the proposed method is that the free boundary inherent in the obstacle problem arises naturally in our energy minimization without any need for problem specific or complicated discretization. In addition, our scheme also works for nonlinear variational inequalities arising from convex minimization problems.\nmore\nSource: SIAM Journal on Applied Mathematics\nDOI: 10.1137/140963303\nAuthors: Giang Tran, Hayden Schaeffer, William M. Feldman, Stanley J. Osher\nInstitutions: University of California, Los Angeles, California Institute of Technology\nLanguage: English\nTopic: Advanced Numerical Methods in Computational Mathematics\nSubfield: Computational Mechanics\nField: Engineering\nDomain: Physical Sciences\nOpen Access status: green\nFunder: National Science Foundation\nAward: PostDoctoral Research Fellowship\nOpenAlex ID: W2093346147\nFWCI: 3.8\nCites: 52\nCited by: 36\nRelated to: 10\n{\"@context\":\"schema.org\",\"@type\":\"ScholarlyArticle\",\"@id\":\"openalex.org/works/W2093346147\",\"url\":\"openalex.org/works/W2093346147\",\"name\":\"An $L^1$ Penalty Method for General Obstacle Problems\",\"headline\":\"An $L^1$ Penalty Method for General Obstacle Problems\",\"datePublished\":\"2015-01-01\",\"inLanguage\":\"en\",\"abstract\":\"We construct an efficient numerical scheme for solving obstacle problems in divergence form. The numerical method is based on a reformulation of the obstacle in terms of an $L^1$-like penalty on the variational problem. The reformulation is an exact regularizer in the sense that for a large (but finite) penalty parameter, we recover the exact solution. Our formulation is applied to classical elliptic obstacle problems as well as some related free boundary problems, for example, the two-phase membrane problem and the Hele--Shaw model. One advantage of the proposed method is that the free boundary inherent in the obstacle problem arises naturally in our energy minimization without any need for problem specific or complicated discretization. In addition, our scheme also works for nonlinear variational inequalities arising from convex minimization problems.\",\"author\":[{\"@type\":\"Person\",\"name\":\"Giang Tran\",\"affiliation\":[{\"@type\":\"Organization\",\"name\":\"University of California, Los Angeles\",\"url\":\"openalex.org/institutions/I161318765\",\"sameAs\":[\"ror.org/046rm7j60\"],\"address\":{\"@type\":\"PostalAddress\",\"addressCountry\":\"US\"}}]},{\"@type\":\"Person\",\"name\":\"Hayden Schaeffer\",\"url\":\"openalex.org/authors/A5086926394\",\"sameAs\":[\"orcid.org/0000-0003-1379-1238\"],\"affiliation\":[{\"@type\":\"Organization\",\"name\":\"California Institute of Technology\",\"url\":\"openalex.org/institutions/I122411786\",\"sameAs\":[\"ror.org/05dxps055\"],\"address\":{\"@type\":\"PostalAddress\",\"addressCountry\":\"US\"}}]},{\"@type\":\"Person\",\"name\":\"William M. Feldman\",\"url\":\"openalex.org/authors/A5068394946\",\"sameAs\":[\"orcid.org/0000-0001-6038-4569\"],\"affiliation\":[{\"@type\":\"Organization\",\"name\":\"University of California, Los Angeles\",\"url\":\"openalex.org/institutions/I161318765\",\"sameAs\":[\"ror.org/046rm7j60\"],\"address\":{\"@type\":\"PostalAddress\",\"addressCountry\":\"US\"}}]},{\"@type\":\"Person\",\"name\":\"Stanley Osher\",\"url\":\"openalex.org/authors/A5002037883\",\"sameAs\":[\"orcid.org/0000-0002-7900-4658\"],\"affiliation\":[{\"@type\":\"Organization\",\"name\":\"University of California, Los Angeles\",\"url\":\"openalex.org/institutions/I161318765\",\"sameAs\":[\"ror.org/046rm7j60\"],\"address\":{\"@type\":\"PostalAddress\",\"addressCountry\":\"US\"}}]}],\"isPartOf\":{\"@type\":\"Periodical\",\"name\":\"SIAM Journal on Applied Mathematics\",\"url\":\"openalex.org/sources/S77200987\",\"issn\":[\"0036-1399\",\"1095-712X\"],\"publisher\":{\"@type\":\"Organization\",\"name\":\"Society for Industrial and Applied Mathematics\",\"url\":\"openalex.org/publishers/P4310320508\"}},\"identifier\":[{\"@type\":\"PropertyValue\",\"propertyID\":\"DOI\",\"value\":\"10.1137/140963303\"},{\"@type\":\"PropertyValue\",\"propertyID\":\"OpenAlex\",\"value\":\"W2093346147\"}],\"sameAs\":[\"doi.org/10.1137/140963303\"],\"isAccessibleForFree\":true,\"about\":[{\"@type\":\"DefinedTerm\",\"name\":\"Advanced Numerical Methods in Computational Mathematics\",\"url\":\"openalex.org/topics/T10339\"},{\"@type\":\"DefinedTerm\",\"name\":\"Contact Mechanics and Variational Inequalities\",\"url\":\"openalex.org/topics/T12809\"},{\"@type\":\"DefinedTerm\",\"name\":\"Nonlinear Partial Differential Equations\",\"url\":\"openalex.org/topics/T10194\"}],\"keywords\":\"obstacle problem, divergence form elliptic equations, free boundary problem, Hele-Shaw model, variational inequalities, convex minimization, energy minimization\",\"funder\":[{\"@type\":\"Organization\",\"name\":\"National Science Foundation\",\"url\":\"openalex.org/funders/F4320306076\"}],\"interactionStatistic\":{\"@type\":\"InteractionCounter\",\"interactionType\":\"schema.org/CiteAction\",\"userInteractionCount\":36}}"
]
},
{
"url": "https://arxivlens.com/paperview/details/an-l1-penalty-method-for-general-obstacle-problems-8528-522630",
"title": "An L1 Penalty Method for General Obstacle Problems |...",
"publish_date": "2014-04-08",
"excerpts": [
"ArxivLens\nDiscover\nAI Search Researchers Categories Conferences Recommendations Trending\nTools\nCompare Papers Literature Review PDF Summarizer Arxiv to Markdown Chinese Translation\nRead\nBlog Explained Guides Weekly Summaries\nSign in for more\nRSS Feeds Shortcuts About Collapse navigation\nArxivLens\n/\nLogin Sign Up Free\nBack ArXiv math.NA\nArXiv math.NA\n\nAn L1 Penalty Method for General Obstacle Problems\n\n1404.1370 Published Apr 8, 2014\nRead paper Cite More tools\nChat with paper 中文 View PDF Share\nOverview Analysis Cite Related research Discussion\nAt a glance AI-generated · verify against the paper\nThis paper proposes an L1 penalty method for solving divergence form obstacle problems, reformulating the obstacle via an L1-like penalty that recovers the exact solution for large penalty parameters. The method naturally handles free boundaries without complex discretization and is applicable to both classical elliptic problems and nonlinear variational inequalities.\n\nAbstract\n\nWe construct an efficient numerical scheme for solving obstacle problems in divergence form. The numerical method is based on a reformulation of the obstacle in terms of an L1-like penalty on the variational problem. The reformulation is an exact regularizer in the sense that for large (but finite) penalty parameter, we recover the exact solution. Our formulation is applied to classical elliptic obstacle problems as well as some related free boundary problems, for example the two-phase membrane problem and the Hele-Shaw model. One advantage of the proposed method is that the free boundary inherent in the obstacle problem arises naturally in our energy minimization without any need for problem specific or complicated discretization. In addition, our scheme also works for nonlinear variational inequalities arising from convex minimization problems.\nminimization problems variational exact problem boundary scheme membrane\n\nAI Key Findings\n\nGet AI-generated insights about this paper's methodology, results, significance, and more — available when analysis has been generated.\nGenerate Key Findings\nPaper preview View the original document\n\nPDF Preview\n\nPreview PDF Download PDF\nPage: 1 / 1\nPreview of the original paper\n\n...\n\nImpact\n\n56\nReferences\n3\nInfluential\n\nPaper Details\n\nPaper ID: 1404.1370\nLicense: arxiv.org/licenses/nonexclusive-distrib/1.0/\nComments: 20 pages, 18 figures\nCategories:\nmath.NA\nView on arXiv Download PDF\n\nKey Terms\n\nminimization (0.272)\nproblems (0.241)\nvariational (0.227)\nexact (0.197)\nproblem (0.193)\nboundary (0.188)\nscheme (0.188)\nmembrane (0.183)\n×"
]
},
{
"url": "https://www.wovepaper.com/papers/1404.1370-an-l1-penalty-method-for-general-obstacle-problems",
"title": "An L1 Penalty Method for General Obstacle Problems",
"publish_date": null,
"excerpts": [
"An L1 Penalty Method for General Obstacle Problems\n\narXiv 1404.1370, published 2014-04-04. No model-written summary yet — the abstract is the record.\n\nMetadata\n\n* arXiv ID: 1404.1370\n* Primary category: math.NA\n* Categories: math.NA, cs.NA\n* Published: 2014-04-04\n* Updated: 2026-06-04\n* Citations: 7\n* Comment: 20 pages, 18 figures\n\nAuthors\n\n* Giang Tran\n* Hayden Schaeffer\n* William M. Feldman\n* Stanley J. Osher\n\nInstitutions\n\n* Irvine University — US (ROR ror.org/04ysmca02)\n* University of California, Irvine — US (ROR ror.org/04gyf1771)\n* University of California, Los Angeles — US (ROR ror.org/046rm7j60)\n\nAbstract\n\nWe construct an efficient numerical scheme for solving obstacle problems in divergence form. The numerical method is based on a reformulation of the obstacle in terms of an L1-like penalty on the variational problem. The reformulation is an exact regularizer in the sense that for large (but finite) penalty parameter, we recover the exact solution. Our formulation is applied to classical elliptic obstacle problems as well as some related free boundary problems, for example the two-phase membrane problem and the Hele-Shaw model. One advantage of the proposed method is that the free boundary inherent in the obstacle problem arises naturally in our energy minimization without any need for problem specific or complicated discretization. In addition, our scheme also works for nonlinear variational inequalities arising from convex minimization problems.\n\nSource\n\n* arXiv abstract: arxiv.org/abs/1404.1370\n* PDF: arxiv.org/pdf/1404.1370\n* JSON: api.wovepaper.com/api/papers/1404.1370\n\nReferences in this archive\n\n* Compressed Modes for Variational Problems in Mathematics and Physics\n* Sparse Dynamics for Partial Differential Equations\n* Compressive sensing and low-rank libraries for classification of bifurcation regimes in nonlinear dynamical systems\n* Sparse Time Frequency Representations and Dynamical Systems\n\nCited by, in this archive"
]
},
{
"url": "http://arxiv.gg/abs/1404.1370",
"title": "An L1 Penalty Method for General Obstacle Problems - arXiv.gg",
"publish_date": "2014-04-04",
"excerpts": [
"Home | Categories | Help shape arXiv.gg | API | Sign in\n\nAn L1 Penalty Method for General Obstacle Problems\n\n1404.1370 · First submitted 2014-04-04 · Latest revision 2026-06-04 · 0 citations in our index · 🧠 prepared\nGiang Tran , Hayden Schaeffer , William M. Feldman , Stanley J. Osher\nmath.NA cs.NA\nWe construct an efficient numerical scheme for solving obstacle problems in divergence form. The numerical method is based on a reformulation of the obstacle in terms of an L1-like penalty on the variational problem. The reformulation is an exact regularizer in the sense that for large (but finite) penalty parameter, we recover the exact solution. Our formulation is applied to classical elliptic obstacle problems as well as some related free boundary problems, for example the two-phase membrane problem and the Hele-Shaw model. One advantage of the proposed method is that the free boundary inherent in the obstacle problem arises naturally in our energy minimization without any need for problem specific or complicated discretization. In addition, our scheme also works for nonlinear variational inequalities arising from convex minimization problems.\n📄 PDF on arXiv.org 🧠 Refresh Paper ◎ Find Similar Auto-prepare ↗ arxiv.org\n\nKeep this paper in your research trail\n\nCreate a free account to return to papers you opened and continue your research trail. Deep Search requires sign-in and is available when the service is enabled.\nContinue free\nrelated-work\nOriginal on arxiv.org PDF (external)\n\nCitation Graph\n\nReferences are papers this paper cites. Citing papers cite this paper. No reference or citing-paper list is cached yet.\nReset Fullscreen\nThis paper\nReference\nCiting\nMetadata not cached\nLoading citation graph..."
]
},
{
"url": "https://www.academia.edu/68658011/An_L_1_Penalty_Method_for_General_Obstacle_Problems",
"title": "(PDF) An $L^1$ Penalty Method for General Obstacle Problems",
"publish_date": "2015-01-01",
"excerpts": [
"Academia.edu Academia.edu\nLog In Sign Up\n* Log In\n* Sign Up\n* more\n* \n* About\n* Press\n* Papers\n* Terms\n* Privacy\n* Copyright\n* We're Hiring!\n* Help Center\n* less\nOutline\nkeyboard_arrow_down\nTitle\nAbstract\nIntroduction\nNumerical Method\nConclusion\nReferences\nAll Topics\nMathematics\nApplied Mathematics\nFirst page of “An $L^1$ Penalty Method for General Obstacle Problems” PDF Icon\ndownload\nDownload Free PDF\nDownload Free PDF\n\nAn $L^1$ Penalty Method for General Obstacle Problems\n\nProfile image of Giang Tran Giang Tran\n2015, SIAM Journal on Applied Mathematics\ndoi.org/10.1137/140963303\nvisibility\n7 views\ndescription\n17 pages\ndescription See full PDF download Download PDF\nformat_quote Cite\nbookmark Save to Library share Share\nclose\n\nSign up for access to the world's latest research\n\nSign up for free arrow_forward\ncheck Get notified about relevant papers\ncheck Save papers to use in your research\ncheck Join the discussion with peers\ncheck Track your impact\n\nAbstract\n\nWe construct an efficient numerical scheme for solving obstacle problems in divergence form. The numerical method is based on a reformulation of the obstacle in terms of an L 1-like penalty on the variational problem. The reformulation is an exact regularizer in the sense that for large (but finite) penalty parameter, we recover the exact solution. Our formulation is applied to classical elliptic obstacle problems as well as some related free boundary problems, for example the two-phase membrane problem and the Hele-Shaw model. One advantage of the proposed method is that the free boundary inherent in the obstacle problem arises naturally in our energy minimization without any need for problem specific or complicated discretization. In addition, our scheme also works for nonlinear variational inequalities arising from convex minimization problems.\n... Read more\n\n...\n\nAfter setting the positive parameter †, we flrst establish the existence of u† by coupling the method of penalization with that of artiflcial viscosity. The uniqueness proof for u† is based on the technique of doubling the time variable and on an assumption on the local behavior of f(:;:;¡1(:)). An L1-estimate for (u†)†>0 is used to take the limit with † through to the notion of entropy process solution.\ndownload Download free PDF View PDF chevron_right\nSee full PDF download Download PDF\nLoading...\nLoading Preview\nSorry, preview is currently unavailable. You can download the paper by clicking the button above.\n\nReferences (47)\n\n...\n\n11. Luis A Caffarelli. The obstacle problem revisited. Journal of Fourier Analysis and Applications, 4(4):383-402, 1998.\n12. Russel E Caflisch, Stanley J Osher, Hayden Schaeffer, and Giang Tran. PDEs with compressed solutions. arXiv preprint arXiv:1311.5850, 2013.\n13. Jian-Feng Cai, Stanley Osher, and Zuowei Shen. Linearized bregman iterations for compressed sensing. Mathematics of Computation, 78(267):1515-1536, 2009.\n14. Emmanuel J Candes, Yonina C Eldar, Thomas Strohmer, and Vladislav Voroninski. Phase retrieval via matrix completion. SIAM Journal on Imaging Sciences, 6(1):199-225, 2013.\n\n...\n\n22. Avner Friedman. Variational principles and free-boundary problems. Courier Dover Publications, 2010.\n23. Tom Goldstein and Stanley Osher. The split Bregman method for L1-regularized problems. SIAM Journal on Imaging Sciences, 2(2):323-343, 2009.\n24. Björn Gustafsson. Applications of variational inequalities to a moving boundary problem for Hele-Shaw flows. SIAM Journal on Mathematical Analysis, 16(2):279-300, 1985.\n\n...\n\n41. José-Francisco Rodrigues. Obstacle problems in mathematical physics. Elsevier, 1987.\n42. Hayden Schaeffer, Russel Caflisch, Cory D Hauck, and Stanley Osher. Sparse dynamics for partial differential equations. Proceedings of the National Academy of Sciences, 110(17):6634-6639, 2013.\n43. Reinhard Scholz. Numerical solution of the obstacle problem by the penalty method. Computing, 32(4):297-306, 1984."
]
},
{
"url": "https://globalresearchspace.com/space?star=https%3A%2F%2Farxiv.org%2Fabs%2F1404.1370",
"title": "https://globalresearchspace.com/space?star=https%3A%2F%2Farxiv.org%2Fabs%2F1404.1370",
"publish_date": null,
"excerpts": [
"An L1 Penalty Method for General Obstacle Problems\n\nWe construct an efficient numerical scheme for solving obstacle problems in divergence form. The numerical method is based on a reformulation of the obstacle in terms of an L1-like penalty on the variational problem. The reformulation is an exact regularizer in the sense that for large (but finite) penalty parameter, we recover the exact solution. Our formulation is applied to classical elliptic obstacle problems as well as some related free boundary problems, for example the two-phase membrane problem and the Hele-Shaw model. One advantage of the proposed method is that the free boundary inherent in the obstacle problem arises naturally in our energy minimization without any need for problem specific or complicated discretization. In addition, our scheme also works for nonlinear variational inequalities arising from convex minimization problems.\n\nPublication Details\n\nPublished 2014-04-04 Primary Topic Numerical Analysis Type preprint Field-Weighted Citation Impact 0.00\nExplore the Global Research Space Interactive Map\nTGRS Logo TGRS Logo The Global Research Space\nMap / News / Laika\nControls\nIN VIEW | QUERIED | SAVED | ANALYTICS\nDefault ↓ FWCI ↓ Links ↓\nAsk Laika\nALL TIME\nJAN\nFEB\nMAR\nAPR\nMAY\nJUN\nJUL\nAUG\nSEP\nOCT\npreprint\nAsk Laika\n\nAn L1 Penalty Method for General Obstacle Problems\n\nApr 4, 2014\nTopics\nNumerical Analysis\nExpand Zoom to Save\npreprint\nHide Chat\n\nAn L1 Penalty Method for General Obstacle Problems\n\nApril 4, 2014 preprint en\n\nAbstract\n\nWe construct an efficient numerical scheme for solving obstacle problems in divergence form. The numerical method is based on a reformulation of the obstacle in terms of an L1-like penalty on the variational problem. The reformulation is an exact regularizer in the sense that for large (but finite) penalty parameter, we recover the exact solution. Our formulation is applied to classical elliptic obstacle problems as well as some related free boundary problems, for example the two-phase membrane problem and the Hele-Shaw model. One advantage of the proposed method is that the free boundary inherent in the obstacle problem arises naturally in our energy minimization without any need for problem specific or complicated discretization. In addition, our scheme also works for nonlinear variational inequalities arising from convex minimization problems.\nTopics\nNumerical Analysis\narXiv\nZoom to Save\nAI Navigator"
]
},
{
"url": "https://www.arxivdaily.com/papers/1404.1370",
"title": "一个L1惩罚法用于一般障碍问题|arXiv 1404.1370|arXivDaily",
"publish_date": "2014-04-04",
"excerpts": [
"arXivDaily arXiv每日学术速递 周一至周五更新\n公众号 反馈 收藏 登录 注册\n×\narXiv周末暂无论文更新,休息一下吧,周末愉快~~ arXiv周末暂无论文更新,休息一下吧,周末愉快~~\n首页 / 论文 / 1404.1370\narXiv 1404.1370 2014-04-04 math.NA cs.NA\n收藏\n\n一个L1惩罚法用于一般障碍问题\n\nAn L1 Penalty Method for General Obstacle Problems\nUniversity of California, Los Angeles(加州大学洛杉矶分校) ; University of California, Irvine(加州大学尔湾分校) 纠错\nGiang Tran, Hayden Schaeffer, William M. Feldman, Stanley J. Osher\n备注: 20 pages, 18 figures\n阅读 PDF ↗\narXiv 页面 ↗ HTML 原文 ↗\n摘要 英文摘要 相关论文\n\nAI总结:\n\n本文提出一种高效的数值方法解决散度形式的障碍问题,通过L1-like惩罚重构障碍,实现精确正则化,适用于经典椭圆障碍问题及相关自由边界问题。\n\n摘要:\n\n我们构建了一个高效的数值方案来求解散度形式的障碍问题。该数值方法基于将障碍转化为变分问题中的L1-like惩罚。重构是精确正则化的,即对于大但有限的惩罚参数,可以恢复精确解。我们的方法应用于经典椭圆障碍问题以及一些相关的自由边界问题,例如两相膜问题和Hele-Shaw模型。所提方法的优点是,障碍问题固有的自由边界在我们的能量最小化中自然出现,无需特定问题或复杂的离散化。此外,我们的方案也适用于由凸最小化问题产生的非线性变分不等式。\n\n英文摘要:\n\nWe construct an efficient numerical scheme for solving obstacle problems in divergence form. The numerical method is based on a reformulation of the obstacle in terms of an L1-like penalty on the variational problem. The reformulation is an exact regularizer in the sense that for large (but finite) penalty parameter, we recover the exact solution. Our formulation is applied to classical elliptic obstacle problems as well as some related free boundary problems, for example the two-phase membrane problem and the Hele-Shaw model. One advantage of the proposed method is that the free boundary inherent in the obstacle problem arises naturally in our energy minimization without any need for problem specific or complicated discretization. In addition, our scheme also works for nonlinear variational inequalities arising from convex minimization problems.\n机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。\n\n阅读原文\n\n阅读 PDF ↗\narXiv 页面 ↗ HTML 原文 ↗\n\n本文内容\n\n摘要 英文摘要 相关论文\n机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。\n继续探索"
]
},
{
"url": "https://utdirect.utexas.edu/apps/student/coursedocs/nlogon/download/7234357",
"title": "Giang Tran – R.H. Bing Instructor",
"publish_date": null,
"excerpts": [
"Giang Tran\nR.H. Bing Instructor\nDepartment of Mathematics\nUniversity of Texas at Austin\n gtran@math.utexas.edu\n ma.utexas.edu/users/gtran/\nEducation\nUniversity of California, Los Angeles , Los Angeles, California, USA\nPh.D. Mathematics\nSeptember 2015\nThesis: Sparsity-Inducing Methods in Imaging Sciences and Partial Differential Equations\nAdvisor: Stanley Osher\nM.A. Mathematics\nMarch 2011\nUniversity of Strasbourg , Strasbourg, France\nM.S. Mathematics\nJune 2009\nHanoi National University of Education , Hanoi, Vietnam\nB.S. Mathematics\nJune 2006\nEmployment\nUniversity of Texas at Austin , Austin, Texas, USA\nR.H. Bing Instructor\nAugust 2015 – present\nResearch Interests\nSparse modeling, imaging science, variational methods, data science, numerical PDEs, compressive sensing,\nmachine learning, medical imaging, and convex optimization\nAwards and Fellowships\n• R.H. Bing Fellowship, University of Texas at Austin\n2015–2018\n• SIAM Student Paper Prize (one of three awardees annually)\n2015\n• Beckenbach Dissertation Year Fellowship, UCLA\n2014–2015\n• SIAM Student Travel Award\n2014\n• Vietnam Education Foundation Fellow, Vietnam\n2009–2014\n• Odon Vallet Scholarship, Vietnam\n2004 & 2005\nPublications & Preprints\n• G. Tran and R. Ward. Exact Recovery of Chaotic Systems from Highly Corrupted Data . Submitted 2016\n• G. Tran , H. Schaeffer, W. M. Feldman, and S. Osher. An L 1 Penalty Method for General Obstacle\nProblems . SIAM Journal on Applied Mathematics, 75(4): 1424-1444, 2015. SIAM Student Paper\nPrize, 2015.\n• R. Caflisch, S. Osher, H. Schaeffer, and G. Tran . PDEs with Compressed Solutions . Communications\nin Mathematical Sciences, 13(8), 2015.\n• D. Zosso, G. Tran , and S. Osher. Non-local Retinex - A Unifying Framework and Beyond . SIAM Journal\non Imaging Sciences, 8(2): 787-826, 2015.\n• G. Tran and Y. Shi. Fiber Orientation and Compartment Parameter Estimation from Multi-Shell\nDiffusion Imaging . IEEE Transactions on Medical Imaging, 34(11): 2320-2332, 2015.\n• J.C. Thomas, J.J."
]
}
],
"warnings": null,
"metadata": null,
"session_id": "session_5786437d5aeb6028b9eeee2f2a0e37a7"
}