日本応用数理学会論文誌

表紙

原稿種別: 表紙
1995 年 5 巻 2 号 p. Cover1-
発行日: 1995/06/15
公開日: 2017/04/08

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

ジャーナルフリー

PDF形式でダウンロード (31K)
目次

原稿種別: 表紙
1995 年 5 巻 2 号 p. Cover2-
発行日: 1995/06/15
公開日: 2017/04/08

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

ジャーナルフリー

PDF形式でダウンロード (31K)
[OTHERS]

原稿種別: 付録等
1995 年 5 巻 2 号 p. App1-
発行日: 1995/06/15
公開日: 2017/04/08

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

ジャーナルフリー

PDF形式でダウンロード (85K)
2固有値問題に対するホモトピー法

島崎眞昭

原稿種別: 本文
1995 年 5 巻 2 号 p. 121-129
発行日: 1995/06/15
公開日: 2017/04/08

DOIhttps://doi.org/10.11540/jsiamt.5.2_121

ジャーナルフリー

抄録を表示する抄録を非表示にする

We present a homotopy algorithm for a certain class of two-parameter eigenvalue problems and give theoretical background of the method. We give the definiteness condition which assures existence of the solution of the original two-parameter eigenvalue problem. We show that if the definiteness condition is satisfied, we can trace homotopy curves starting from n^2 points which can be easily computed, and can reach eigenvalues of the original two-parameter eigenvalue problem. The method is particularly suitable for parallel computation.

抄録全体を表示

PDF形式でダウンロード (431K)
多項式の符号判定のための剰余演算の利用法と計算幾何学への応用

今井敏行

原稿種別: 本文
1995 年 5 巻 2 号 p. 131-138
発行日: 1995/06/15
公開日: 2017/04/08

DOIhttps://doi.org/10.11540/jsiamt.5.2_131

ジャーナルフリー

抄録を表示する抄録を非表示にする

Not a few geometric algorithms determine signs of values of polynomials whose variables are input data to decide the structure of geometric objects. Such algorithms require double or triple long integer arithmetics such as addition, subtraction and multiplication even if all the input data are integers of the single length. In the standard method, multiple long integer arithmetic takes much time, especially in multiplication. It has been known that modular arithmetic reduces time. Modular arithmetic, however, has to use multiple long integer arithmetics to get back the values themselves from their residues and it takes the same or more time compared to the standard method. In this paper, we show some techniques to determine the sign of a double or triple long integer directly from the result of modular arithmetic method, and show the performances of these techniques applied to some geometric problems.

抄録全体を表示

PDF形式でダウンロード (766K)
エッジ・パッキングによるネットワーク信頼度の下界

新森修一, 小出武, 石井博昭

原稿種別: 本文
1995 年 5 巻 2 号 p. 139-151
発行日: 1995/06/15
公開日: 2017/04/08

DOIhttps://doi.org/10.11540/jsiamt.5.2_139

ジャーナルフリー

抄録を表示する抄録を非表示にする

A simple model for a communication network is a probabilistic graph consisting of a set of nodes which is not fail and a set of edges which operates with a probability. One of the indicators which measure the performance of the network is all-terminal reliability, that is, probability that all nodes are connected with operational edges. Since to calculate its value precisely is NP-hard, it is important to obtain the bounds of the all-terminal reliability efficiently. In this paper, we propose the polynomial time algorithm that can derive the lower bound by transforming any graph to the graph in which the degree of all the nodes is more than two and by using of edge-packing. This algorithm can be applied to the probabilistic graph in which each edge operates with the different probability.

抄録全体を表示

PDF形式でダウンロード (837K)
抵抗回路の区間解析 : 奥村の問題の最終結果

早川透

原稿種別: 本文
1995 年 5 巻 2 号 p. 153-162
発行日: 1995/06/15
公開日: 2017/04/08

DOIhttps://doi.org/10.11540/jsiamt.5.2_153

ジャーナルフリー

抄録を表示する抄録を非表示にする

In this paper we report the best estimates and the method to get them of Okumura's problem[10]that is an interval problem of resistive networks. We proof the monotonicity of the problem and estimate the answer using by the signs of the sensitivity. The proof of the monotonicity is main part of this paper. The confluence of the network in Fig.1 makes it equivalent to the monotonicity of the problem that the signe of i_6 and i_7 don't change. The numerical result of Okumura's interval method[10] satisfies the condition.

抄録全体を表示

PDF形式でダウンロード (576K)
多項式の各階導関数値を求める高速算法について

李磊, 游兆永

原稿種別: 本文
1995 年 5 巻 2 号 p. 163-168
発行日: 1995/06/15
公開日: 2017/04/08

DOIhttps://doi.org/10.11540/jsiamt.5.2_163

ジャーナルフリー

抄録を表示する抄録を非表示にする

This paper presents an O(nlog_2n)fast algorithm for computing all derivatives of an nth degree polynomial at some point. It improves the O(nlog_2^2n)fast algorithm showed by H.T.kung. And by this new method, we further reduce the orders of the computational complexities in [2] and [3].

抄録全体を表示

PDF形式でダウンロード (347K)
3次元ポアソン方程式の右辺項の修正による高次精度の差分公式について

藤野清次, 竹内敏己

原稿種別: 本文
1995 年 5 巻 2 号 p. 169-184
発行日: 1995/06/15
公開日: 2017/04/08

DOIhttps://doi.org/10.11540/jsiamt.5.2_169

ジャーナルフリー

抄録を表示する抄録を非表示にする

High-order finite difference schemes suited to super vector-computer are proposed for numerical solution of the three-dimensional Poisson equation. These difference schemes are derived from modification of the right-hand side of the equation. We consider the schemes which are defined on a cube using stencils with the node points which are located on the gridpoints and on the intermediate point between gridpoints. Several high-order difference schemes are examined in view of precision and efficiency. The results exhibit superiority of the new difference scheme in terms of computational efficiency. Moreover it turned out theoretically it is impossible to realize difference schemes of order 8 in the same way.

抄録全体を表示

PDF形式でダウンロード (1093K)
[OTHERS]

原稿種別: 付録等
1995 年 5 巻 2 号 p. App2-
発行日: 1995/06/15
公開日: 2017/04/08

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

ジャーナルフリー

PDF形式でダウンロード (12K)
裏表紙

原稿種別: 表紙
1995 年 5 巻 2 号 p. Cover3-
発行日: 1995/06/15
公開日: 2017/04/08

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

ジャーナルフリー

PDF形式でダウンロード (30K)
CONTENTS

原稿種別: 表紙
1995 年 5 巻 2 号 p. Cover4-
発行日: 1995/06/15
公開日: 2017/04/08

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

ジャーナルフリー

PDF形式でダウンロード (30K)

J-STAGEへの登録はこちら（無料）