APJan 13, 2015
Vortex Filament Equation for a Regular PolygonFrancisco de la Hoz, Luis Vega
In this paper, we study the evolution of the vortex filament equation (VFE), $$\mathbf X_t = \mathbf X_s \wedge \mathbf X_{ss},$$ with $\mathbf X(s, 0)$ being a regular planar polygon. Using algebraic techniques, supported by full numerical simulations, we give strong evidence that $\mathbf X(s, t)$ is also a polygon at any rational time; moreover, it can be fully characterized, up to a rigid movement, by a generalized quadratic Gauß sum. We also study the fractal behavior of $\mathbf X(0, t)$, relating it with the so-called Riemann's non-differentiable function, that was proved by Jaffard to be a multifractal.
NADec 4, 2008
A numerical study of the self-similar solutions of the Schroedinger MapFrancisco de la Hoz, Carlos Garcia-Cervera, Luis Vega
We present a numerical study of the self-similar solutions of the Localized Induction Approximation of a vortex filament. These self-similar solutions, which constitute a one-parameter family, develop a singularity at finite time. We study a number of boundary conditions that allow us reproduce the mechanism of singularity formation. Some related questions are also considered.
NANov 25, 2015
A pseudo-spectral method for a non-local KdV-Burgers equation posed on $\mathbb R$Francisco de la Hoz, Carlota Maria Cuesta
In this paper, we present a new pseudo-spectral method to solve the initial value problem associated to a non-local KdV-Burgers equation involving a Caputo-type fractional derivative. The basic idea is, using an algebraic map, to transform the whole real line into a bounded interval where we can apply a Fourier expansion. Special attention is given to the correct computation of the fractional derivative in this setting.
NADec 5, 2008
Numerical study of a flow of regular planar curves that develop singularities at finite timeFrancisco de la Hoz
In this paper, we will study the following geometric flow, obtained by Goldstein and Petrich while considering the evolution of a vortex patch in the plane under Euler's equations, X_t = -k_s n - (1/2) k^2 T, with s being the arc-length parameter and k the curvature. Perelman and Vega proved that this flow has a one-parameter family of regular solutions that develop a corner-shaped singularity at finite time. We will give a method to reproduce numerically the evolution of those solutions, as well as the formation of the corner, showing several properties associated to them.
51.5NAMay 22
A matrix-based spectral method for the numerical approximation of the fractional Laplacian and the fractional $p$-Laplacian of functions defined on $\mathbb R^n$Loïc Constantin, Carlota M. Cuesta, Francisco de la Hoz
Given a function $u$ defined on $\mathbb R^n$, its fractional $p$-Laplacian is given by $$(-Δ)_p^su(\vec x)=C_1(n,s,p)\int_{\mathbb R^n}\frac{|u(\vec x)-u(\vec y)|^{p-2}(u(\vec x)-u(\vec y))}{\|\vec x-\vec y\|_2^{n+sp}}d\vec y,\quad\vec x\in\mathbb R^n,$$where the integral is understood in the principal value sense, $p\in(1,\infty)$, $s\in(0,1)$, and $C_1(n,s,p)$ is a normalization constant. A formally equivalent nonlinear Balakrishnan formulation is given by $$(-Δ)_p^su(\vec x)=C_4(n,s,p)\int_0^\inftyΔ(t-Δ)^{-1}\left[Φ_p(u(\vec x)-u(\cdot))\right](\vec x)\frac{dt}{t^{1-sp/2}},$$ where $C_4(n,s,p)$ is another normalization constant, and $Φ_p(t)=|t|^{p-2}t$. In this paper, we present a matrix-based spectral method to approximate numerically the fractional Laplacian (i.e., the linear case, where $p = 2$) and the fractional $p$-Laplacian for functions defined on $\mathbb R^n$. Our approach builds on the Balakrishnan representation, where we discretize the 2nd-order derivatives in $Δ$ using spectrally accurate differentiation matrices. A key advantage is that these matrices can be diagonalized in a well-conditioned manner, enabling a stable and robust numerical scheme that naturally extends to arbitrary spatial dimensions $n$. In particular, this diagonalization allows the fractional operator to act directly on the eigenvalue spectrum, effectively reducing the Balakrishnan integral to an analytical evaluation at the spectral level and thereby avoiding costly multidimensional quadrature. The resulting method also avoids domain truncation and variational formulations, making it both computationally efficient and conceptually straightforward. As a practical application, we simulate the evolution of $$\frac{\partial u}{\partial t}+(-Δ)^s_pu=0,$$in one and two spatial dimensions, being able to capture the self-similar solutions that arise as $t\to\infty$.
55.8NAMay 8
A Non-Recursive, Dimension-Independent Schur-Decomposition Algorithm for $N$-Dimensional Sylvester Tensor EquationsCarlota M. Cuesta, Francisco de la Hoz
In this paper we present a non-recursive direct solver, based on the Bartels-Stewart algorithm, for $N$-dimensional Sylvester tensor equations. The method relies only on Schur decompositions of the coefficient matrices and reduces the computation to a single sequential sweep over tensor entries, making it entirely independent of the dimension $N$. Its main advantages are simplicity, a dimension-independent formulation, and the ability to solve very high-dimensional problems limited only by available memory, which is used efficiently. We successfully solve cases up to $N=29$ on a standard laptop with $32$ GB RAM. Compared with the recursive blocked method of Chen and Kressner (state of the art), both approaches achieve identical accuracy. The recursive method is faster for large coefficient matrices, whereas our solver is competitive or superior when matrices are small, especially for large $N$, where recursive methods cannot effectively exploit BLAS-3 kernels. It also uses memory more efficiently: for near-capacity problems (e.g., matrices of order $19$ with $N=7$, where solution and right-hand side occupy $\approx 28$ GB), the Chen-Kressner method exceeds available memory, while ours succeeds. The method is also significantly simpler to implement, fully independent of $N$, and correctly handles singleton dimensions. We detail the algorithm and derive accurate cost estimates. For reproducibility, we provide pseudocode and complete MATLAB implementations. As an application, we compute solutions of linear $N$-dimensional ODE systems with constant coefficients at arbitrary times, and thus of evolutionary PDEs after spatial discretization, including highly accurate solutions of an advection-diffusion equation on $\mathbb{R}^N$.
NAJul 28, 2017
On the Relationship between the One-Corner Problem and the $M$-Corner Problem for the Vortex Filament EquationFrancisco de la Hoz, Luis Vega
In this paper, we give evidence that the evolution of the Vortex Filament Equation for a regular $M$-corner polygon as initial datum can be explained at infinitesimal times as the superposition of $M$ one-corner initial data. Therefore, and due to periodicity, the evolution at later times can be understood as the nonlinear interaction of infinitely many filaments, one for each corner. This interaction turns out to be some kind of nonlinear Talbot effect. We also give very strong numerical evidence of the transfer of energy and linear momentum for the $M$-corner case.