Transactions of the Japan Society for Industrial and Applied Mathematics

Online ISSN : 2424-0982
ISSN-L : 0917-2246

Search
Browse

All issues

Volume 11, Issue 1

Displaying 1-12 of 12 articles from this issue

Download citation

Show all abstracts

[title in Japanese]

Article type: Cover
2001 Volume 11 Issue 1 Pages Cover1-
Published: March 15, 2001
Released on J-STAGE: April 08, 2017

DOIhttps://doi.org/10.11540/jsiamt.11.1_Cover1

JOURNAL FREE ACCESS

Download PDF (23K)
[title in Japanese]

Article type: Cover
2001 Volume 11 Issue 1 Pages Cover2-
Published: March 15, 2001
Released on J-STAGE: April 08, 2017

DOIhttps://doi.org/10.11540/jsiamt.11.1_Cover2

JOURNAL FREE ACCESS

Download PDF (23K)
[title in Japanese]

Article type: Appendix
2001 Volume 11 Issue 1 Pages App1-
Published: March 15, 2001
Released on J-STAGE: April 08, 2017

DOIhttps://doi.org/10.11540/jsiamt.11.1_App1

JOURNAL FREE ACCESS

Download PDF (37K)
[title in Japanese]

[in Japanese]

Article type: Article
2001 Volume 11 Issue 1 Pages i-
Published: March 15, 2001
Released on J-STAGE: April 08, 2017

DOIhttps://doi.org/10.11540/jsiamt.11.1_i

JOURNAL FREE ACCESS

Download PDF (124K)
[title in Japanese]

Article type: Appendix
2001 Volume 11 Issue 1 Pages App2-
Published: March 15, 2001
Released on J-STAGE: April 08, 2017

DOIhttps://doi.org/10.11540/jsiamt.11.1_App2

JOURNAL FREE ACCESS

Download PDF (427K)
Tour-Distance Voronoi Diagram and its Application to Location Analysis

Takashi OHYAMA, Tsutomu SUZUKI

Article type: Article
2001 Volume 11 Issue 1 Pages 1-14
Published: March 15, 2001
Released on J-STAGE: April 08, 2017

DOIhttps://doi.org/10.11540/jsiamt.11.1_1

JOURNAL FREE ACCESS

Show abstractHide abstract

The purpose of this paper is to show tour-distance Voronoi diagrams which represent catchment areas of facilities under the assumption that users use more than one facility. Bisectors composing tour-distance Voronoi diagrams are generally curved lines, although those of higher-order Voronoi diagrams are composed of straight lines. It is observed that contiguous facilities have larger joint catchment areas than scattered facilities. Applying them to locational selection of competitive facilities, it is found out that locational concentration tends to be superior for facilities which maximize their catchment areas, if users make tours to move around from one facility to another.

View full abstract

Download PDF (1077K)
Performance Evaluation of Distributed Database in Hierarchical Networks

Takao Kawamura, Michio Inoue, Hiroshi Masuyama

Article type: Article
2001 Volume 11 Issue 1 Pages 15-26
Published: March 15, 2001
Released on J-STAGE: April 08, 2017

DOIhttps://doi.org/10.11540/jsiamt.11.1_15

JOURNAL FREE ACCESS

Show abstractHide abstract

In this paper, we show a performance evaluation of distributed database in a hierarchical network in the two cases. In one case, database is managed by one supervisor agent and in the other case, it is distributed among all agents. We investigate the average expectation values of the time required by an agent to obtain a required data. In addition, how the time transition of the average expectation values of the time require by an agent to obtain a searched data in a distributed management systems changes with a queue or without queue is also analyzed.

View full abstract

Download PDF (682K)
Legendre-Galerkin Method for Poisson Equation on a Fan-Shaped Domain

Narathip Tiangtae, Hiroshi Sugiura

Article type: Article
2001 Volume 11 Issue 1 Pages 27-40
Published: March 15, 2001
Released on J-STAGE: April 08, 2017

DOIhttps://doi.org/10.11540/jsiamt.11.1_27

JOURNAL FREE ACCESS

Show abstractHide abstract

We present an efficient algorithm based on the Legendre-Galerkin approximation for solving the Poisson equation on a fan-shaped domain. The key to the efficiency of our algorithm is to map the domain to a rectangular domain by using a new type of the double exponential formula. Some numerical results show that the convergence rate of our algorithm is nearly exponential. As an application, we also discuss the approach for solving the Poisson equation on triangular domains by using the Legendre-Galerkin method in conjunction with the Schwarz Alternating method.

View full abstract

Download PDF (755K)
The Accuracy of Multiple or Clustered Zeros Using Numerical Integration Error Method

Tomohiro SUZUKI, Toshio SUZUKI

Article type: Article
2001 Volume 11 Issue 1 Pages 41-48
Published: March 15, 2001
Released on J-STAGE: April 08, 2017

DOIhttps://doi.org/10.11540/jsiamt.11.1_41

JOURNAL FREE ACCESS

Show abstractHide abstract

The polynomial root-finding algorithm that uses the errors of numerical integration of the logarithmic derivative was announced. In this algorithm, a new approximate expression of zeros was proposed. We call the method NIEM (Numerical Integration Error Method). In general, the accuracy of the multiple zero is worse than that of the simple one. The reason for this deterioration of accuracy is that the polynomial and its differentiation is estimated in a neighborhood of the multiple zero. NIEM can avoid this deterioration by evaluating them away from the multiple zero. In this paper we propose an approach for multiple or clustered zeros using NIEM.

View full abstract

Download PDF (541K)
[title in Japanese]

Article type: Appendix
2001 Volume 11 Issue 1 Pages App3-
Published: March 15, 2001
Released on J-STAGE: April 08, 2017

DOIhttps://doi.org/10.11540/jsiamt.11.1_App3

JOURNAL FREE ACCESS

Download PDF (42K)
[title in Japanese]

Article type: Cover
2001 Volume 11 Issue 1 Pages Cover3-
Published: March 15, 2001
Released on J-STAGE: April 08, 2017

DOIhttps://doi.org/10.11540/jsiamt.11.1_Cover3

JOURNAL FREE ACCESS

Download PDF (23K)
[title in Japanese]

Article type: Cover
2001 Volume 11 Issue 1 Pages Cover4-
Published: March 15, 2001
Released on J-STAGE: April 08, 2017

DOIhttps://doi.org/10.11540/jsiamt.11.1_Cover4

JOURNAL FREE ACCESS

Download PDF (23K)

feedback

Top

Register with J-STAGE for free!