Fast solution of three-dimensional elliptic equations with randomly generated jumping coefficients by using tensor-structured preconditioners

In this paper, we propose and analyze the numerical algorithms for fast solution of periodic elliptic problems in random media in ${ℝ}^d$, $d=2,3$. Both the two-dimensional (2D) and three-dimensional (3D) elliptic problems are considered for the jumping equation coefficients built as a checkerboard type configuration of bumps randomly distributed on a large $L\times L$, or $L\times L\times L$ lattice, respectively. The finite element method discretization procedure on a 3D $n\times n\times n$ uniform tensor grid is described in detail, and the Kronecker tensor product approach is proposed for fast generation of the stiffness matrix. We introduce tensor techniques for the construction of the low Kronecker rank spectrally equivalent preconditioner in a periodic setting to be used in the framework of the preconditioned conjugate gradient iteration. The discrete 3D periodic Laplacian pseudo-inverse is first diagonalized in the Fourier basis, and then the diagonal matrix is reshaped into a fully populated third-order tensor of size $n\times n\times n$. The latter is approximated by a low-rank canonical tensor by using the multigrid Tucker-to-canonical tensor transform. As an example, we apply the presented solver in numerical analysis of stochastic homogenization method where the 3D elliptic equation should be solved many hundred times, and where for every random sampling of the equation coefficient one has to construct the new stiffness matrix and the right-hand side. The computational characteristics of the presented solver in terms of a lattice parameter $L$ and the grid-size, $n^d$, in both 2D and 3D cases are illustrated in numerical tests. Our solver can be used in various applications where the elliptic problem should be solved for a number of different coefficients for example, in many-particle dynamics, protein docking problems or stochastic modeling.     

Lower and upper bounds of condition number for Vandermonde-wise matrices and method of fundamental solutions using pseudo radial-lines

Consider the method of fundamental solutions (MFS) for 2D Laplace's equation in a bounded simply connected domain $S$. In the standard MFS, the source nodes are located on a closed contour outside the domain boundary $\mathrm{\Gamma }(=\partial S)$, which is called pseudo-boundary. For circular, elliptic, and general closed pseudo-boundaries, analysis and computation have been studied extensively. New locations of source nodes are proposed along two pseudo radial-lines outside $\mathrm{\Gamma }$. Numerical results are very encouraging and promising. Since the success of the MFS mainly depends on stability, our efforts are focused on deriving the lower and upper bounds of condition number (Cond). The study finds stability properties of new Vandermonde-wise matrices on nodes $x_i\in [a,b]$ with . The Vandermonde-wise matrix is called in this article if it can be decomposed into the standard Vandermonde matrix. New lower and upper bounds of Cond are first derived for the standard Vandermonde matrix, and then for new algorithms of the MFS using two pseudo radial-lines. Both lower and upper bounds of Cond are intriguing in the stability study for the MFS. Numerical experiments are carried out to verify the stability analysis made. Since the fundamental solutions (as $\{\ln |\overline{{PQ}_i}|\}$) are the basis functions of the MFS, new Vandermonde-wise matrices are found. Since the nodes $x_i\in [a,b]$ with may come from approximations and interpolations by the Laurent polynomials with singular part, the conclusions in this article are important not only to the MFS but also to matrix analysis.     

Asymptotics for the eigenvalues of Toeplitz matrices with a symbol having a power singularity

The present work is devoted to the construction of an asymptotic expansion for the eigenvalues of a Toeplitz matrix $T_n(a)$ as $n$ goes to infinity, with a continuous and real-valued symbol $a$ having a power singularity of degree $\gamma$ with , at one point. The resulting matrix is dense and its entries decrease slowly to zero when moving away from the main diagonal, we apply the so called simple-loop (SL) method for constructing and justifying a uniform asymptotic expansion for all the eigenvalues. Note however, that the considered symbol does not fully satisfy the conditions imposed in previous works, but only in a small neighborhood of the singularity point. In the present work: (i) We construct and justify the asymptotic formulas of the SL method for the eigenvalues ${\lambda }_j(T_n(a))$ with $j⩾\epsilon n$, where the eigenvalues are arranged in nondecreasing order and $\epsilon$ is a sufficiently small fixed number. (ii) We show, with the help of numerical calculations, that the obtained formulas give good approximations in the case . (iii) We numerically show that the main term of the asymptotics for eigenvalues with , formally obtained from the formulas of the SL method, coincides with the main term of the asymptotics constructed and justified in the classical works of Widom and Parter.     

Constructing the field of values of decomposable and general matrices using the ZNN based path following method

This paper describes and develops a fast and accurate path following algorithm that computes the field of values boundary curve $\partial F(A)$ for every conceivable complex or real square matrix $A$. It relies on the matrix flow decomposition algorithm that finds a proper block-diagonal flow representation for the associated hermitean matrix flow ${ℱ}_A(t)=\cos (t)H+\sin (t)K$ under unitary similarity if that is possible. Here ${ℱ}_A(t)$ is the 1-parameter-varying linear combination of the real and skew part matrices $H=(A+A^{\ast })/2$ and $K=(A-A^{\ast })/(2i)$ of $A$. For indecomposable matrix flows, ${ℱ}_A(t)$ has just one block and the ZNN based field of values algorithm works with ${ℱ}_A(t)$ directly. For decomposing flows ${ℱ}_A(t)$, the algorithm decomposes the given matrix $A$ unitarily into block-diagonal form $U^{\ast }AU=\text{diag}(A_j)$ with $j>1$ diagonal blocks $A_j$ whose individual sizes add up to the size of $A$. It then computes the field of values boundaries separately for each diagonal block $A_j$ using the path following ZNN eigenvalue method. The convex hull of all sub-fields of values boundary points $\partial F(A_j)$ finally determines the field of values boundary curve correctly for decomposing matrices $A$. The algorithm removes standard restrictions for path following FoV methods that generally cannot deal with decomposing matrices $A$ due to possible eigencurve crossings of ${ℱ}_A(t)$. Tests and numerical comparisons are included. Our ZNN based method is coded for sequential and parallel computations and both versions run very accurately and fast when compared with Johnson's Francis QR eigenvalue and Bendixson rectangle based method and compute global eigenanalyses of ${ℱ}_A(t_k)$ for large discrete sets of angles $t_k\in [0,2\pi ]$ more slowly.     

Data-driven linear complexity low-rank approximation of general kernel matrices: A geometric approach

A general, rectangular kernel matrix may be defined as $K_{ij}=\kappa (x_i,y_j)$ where $\kappa (x,y)$ is a kernel function and where $X={\{x_i\}}_{i=1}^m$ and $Y={\{y_i\}}_{i=1}^n$ are two sets of points. In this paper, we seek a low-rank approximation to a kernel matrix where the sets of points $X$ and $Y$ are large and are arbitrarily distributed, such as away from each other, “intermingled”, identical, and so forth. Such rectangular kernel matrices may arise, for example, in Gaussian process regression where $X$ corresponds to the training data and $Y$ corresponds to the test data. In this case, the points are often high-dimensional. Since the point sets are large, we must exploit the fact that the matrix arises from a kernel function, and avoid forming the matrix, and thus ruling out most algebraic techniques. In particular, we seek methods that can scale linearly or nearly linearly with respect to the size of data for a fixed approximation rank. The main idea in this paper is to geometrically select appropriate subsets of points to construct a low rank approximation. An analysis in this paper guides how this selection should be performed.     

Existence of positive ground state solutions for the coupled Choquard system with potential

In this paper, we study the following coupled Choquard system in ${\mathbb{R}}^N$: where $\alpha \in (0,N)$ and , in which $2_{\ast }^{\alpha }$ denotes $\frac{N+\alpha }{N-2}$ if $N\ge 3$ and $2_{\ast }^{\alpha }:=\infty$ if $N=1,2$. The function $I_{\alpha }$ is a Riesz potential. By using Nehari manifold method, we obtain the existence of a positive ground state solution in the case of bounded potential and periodic potential, respectively. In particular, the nonlinear term includes the well-studied case $p=q$ and $u(x)=v(x)$, and the less-studied case $p\ne q$ and $u(x)\ne v(x)$. Moreover, it seems to be the first existence result for the case $p\ne q$.     

Single-peak solutions for a subcritical Schrödinger equation with non-power nonlinearity

This paper deals with the following slightly subcritical Schrödinger equation: $$-\mathrm{\Delta }u+V(x)u=f_{\epsilon }(u),u>0\text{in}{\mathbb{R}}^N,$$ where $V(x)$ is a nonnegative smooth function, $f_{\epsilon }(u)=\frac{u^p}{{[\ln (e+u)]}^{\epsilon }}$, $p=\frac{N+2}{N-2}$, $\epsilon >0$, $N\ge 7$. Most of the previous works for the Schrödinger equations were mainly investigated for power-type nonlinearity. In this paper, we will study the case when the nonlinearity $f_{\epsilon }(u)$ is a non-power nonlinearity. We show that, for ε small enough, there exists a family of single-peak solutions concentrating at the positive stable critical point of the potential $V(x)$.     

Tensor rank bounds and explicit QTT representations for the inverses of circulant matrices

In this paper, we are concerned with the inversion of circulant matrices and their quantized tensor-train (QTT) structure. In particular, we show that the inverse of a complex circulant matrix $A$, generated by the first column of the form ${(a_0,\dots ,a_{m-1},0,\dots ,0,a_{-n},\dots ,a_{-1})}^{\top }$ admits a QTT representation with the QTT ranks bounded by $(m+n)$. Under certain assumptions on the entries of $A$, we also derive an explicit QTT representation of $A^{-1}$. The latter can be used, for instance, to overcome stability issues arising when numerically solving differential equations with periodic boundary conditions in the QTT format.     

An improved result for a class of Klein–Gordon–Maxwell system with quasicritical potential vanishing at infinity

The following kind of Klein–Gordon–Maxwell system is investigated where $\omega >0$ is a parameter, and V is vanishing potential. By using some suitable conditions on K and f, we obtain a Palais–Smale sequence by using Pohožaev equality and prove the ground-state solution for this system by employing variational methods. Our result improves the related one in the literature.     

A unified rational Krylov method for elliptic and parabolic fractional diffusion problems

We present a unified framework to efficiently approximate solutions to fractional diffusion problems of stationary and parabolic type. After discretization, we can take the point of view that the solution is obtained by a matrix-vector product of the form $f^{\mathit{\tau }}(L)\mathbf{b}$, where $L$ is the discretization matrix of the spatial operator, $\mathbf{b}$ a prescribed vector, and $f^{\mathit{\tau }}$ a parametric function, such as a fractional power or the Mittag-Leffler function. In the abstract framework of Stieltjes and complete Bernstein functions, to which the functions we are interested in belong to, we apply a rational Krylov method and prove uniform convergence when using poles based on Zolotarëv's minimal deviation problem. The latter are particularly suited for fractional diffusion as they allow for an efficient query of the map $\mathit{\tau }\mapsto f^{\mathit{\tau }}(L)\mathbf{b}$ and do not degenerate as the fractional parameters approach zero. We also present a variety of both novel and existing pole selection strategies for which we develop a computable error certificate. Our numerical experiments comprise a detailed parameter study of space-time fractional diffusion problems and compare the performance of the poles with the ones predicted by our certificate.     

Efficient algorithms for computing rank-revealing factorizations on a GPU

Standard rank-revealing factorizations such as the singular value decomposition (SVD) and column pivoted QR factorization are challenging to implement efficiently on a GPU. A major difficulty in this regard is the inability of standard algorithms to cast most operations in terms of the Level-3 BLAS. This article presents two alternative algorithms for computing a rank-revealing factorization of the form $\mathsf{A}=\mathsf{U}\mathsf{T}{\mathsf{V}}^{\ast }$, where $\mathsf{U}$ and $\mathsf{V}$ are orthogonal and $\mathsf{T}$ is trapezoidal (or triangular if $\mathsf{A}$ is square). Both algorithms use randomized projection techniques to cast most of the flops in terms of matrix-matrix multiplication, which is exceptionally efficient on the GPU. Numerical experiments illustrate that these algorithms achieve significant acceleration over finely tuned GPU implementations of the SVD while providing low rank approximation errors close to that of the SVD.     

Global well-posedness and finite time blow-up for a class of wave equation involving fractional p-Laplacian with logarithmic nonlinearity

In this paper, we consider the following class of wave equation involving fractional p-Laplacian with logarithmic nonlinearity where $\mathrm{\Omega }\subset {\mathbb{R}}^N(N\ge 1)$ is a bounded domain with Lipschitz boundary, $s\in (0,1)$, , and $p_s^{\ast }=\frac{Np}{N-sp}$ is the critical exponent in the Sobolev inequality. First, via the Galerkin approximations, the existence of local solutions are obtained when . Next, by combining the potential well theory with the Nehari manifold, we establish the existence of global solutions when . Then, via the Pohozaev manifold, the existence of global solutions are obtained when . By virtue of a differential inequality technique, we prove that the local solutions blow-up in finite time with arbitrary negative initial energy and suitable initial values. Moreover, we discuss the asymptotic behavior of solutions as time tends to infinity. Here, we point out that the main difficulty is the lack of logarithmic Sobolev inequality concerning fractional p-Laplacian.     

Liouville-type theorems for a nonlinear fractional Choquard equation

In this paper, we are concerned with the fractional Choquard equation on the whole space ${\mathbb{R}}^N$ $${(-\mathrm{\Delta })}^{s}u=\left(\frac{1}{{|x|}^{N-2s}}\ast u^p\right)u^{p-1}$$ with , $N>2s$ and $p\in \mathbb{R}$. We first prove that the equation does not possess any positive solution for $p\le 1$. When $p>1$, we establish a Liouville type theorem saying that if then the equation has no positive stable solution. This extends, in particular, a result in [27] to the fractional Choquard equation.     

Exponential decay for semilinear wave equation with localized damping in the hyperbolic space

In this paper, we study the exponential decay of the energy associated to an initial value problem involving the wave equation on the hyperbolic space ${\mathbb{B}}^N$. The space ${\mathbb{B}}^N$ is the unit disc of ${\mathbb{R}}^N$ endowed with the Riemannian metric g given by $g_{ij}=p^2{\delta }_{ij}$, where $p(x)=\frac{2}{1-{|x|}^2}$ and ${\delta }_{ij}=1$, if $i=j$ and ${\delta }_{ij}=0$, if $i\ne j$. Making an appropriate change, the problem can be seen as a singular problem on the boundary of the open ball endowed with the euclidean metric. The proof is based on the multiplier techniques combined with the use of Hardy's inequality, in a version due to the Brezis–Marcus, which allows us to overcome the difficulty involving the singularities.     

Normalized ground state for the Sobolev critical Schrödinger equation involving Hardy term with combined nonlinearities

In this paper, we study the existence and properties of normalized solutions for the following Sobolev critical Schrödinger equation involving Hardy term: $$-\mathrm{\Delta }u-\frac{\mu }{{|x|}^2}u=\lambda u+{|u|}^{2^{\ast }-2}u+\nu {|u|}^{p-2}u\text{in}{\mathbb{R}}^N,N\ge 3,$$ with prescribed mass $${\int }_{{\mathbb{R}}^N}{u}^2=a^2,$$ where 2* is the Sobolev critical exponent. For a L²-subcritical, L²-critical, or L²-supercritical perturbation ${\nu |u|}^{p-2}u$, we prove several existence results of normalized ground state when $\nu \ge 0$ and non-existence results when $\nu \le 0$. Furthermore, we also consider the asymptotic behavior of the normalized solutions u as $\mu \to 0$ or $\nu \to 0$.     

Boundary behavior of the solution to the linear Korteweg-De Vries equation on the half line

In this paper, we consider the solution to the linear Korteweg-De Vries (KdV) equation, both homogeneous and forced, on the quadrant $\{x\in {\mathbb{R}}^{+},t\in {\mathbb{R}}^{+}\}$ via the unified transform method of Fokas and we provide a complete rigorous study of the integrals of the formula provided by the method, especially focusing on the explicit verification of the considered initial-boundary-value problems (IBVPs), with generic data, as well as on the uniform convergence of all its derivatives, as $(x,t)$ approaches the boundary of the quadrant, and their rapid decay as $x\to \infty$.     

On the equivalence of certain quasi-Hermitian varieties

By Aguglia et al., new quasi-Hermitian varieties ${\mathrm{ℳ}}_{\alpha ,\beta }$ in $\text{PG}\left(r,q^2\right)$ depending on a pair of parameters $\alpha ,\beta$ from the underlying field $\text{GF}\left(q^2\right)$ have been constructed. In the present paper we study the structure of the lines contained in ${\mathrm{ℳ}}_{\alpha ,\beta }$ and consequently determine the projective equivalence classes of such varieties for $q$ odd and $r=3$. As a byproduct, we also prove that the collinearity graph of ${\mathrm{ℳ}}_{\alpha ,\beta }$ is connected with diameter 3 for $q\equiv 1\left(\mathrm{mod}4\right)$.