-
Article type: Cover
2011 Volume 21 Issue 3 Pages
Cover1-
Published: September 27, 2011
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
-
Ichiro Hagiwara
Article type: Article
2011 Volume 21 Issue 3 Pages
165-
Published: September 27, 2011
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
-
Article type: Index
2011 Volume 21 Issue 3 Pages
Toc1-
Published: September 27, 2011
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
-
Ichiro Hagiwara
Article type: Article
2011 Volume 21 Issue 3 Pages
166-
Published: September 27, 2011
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
-
Yasuhiko Ikebe
Article type: Article
2011 Volume 21 Issue 3 Pages
166-167
Published: September 27, 2011
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
-
Seiji Ukai
Article type: Article
2011 Volume 21 Issue 3 Pages
167-
Published: September 27, 2011
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
-
Tatsuaki Okamoto
Article type: Article
2011 Volume 21 Issue 3 Pages
167-168
Published: September 27, 2011
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
-
Mitsuhiro Nakao
Article type: Article
2011 Volume 21 Issue 3 Pages
168-
Published: September 27, 2011
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
-
Ichiro Hagiwara
Article type: Article
2011 Volume 21 Issue 3 Pages
169-
Published: September 27, 2011
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
-
Hideaki Iiduka, Masato Uchida
Article type: Article
2011 Volume 21 Issue 3 Pages
170-185
Published: September 27, 2011
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
Network resource allocation is a central issue in modern networks. The main objective of the allocation is to share the available resource among users in the network so as to maximize the sum of their utilities subject to the feasible region for allocating the resource. In this paper, we discuss a network allocation problem in which the constraint set composed of the absolute set and the subsidiary sets is not feasible. We formulate a compromise solution of the problem by using a maximizer of the objective function over a subset of the absolute set with the elements closest to the subsidiary sets in terms of the norm. We propose fixed point optimization algorithms, based on iterative techniques for optimization over the fixed point set of a certain nonexpansive mapping, for solving the problem and perform convergence analyses on them. We apply the algorithms to concrete network resource allocation problems such as power and bandwidth allocation and provide numerical examples for these problems.
View full abstract
-
Katsuhisa Ozaki, Takeshi Ogita, Shin'ichi Oishi
Article type: Article
2011 Volume 21 Issue 3 Pages
186-196
Published: September 27, 2011
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
This paper is concerned with interval arithmetic, especially, an enclosure of a matrix product is focused on. Using level 3 operations of matrix computations, an algorithm outputting a tight enclosure for matrix multiplication is proposed. Most of the algorithms for this purpose require switches of rounding modes defined in the IEEE standard 754. However some programing enviroments have not supported them. Our proposed method demands only rounding-to-nearest mode, so that it is very portable.
View full abstract
-
Tomonori Kouya
Article type: Article
2011 Volume 21 Issue 3 Pages
197-206
Published: September 27, 2011
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
BNCpack is a multiple precision numerical computation library built on the functions provided by MPFR/GMP which is currently fastest and the most reliable multiple precision floating-point arithmetic library. It can handle complex arithmetic, basic linear computation, polynomial computation, root finding, numerical integration, and initial value problem of ordinary differential equation in double precision and in multiple and mixed precision. Parts of these functions such as basic linear computation, the Durand-Kerner method and numerical integration are parallelized by using a message-passing interface (MPI) to obtain higher performance using parallelized programs provided by BNCpack on MPI PC clusters. In this paper, we first introduce MPFR/GMP and its functions. Second, we explain the numerical algorithms implemented in BNCpack and the method for parallelizing numerical computation using MPFR/GMP. Third, we describe benchmark tests performed using BNCpack to demonstrate its effectiveness. Finally, we discuss future works on BNCpack.
View full abstract
-
Shinji Inoue, Shigeru Yamada, Toshihiko Fukushima
Article type: Article
2011 Volume 21 Issue 3 Pages
207-210
Published: September 27, 2011
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
-
Yoshitaka Watanabe
Article type: Article
2011 Volume 21 Issue 3 Pages
211-217
Published: September 27, 2011
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
-
Kunio Tanabe
Article type: Article
2011 Volume 21 Issue 3 Pages
218-222
Published: September 27, 2011
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
-
Kiyoshi Takano
Article type: Article
2011 Volume 21 Issue 3 Pages
223-225
Published: September 27, 2011
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
-
Hirokazu Anai
Article type: Article
2011 Volume 21 Issue 3 Pages
226-
Published: September 27, 2011
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
-
Keiichi Morikuni, Kensuke Aihara
Article type: Article
2011 Volume 21 Issue 3 Pages
227-
Published: September 27, 2011
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
-
Akitoshi Takayasu
Article type: Article
2011 Volume 21 Issue 3 Pages
227-228
Published: September 27, 2011
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
-
Hideyuki Azegami
Article type: Article
2011 Volume 21 Issue 3 Pages
229-
Published: September 27, 2011
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
-
Ken-Ichi Nakamura
Article type: Article
2011 Volume 21 Issue 3 Pages
230-231
Published: September 27, 2011
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
-
Noboru Kunihiro
Article type: Article
2011 Volume 21 Issue 3 Pages
232-233
Published: September 27, 2011
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
-
Article type: Appendix
2011 Volume 21 Issue 3 Pages
234-235
Published: September 27, 2011
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
-
Article type: Appendix
2011 Volume 21 Issue 3 Pages
236-
Published: September 27, 2011
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
-
Article type: Appendix
2011 Volume 21 Issue 3 Pages
236-
Published: September 27, 2011
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
-
Article type: Appendix
2011 Volume 21 Issue 3 Pages
237-
Published: September 27, 2011
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
-
Article type: Index
2011 Volume 21 Issue 3 Pages
Toc2-
Published: September 27, 2011
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
-
Article type: Appendix
2011 Volume 21 Issue 3 Pages
239-
Published: September 27, 2011
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
-
Article type: Appendix
2011 Volume 21 Issue 3 Pages
240-
Published: September 27, 2011
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
-
Article type: Appendix
2011 Volume 21 Issue 3 Pages
App1-
Published: September 27, 2011
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
-
Article type: Cover
2011 Volume 21 Issue 3 Pages
Cover2-
Published: September 27, 2011
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
-
Article type: Appendix
2011 Volume 21 Issue 3 Pages
App2-
Published: September 27, 2011
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS