Related papers: Tesler matrices and Lusztig data
Lenstra's integer factorization algorithm is asymptotically one of the fastest known algorithms, and is ideally suited for parallel computation. We suggest a way in which the algorithm can be speeded up by the addition of a second phase.…
We prove an asymptotic estimate for the number of mxn non-negative integer matrices (contingency tables) with prescribed row and column sums and, more generally, for the number of integer feasible flows in a network. Similarly, we estimate…
Functional data present as functions or curves possessing a spatial or temporal component. These components by nature have a fixed observational domain. Consequently, any asymptotic investigation requires modelling the increased correlation…
In vivo and in vitro systems of cells and extra-cellular matrix (ECM) systems are well known to form ordered patterns of orientationally aligned fibers. Here, we interpret them as active analogs of the (disordered) isotropic to the…
The purpose of this paper is twofold. One is to give a survey of our study on the reductions of harmonic bundles, and the other is to explain a simple application in the study of TERP structure. In particular, we investigate the asymptotic…
We study the kinetics of the nematic-isotropic transition in a two-dimensional liquid crystal by using a lattice Boltzmann scheme that couples the tensor order parameter and the flow consistently. Unlike in previous studies, we find the…
We consider a higher-order Milstein scheme for stochastic partial differential equations with trace class noise which fulfill a certain commutativity condition. A novel technique to generally improve the order of convergence of Taylor…
This paper is devoted to studying non-commensurate fractional order planar systems. Our contributions are to derive sufficient conditions for the global attractivity of non-trivial solutions to fractional-order inhomogeneous linear planar…
In this paper, we study properties of asymptotic resemblance relations induced by compatible coarse structures on groups. We generalize the notion of asymptotic dimensiongrad for groups with compatible coarse structures and show this notion…
In this work, we describe advanced numerical tools for working with multivariate functions and for the analysis of large data sets. These tools will drastically reduce the required computing time and the storage cost, and, therefore, will…
We employ computer algebra algorithms to prove a collection of identities involving Bessel functions with half-integer orders and other special functions. These identities appear in the famous Handbook of Mathematical Functions, as well as…
A new method to represent and approximate rotation matrices is introduced. The method represents approximations of a rotation matrix $Q$ with linearithmic complexity, i.e. with $\frac{1}{2}n\lg(n)$ rotations over pairs of coordinates,…
We propose stochastic splitting algorithms for solving large-scale composite inclusion problems involving monotone and linear operators. They activate at each iteration blocks of randomly selected resolvents of monotone operators and,…
Asymptotic properties of a vector of length power functionals of random geometric graphs are investigated. More precisely, its asymptotic covariance matrix is studied as the intensity of the underlying homogeneous Poisson point process…
We propose and analyze a second-order Strang splitting method for a class of stiff matrix differential equations with Sylvester-type structure. The method splits the dynamics into a stiff linear part, treated exactly via matrix…
In this paper we prove that there exists an asymptotical diagonalization algorithm for a class of sparse Hermitian (or real symmetric) matrices if and only if the matrices become Hessenberg matrices after some permutation of rows and…
In this paper we obtain precise asymptotics for certain families of graphs, namely circulant graphs and degenerating discrete tori. The asymptotics contain interesting constants from number theory among which some can be interpreted as…
These lecture notes are intended as an introduction to several notions of tensor rank and their connections to the asymptotic complexity of matrix multiplication. The latter is studied with the exponent of matrix multiplication, which will…
The main purpose of this paper is to study the structure of the well-known non-iterative MUltiple SIgnal Classification (MUSIC) algorithm for identifying the shape of extended electromagnetic inclusions of small thickness located in a…
The purpose of this material is to review the Adler Kostant Symes scheme as a theory which can be developped succesfully in different contexts. It was useful to describe some mechanical systems, the so called generalized Toda, and now it…