{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/fastqsl-a-fast-computation-method-for-quasi","title":"FastQSL: A Fast Computation Method for Quasi-separatrix Layers","arxiv_id":"2208.12569","date":"2022-08-26","proceeding":null,"authors":["Peijin Zhang","Jun Chen","Rui Liu","Chuanbing Wang"],"abstract":"Magnetic reconnection preferentially takes place at the intersection of two separatrices or two quasi-separatrix layers, which can be quantified by the squashing factor Q, whose calculation is computationally expensive due to the need to trace as many field lines as possible. We developed a method (FastQSL) optimized for obtaining Q and the twist number in a 3D data cube. FastQSL utilizes the hardware acceleration of the graphic process unit (GPU) and adopts a step-size adaptive scheme for the most computationally intensive part: tracing magnetic field lines. As a result, it achieves a computational efficiency of 4.53 million Q values per second. FastQSL is open source, and user-friendly for data import, export, and visualization.","url_abs":"https://arxiv.org/abs/2208.12569v4","url_pdf":"https://arxiv.org/pdf/2208.12569v4.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"links_only","authors_date_abstract":"arXiv metadata, CC0 1.0 (https://info.arxiv.org/help/license), from the Kaggle arXiv metadata snapshot of 2026-09-12"},"code_links":[{"paper_slug":"fastqsl-a-fast-computation-method-for-quasi","repo_url":"https://github.com/peijin94/FastQSL","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"fastqsl-a-fast-computation-method-for-quasi","repo_url":"https://github.com/pjer-zhang/fastqsl","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"fastqsl-a-fast-computation-method-for-quasi","repo_url":"https://github.com/el2718/fastqsl","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers"},"arxiv_metadata":null,"syntology_extracted_results":null}