Sparse-grid Discontinuous Galerkin Methods for the Vlasov-Poisson-Lenard-Bernstein Model

Sparse-grid Discontinuous Galerkin Methods for the Vlasov-Poisson-Lenard-Bernstein Model

Sparse-grid methods have recently gained interest in reducing the computational cost of solving high-dimensional kinetic equations. In this paper, we construct adaptive and hybrid sparse-grid methods for the Vlasov-Poisson-Lenard-Bernstein (VPLB) model. This model has applications to plasma physics...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Schnake, Stefan, Kendrick, Coleman, Endeve, Eirik, Stoyanov, Miroslav, Hahn, Steven, Hauck, Cory D, Green, David L, Snyder, Phil, Canik, John
Format: Artikel
Sprache:eng
Schlagworte:
Computer Science - Numerical Analysis
Mathematics - Numerical Analysis
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Schnake, Stefan
Kendrick, Coleman
Endeve, Eirik
Stoyanov, Miroslav
Hahn, Steven
Hauck, Cory D
Green, David L
Snyder, Phil
Canik, John
description Sparse-grid methods have recently gained interest in reducing the computational cost of solving high-dimensional kinetic equations. In this paper, we construct adaptive and hybrid sparse-grid methods for the Vlasov-Poisson-Lenard-Bernstein (VPLB) model. This model has applications to plasma physics and is simulated in two reduced geometries: a 0x3v space homogeneous geometry and a 1x3v slab geometry. We use the discontinuous Galerkin (DG) method as a base discretization due to its high-order accuracy and ability to preserve important structural properties of partial differential equations. We utilize a multiwavelet basis expansion to determine the sparse-grid basis and the adaptive mesh criteria. We analyze the proposed sparse-grid methods on a suite of three test problems by computing the savings afforded by sparse-grids in comparison to standard solutions of the DG method. The results are obtained using the adaptive sparse-grid discretization library ASGarD.
doi_str_mv 10.48550/arxiv.2402.06493
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2402_06493</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2402_06493</sourcerecordid><originalsourceid>FETCH-LOGICAL-a673-edfb4f7a9f700823fba5b0890aa8899742a5818d4e4443d4e1a8039ed76fad743</originalsourceid><addsrcrecordid>eNotz7FOwzAUhWEvDKjwAEz4BRyc-Ca2RyhQkIpAokJs0Q2-phbBruy0greHFqZ_OTrSx9hZLSswbSsvMH-FXdWAbCrZgVXH7PV5g7mQeM_B8etQ3lKcQtymbeELHCl_hMgfaFonV7hPmU9r4i8jlrQTTymUkqJYUsTsxBXlWCba75Oj8YQdeRwLnf53xla3N6v5nVg-Lu7nl0uBnVaCnB_Aa7ReS2ka5QdsB2msRDTGWg0NtqY2DggA1G9qNFJZcrrz6DSoGTv_uz3Q-k0On5i_-z2xPxDVD2JBTPE</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Sparse-grid Discontinuous Galerkin Methods for the Vlasov-Poisson-Lenard-Bernstein Model</title><source>arXiv.org</source><creator>Schnake, Stefan ; Kendrick, Coleman ; Endeve, Eirik ; Stoyanov, Miroslav ; Hahn, Steven ; Hauck, Cory D ; Green, David L ; Snyder, Phil ; Canik, John</creator><creatorcontrib>Schnake, Stefan ; Kendrick, Coleman ; Endeve, Eirik ; Stoyanov, Miroslav ; Hahn, Steven ; Hauck, Cory D ; Green, David L ; Snyder, Phil ; Canik, John</creatorcontrib><description>Sparse-grid methods have recently gained interest in reducing the computational cost of solving high-dimensional kinetic equations. In this paper, we construct adaptive and hybrid sparse-grid methods for the Vlasov-Poisson-Lenard-Bernstein (VPLB) model. This model has applications to plasma physics and is simulated in two reduced geometries: a 0x3v space homogeneous geometry and a 1x3v slab geometry. We use the discontinuous Galerkin (DG) method as a base discretization due to its high-order accuracy and ability to preserve important structural properties of partial differential equations. We utilize a multiwavelet basis expansion to determine the sparse-grid basis and the adaptive mesh criteria. We analyze the proposed sparse-grid methods on a suite of three test problems by computing the savings afforded by sparse-grids in comparison to standard solutions of the DG method. The results are obtained using the adaptive sparse-grid discretization library ASGarD.</description><identifier>DOI: 10.48550/arxiv.2402.06493</identifier><language>eng</language><subject>Computer Science - Numerical Analysis ; Mathematics - Numerical Analysis</subject><creationdate>2024-02</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,776,881</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2402.06493$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2402.06493$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Schnake, Stefan</creatorcontrib><creatorcontrib>Kendrick, Coleman</creatorcontrib><creatorcontrib>Endeve, Eirik</creatorcontrib><creatorcontrib>Stoyanov, Miroslav</creatorcontrib><creatorcontrib>Hahn, Steven</creatorcontrib><creatorcontrib>Hauck, Cory D</creatorcontrib><creatorcontrib>Green, David L</creatorcontrib><creatorcontrib>Snyder, Phil</creatorcontrib><creatorcontrib>Canik, John</creatorcontrib><title>Sparse-grid Discontinuous Galerkin Methods for the Vlasov-Poisson-Lenard-Bernstein Model</title><description>Sparse-grid methods have recently gained interest in reducing the computational cost of solving high-dimensional kinetic equations. In this paper, we construct adaptive and hybrid sparse-grid methods for the Vlasov-Poisson-Lenard-Bernstein (VPLB) model. This model has applications to plasma physics and is simulated in two reduced geometries: a 0x3v space homogeneous geometry and a 1x3v slab geometry. We use the discontinuous Galerkin (DG) method as a base discretization due to its high-order accuracy and ability to preserve important structural properties of partial differential equations. We utilize a multiwavelet basis expansion to determine the sparse-grid basis and the adaptive mesh criteria. We analyze the proposed sparse-grid methods on a suite of three test problems by computing the savings afforded by sparse-grids in comparison to standard solutions of the DG method. The results are obtained using the adaptive sparse-grid discretization library ASGarD.</description><subject>Computer Science - Numerical Analysis</subject><subject>Mathematics - Numerical Analysis</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotz7FOwzAUhWEvDKjwAEz4BRyc-Ca2RyhQkIpAokJs0Q2-phbBruy0greHFqZ_OTrSx9hZLSswbSsvMH-FXdWAbCrZgVXH7PV5g7mQeM_B8etQ3lKcQtymbeELHCl_hMgfaFonV7hPmU9r4i8jlrQTTymUkqJYUsTsxBXlWCba75Oj8YQdeRwLnf53xla3N6v5nVg-Lu7nl0uBnVaCnB_Aa7ReS2ka5QdsB2msRDTGWg0NtqY2DggA1G9qNFJZcrrz6DSoGTv_uz3Q-k0On5i_-z2xPxDVD2JBTPE</recordid><startdate>20240209</startdate><enddate>20240209</enddate><creator>Schnake, Stefan</creator><creator>Kendrick, Coleman</creator><creator>Endeve, Eirik</creator><creator>Stoyanov, Miroslav</creator><creator>Hahn, Steven</creator><creator>Hauck, Cory D</creator><creator>Green, David L</creator><creator>Snyder, Phil</creator><creator>Canik, John</creator><scope>AKY</scope><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20240209</creationdate><title>Sparse-grid Discontinuous Galerkin Methods for the Vlasov-Poisson-Lenard-Bernstein Model</title><author>Schnake, Stefan ; Kendrick, Coleman ; Endeve, Eirik ; Stoyanov, Miroslav ; Hahn, Steven ; Hauck, Cory D ; Green, David L ; Snyder, Phil ; Canik, John</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a673-edfb4f7a9f700823fba5b0890aa8899742a5818d4e4443d4e1a8039ed76fad743</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><topic>Computer Science - Numerical Analysis</topic><topic>Mathematics - Numerical Analysis</topic><toplevel>online_resources</toplevel><creatorcontrib>Schnake, Stefan</creatorcontrib><creatorcontrib>Kendrick, Coleman</creatorcontrib><creatorcontrib>Endeve, Eirik</creatorcontrib><creatorcontrib>Stoyanov, Miroslav</creatorcontrib><creatorcontrib>Hahn, Steven</creatorcontrib><creatorcontrib>Hauck, Cory D</creatorcontrib><creatorcontrib>Green, David L</creatorcontrib><creatorcontrib>Snyder, Phil</creatorcontrib><creatorcontrib>Canik, John</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv Mathematics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Schnake, Stefan</au><au>Kendrick, Coleman</au><au>Endeve, Eirik</au><au>Stoyanov, Miroslav</au><au>Hahn, Steven</au><au>Hauck, Cory D</au><au>Green, David L</au><au>Snyder, Phil</au><au>Canik, John</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Sparse-grid Discontinuous Galerkin Methods for the Vlasov-Poisson-Lenard-Bernstein Model</atitle><date>2024-02-09</date><risdate>2024</risdate><abstract>Sparse-grid methods have recently gained interest in reducing the computational cost of solving high-dimensional kinetic equations. In this paper, we construct adaptive and hybrid sparse-grid methods for the Vlasov-Poisson-Lenard-Bernstein (VPLB) model. This model has applications to plasma physics and is simulated in two reduced geometries: a 0x3v space homogeneous geometry and a 1x3v slab geometry. We use the discontinuous Galerkin (DG) method as a base discretization due to its high-order accuracy and ability to preserve important structural properties of partial differential equations. We utilize a multiwavelet basis expansion to determine the sparse-grid basis and the adaptive mesh criteria. We analyze the proposed sparse-grid methods on a suite of three test problems by computing the savings afforded by sparse-grids in comparison to standard solutions of the DG method. The results are obtained using the adaptive sparse-grid discretization library ASGarD.</abstract><doi>10.48550/arxiv.2402.06493</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.2402.06493
ispartof
issn
language eng
recordid cdi_arxiv_primary_2402_06493
source arXiv.org
subjects Computer Science - Numerical Analysis
Mathematics - Numerical Analysis
title Sparse-grid Discontinuous Galerkin Methods for the Vlasov-Poisson-Lenard-Bernstein Model
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-30T02%3A02%3A47IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Sparse-grid%20Discontinuous%20Galerkin%20Methods%20for%20the%20Vlasov-Poisson-Lenard-Bernstein%20Model&rft.au=Schnake,%20Stefan&rft.date=2024-02-09&rft_id=info:doi/10.48550/arxiv.2402.06493&rft_dat=%3Carxiv_GOX%3E2402_06493%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true