Related papers: A non-iterative straightening algorithm and orthog…
A novel class of high-order linearly implicit energy-preserving integrating factor Runge-Kutta methods are proposed for the nonlinear Schr\"odinger equation. Based on the idea of the scalar auxiliary variable approach, the original equation…
A quantitative definition of numerical stiffness for initial value problems is proposed. Exponential integrators can effectively integrate linearly stiff systems, but they become expensive when the linear coefficient is a matrix, especially…
In this paper, we analyse a new exponential-type integrator for the nonlinear cubic Schr\"odinger equation on the $d$ dimensional torus $\mathbb T^d$. The scheme has recently also been derived in a wider context of decorated trees in [Y.…
A linearly implicit conservative difference scheme is applied to discretize the attractive coupled nonlinear Schr\"odinger equations with fractional Laplacian. Complex symmetric linear systems can be obtained, and the system matrices are…
For the solution of the cubic nonlinear Schr\"odinger equation in one space dimension, we propose and analyse a fully discrete low-regularity integrator. The scheme is explicit and can easily be implemented using the fast Fourier transform…
This paper introduces the notion of Brauer-friendly modules, a generalisation of endo-p-permutation modules. A module over a block algebra OGe is said to be Brauer-friendly if it is a direct sum of indecomposable modules with compatible…
A scheme to encode arbitrarily long integer pairs on degenerate optical parametric oscillations multiplexed in time is proposed. The classical entanglement between the polarization directions and the phases of the oscillating pulses,…
As a classical time-stepping method, it is well-known that the Strang splitting method reaches the first-order accuracy by losing two spatial derivatives. In this paper, we propose a modified splitting method for the 1D cubic nonlinear…
Let $(R, \mf, k_R)$ be regular local $k$-algebra satisfying the weak Jacobian criterion, such that $k_R/k$ is an algebraic field extension. Let $D_R$ be the ring of $k$-linear differential operators of $R$. We give an explicit decomposition…
In this paper, the connections are investigated between two different approaches towards the parametrization of multivariable stable all-pass systems in discrete-time. The first approach involves the tangential Schur algorithm, which…
The main objective of this paper is to present an efficient structure-preserving scheme, which is based on the idea of the scalar auxiliary variable approach, for solving the space fractional nonlinear Schr\"{o}dinger equation. First, we…
In this paper we describe the thickened strips and the outside nested decompositions of any skew shape $\lambda/\mu$. For any such decomposition $\Phi=(\Theta_1,\Theta_2,\ldots,\Theta_g)$ of the skew shape $\lambda/\mu$ where $\Theta_i$ is…
We prove refined generating series formulae for characters of (virtual) cohomology representations of external products of suitable coefficients, e.g., (complexes of) constructible or coherent sheaves, or (complexes of) mixed Hodge modules…
In this chapter, we demonstrate a general formulation of the Finite Element Method allowing to calculate the diffraction efficiencies from the electromagnetic field diffracted by arbitrarily shaped gratings embedded in a multilayered stack…
Spacetime discontinuous Galerkin (SDG) finite element methods are used to solve such PDEs involving space and time variables arising from wave propagation phenomena in important applications in science and engineering. To support an…
Let $R$ be an $n\times n$ expanding matrix with integral entries. A fundamental question in the fractal tiling theory is to understand the structure of the digit set $\mathcal{D}\subset\mathbb{Z}^n$ so that the integral self-affine set…
We present a new line-based discontinuous Galerkin (DG) discretization scheme for first- and second-order systems of partial differential equations. The scheme is based on fully unstructured meshes of quadrilateral or hexahedral elements,…
Schur-type methods in \cite{Chu2} and \cite{GCQX} solve the robust pole assignment problem by employing the departure from normality of the closed-loop system matrix as the measure of robustness. They work well generally when all poles to…
A new algorithm to compute the restricted singular value decomposition of dense matrices is presented. Like Zha's method \cite{Zha92}, the new algorithm uses an implicit Kogbetliantz iteration, but with four major innovations. The first…
To a smooth and proper morphism $\mathcal{X}\to U$ with quasicompact semiseparated target we associate a sheaf in the \'etale topology, which takes an affine $U$-scheme $V$ to the set of $V$-linear semiorthogonal decompositions (of fixed…