Maps from a source manifold $ {\mathcal M}$ to a target manifold ${\mathcal N}$ appear in liquid crystals, colour image enhancement, texture mapping, brain mapping, and many other areas. A numerical framework to solve variational problems and partial differential equations (PDEs) that map between manifolds is introduced within this paper. Our approach, the closest point method for manifold mapping, reduces the problem of solving a constrained PDE between manifolds ${\mathcal M}$ and ${\mathcal N}$ to the simpler problems of solving a PDE on ${\mathcal M}$ and projecting to the closest points on ${\mathcal N}.$ In our approach, an embedding PDE is formulated in the embedding space using closest point representations of ${\mathcal M}$ and ${\mathcal N}.$ This enables the use of standard Cartesian numerics for general manifolds that are open or closed, with or without orientation, and of any codimension. An algorithm is presented for the important example of harmonic maps and generalized to a broader class of PDEs, which includes $p$-harmonic maps. Improved efficiency and robustness are observed in convergence studies relative to the level set embedding methods. Harmonic and $p$-harmonic maps are computed for a variety of numerical examples. In these examples, we denoise texture maps, diffuse random maps between general manifolds, and enhance colour images.
An Introduction to Solving the Least-Squares Problem in Variational Data Assimilation
CERFACS(欧洲研究计算流体力学中心);University of Potsdam(波茨坦大学);School of Mathematical, Physical and Computational Sciences, University of Reading(雷丁大学数学、物理与计算科学学院);National Centre for Earth Observation(国家地球观测中心);Department of Mathematics and Statistics, University of Strathclyde(斯特拉斯克莱德大学数学与统计系);Scientific Computing Department, Science & Technology Facilities Council, Rutherford Appleton Laboratory(卢瑟福阿普顿实验室科学计算部);Eindhoven University of Technology(埃因霍温理工大学)
Deep Domain Decomposition Method for Solving the Variational Inequality Problems
School of Mathematics and Computing Science, Guilin University of Electronics Technology(桂林电子科技大学数学与计算科学学院);Center for Applied Mathematics of Guangxi (GUET)(广西应用数学中心)
A scalable space-time domain decomposition approach for solving large-scale nonlinear regularized inverse ill-posed problems in 4D variational data assimilation
RUNNs: Ritz-Uzawa Neural Networks for Solving Variational Problems
Basque Center for Applied Mathematics(巴斯克应用数学中心);Instituto de Matemáticas, Pontificia Universidad Católica de Valparaíso(天主教法科大学瓦帕莱索数学研究所);Department of Mathematics, CUNEF Universidad(CUNEF大学数学系);Curtin University(科廷大学);Department of Mathematics, University of the Basque Country UPV/EHU(巴斯克国立大学数学系);Ikerbasque: Basque Foundation for Science(伊克拉巴斯克:巴斯克科学基金会);School of Mathematical Sciences, University of Nottingham(诺丁汉大学数学科学学院)
A Proximal Decomposition Method for Solving Convex Variational Inverse Problems
UPMC Université Paris 06(巴黎第六大学);Laboratoire Jacques-Louis Lions – UMR 7598(雅克-路易·利翁斯实验室);Université Paris-Est(巴黎东大学);Institut Gaspard Monge and UMR CNRS 8049(加斯帕尔·蒙日研究所)
CENN: Conservative energy method based on neural networks with subdomains for solving variational problems involving heterogeneous and complex geometries
Tsinghua University(清华大学);Massachusetts Institute of Technology(麻省理工学院);KU Leuven(荷语鲁汶大学)
Variational Geometry-aware Neural Network based Method for Solving High-dimensional Diffeomorphic Mapping Problems
Department of Mathematics, The Chinese University of Hong Kong, Shatin, Hong Kong(数学系,香港中文大学(深圳校区));Department of Mathematics, University of British Columbia, Vancouver, V6T1Z2, BC, Canada(数学系,不列颠哥伦比亚大学);Department of Mathematics, The Chinese University of Hong Kong, Shatin, N.T., Hong Kong(数学系,香港中文大学(深圳校区))