On some questions in computer modeling of the reachability sets constructing problems
The research considers the problem of constructing the reachability sets of non-linear dynamical system in n-dimensional Euclidean space on the fixed time interval. The approximate solution methods of the reachability sets constructing are considered in this research as well as the accuracy estimati...
Gespeichert in:
Hauptverfasser: | , , |
---|---|
Format: | Tagungsbericht |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | |
---|---|
container_issue | 1 |
container_start_page | |
container_title | |
container_volume | 1773 |
creator | Ushakov, V. N. Parshikov, G. V. Matviychuk, A. R. |
description | The research considers the problem of constructing the reachability sets of non-linear dynamical system in n-dimensional Euclidean space on the fixed time interval. The approximate solution methods of the reachability sets constructing are considered in this research as well as the accuracy estimation for this methods is given. The research contains the computational experiments on computer modeling of described reachability sets constructing methods, which use the algorithms implemented for two computation technologies CPU as well as GPU (using CUDA technology). In this research the description and comparison of approaches to the computer modeling of the problem are given. Furthermore, the CPU-based computer modeling result comparison with the result obtained on GPU based on CUDA technology are presented. Besides, this research discusses some the side issues appeared during computer modeling, the issues raised during the computer algorithms implementation, as well as the ways to eliminate these issues or reduce their impact. |
doi_str_mv | 10.1063/1.4965019 |
format | Conference Proceeding |
fullrecord | <record><control><sourceid>proquest_scita</sourceid><recordid>TN_cdi_proquest_journals_2121633489</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2121633489</sourcerecordid><originalsourceid>FETCH-LOGICAL-p323t-96c50346896f7076fc0081091162639cbe5fff49817be60e16d2a2b3eb1e2f533</originalsourceid><addsrcrecordid>eNp9kM9LwzAcxYMoOKcH_4OAN6Hz-03atDnK8BcMdnHgLbRp4jrapiapsP_ezg28eXqXz3uP9wi5RVggCP6Ai1SKDFCekRlmGSa5QHFOZgAyTVjKPy7JVQg7ACbzvJiRzbqnwXWGfo0mxMb1gTY91a4bxmg87Vxt2qb_pM7SuDXUm1Jvy6ppm7inwcQwoX2IftTxQA3eVa3pwjW5sGUbzM1J52Tz_PS-fE1W65e35eMqGTjjMZFCZ8BTUUhhc8iF1QAFgkQUTHCpK5NZa1NZYF4ZAQZFzUpWcVOhYTbjfE7ujrlT8e8AtXOj76dKxZCh4Dwt5ETdH6mgm1geRqrBN13p9-rbeYXqdJkaavsfjKAOH_8Z-A8cK24U</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype><pqid>2121633489</pqid></control><display><type>conference_proceeding</type><title>On some questions in computer modeling of the reachability sets constructing problems</title><source>AIP Journals Complete</source><creator>Ushakov, V. N. ; Parshikov, G. V. ; Matviychuk, A. R.</creator><contributor>Todorov, Michail D.</contributor><creatorcontrib>Ushakov, V. N. ; Parshikov, G. V. ; Matviychuk, A. R. ; Todorov, Michail D.</creatorcontrib><description>The research considers the problem of constructing the reachability sets of non-linear dynamical system in n-dimensional Euclidean space on the fixed time interval. The approximate solution methods of the reachability sets constructing are considered in this research as well as the accuracy estimation for this methods is given. The research contains the computational experiments on computer modeling of described reachability sets constructing methods, which use the algorithms implemented for two computation technologies CPU as well as GPU (using CUDA technology). In this research the description and comparison of approaches to the computer modeling of the problem are given. Furthermore, the CPU-based computer modeling result comparison with the result obtained on GPU based on CUDA technology are presented. Besides, this research discusses some the side issues appeared during computer modeling, the issues raised during the computer algorithms implementation, as well as the ways to eliminate these issues or reduce their impact.</description><identifier>ISSN: 0094-243X</identifier><identifier>EISSN: 1551-7616</identifier><identifier>DOI: 10.1063/1.4965019</identifier><identifier>CODEN: APCPCS</identifier><language>eng</language><publisher>Melville: American Institute of Physics</publisher><subject>Algorithms ; Approximation ; Euclidean geometry ; Euclidean space</subject><ispartof>AIP conference proceedings, 2016, Vol.1773 (1)</ispartof><rights>Author(s)</rights><rights>2016 Author(s). Published by AIP Publishing.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://pubs.aip.org/acp/article-lookup/doi/10.1063/1.4965019$$EHTML$$P50$$Gscitation$$H</linktohtml><link.rule.ids>309,310,314,776,780,785,786,790,4498,23909,23910,25118,27901,27902,76127</link.rule.ids></links><search><contributor>Todorov, Michail D.</contributor><creatorcontrib>Ushakov, V. N.</creatorcontrib><creatorcontrib>Parshikov, G. V.</creatorcontrib><creatorcontrib>Matviychuk, A. R.</creatorcontrib><title>On some questions in computer modeling of the reachability sets constructing problems</title><title>AIP conference proceedings</title><description>The research considers the problem of constructing the reachability sets of non-linear dynamical system in n-dimensional Euclidean space on the fixed time interval. The approximate solution methods of the reachability sets constructing are considered in this research as well as the accuracy estimation for this methods is given. The research contains the computational experiments on computer modeling of described reachability sets constructing methods, which use the algorithms implemented for two computation technologies CPU as well as GPU (using CUDA technology). In this research the description and comparison of approaches to the computer modeling of the problem are given. Furthermore, the CPU-based computer modeling result comparison with the result obtained on GPU based on CUDA technology are presented. Besides, this research discusses some the side issues appeared during computer modeling, the issues raised during the computer algorithms implementation, as well as the ways to eliminate these issues or reduce their impact.</description><subject>Algorithms</subject><subject>Approximation</subject><subject>Euclidean geometry</subject><subject>Euclidean space</subject><issn>0094-243X</issn><issn>1551-7616</issn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2016</creationdate><recordtype>conference_proceeding</recordtype><recordid>eNp9kM9LwzAcxYMoOKcH_4OAN6Hz-03atDnK8BcMdnHgLbRp4jrapiapsP_ezg28eXqXz3uP9wi5RVggCP6Ai1SKDFCekRlmGSa5QHFOZgAyTVjKPy7JVQg7ACbzvJiRzbqnwXWGfo0mxMb1gTY91a4bxmg87Vxt2qb_pM7SuDXUm1Jvy6ppm7inwcQwoX2IftTxQA3eVa3pwjW5sGUbzM1J52Tz_PS-fE1W65e35eMqGTjjMZFCZ8BTUUhhc8iF1QAFgkQUTHCpK5NZa1NZYF4ZAQZFzUpWcVOhYTbjfE7ujrlT8e8AtXOj76dKxZCh4Dwt5ETdH6mgm1geRqrBN13p9-rbeYXqdJkaavsfjKAOH_8Z-A8cK24U</recordid><startdate>20161013</startdate><enddate>20161013</enddate><creator>Ushakov, V. N.</creator><creator>Parshikov, G. V.</creator><creator>Matviychuk, A. R.</creator><general>American Institute of Physics</general><scope>8FD</scope><scope>H8D</scope><scope>L7M</scope></search><sort><creationdate>20161013</creationdate><title>On some questions in computer modeling of the reachability sets constructing problems</title><author>Ushakov, V. N. ; Parshikov, G. V. ; Matviychuk, A. R.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p323t-96c50346896f7076fc0081091162639cbe5fff49817be60e16d2a2b3eb1e2f533</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2016</creationdate><topic>Algorithms</topic><topic>Approximation</topic><topic>Euclidean geometry</topic><topic>Euclidean space</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Ushakov, V. N.</creatorcontrib><creatorcontrib>Parshikov, G. V.</creatorcontrib><creatorcontrib>Matviychuk, A. R.</creatorcontrib><collection>Technology Research Database</collection><collection>Aerospace Database</collection><collection>Advanced Technologies Database with Aerospace</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Ushakov, V. N.</au><au>Parshikov, G. V.</au><au>Matviychuk, A. R.</au><au>Todorov, Michail D.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>On some questions in computer modeling of the reachability sets constructing problems</atitle><btitle>AIP conference proceedings</btitle><date>2016-10-13</date><risdate>2016</risdate><volume>1773</volume><issue>1</issue><issn>0094-243X</issn><eissn>1551-7616</eissn><coden>APCPCS</coden><abstract>The research considers the problem of constructing the reachability sets of non-linear dynamical system in n-dimensional Euclidean space on the fixed time interval. The approximate solution methods of the reachability sets constructing are considered in this research as well as the accuracy estimation for this methods is given. The research contains the computational experiments on computer modeling of described reachability sets constructing methods, which use the algorithms implemented for two computation technologies CPU as well as GPU (using CUDA technology). In this research the description and comparison of approaches to the computer modeling of the problem are given. Furthermore, the CPU-based computer modeling result comparison with the result obtained on GPU based on CUDA technology are presented. Besides, this research discusses some the side issues appeared during computer modeling, the issues raised during the computer algorithms implementation, as well as the ways to eliminate these issues or reduce their impact.</abstract><cop>Melville</cop><pub>American Institute of Physics</pub><doi>10.1063/1.4965019</doi><tpages>5</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0094-243X |
ispartof | AIP conference proceedings, 2016, Vol.1773 (1) |
issn | 0094-243X 1551-7616 |
language | eng |
recordid | cdi_proquest_journals_2121633489 |
source | AIP Journals Complete |
subjects | Algorithms Approximation Euclidean geometry Euclidean space |
title | On some questions in computer modeling of the reachability sets constructing problems |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-02T00%3A35%3A11IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_scita&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=On%20some%20questions%20in%20computer%20modeling%20of%20the%20reachability%20sets%20constructing%20problems&rft.btitle=AIP%20conference%20proceedings&rft.au=Ushakov,%20V.%20N.&rft.date=2016-10-13&rft.volume=1773&rft.issue=1&rft.issn=0094-243X&rft.eissn=1551-7616&rft.coden=APCPCS&rft_id=info:doi/10.1063/1.4965019&rft_dat=%3Cproquest_scita%3E2121633489%3C/proquest_scita%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2121633489&rft_id=info:pmid/&rfr_iscdi=true |