データ列に対する各種アルゴリズムの逆変換に基づく統一的導出

Cycle premodules are roughly said functors on elds which have transfer, are modules over Milnor's K -theory, are equipped with residue maps for discrete valuations and satisfy

Comparing the Gauss-Jordan-based algorithm and the algorithm presented in [5], which is based on the LU factorization of the Laplacian matrix, we note that despite the fact that

In the present §3, we establish functorial “group-theoretic” algorithms for reconstruct- ing various objects related to the geometry of the stable models of proper hyperbolic

This article demonstrates a systematic derivation of stochastic Taylor methods for solving stochastic delay differential equations (SDDEs) with a constant time lag, r > 0..

In this section we look at spectral sequences for calculating the homology of the bar and cobar constructions on operads and cooperads in based spaces or spectra.. It turns out that

We presented simple and data-guided lexisearch algorithms that use path representation method for representing a tour for the benchmark asymmetric traveling salesman problem to

Here we purpose, firstly, to establish analogous results for collocation with respect to Chebyshev nodes of first kind (and to compare them with the results of [7]) and, secondly,

All three problems (1*, 2*.1 2*.2) are open; there are conjectures which would provide complete answers to these problems and some partial results supporting these conjectures