J151 e JETTA 2010 4 最近の更新履歴 Hideo Fujiwara J151 e JETTA 2010 4

For a given complex square matrix A, we develop, implement and test a fast geometric algorithm to find a unit vector that generates a given point in the complex plane if this point

For computing Pad´ e approximants, we present presumably stable recursive algorithms that follow two adjacent rows of the Pad´ e table and generalize the well-known classical

As in [6], we also used an iterative algorithm based on surrogate functionals for the minimization of the Tikhonov functional with the sparsity penalty, and proved the convergence

Given a cubic ´etale algebra E and an Albert algebra J over F, the idea of the proof is to factor two isomorphic embeddings from E to J through the same absolutely

Given that we computed the M -triangle of the m-divisible non-crossing partitions poset for E 7 and E 8 and that the F -triangle of the generalised cluster complex has been computed

We have shown [2, 4] that complete spreads (with a locally connected domain) over a bounded topos E (relative to S ) are ‘comprehensive’ in the sense that they are precisely the

The bound of Lemma 3 is connected to the constant 4/33 in Theorem 1 in the following way: given a result of the form E c (x, yk) > zk, we shall deduce a lower bound of the

In Section 4, we observe that for every Hecke group the corresponding Eisenstein series E 2 (m) satisfies an ordinary differential equation of order m that can be