{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00225644","sets":["1:10711:11221"]},"path":["11221"],"owner":"44499","recid":"225644","title":["5分で分かる!? 有名論文ナナメ読み：J. M. Sanz-Serna : Symplectic Runge-Kutta Schemes for Adjoint Equations, Automatic Differentiation, Optimal Control, and More"],"pubdate":{"attribute_name":"公開日","attribute_value":"2023-04-15"},"_buckets":{"deposit":"6f2b52b4-59bb-4114-b44d-cc4628d2ff15"},"_deposit":{"id":"225644","pid":{"type":"depid","value":"225644","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"5分で分かる!? 有名論文ナナメ読み：J. M. Sanz-Serna : Symplectic Runge-Kutta Schemes for Adjoint Equations, Automatic Differentiation, Optimal Control, and More","author_link":["597540"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"5分で分かる!? 有名論文ナナメ読み：J. M. Sanz-Serna : Symplectic Runge-Kutta Schemes for Adjoint Equations, Automatic Differentiation, Optimal Control, and More"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"連載","subitem_subject_scheme":"Other"}]},"item_type_id":"30","publish_date":"2023-04-15","item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_30_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"大阪大学サイバーメディアセンター"}]},"publish_status":"0","weko_shared_id":44499,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/225644/files/IPSJ-MGN640509.pdf","label":"IPSJ-MGN640509.pdf"},"date":[{"dateType":"Available","dateValue":"2025-04-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-MGN640509.pdf","filesize":[{"value":"733.1 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"0","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"a83ffdb7-7971-4494-90aa-99f7303f9271","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2023 by the Information Processing Society of Japan"}]},"item_30_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"宮武, 勇登"}],"nameIdentifiers":[{}]}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_6501","resourcetype":"article"}]},"item_30_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN00116625","subitem_source_identifier_type":"NCID"}]},"item_30_publisher_14":{"attribute_name":"公開者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"item_30_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"ODE Netなどでは，微分方程式の近似解を用いて定義された目的関数の最小化問題を解く必要があるが，そのためには，目的関数の微分の計算を系統的に効率よく行うことが期待される．紹介論文では，そのための方法論が示されているが，理論の背景には，微分方程式の持つ保存量を厳密に再現するように離散化を行うという考え方があり，同様の議論はNewtonによるKepler問題（特にKeplerの第二法則）の考察にまで遡ることができる．","subitem_description_type":"Other"}]},"item_30_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"246","bibliographic_titles":[{"bibliographic_title":"情報処理"}],"bibliographicPageStart":"244","bibliographicIssueDates":{"bibliographicIssueDate":"2023-04-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"5","bibliographicVolumeNumber":"64"}]},"relation_version_is_last":true,"item_30_identifier_registration":{"attribute_name":"ID登録","attribute_value_mlt":[{"subitem_identifier_reg_text":"10.20729/00225535","subitem_identifier_reg_type":"JaLC"}]},"weko_creator_id":"44499"},"updated":"2025-01-19T11:41:23.827584+00:00","created":"2025-01-19T01:25:08.951386+00:00","links":{},"id":225644}