ログイン
言語:

WEKO3

  • トップ
  • ランキング
To
lat lon distance
To

Field does not validate



インデックスリンク

インデックスツリー

メールアドレスを入力してください。

WEKO

One fine body…

WEKO

One fine body…

アイテム

{"_buckets": {"deposit": "5e5bafbd-ad2e-434f-a5dc-87828c621738"}, "_deposit": {"id": "2007386", "owners": [1], "pid": {"revision_id": 0, "type": "depid", "value": "2007386"}, "status": "published"}, "_oai": {"id": "oai:u-ryukyu.repo.nii.ac.jp:02007386", "sets": ["1642837725169", "1642838406845"]}, "author_link": [], "item_1617186331708": {"attribute_name": "Title", "attribute_value_mlt": [{"subitem_1551255647225": "\u30b9\u30d1\u30fc\u30b9\u884c\u5217\u306e\u30ac\u30a6\u30b9\u6d88\u53bb\u306b\u304a\u3051\u308b\u6700\u9069\u30d4\u30dc\u30c3\u30c6\u30f3\u30b0\u30fb\u30a2\u30eb\u30b4\u30ea\u30ba\u30e0\u3068\u305d\u306e\u30d5\u30a9\u30c8\u30e9\u30f3\u30d7\u30ed\u30b0\u30e9\u30e0", "subitem_1551255648112": "ja"}, {"subitem_1551255647225": "Optimal Pivoting Algorithm in Gaussian Elimination for Sparse Matrices and its FORTRAN Program.", "subitem_1551255648112": "en"}]}, "item_1617186419668": {"attribute_name": "Creator", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "\u559c\u5c4b\u6b66, \u76db\u57fa", "creatorNameLang": "ja"}]}, {"creatorNames": [{"creatorName": "\u767d\u5ddd, \u529f", "creatorNameLang": "ja"}]}, {"creatorNames": [{"creatorName": "\u5c3e\u5d0e, \u5f18", "creatorNameLang": "ja"}]}, {"creatorNames": [{"creatorName": "Kyan, Seiki", "creatorNameLang": "en"}]}, {"creatorNames": [{"creatorName": "Shirakawa, Isao", "creatorNameLang": "en"}]}, {"creatorNames": [{"creatorName": "Ozaki, Hiroshi", "creatorNameLang": "en"}]}]}, "item_1617186476635": {"attribute_name": "Access Rights", "attribute_value_mlt": [{"subitem_1522299639480": "open access", "subitem_1600958577026": "http://purl.org/coar/access_right/c_abf2"}]}, "item_1617186626617": {"attribute_name": "Description", "attribute_value_mlt": [{"subitem_description": "In the process of solving the linear epuation by the Gaussian Elimination or other comparable technigues, a computational interest is the pivotal ordering of the coefficient matix for the given set of epuations. This paper describes the algorithm fit for a large scale sparse matrices. The algorithm is essentially so called \"minimum fill-in\" but the method to obtain the minimum fill-in is unigue and some other criteria are added in oder to improve the optimality. Comparisions are made withe Ghausi method by actual program and results are given.", "subitem_description_type": "Other"}, {"subitem_description": "\u7d00\u8981\u8ad6\u6587", "subitem_description_type": "Other"}]}, "item_1617186643794": {"attribute_name": "Publisher", "attribute_value_mlt": [{"subitem_1522300295150": "ja", "subitem_1522300316516": "\u7409\u7403\u5927\u5b66\u7406\u5de5\u5b66\u90e8"}, {"subitem_1522300295150": "en", "subitem_1522300316516": "Science and Engineering Division, University of the Ryukyus"}]}, "item_1617186702042": {"attribute_name": "Language", "attribute_value_mlt": [{"subitem_1551255818386": "jpn"}]}, "item_1617186783814": {"attribute_name": "Identifier", "attribute_value_mlt": [{"subitem_identifier_type": "HDL", "subitem_identifier_uri": "http://hdl.handle.net/20.500.12000/26154"}]}, "item_1617186920753": {"attribute_name": "Source Identifier", "attribute_value_mlt": [{"subitem_1522646500366": "ISSN", "subitem_1522646572813": "0387-429X"}, {"subitem_1522646500366": "NCID", "subitem_1522646572813": "AN00250785"}]}, "item_1617186941041": {"attribute_name": "Source Title", "attribute_value_mlt": [{"subitem_1522650068558": "ja", "subitem_1522650091861": "\u7409\u7403\u5927\u5b66\u7406\u5de5\u5b66\u90e8\u7d00\u8981. \u5de5\u5b66\u7bc7"}, {"subitem_1522650068558": "en", "subitem_1522650091861": "Bulletin of Science \u0026 Engineering Division, University of the Ryukyus. Engineering"}]}, "item_1617187056579": {"attribute_name": "Bibliographic Information", "attribute_value_mlt": [{"bibliographicIssueNumber": "7", "bibliographicPageEnd": "150", "bibliographicPageStart": "137"}]}, "item_1617258105262": {"attribute_name": "Resource Type", "attribute_value_mlt": [{"resourcetype": "departmental bulletin paper", "resourceuri": "http://purl.org/coar/resource_type/c_6501"}]}, "item_1617265215918": {"attribute_name": "Version Type", "attribute_value_mlt": [{"subitem_1522305645492": "VoR", "subitem_1600292170262": "http://purl.org/coar/version/c_970fb48d4fbd8a85"}]}, "item_1617605131499": {"attribute_name": "File", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_access", "download_preview_message": "", "file_order": 0, "filename": "NO7P137.pdf", "future_date_message": "", "is_thumbnail": false, "mimetype": "", "size": 0, "url": {"objectType": "fulltext", "url": "https://u-ryukyu.repo.nii.ac.jp/record/2007386/files/NO7P137.pdf"}, "version_id": "85470076-d08f-411f-b654-c9eb0467f5e9"}]}, "item_title": "\u30b9\u30d1\u30fc\u30b9\u884c\u5217\u306e\u30ac\u30a6\u30b9\u6d88\u53bb\u306b\u304a\u3051\u308b\u6700\u9069\u30d4\u30dc\u30c3\u30c6\u30f3\u30b0\u30fb\u30a2\u30eb\u30b4\u30ea\u30ba\u30e0\u3068\u305d\u306e\u30d5\u30a9\u30c8\u30e9\u30f3\u30d7\u30ed\u30b0\u30e9\u30e0", "item_type_id": "15", "owner": "1", "path": ["1642837725169", "1642838406845"], "permalink_uri": "http://hdl.handle.net/20.500.12000/26154", "pubdate": {"attribute_name": "PubDate", "attribute_value": "2013-05-22"}, "publish_date": "2013-05-22", "publish_status": "0", "recid": "2007386", "relation": {}, "relation_version_is_last": true, "title": ["\u30b9\u30d1\u30fc\u30b9\u884c\u5217\u306e\u30ac\u30a6\u30b9\u6d88\u53bb\u306b\u304a\u3051\u308b\u6700\u9069\u30d4\u30dc\u30c3\u30c6\u30f3\u30b0\u30fb\u30a2\u30eb\u30b4\u30ea\u30ba\u30e0\u3068\u305d\u306e\u30d5\u30a9\u30c8\u30e9\u30f3\u30d7\u30ed\u30b0\u30e9\u30e0"], "weko_shared_id": -1}
  1. 紀要論文
  2. 琉球大学理工学部紀要 工学編
  3. 7号
  1. 部局別インデックス
  2. 工学部

スパース行列のガウス消去における最適ピボッテング・アルゴリズムとそのフォトランプログラム

http://hdl.handle.net/20.500.12000/26154
http://hdl.handle.net/20.500.12000/26154
26cb1b2c-248e-411d-b14f-deef36f83862
名前 / ファイル ライセンス アクション
NO7P137.pdf NO7P137.pdf
Item type デフォルトアイテムタイプ(フル)(1)
公開日 2013-05-22
タイトル
タイトル スパース行列のガウス消去における最適ピボッテング・アルゴリズムとそのフォトランプログラム
言語 ja
作成者 喜屋武, 盛基

× 喜屋武, 盛基

ja 喜屋武, 盛基

白川, 功

× 白川, 功

ja 白川, 功

尾崎, 弘

× 尾崎, 弘

ja 尾崎, 弘

Kyan, Seiki

× Kyan, Seiki

en Kyan, Seiki

Shirakawa, Isao

× Shirakawa, Isao

en Shirakawa, Isao

Ozaki, Hiroshi

× Ozaki, Hiroshi

en Ozaki, Hiroshi

アクセス権
アクセス権 open access
アクセス権URI http://purl.org/coar/access_right/c_abf2
内容記述
内容記述タイプ Other
内容記述 In the process of solving the linear epuation by the Gaussian Elimination or other comparable technigues, a computational interest is the pivotal ordering of the coefficient matix for the given set of epuations. This paper describes the algorithm fit for a large scale sparse matrices. The algorithm is essentially so called "minimum fill-in" but the method to obtain the minimum fill-in is unigue and some other criteria are added in oder to improve the optimality. Comparisions are made withe Ghausi method by actual program and results are given.
内容記述タイプ Other
内容記述 紀要論文
出版者
言語 ja
出版者 琉球大学理工学部
言語
言語 jpn
資源タイプ
資源タイプ departmental bulletin paper
資源タイプ識別子 http://purl.org/coar/resource_type/c_6501
出版タイプ
出版タイプ VoR
出版タイプResource http://purl.org/coar/version/c_970fb48d4fbd8a85
識別子
識別子 http://hdl.handle.net/20.500.12000/26154
識別子タイプ HDL
収録物識別子
収録物識別子タイプ ISSN
収録物識別子 0387-429X
収録物識別子タイプ NCID
収録物識別子 AN00250785
収録物名
言語 ja
収録物名 琉球大学理工学部紀要. 工学篇
書誌情報
号 7, p. 137-150
戻る
0
views
See details
Views

Versions

Ver.1 2022-01-28 04:21:01.027493
Show All versions

Share

Mendeley Twitter Facebook Print Addthis

Cite as

エクスポート

OAI-PMH
  • OAI-PMH JPCOAR
  • OAI-PMH DublinCore
  • OAI-PMH DDI
Other Formats
  • JSON

確認


Powered by WEKO3


Powered by WEKO3