skip to main content


Search for: All records

Award ID contains: 1912654

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. WeproposetousetheL􏰀ojasiewiczinequalityasageneraltoolforanalyzingthecon- vergence rate of gradient descent on a Hilbert manifold, without resorting to the continuous gradient flow. Using this tool, we show that a Sobolev gradient descent method with adaptive inner product converges exponentially fast to the ground state for the Gross-Pitaevskii eigenproblem. This method can be extended to a class of general high-degree optimizations or nonlinear eigenproblems under cer- tain conditions. We demonstrate this generalization using several examples, in particular a nonlinear Schr ̈odinger eigenproblem with an extra high-order interaction term. Numerical experiments are pre- sented for these problems. 
    more » « less
  2. null (Ed.)
  3. null (Ed.)
    We present a novel method of analysis and prove finite time asymptotically self- similar blowup of the De Gregorio model [13,14] for some smooth initial data on the real line with compact support. We also prove self-similar blowup results for the generalized De Gregorio model [41] for the entire range of parameter on R or $S^1$ for Holder continuous initial data with compact support. Our strategy is to reformulate the problem of proving finite time asymptotically self-similar singularity into the problem of establishing the nonlinear stability of an approximate self-similar profile with a small residual error using the dynamic rescaling equation. We use the energy method with appropriate singular weight functions to extract the damping effect from the linearized operator around the approximate self-similar profile and take into account cancellation among various nonlocal terms to establish stability analysis. We remark that our analysis does not rule out the possibility that the original De Gregorio model is well posed for smooth initial data on a circle. The method of analysis presented in this paper provides a promising new framework to analyze finite time singularity of nonlinear nonlocal systems of partial differential equations 
    more » « less
  4. null (Ed.)
    Inspired by the numerical evidence of a potential 3D Euler singularity by Luo- Hou [30,31] and the recent breakthrough by Elgindi [11] on the singularity formation of the 3D Euler equation without swirl with $C^{1,\alpha}$ initial data for the velocity, we prove the finite time singularity for the 2D Boussinesq and the 3D axisymmetric Euler equations in the presence of boundary with $C^{1,\alpha}$ initial data for the velocity (and density in the case of Boussinesq equations). Our finite time blowup solution for the 3D Euler equations and the singular solution considered in [30,31] share many essential features, including the symmetry properties of the solution, the flow structure, and the sign of the solution in each quadrant, except that we use $C^{1,\alpha}$ initial data for the velocity field. We use a dynamic rescaling formulation and follow the general framework of analysis developed by Elgindi in [11]. We also use some strategy proposed in our recent joint work with Huang in [7] and adopt several methods of analysis in [11] to establish the linear and nonlinear stability of an approximate self-similar profile. The nonlinear stability enables us to prove that the solution of the 3D Euler equations or the 2D Boussinesq equations with $C^{1,\alpha}$ initial data will develop a finite time singularity. Moreover, the velocity field has finite energy before the singularity time. 
    more » « less
  5. null (Ed.)
  6. Meila, Marina and (Ed.)
    We propose a Multiscale Invertible Generative Network (MsIGN) and associated training algorithm that leverages multiscale structure to solve high-dimensional Bayesian inference. To address the curse of dimensionality, MsIGN exploits the low-dimensional nature of the posterior, and generates samples from coarse to fine scale (low to high dimension) by iteratively upsampling and refining samples. MsIGN is trained in a multistage manner to minimize the Jeffreys divergence, which avoids mode dropping in high-dimensional cases. On two high-dimensional Bayesian inverse problems, we show superior performance of MsIGN over previous approaches in posterior approximation and multiple mode capture. On the natural image synthesis task, MsIGN achieves superior performance in bits-per-dimension over baseline models and yields great interpret-ability of its neurons in intermediate layers. 
    more » « less
  7. null (Ed.)
  8. null (Ed.)