Tensor method for optimal control problems constrained by fractional three-dimensional elliptic operator with variable coefficients

We introduce the tensor numerical method for solving optimal control problems that are constrained by fractional two- (2D) and three-dimensional (3D) elliptic operators with variable coefficients. We solve the governing equation for the control function which includes a sum of the fractional operator and its inverse, both discretized over large 3D $n\times n\times n$ spacial grids. Using the diagonalization of the arising matrix-valued functions in the eigenbasis of the one-dimensional Sturm–Liouville operators, we construct the rank-structured tensor approximation with controllable precision for the discretized fractional elliptic operators and the respective preconditioner. The right-hand side in the constraining equation (the optimal design function) is supposed to be represented in a form of a low-rank canonical tensor. Then the equation for the control function is solved in a tensor structured format by using preconditioned CG iteration with the adaptive rank truncation procedure that also ensures the accuracy of calculations, given an $\epsilon$-threshold. This method reduces the numerical cost for solving the control problem to $O(n\log n)$ (plus the quadratic term $O(n^2)$ with a small weight), which outperforms traditional approaches with $O(n^3\log n)$ complexity in the 3D case. The storage for the representation of all 3D nonlocal operators and functions involved is also estimated by $O(n\log n)$. This essentially outperforms the traditional methods operating with fully populated $n^3\times n^3$ matrices and vectors in ${?}^{n^3}$. Numerical tests for 2D/3D control problems indicate the almost linear complexity scaling of the rank truncated preconditioned conjugate gradient iteration in the univariate grid size n.     

A reduced basis approach to large‐scale pseudospectra computation

For studying spectral properties of a nonnormal matrix $A\in {\mathbb{C}}^{n\times n}$, information about its spectrum σ(A) alone is usually not enough. Effects of perturbations on σ(A) can be studied by computing ε‐pseudospectra, i.e. the level sets of the resolvent norm function $\mathsf{g}(z)=\Vert {(zI?A)}^{?1}{\Vert }_2$. The computation of ε‐pseudospectra requires determining the smallest singular values ${\sigma }_{\min }(zI?A)$ for all z on a portion of the complex plane. In this work, we propose a reduced basis approach to pseudospectra computation, which provides highly accurate estimates of pseudospectra in the region of interest, in particular, for pseudospectra estimates in isolated parts of the spectrum containing few eigenvalues of A. It incorporates the sampled singular vectors of zI ? A for different values of z, and implicitly exploits their smoothness properties. It provides rigorous upper and lower bounds for the pseudospectra in the region of interest. In addition, we propose a domain splitting technique for tackling numerically more challenging examples. We present a comparison of our algorithms to several existing approaches on a number of numerical examples, showing that our approach provides significant improvement in terms of computational time.     

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.     

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.     

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.     

A fast and accurate algorithm for solving linear systems associated with a class of negative matrix

A class of negative matrices including Vandermonde-like matrices tends to be extremely ill-conditioned, and linear systems associated with this class of matrices appear in the polynomial interpolation problems. In this article, we present a fast and accurate algorithm with $O(n^2)$ complexity to solve the linear systems whose coefficient matrices belong to the class of negative matrix. We show that the inverse of any such matrix is generated in a subtraction-free manner. Consequently, the solutions of linear systems associated with the class of negative matrix are accurately determined by parameterization matrices of coefficient matrices, and a pleasantly componentwise forward error is provided to illustrate that each component of the solution is computed to high accuracy. Numerical experiments are performed to confirm the claimed high accuracy.     

A fast Fourier transform based direct solver for the Helmholtz problem

This article is devoted to the efficient numerical solution of the Helmholtz equation in a two‐ or three‐dimensional (2D or 3D) rectangular domain with an absorbing boundary condition (ABC). The Helmholtz problem is discretized by standard bilinear and trilinear finite elements on an orthogonal mesh yielding a separable system of linear equations. The main key to high performance is to employ the fast Fourier transform (FFT) within a fast direct solver to solve the large separable systems. The computational complexity of the proposed FFT‐based direct solver is $\mathrm{??}(N\log N)$ operations. Numerical results for both 2D and 3D problems are presented confirming the efficiency of the method discussed.     

The two-dimensional stationary Navier–Stokes equations in toroidal Besov spaces

We consider the stationary Navier–Stokes equations in the two-dimensional torus ${\mathbb{T}}^2$. For any $\epsilon >0$, we show the existence, uniqueness, and continuous dependence of solutions in homogeneous toroidal Besov spaces ${\dot{B}}_{p+\epsilon ,q}^{-1+\frac{2}{p}}({\mathbb{T}}^2)$ for given small external forces in ${\dot{B}}_{p+\epsilon ,q}^{-3+\frac{2}{p}}({\mathbb{T}}^2)$ when . These spaces become closer to the scaling invariant ones if the difference ε becomes smaller. This well-posedness is proved by using the embedding property and the para-product estimate in homogeneous Besov spaces. In addition, for the case $(p,q)\in (\{2\}\times (2,\infty ])\cup ((2,\infty ]\times [1,\infty ])$, we can show the ill-posedness, even in the scaling invariant spaces. Actually in such cases of p and q, we can prove that ill-posedness by showing the discontinuity of a certain solution map from ${\dot{B}}_{p,q}^{-3+\frac{2}{p}}({\mathbb{T}}^2)$ to ${\dot{B}}_{p,q}^{-1+\frac{2}{p}}({\mathbb{T}}^2)$.     

Nonlinear approximation of functions based on nonnegative least squares solver

In computational practice, most attention is paid to rational approximations of functions and approximations by the sum of exponents. We consider a wide enough class of nonlinear approximations characterized by a set of two required parameters. The approximating function is linear in the first parameter; these parameters are assumed to be positive. The individual terms of the approximating function represent a fixed function that depends nonlinearly on the second parameter. A numerical approximation minimizes the residual functional by approximating function values at individual points. The second parameter's value is set on a more extensive set of points of the interval of permissible values. The proposed approach's key feature consists in determining the first parameter on each separate iteration of the classical nonnegative least squares method. The computational algorithm is used to rational approximate the function . The second example concerns the approximation of the stretching exponential function at $x\ge 0$ by the sum of exponents.     

Blow‐up for wave equation with the scale‐invariant damping and combined nonlinearities

In this article, we study the blow‐up of the damped wave equation in the scale‐invariant case and in the presence of two nonlinearities. More precisely, we consider the following equation: $$u_{tt}?\mathrm{\Delta }u+\frac{\mu }{1+t}{u}_t=|u_t{|}^p+|u{|}^q,\text{in}{?}^N\times [0,\infty ),$$ with small initial data. For $\mu <\frac{N(q?1)}{2}$ and μ ∈ (0, μ_?) , where μ_? > 0 is depending on the nonlinearties' powers and the space dimension (μ_? satisfies $(q?1)\left((N+2{\mu }_{?}?1)p?2\right)=4$), we prove that the wave equation, in this case, behaves like the one without dissipation (μ = 0 ). Our result completes the previous studies in the case where the dissipation is given by $\frac{\mu }{{(1+t)}^{\beta }}{u}_t;\beta >1$, where, contrary to what we obtain in the present work, the effect of the damping is not significant in the dynamics. Interestingly, in our case, the influence of the damping term $\frac{\mu }{1+t}{u}_t$ is important.     

Asymptotic spectra of large matrices coming from the symmetrization of Toeplitz structure functions and applications to preconditioning

The singular value distribution of the matrix‐sequence {Y_nT_n[f]}_n , with T_n[f] generated by $f\in L^1([?\pi ,\pi ])$, was shown in [J. Pestana and A.J. Wathen, SIAM J Matrix Anal Appl. 2015;36(1):273‐288]. The results on the spectral distribution of {Y_nT_n[f]}_n were obtained independently in [M. Mazza and J. Pestana, BIT, 59(2):463‐482, 2019] and [P. Ferrari, I. Furci, S. Hon, M.A. Mursaleen, and S. Serra‐Capizzano, SIAM J. Matrix Anal. Appl., 40(3):1066‐1086, 2019]. In the latter reference, the authors prove that {Y_nT_n[f]}_n is distributed in the eigenvalue sense as $${?}_{|f|}(\theta )=\left\{\begin{array}{ll}|f(\theta )|,& \theta \in [0,2\pi ],\\ ?|f(?\theta )|,& \theta \in [?2\pi ,0),\end{array}\right.$$ under the assumptions that f belongs to $L^1([?\pi ,\pi ])$ and has real Fourier coefficients. The purpose of this paper is to extend the latter result to matrix‐sequences of the form {h(T_n[f])}_n , where h is an analytic function. In particular, we provide the singular value distribution of the sequence {h(T_n[f])}_n , the eigenvalue distribution of the sequence {Y_nh(T_n[f])}_n , and the conditions on f and h for these distributions to hold. Finally, the implications of our findings are discussed, in terms of preconditioning and of fast solution methods for the related linear systems.     

Stability of stationary solutions to the Navier–Stokes equations in the Besov space

We consider the stability of the stationary solution w of the Navier–Stokes equations in the whole space ${\mathbb{R}}^n$ for $n\ge 3$. It is clarified that if w is small in ${\dot{B}}_{p_{*},q^{\prime }}^{-1+\frac{n}{p_{*}}}$ for and , then for every small initial disturbance $a\in {\dot{B}}_{p_0,q}^{-1+\frac{n}{p_0}}$ with and ($1/q+1/q^{\prime }=1$), there exists a unique solution $v(t)$ of the nonstationary Navier–Stokes equations on (0, ∞) with $v(0)=w+a$ such that ${\parallel v(t)-w\parallel }_{L^r}=O(t^{-\frac{n}{2}(\frac{1}{n}-\frac{1}{r})})$ and ${\parallel v(t)-w\parallel }_{{\dot{B}}_{p,q}^s}=O(t^{-\frac{n}{2}(\frac{1}{n}-\frac{1}{p})-\frac{s}{2}})$ as $t\to \infty$, for , , and small $s>0$.     

Degrees of categoricity of trees and the isomorphism problem

In this paper, we show that for any computable ordinal α, there exists a computable tree of rank $\alpha +1$ with strong degree of categoricity ${\mathbf{0}}^{(2\alpha )}$ if α is finite, and with strong degree of categoricity ${\mathbf{0}}^{(2\alpha +1)}$ if α is infinite. In fact, these are the greatest possible degrees of categoricity for such trees. For a computable limit ordinal α, we show that there is a computable tree of rank α with strong degree of categoricity ${\mathbf{0}}^{(\alpha )}$ (which equals ${\mathbf{0}}^{(2\alpha )}$). It follows from our proofs that, for every computable ordinal $\alpha >0$, the isomorphism problem for trees of rank α is ${\mathrm{\Pi }}_{2\alpha }^0$‐complete.     

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

Ground state solutions for a modified fractional Schrödinger equation with critical exponent

In this paper, we study the existence of ground state solutions for the modified fractional Schrödinger equations $${(-\mathrm{\Delta })}^{\alpha }u+\mu u+\kappa [{(-\mathrm{\Delta })}^{\alpha }{u}^2]u=\sigma |u{|}^{p-1}u+|u{|}^{q-2}u,x\in R^N,$$ where $N\ge 2$, $\alpha \in (0,1)$, $\mu$, $\sigma$ and $\kappa$ are positive parameters, $2<p+1<q\le 2_{\alpha }^{\ast }:=\frac{2N}{N-2\alpha }$, ${(-\mathrm{\Delta })}^{\alpha }$ denotes the fractional Laplacian of order $\alpha$. For the case $2<p+1<q<2_{\alpha }^{\ast }$ and the case $q=2_{\alpha }^{\ast }$, the existence results of ground state solutions are given, respectively.     

On fractional semidiscrete Dirac operators of Lévy–Leblond type

In this paper, we introduce a wide class of space-fractional and time-fractional semidiscrete Dirac operators of Lévy–Leblond type on the semidiscrete space-time lattice $h{\mathbb{Z}}^n\times [0,\infty )$ ($h>0$), resembling to fractional semidiscrete counterparts of the so-called parabolic Dirac operators. The methods adopted here are fairly operational, relying mostly on the algebraic manipulations involving Clifford algebras, discrete Fourier analysis techniques as well as standard properties of the analytic fractional semidiscrete semigroup ${\left\{\exp (-t{e}^{i\theta }{(-{\mathrm{\Delta }}_h)}^{\alpha })\right\}}_{t\ge 0}$, carrying the parameter constraints and $|\theta |\le \frac{\alpha \pi }{2}$. The results obtained involve the study of Cauchy problems on $h{\mathbb{Z}}^n\times [0,\infty )$.     

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.     

On the interpolation constants for variable Lebesgue spaces

For $\theta \in (0,1)$ and variable exponents $p_0(·),q_0(·)$ and $p_1(·),q_1(·)$ with values in [1, ∞], let the variable exponents $p_{\theta }(·),q_{\theta }(·)$ be defined by $$1/p_{\theta }(·):=(1-\theta )/p_0(·)+\theta /p_1(·),1/q_{\theta }(·):=(1-\theta )/q_0(·)+\theta /q_1(·).$$ The Riesz–Thorin–type interpolation theorem for variable Lebesgue spaces says that if a linear operator T acts boundedly from the variable Lebesgue space $L^{p_j(·)}$ to the variable Lebesgue space $L^{q_j(·)}$ for $j=0,1$, then $${\parallel T\parallel }_{L^{p_{\theta }(·)}\to L^{q_{\theta }(·)}}\le {C\parallel T\parallel }_{L^{p_0(·)}\to L^{q_0(·)}}^{1-\theta }{\parallel T\parallel }_{L^{p_1(·)}\to L^{q_1(·)}}^{\theta },$$ where C is an interpolation constant independent of T. We consider two different modulars ${\varrho }^{\max }(·)$ and ${\varrho }^{\mathrm{sum}}(·)$ generating variable Lebesgue spaces and give upper estimates for the corresponding interpolation constants C_max and C_sum, which imply that $C_{\max }\le 2$ and $C_{\mathrm{sum}}\le 4$, as well as, lead to sufficient conditions for $C_{\max }=1$ and $C_{\mathrm{sum}}=1$. We also construct an example showing that, in many cases, our upper estimates are sharp and the interpolation constant is greater than one, even if one requires that $p_j(·)=q_j(·)$, $j=0,1$ are Lipschitz continuous and bounded away from one and infinity (in this case, ${\varrho }^{\max }(·)={\varrho }^{\mathrm{sum}}(·)$).