Related papers: A Structure-Preserving Divide-and-Conquer Method f…
We develop a structure-preserving computational framework for acoustic wave scattering by moving objects, comprising a new PML-domain-embedding model and a compatible numerical approximation. The model couples a perfectly matched layer…
Using the method of equivariant moving frames, we present a procedure for constructing symmetry-preserving finite element methods for second-order ordinary differential equations. Using the method of lines, we then indicate how our…
We provide a sufficient criterion for the unique parameter identification of combinatorially symmetric Hidden Markov Models based on the structure of their transition matrix. If the observed states of the chain form a zero forcing set of…
When computing the eigenstructure of matrix pencils associated with the passivity analysis of perturbed port-Hamiltonian descriptor system using a structured generalized eigenvalue method, one should make sure that the computed spectrum…
Subdivision schemes are iterative methods for the design of smooth curves and surfaces. Any linear subdivision scheme can be identified by a sequence of Laurent polynomials, also called subdivision symbols, which describe the linear rules…
In this paper, we study the geometry of reduced density matrices for states with symmetry-protected topological (SPT) order. We observe ruled surface structures on the boundary of the convex set of low dimension projections of the reduced…
For random graphs distributed according to a stochastic block model, we consider the inferential task of partioning vertices into blocks using spectral techniques. Spectral partioning using the normalized Laplacian and the adjacency matrix…
The method of spectral decimation is applied to an infinite collection of self--similar fractals. The sets considered belong to the class of nested fractals, and are thus very symmetric. An explicit construction is given to obtain formulas…
Symmetry-protected topological (SPT) phases exhibit nontrivial order if symmetry is respected but are adiabatically connected to the trivial product phase if symmetry is not respected. However, unlike the symmetry-breaking phase, there is…
Concatenating matrices is a common technique for uncovering shared structures in data through singular value decomposition (SVD) and low-rank approximations. The fundamental question arises: How does the singular value spectrum of the…
We address the subset selection problem for matrices, where the goal is to select a subset of $k$ columns from a "short-and-fat" matrix $X \in \mathbb{R}^{m \times n}$, such that the pseudoinverse of the sampled submatrix has as small…
Surface integral equations (SIEs)-based boundary element methods are widely used for analyzing electromagnetic scattering scenarii. However, after discretization of SIEs, the spectrum and eigenvectors of the boundary element matrices are…
With the example of the spherically symmetric scalar wave equation on Minkowski space-time we demonstrate that a fully pseudospectral scheme (i.e. spectral with respect to both spatial and time directions) can be applied for solving…
Our aim in this note is to extend the semi discrete technique by combine it with the split step method. We apply our new method to the Ait-Sahalia model and propose an explicit and positivity preserving numerical scheme.
Distributed order fractional operators offer a rigorous tool for mathematical modelling of multi-physics phenomena, where the differential orders are distributed over a range of values rather than being just a fixed integer/fraction as it…
In this article we discuss the numerical analysis for the finite difference scheme of the one-dimensional nonlinear wave equations with dynamic boundary conditions. From the viewpoint of the discrete variational derivative method we propose…
Boundary problem for linear partial differential algebraic equations system with multiple characteristic curves is considered. It is supposed that matrix-functions pencil of the system under consideration is smoothly equivalent to special…
We present a parallelized bijective graph matching algorithm that leverages seeds and is designed to match very large graphs. Our algorithm combines spectral graph embedding with existing state-of-the-art seeded graph matching procedures.…
The structure-preserving doubling algorithm (SDA) is a fairly efficient method for solving problems closely related to Hamiltonian (or Hamiltonian-like) matrices, such as computing the required solutions to algebraic Riccati equations.…
The computation of tunes and matched beam distributions are essential steps in the analysis of circular accelerators. If certain symmetries - like midplane symmetrie - are present, then it is possible to treat the betatron motion in the…