-
Article type: Cover
2008 Volume 18 Issue 4 Pages
Cover1-
Published: December 25, 2008
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
-
Article type: Cover
2008 Volume 18 Issue 4 Pages
Cover2-
Published: December 25, 2008
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
-
Article type: Index
2008 Volume 18 Issue 4 Pages
Toc1-
Published: December 25, 2008
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
-
Article type: Appendix
2008 Volume 18 Issue 4 Pages
App1-
Published: December 25, 2008
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
-
[in Japanese]
Article type: Article
2008 Volume 18 Issue 4 Pages
i-
Published: December 25, 2008
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
-
Article type: Appendix
2008 Volume 18 Issue 4 Pages
App2-
Published: December 25, 2008
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
-
Daichi Yanagisawa, Akiyasu Tomoeda, Ayako Kimura, Katsuhiro Nishinari
Article type: Article
2008 Volume 18 Issue 4 Pages
507-534
Published: December 25, 2008
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
We introduce the effect of delay in walking from the head of the queue to the service windows in the queueing theory and analyze queueing systems under various conditions. When there are plural service windows, the queueing theory indicates that a fork-type queue, which collects people into a single queue, is more efficient than a parallel-type queue, i.e., queues for each service windows. However, in the walking-distance introduced queueing theory, we find that the parallel-type queue is more efficient when sufficiently many people are waiting in queues and service time is short against walking time.
View full abstract
-
Akiyasu Tomoeda, Kazumichi Ohtsuka, Katsuhiro Nishinari
Article type: Article
2008 Volume 18 Issue 4 Pages
535-546
Published: December 25, 2008
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
The mechanics of one-dimensional traffic flow has been expressed by many fluid models. Payne model is one of the best models which show instability in homogeneous flow. However, Payne model has two problems: instability at high density and numerical divergence for disturbance. Thus, in this study, we have first performed the linear stability analysis and represented the stability at high density by introducing the higher-order equation of velocity-density relation. Furthermore, it is found that small disturbance in Payne model has been governed by the Burgers equation and higher Burgers equation by using reductive perturbation method.
View full abstract
-
Shinya Nakamura, Daisuke Takahashi
Article type: Article
2008 Volume 18 Issue 4 Pages
547-562
Published: December 25, 2008
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
Almost known cellular automata (CA) follows an evolution rule defined by information of local cells. We construct a new type of CA with an evolution rule depending on global information curves in a cellular space. Moreover we propose extended types of the CA and show their interesting behavior of evolution.
View full abstract
-
Takafumi Miyata, Masashi Iwasaki, Yusaku Yamamoto, Shao-Liang Zhang
Article type: Article
2008 Volume 18 Issue 4 Pages
563-577
Published: December 25, 2008
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
The Multishift QR method (M-QR) enables us to compute all the eigenvalues of a symmetric tridiagonal matrix on parallel machines. To use all processors sufficiently, the Deferred shift QR method (D-QR) is proposed. However, the convergence rate of D-QR is numerically inferior to that of M-QR. Recently, the Fully Pipelined Multishift QR method (FPM-QR) is proposed. FPM-QR shows better convergence than D-QR while keeping the high level of processor utilization. In this paper, we analyze the asymptotic behavior of FPM-QR with two shifts.
View full abstract
-
Akitaka Sawamura
Article type: Article
2008 Volume 18 Issue 4 Pages
579-589
Published: December 25, 2008
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
I propose a rapidly converging method for first-principles electronic-structure calculations. The present method is based on the Kerker method, a diagonal preconditioner frequently employed for accelerating the convergence of the calculations by damping the charge-sloshing. The Kerker method contains two parameters to be determined in a trial-and-error way. The present method is an adaptive preconditioner where those two parameters are determined automatically in a simple way. The present method is applied in test cases of semiconductors with good results.
View full abstract
-
Kazuhito Somehara, Seiji Fujino
Article type: Article
2008 Volume 18 Issue 4 Pages
591-609
Published: December 25, 2008
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
In this paper, we propose a new preconditioning technique based on AGM (Arithmetic-Geometric Mean) of eigenvalues by means of determination of approximate one. Through numerical experiments, we examine distribution of eigenvalues, and verify effectiveness and parallelism of Conjugate Gradient method with our proposed preconditioning on SMP machine with shared memory compared with the conventional preconditioned CG method.
View full abstract
-
Hiroaki Tsuboi, Taro Konda, Masashi Iwasaki, Kinji Kimura, Masami Taka ...
Article type: Article
2008 Volume 18 Issue 4 Pages
611-630
Published: December 25, 2008
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
An algorithm which consists of a simplified D & C and twisted factorization is proposed for symmetric tridiagonal eigenvalue decomposition. The complexity is O(n^2) and the memory usage is O(n) if no cluster exists. The orthogonality can be improved by additional one step of the inverse iteration, although the classical D & C shows better one. In some numerical tests, our algorithm shows stable speed and better accuracy of the decompositions. But the orthogonality is worse than those of the classical D & C in up to three digits.
View full abstract
-
Ikuro Yamazaki, Masayuki Okada, Hiroto Tadano, Tetsuya Sakurai, Keita ...
Article type: Article
2008 Volume 18 Issue 4 Pages
631-651
Published: December 25, 2008
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
In this paper, we consider "Cutting-off" again preconditioning matrices made by the preconditioner of an earlier literature and verify the influence and validity of our method. In this earlier literature, a preconditioner using complete factorization of the matrix LDL^T=A_c obtained from drop-thresholding of the original coefficient matrix A is proposed as suitable methods for matrices which have many nonzero elements and complex nonzero structure. We explain the earlier literature and our method, and report the performance of our method for the sparse matrices that arise from our application including comparison with earlier literature.
View full abstract
-
Yohei Nanazawa, Hiroshi Suito, Takuya Ueda, Manabu Minami
Article type: Article
2008 Volume 18 Issue 4 Pages
653-670
Published: December 25, 2008
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
In this study, data correction and inverse analysis techniques to know conditions of the liver are discussed. The concentration of contrast agent has various problems. It is necessary to do a suitable correction for those problems. A liver model is built by Compartment Model Analysis, in which important parameters are obtained through inverse analysis by hybrid genetic algorithms combined with a gradient method.
View full abstract
-
Katsuyoshi Ohara, Hiroshi Iwasaki, Koji Itoh
Article type: Article
2008 Volume 18 Issue 4 Pages
671-679
Published: December 25, 2008
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
A minimizing method for calculating the American call option is developed. The American option pricing is a heat type obstacle problem but it contains some difficulties on the initial condition. Inspite of these difficulties the discrete Morse semiflow, which is a minimizing scheme via the time semidiscretized variational functional, works well. Moreover approximate solutions are monotone increasing.
View full abstract
-
Masahiro Kushida, Hitoshi Imai
Article type: Article
2008 Volume 18 Issue 4 Pages
681-686
Published: December 25, 2008
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
Numerical treatment of a singular nonlinear partial differential equation (PDE) is made. The PDE is proposed to describe the evolution of the risk preference in the optimal investment problem under the random risk process. The bounding trans-formation is used for avoiding unboudedness of the domain. Implications of our results for financial economics are also discussed.
View full abstract
-
Masahiro Koizumi, Toshiyuki Miyazawa, Shigenori Uchiyama, Ken Nakamula
Article type: Article
2008 Volume 18 Issue 4 Pages
687-701
Published: December 25, 2008
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
Lattice reduction algorithms are powerful tools for breaking knapsack based cryptosystems. In 2005, Ludwig introduced a new lattice reduction algorithm called Sampling Reduction. In this paper, we explain Sampling Reduction would not be effective for the attack against knapsack based cryptosystems by using our experimental results. Furthermore, we propose a Modified Sampling Reduction, and also show that it is more effective than the original Sampling Reduction by using the experimental results.
View full abstract
-
Christine Abegail ANTONIO, Satoru Tanaka, Ken Nakamula
Article type: Article
2008 Volume 18 Issue 4 Pages
703-721
Published: December 25, 2008
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
In this paper, we precisely analyze the computational complexity of the algorithms, which we have been using for experiments of the squared pairings over pairing-friendly elliptic curves of embedding degrees 6, 8 and 10. The experimental result agrees with this analysis very well. The squared Weil pairing is 1.5 times as fast as the ordinary Weil pairing, but the squared Tate pairing is not necessarily comparable to the ordinary Tate pairing. The implemented programs can be applied to other general curves without modification, so we release the source code with explanation how to use it.
View full abstract
-
Article type: Index
2008 Volume 18 Issue 4 Pages
A217-A219
Published: December 25, 2008
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
-
Article type: Index
2008 Volume 18 Issue 4 Pages
A220-A224
Published: December 25, 2008
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
-
Article type: Appendix
2008 Volume 18 Issue 4 Pages
App3-
Published: December 25, 2008
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
-
Article type: Appendix
2008 Volume 18 Issue 4 Pages
App4-
Published: December 25, 2008
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
-
Article type: Index
2008 Volume 18 Issue 4 Pages
Toc2-
Published: December 25, 2008
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
-
Article type: Cover
2008 Volume 18 Issue 4 Pages
Cover3-
Published: December 25, 2008
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
-
Article type: Cover
2008 Volume 18 Issue 4 Pages
Cover4-
Published: December 25, 2008
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS