Related papers: Sobolev gradient flow for the Gross-Pitaevskii eig…
We propose a quasi-Grassmannian gradient flow model for eigenvalue problems of linear operators, aiming to efficiently address many eigenpairs. Our model inherently ensures asymptotic orthogonality: without the need for initial…
We compute the ground state $u$ of the Gross--Pitaevskii equation (GPE) via Wasserstein gradient descent in diffeomorphism space. We represent the density $\rho=u^2$ as the push-forward of a fixed reference measure through a parameterized…
We present here a new image inpainting algorithm based on the Sobolev gradient method in conjunction with the Navier-Stokes model. The original model of Bertalmio et al is reformulated as a variational principle based on the minimization of…
In this paper, we present a novel spectral renormalization exponential integrator method for solving gradient flow problems. Our method is specifically designed to simultaneously satisfy discrete analogues of the energy dissipation laws and…
We propose a high-order numerical methodology for computing the ground state and time evolution of the two-dimensional Gross-Pitaevskii equation with harmonic trapping potential. The ground state is obtained by combining normalized gradient…
Wasserstein gradient flows have become a central tool for optimization problems over probability measures. A natural numerical approach is forward-Euler time discretization. We show, however, that even in the simple case where the energy…
We propose a positivity preserving finite element discretization for the nonlinear Gross-Pitaevskii eigenvalue problem. The method employs mass lumping techniques, which allow to transfer the uniqueness up to sign and positivity properties…
We study the Rayleigh-Stokes problem for a generalized second-grade fluid which involves a Riemann-Liouville fractional derivative in time, and present an analysis of the problem in the continuous, space semidiscrete and fully discrete…
Preconditioned eigenvalue solvers (eigensolvers) are gaining popularity, but their convergence theory remains sparse and complex. We consider the simplest preconditioned eigensolver--the gradient iterative method with a fixed step size--for…
This report presents a low computational and cognitive complexity, stable, time accurate and adaptive method for the Navier-Stokes equations. The improved method requires a minimally intrusive modification to an existing program based on…
For a class of fourth order gradient flow problems, integration of the scalar auxiliary variable (SAV) time discretization with the penalty-free discontinuous Galerkin (DG) spatial discretization leads to SAV-DG schemes. These schemes are…
Sampling a probability distribution with an unknown normalization constant is a fundamental problem in computational science and engineering. This task may be cast as an optimization problem over all probability measures, and an initial…
We study doubly nonlinear parabolic equation arising from the gradient flow for p-Sobolev type inequality, referred as p-Sobolev flow from now on, which includes the classical Yamabe flow on a bounded domain in Euclidean space in the…
Generalized eigenvalue problems (GEPs) find applications in various fields of science and engineering. For example, principal component analysis, Fisher's discriminant analysis, and canonical correlation analysis are specific instances of…
We study the gradient flow of the length functional on the space of planar immersed closed curves, where the gradient is taken with respect to a family of homogeneous Sobolev $H^1$-type Riemannian metrics depending on parameters $\lambda>0$…
We consider a gradient flow of the total variation in a negative Sobolev space $H^{-s}$ $(0\leq s \leq 1)$ under the periodic boundary condition. If $s=0$, the flow is nothing but the classical total variation flow. If $s=1$, this is the…
We study the asymptotic convergence of solutions as $t\rightarrow\infty$ of $\partial_t u=-f(u)+\int f(u)$, a nonlocal differential equation that is formally a gradient flow in a constant-mass subspace of $L^2$ arising from simplified…
This paper explores variants of the subspace iteration algorithm for computing approximate invariant subspaces. The standard subspace iteration approach is revisited and new variants that exploit gradient-type techniques combined with a…
This paper proposes novel gradient-flow schemes that yield convergence to the optimal point of a convex optimization problem within a \textit{fixed} time from any given initial condition for unconstrained optimization, constrained…
This paper establishes a theory of nonlinear spectral decompositions by considering the eigenvalue problem related to an absolutely one-homogeneous functional in an infinite-dimensional Hilbert space. This approach is both motivated by…