Searcharxiv⌕ Search

arXiv subjects

Francisco de la Hoz

Publications and source records attributed to Francisco de la Hoz.

At least 19 recordsLinked to original sources

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$

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$.

math.NA↗

A Non-Recursive, Dimension-Independent Schur-Decomposition Algorithm for $N$-Dimensional Sylvester Tensor Equations

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$.

math.NA↗

Numerical approximation of Caputo-type advection-diffusion equations in one and multiple spatial dimensions via shifted Chebyshev polynomials

In this paper, using a pseudospectral approach, we develop operational matrices based on the shifted Chebyshev polynomials to approximate numerically Caputo fractional derivatives and Riemann-Liouville fractional integrals. In order to make the generation of these matrices stable, we use variable precision arithmetic. Then, we apply the Caputo differentiation matrices to solve numerically Caputo-type advection-diffusion equations in one and multiple spatial dimensions, which involves transforming the discretization of the concerning equation into a Sylvester (tensor) equation. We provide complete Matlab codes, whose implementation is carefully explained. The numerical experiments involving highly oscillatory functions in time confirm the effectiveness of this approach.

math.NA↗

Numerical approximation of Caputo-type advection-diffusion equations via Sylvester equations

In this paper, we approximate numerically the solution of Caputo-type advection-diffusion equations of the form $D_t^α u(t,x) = a_1(x)u_{xx}(t,x) + a_2(x)u_x(t,x) + a_3u(t,x) + a_4(t,x)$, where $D_t^α u$ denotes the Caputo fractional derivative of order $α\in(0,1)$ of $u$ with respect to $t$, $t\in[0, t_f]$ and the spatial domain can be the whole real line or a closed interval. First, we propose a method of order $3 - α$ to approximate Caputo fractional derivatives, explain how to implement an FFT-based fast convolution to reduce the computational cost, and express the numerical approximation in terms of an operational matrix. Then, we transform a given Caputo-type advection-diffusion equation into a Sylvester equation of the form $\mathbf A\mathbf U + \mathbf U \mathbf B = \mathbf C$, and special care is given to the treatment of the boundary conditions, when the spatial domain is a closed interval. Finally, we perform several numerical experiments that illustrate the adequacy of our approach. The implementation has been done in Matlab, and we share and explain in detail the majority of the actual codes that we have used.

math.NA↗

Regular Polygonal Vortex Filament Evolution and Exponential Sums

In this paper, we give a rigorous proof for the expression of the angle between adjacent sides in the skew polygons appearing at rational times in the evolution of regular polygons of $M$ sides under the vortex filament equation. The proof depends on showing that some exponential sums with arithmetic content are purely imaginary.

math.NT↗

A study of the reconnection of antiparallel vortices in the infinitely thin case and in the finite thickness case

The simplest case is the reconnection of a pair of antiparallel line vortices, e.g., condensation trails of an aircraft. The vortices first undergo long wave deformation (Crow waves), and then reconnect to form coherent structures. Although the behavior of the vortices before and after the reconnection can be clearly observed, what happens during the reconnection still needs to be explained. One of the challenges is related to the fact that the vortices have finite thickness, and therefore, the time and the point of the reconnection cannot be determined. Moreover, the smallest scale of coherent structures that can be observed also depends on the vortex thickness. In this paper, we consider an infinitely thin vortex approximation to study the reconnection process. We show that, in this case, the behavior after the reconnection is quasi-periodic, with the quasi-period being independent of the angle between the vortices at the time of the reconnection. We also show that, in the Fourier transform of the trajectory of the reconnection point, the frequencies that correspond to squares of integers are dominating in a similar way as in the evolution of a polygonal vortex under the localized induction approximation. At the end, we compare the results with a solution of the Navier-Stokes equations for the reconnection of a pair of antiparallel vortices with finite thickness. We use the fluid impulse to determine the reconnection time, the reconnection point, and the quasi-period for this case.

math.AP↗

Numerical Approximation of Riesz-Feller Operators on $\mathbb R$

In this paper, we develop an accurate pseudospectral method to approximate numerically the Riesz-Feller operator $D_γ^α$ on $\mathbb R$, where $α\in(0,2)$, and $|γ|\le\min\{α, 2 - α\}$. This operator can be written as a linear combination of the Weyl-Marchaud derivatives $\mathcal{D}^α$ and $\overline{\mathcal{D}^α}$, when $α\in(0,1)$, and of $\partial_x\mathcal{D}^{α-1}$ and $\partial_x\overline{\mathcal{D}^{α-1}}$, when $α\in(1,2)$. Given the so-called Higgins functions $λ_k(x) = ((ix-1)/(ix+1))^k$, where $k\in\mathbb Z$, we compute explicitly, using complex variable techniques, $\mathcal{D}^α[λ_k](x)$, $\overline{\mathcal{D}^α}[λ_k](x)$, $\partial_x\mathcal{D}^{α-1}[λ_k](x)$, $\partial_x\overline{\mathcal{D}^{α-1}}[λ_k](x)$ and $D_γ^α[λ_k](x)$, in terms of the Gaussian hypergeometric function ${}_2F_1$, and relate these results to previous ones for the fractional Laplacian. This enables us to approximate $\mathcal{D}^α[u](x)$, $\overline{\mathcal{D}^α}[u](x)$, $\partial_x\mathcal{D}^{α-1}[u](x)$, $\partial_x\overline{\mathcal{D}^{α-1}}[u](x)$ and $D_γ^α[u](x)$, for bounded continuous functions $u(x)$. Finally, we simulate a nonlinear Riesz-Feller fractional diffusion equation, characterized by having front propagating solutions whose speed grows exponentially in time.

math.NA↗

Numerical computation of the half Laplacian by means of a fast convolution algorithm

In this paper, we develop a fast and accurate pseudospectral method to approximate numerically the half Laplacian $(-Δ)^{1/2}$ of a function on $\mathbb{R}$, which is equivalent to the Hilbert transform of the derivative of the function. The main ideas are as follows. Given a twice continuously differentiable bounded function $u\in\mathcal C_b^2(\mathbb{R})$, we apply the change of variable $x=L\cot(s)$, with $L>0$ and $s\in[0,π]$, which maps $\mathbb{R}$ into $[0,π]$, and denote $(-Δ)_s^{1/2}u(x(s)) \equiv (-Δ)^{1/2}u(x)$. Therefore, by performing a Fourier series expansion of $u(x(s))$, the problem is reduced to computing $(-Δ)_s^{1/2}e^{iks} \equiv (-Δ)^{1/2}[(x + i)^k/(1+x^2)^{k/2}]$. On a previous work, we considered the case with $k$ even for the more general power $α/2$, with $α\in(0,2)$, so here we focus on the case with $k$ odd. More precisely, we express $(-Δ)_s^{1/2}e^{iks}$ for $k$ odd in terms of the Gaussian hypergeometric function ${}_2F_1$, and also as a well-conditioned finite sum. Then, we use a fast convolution result, that enable us to compute very efficiently $\sum_{l = 0}^Ma_l(-Δ)_s^{1/2}e^{i(2l+1)s}$, for extremely large values of $M$. This enables us to approximate $(-Δ)_s^{1/2}u(x(s))$ in a fast and accurate way, especially when $u(x(s))$ is not periodic of period $π$. As an application, we simulate a fractional Fisher's equation having front solutions whose speed grows exponentially.

math.NA↗

A fast convolution method for the fractional Laplacian in $\mathbb{R}$

In this article, we develop a new method to approximate numerically the fractional Laplacian of functions defined on $\mathbb R$, as well as some more general singular integrals. After mapping $\mathbb R$ into a finite interval, we discretize the integral operator using a modified midpoint rule. The result of this procedure can be cast as a discrete convolution, which can be evaluated efficiently using the Fast-Fourier Transform (FFT). The method provides an efficient, second order accurate, approximation to the fractional Laplacian, without the need to truncate the domain. We first prove that the method gives a second-order approximation for the fractional Laplacian and other related singular integrals; then, we detail the implementation of the method using the fast convolution, and give numerical examples that support its efficacy and efficiency; finally, as an example of its applicability to an evolution problem, we employ the method for the discretization of the nonlocal part of the one-dimensional cubic fractional Schrödinger equation in the focusing case.

math.NA↗

Vortex Filament Equation for a regular polygon in the hyperbolic plane

The aim of this article is twofold. First, we show the evolution of the vortex filament equation (VFE) for a regular planar polygon in the hyperbolic space. Unlike in the Euclidean space, the planar polygon is open and both of its ends grow exponentially, which makes the problem more challenging from a numerical point of view. However, with fixed boundary conditions, a finite difference scheme and a fourth-order Runge--Kutta method in time, we show that the numerical solution is in complete agreement with the one obtained from algebraic techniques. Second, as in the Euclidean case, we claim that, at infinitesimal times, the evolution of VFE for a planar polygon as the initial datum can be described as a superposition of several one-corner initial data. As a consequence, not only can we compute the speed of the center of mass of the planar polygon, but the relationship also allows us to compare the time evolution of any of its corners with that in the Euclidean case.

math.NA↗

Numerical Approximation of the Fractional Laplacian on $\mathbb R$ Using Orthogonal Families

In this paper, using well-known complex variable techniques, we compute explicitly, in terms of the ${}_2F_1$ Gaussian hypergeometric function, the one-dimensional fractional Laplacian of the Higgins functions, the Christov functions, and their sine-like and cosine-like versions. After discussing the numerical difficulties in the implementation of the proposed formulas, we develop a method using variable precision arithmetic that gives accurate results.

math.NA↗

On the Evolution of the Vortex Filament Equation for regular $M$-polygons with nonzero torsion

In this paper, we consider the evolution of the Vortex Filament equation (VFE): \begin{equation*} \mathbf X_t = \mathbf Xs \wedge \mathbf Xss, \end{equation*} taking $M$-sided regular polygons with nonzero torsion as initial data. Using algebraic techniques, backed by numerical simulations, we show that the solutions are polygons at rational times, as in the zero-torsion case. However, unlike in that case, the evolution is not periodic in time; moreover, the multifractal trajectory of the point $\mathbf X(0,t)$ is not planar, and appears to be a helix for large times. These new solutions of VFE can be used to illustrate numerically that the smooth solutions of VFE given by helices and straight lines share the same instability as the one already established for circles. This is accomplished by showing the existence of variants of the so-called Riemann's non-differentiable function that are as close to smooth curves as desired, when measured in the right topology. This topology is motivated by some recent results on the well-posedness of VFE, which prove that the selfsimilar solutions of VFE have finite renormalized energy.

math.NA↗

A Pseudospectral Method for the One-Dimensional Fractional Laplacian on $\mathbb R$

In this paper, we propose a novel pseudospectral method to approximate accurately and efficiently the fractional Laplacian without using truncation. More precisely, given a bounded regular function defined over $\mathbb R$, we map the unbounded domain into a finite one, then we represent the function as a trigonometrical series. Therefore, the central point of this paper is the computation of the fractional Laplacian of an elementary trigonometric function. As an application of the method, we also do the simulation of Fisher's equation with fractional Laplacian in the monostable case.

math.NA↗

On the Relationship between the One-Corner Problem and the $M$-Corner Problem for the Vortex Filament Equation

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.

math.NA↗

A pseudo-spectral method for a non-local KdV-Burgers equation posed on $\mathbb R$

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.

math.NA↗

An analytical and numerical study of steady patches in the disc

In this paper, we prove the existence of $m$-fold rotating patches for the Euler equations in the disc, for both simply-connected and doubly-connected cases. Compared to the planar case, the rigid boundary introduces rich dynamics for the lowest symmetries $m=1$ and $m=2$. We also discuss some numerical experiments highlighting the interaction between the boundary of the patch and the rigid one.

math.AP↗

Doubly connected V-states for the generalized surface quasi-geostrophic equations

In this paper, we prove the existence of doubly connected V-states for the generalized SQG equations with $α\in ]0,1[.$ They can be described by countable branches bifurcating from the annulus at some explicit "eigenvalues" related to Bessel functions of the first kind. Contrary to Euler equations \cite{H-F-M-V}, we find V-states rotating with positive and negative angular velocities. At the end of the paper we discuss some numerical experiments concerning the limiting V-states.

math.AP↗

The vortex filament equation as a pseudorandom generator

In this paper, we consider the evolution of the so-called vortex filament equation (VFE), \begin{equation*} \mathbf X_t = \mathbf X_s\wedge\mathbf X_{ss}, \end{equation*} taking a planar regular polygon of $M$ sides as initial datum. We study VFE from a completely novel point of view: that of an evolution equation which yields a very good generator of pseudorandom numbers in a completely natural way. This essential randomness of VFE is in agreement with the randomness of the physical phenomena upon which it is based.

math.NT↗