-
Article type: Cover
2009 Volume 19 Issue 4 Pages
Cover1-
Published: December 25, 2009
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
-
Article type: Cover
2009 Volume 19 Issue 4 Pages
Cover2-
Published: December 25, 2009
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
-
Article type: Index
2009 Volume 19 Issue 4 Pages
Toc1-
Published: December 25, 2009
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
-
Article type: Appendix
2009 Volume 19 Issue 4 Pages
App1-
Published: December 25, 2009
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
-
[in Japanese]
Article type: Article
2009 Volume 19 Issue 4 Pages
i-
Published: December 25, 2009
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
-
Article type: Appendix
2009 Volume 19 Issue 4 Pages
App2-
Published: December 25, 2009
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
-
Takaharu Yaguchi, Takayasu Matsuo, Masaaki Sugihara
Article type: Article
2009 Volume 19 Issue 4 Pages
371-431
Published: December 25, 2009
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
The discrete variational method is a method to derive finite difference schemes that inherit the conservation/dissipation properties of the original equations. Although this method has been developed on uniform grids, we show that this method is also applicable to multi-dimensional non-uniform grids.
View full abstract
-
Naoki Ogura, Shigenori Uchiyama, Ken Nakamula
Article type: Article
2009 Volume 19 Issue 4 Pages
433-445
Published: December 25, 2009
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
In 2001, SFLASH, which is one of the most efficient signature schemes, was proposed by Patarin et al. This scheme is a kind of multivariate quadratic public-key cryptosystems and has an efficient implementation on smart cards. Moreover, NESSIE selected SFLASH as one of the recommended schemes in 2003. In 2007, however, Dubois et al. proposed an efficient attack against SFLASH. On the other hand, the explicit algorithm would not be clearly shown. In this paper, we explicitly describe the algorithm by Dubois et al. Furthermore, we give some experimental results of the attack under the most general situation, and also discuss the results.
View full abstract
-
Hidefumi Kawakatsu, Hiroaki Sandoh
Article type: Article
2009 Volume 19 Issue 4 Pages
447-470
Published: December 25, 2009
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
The present study investigates an oligopoly market in the circumstances where a large-scale retailer coexists with a small-scale retailer in a relatively small market. The large-scale retailer deals in foodstuffs (Commodity A) as well as other sorts of commodities such as sundries, clothes and electrical home appliances (Commodity B), while the small-scale retailer mainly sells Commodity A to his consumers. We formulate the price competition problem as Nash game between the two retailers to analyze the existence of equilibrium with respect to the selling price of Commodity A. The same problem is also formulated as Stackelberg game. Numerical examples are presented to illustrate the theoretical underpinnings of the proposed formulation.
View full abstract
-
Yuzo Kusakabe, Seiji Fujino
Article type: Article
2009 Volume 19 Issue 4 Pages
471-487
Published: December 25, 2009
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
In this paper we consider how to give the initial approximate solution χ_0 of the restarted GMRES(k) method with iterative refinement process which was proposed by Imakura et al. In this restarted GMRES(k) method, it is crucial to give a reasonable initial approximate solution e_0 of the equation of errors in order to improve the convergence of the restarted GMRES(k) method at the restarted phase. In order to do so, we adopt the higher order Minimal Residual method proposed by Indora et al. Numerical experiments show that the IR-GMRES(k)-MR(4) method works best among several methods.
View full abstract
-
Hiroyuki Yamagishi, Yoshinori Kametaka, Kazuo Takemura, Kohtaro Watana ...
Article type: Article
2009 Volume 19 Issue 4 Pages
489-518
Published: December 25, 2009
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
We consider 4 two-point boundary value problems for bending of a beam supported by uniformly distributed springs with spring constant q>0 on a fixed floor under tension p>0. The tension is relatively strong, that is (p/2)^2>q. We have treated clamped, Dirichlet, Neumann and free boundary conditions and found their Green functions. As an application, we have found the best constants of the corresponding Sobolev inequality, which are equal to the maximum of diagonal values of Green functions. Putting p=a^2+b^2, q=a^2b^2, a>b>0, we have found explicit forms of the best constants in terms of a, b.
View full abstract
-
Ryosuke Nishi, Hiroshi Miki, Akiyasu Tomoeda, Katsuhiro Nishinari
Article type: Article
2009 Volume 19 Issue 4 Pages
519-536
Published: December 25, 2009
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
For releasing the heavy congestion occurring at intersections on highway traffic, the efficiency of the "alternative" merging is discussed. This is the merging of vehicles on two lanes by turns. This merging is compared with the "random" merging, which is the merging of vehicles irrespective of other vehicles on another lane, in terms of travel time and flux, by using numerical simulations. We define a new multiple-lane cellular automaton model with a slow-to-start rule for the simulations. Simulation results show that the reversal of travel time and flux is observed between these two merging as the slow-to-start effect changes.
View full abstract
-
Takafumi Miyata, Lei Du, Tomohiro Sogabe, Yusaku Yamamoto, Shao-Liang ...
Article type: Article
2009 Volume 19 Issue 4 Pages
537-550
Published: December 25, 2009
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
The Sakurai-Sugiura method was proposed to compute the eigenvalues which are contained in a specified region on the complex plane. In this paper, we extend the Sakurai-Sugiura method to compute the eigenvalues in a finite and multiply connected region. We also analyze the error of the computed eigenvalues.
View full abstract
-
Akira Imakura, Tomohiro Sogabe, Shao-Liang Zhang
Article type: Article
2009 Volume 19 Issue 4 Pages
551-564
Published: December 25, 2009
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
In 1986, the GMRES method and its restarted version, GMRES(m) method, were proposed by Saad and Schultz for solving nonsymmetric linear systems. In this paper, we investigate the restart of the GMRES(m) method. The main goal of this paper is to propose an extension of the GMRES(m) method based on a new framework of the restart. A mathematical background of the extension is analyzed based on the error equations. The numerical results are presented to show a potential efficiency in our framework.
View full abstract
-
Article type: Index
2009 Volume 19 Issue 4 Pages
A195-A197
Published: December 25, 2009
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
-
Article type: Index
2009 Volume 19 Issue 4 Pages
A198-A201
Published: December 25, 2009
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
-
Article type: Appendix
2009 Volume 19 Issue 4 Pages
App3-
Published: December 25, 2009
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
-
Article type: Appendix
2009 Volume 19 Issue 4 Pages
App4-
Published: December 25, 2009
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
-
Article type: Appendix
2009 Volume 19 Issue 4 Pages
App5-
Published: December 25, 2009
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
-
Article type: Index
2009 Volume 19 Issue 4 Pages
Toc2-
Published: December 25, 2009
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
-
Article type: Cover
2009 Volume 19 Issue 4 Pages
Cover3-
Published: December 25, 2009
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
-
Article type: Cover
2009 Volume 19 Issue 4 Pages
Cover4-
Published: December 25, 2009
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS