Fast solver for quasi-periodic 2D-Helmholtz scattering in layered media

We present a fast spectral Galerkin scheme for the discretization of boundary integral equations arising from two-dimensional Helmholtz transmission problems in multi-layered periodic structures or gratings. Employing suitably parametrized Fourier basis and excluding cut-off frequen- cies (also known as Rayleigh-Wood frequencies), we rigorously establish the well-posedness of both continuous and discrete problems, and prove super-algebraic error convergence rates for the proposed scheme. Through several numerical examples, we confirm our findings and show performances competitive to those attained via Nystr\"om methods.

Optimal error estimate for a space-time discretization for incompressible generalized Newtonian fluids: the Dirichlet problem

In this paper we prove optimal error estimates for solutions with natural regularity of the equations describing the unsteady motion of incompressible shear-thinning fluids. We consider a full space-time semi-implicit scheme for the discretization. The main novelty, with respect to previous results, is that we obtain the estimates directly without introducing intermediate semi-discrete problems, which enables the treatment of homogeneous Dirichlet boundary conditions.

Identification Conditions for the Solvability of NP-complete Problems for the Class of Pre-fractal Graphs

Modern network systems (unmanned aerial vehicles groups, social networks, network production chains, transport and logistics networks, communication networks, cryptocurrency networks) are distinguished by their multi-element nature and the dynamics of connections between its elements. A number of discrete problems on the construction of optimal substructures of network systems described in the form of various classes of graphs are NP-complete problems. In this case, the variability and dynamism of the structures of network systems leads to an "additional" complication of the search for solutions to discrete optimization problems. At the same time, for some subclasses of dynamical graphs, which are used to model the structures of network systems, conditions for the solvability of a number of NP-complete problems can be distinguished. This subclass of dynamic graphs includes pre-fractal graphs. The article investigates NP-complete problems on pre-fractal graphs: a Hamiltonian cycle, a skeleton with the maximum number of pendant vertices, a monochromatic triangle, a clique, an independent set. The conditions under which for some problems it is possible to obtain an answer about the existence and to construct polynomial (when fixing the number of seed vertices) algorithms for finding solutions are identified.

Optimal control of system governed by nonlinear volterra integral and fractional derivative equations

This work presents a novel formulation for the numerical solution of optimal control problems related to nonlinear Volterra fractional integral equations systems. A spectral approach is implemented based on the new polynomials known as Chelyshkov polynomials. First, the properties of these polynomials are studied to solve the aforementioned problems. The operational matrices and the Galerkin method are used to discretize the continuous optimal control problems. Thereafter, some necessary conditions are defined according to which the optimal solutions of discrete problems converge to the optimal solution of the continuous ones. The applicability of the proposed approach has been illustrated through several examples. In addition, a comparison is made with other methods for showing the accuracy of the proposed one, resulting also in an improved efficiency.

Finite element algorithms for nonlocal minimal graphs

<abstract><p>We discuss computational and qualitative aspects of the fractional Plateau and the prescribed fractional mean curvature problems on bounded domains subject to exterior data being a subgraph. We recast these problems in terms of energy minimization, and we discretize the latter with piecewise linear finite elements. For the computation of the discrete solutions, we propose and study a gradient flow and a Newton scheme, and we quantify the effect of Dirichlet data truncation. We also present a wide variety of numerical experiments that illustrate qualitative and quantitative features of fractional minimal graphs and the associated discrete problems.</p></abstract>

High-order Galerkin method for Helmholtz and Laplace problems on multiple open arcs

We present a spectral Galerkin numerical scheme for solving Helmholtz and Laplace problems with Dirichlet boundary conditions on a finite collection of open arcs in two-dimensional space. A boundary integral method is employed, giving rise to a first kind Fredholm equation whose variational form is discretized using weighted Chebyshev polynomials. Well-posedness of the discrete problems is established as well as algebraic or even exponential convergence rates depending on the regularities of both arcs and excitations. Our numerical experiments show the robustness of the method with respect to number of arcs and large wavenumber range. Moreover, we present a suitable compression algorithm that further accelerates computational times.