skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Title: A convergent finite difference method for computing minimal Lagrangian graphs
We consider the numerical construction of minimal Lagrangian graphs, which is related to recent applications in materials science, molecular engineering, and theoretical physics. It is known that this problem can be formulated as an additive eigenvalue problem for a fully nonlinear elliptic partial differential equation. We introduce and implement a two-step generalized finite difference method, which we prove converges to the solution of the eigenvalue problem. Numerical experiments validate this approach in a range of challenging settings. We further discuss the generalization of this new framework to Monge-Ampère type equations arising in optimal transport. This approach holds great promise for applications where the data does not naturally satisfy the mass balance condition, and for the design of numerical methods with improved stability properties.  more » « less
Award ID(s):
1751996 1619807
PAR ID:
10308810
Author(s) / Creator(s):
;
Date Published:
Journal Name:
Communications on Pure & Applied Analysis
Volume:
0
Issue:
0
ISSN:
1534-0392
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. null (Ed.)
    Recently Fraser and Schoen showed that the solution of a certain extremal Steklov eigenvalue problem on a compact surface with boundary can be used to generate a free boundary minimal surface, i.e. , a surface contained in the ball that has (i) zero mean curvature and (ii) meets the boundary of the ball orthogonally (doi: 10.1007/s00222-015-0604-x ). In this paper, we develop numerical methods that use this connection to realize free boundary minimal surfaces. Namely, on a compact surface, Σ, with genus γ and b boundary components, we maximize σ j (Σ, g )  L ( ∂ Σ, g ) over a class of smooth metrics, g , where σ j (Σ, g ) is the j th nonzero Steklov eigenvalue and L ( ∂ Σ, g ) is the length of ∂ Σ. Our numerical method involves (i) using conformal uniformization of multiply connected domains to avoid explicit parameterization for the class of metrics, (ii) accurately solving a boundary-weighted Steklov eigenvalue problem in multi-connected domains, and (iii) developing gradient-based optimization methods for this non-smooth eigenvalue optimization problem. For genus γ = 0 and b = 2, …, 9, 12, 15, 20 boundary components, we numerically solve the extremal Steklov problem for the first eigenvalue. The corresponding eigenfunctions generate a free boundary minimal surface, which we display in striking images. For higher eigenvalues, numerical evidence suggests that the maximizers are degenerate, but we compute local maximizers for the second and third eigenvalues with b = 2 boundary components and for the third and fifth eigenvalues with b = 3 boundary components. 
    more » « less
  2. In this paper, spectral methods based on conformal mappings are proposed to solve the Steklov eigenvalue problem and its related shape optimization problems in two dimensions. To apply spectral methods, we first reformulate the Steklov eigenvalue problem in the complex domain via conformal mappings. The eigenfunctions are expanded in Fourier series so the discretization leads to an eigenvalue problem for coefficients of Fourier series. For shape optimization problem, we use a gradient ascent approach to find the optimal domain which maximizes k-th Steklov eigenvalue with a fixed area for a given k. The coefficients of Fourier series of mapping functions from a unit circle to optimal domains are obtained for several different k. 
    more » « less
  3. In an extremal eigenvalue problem, one considers a family of eigenvalue problems, each with discrete spectra, and extremizes a chosen eigenvalue over the family. In this chapter, we consider eigenvalue problems defined on Riemannian manifolds and extremize over the metric structure. For example, we consider the problem of maximizing the principal Laplace–Beltrami eigenvalue over a family of closed surfaces of fixed volume. Computational approaches to such extremal geometric eigenvalue problems present new computational challenges and require novel numerical tools, such as the parameterization of conformal classes and the development of accurate and efficient methods to solve eigenvalue problems on domains with nontrivial genus and boundary. We highlight recent progress on computational approaches for extremal geometric eigenvalue problems, including (i) maximizing Laplace–Beltrami eigenvalues on closed surfaces and (ii) maximizing Steklov eigenvalues on surfaces with boundary. 
    more » « less
  4. Abstract This paper addresses the problem of algorithmic prediction of protein folding pathways, namely, the transient three-dimensional conformations of protein molecules during folding, under constrained rates of entropy change. We formulate the physics-based prediction of folding pathways as a control synthesis problem, where the control inputs guide the protein folding simulations. These folding control inputs are obtained from largescale trust-region subproblems (TRS) utilizing a computationally efficient algorithm with no need for outer iterations. The proposed control synthesis approach, which leverages the solutions obtained from a special generalized eigenvalue problem, avoids potentially cumbersome and unpredictable iterative computations at each protein conformation. Moreover, the TRS-based control inputs align the closed-loop dynamics closely with the kinetostatic compliance method (KCM) reference vector field while satisfying ellipsoidal constraints on the folding control inputs. Finally, we provide conditions for existence and uniqueness of the resulting closed-loop solutions, which are the protein folding pathways under constraints on the rate of entropy change. Numerical simulations utilizing the KCM approach on protein backbones confirm the effectiveness of the proposed framework. 
    more » « less
  5. In recent years, a new approach has been proposed in the study of the inverse scattering problem for electromagnetic waves. In particular, a study is made of the analytic properties of the scattering operator, and the results of this study are used to design target signatures that respond to changes in the electromagnetic parameters of the scattering medium. These target signatures are characterized by novel eigenvalue problems such that the eigenvalues can be determined from measured scattering data. Changes in the structural properties of the material or the presence of flaws cause changes in the measured eigenvalues. In this article, we provide a general framework for developing target signatures and numerical evidence of the efficacy of new target signatures based on recently introduced eigenvalue problems arising in electromagnetic scattering theory for anisotropic media. 
    more » « less