default search action
Linda Stals
Person information
- affiliation: Australian National University, Mathematical Sciences Institute, Canberra, Australia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j7]Stuart C. Hawkins
, Linda Stals, Sherwin Bagheri:
An efficient iterative method for reconstructing the refractive index in complex domains from far field data. J. Comput. Appl. Math. 438: 115573 (2024) - [j6]Lishan Fang
Data-based adaptive refinement of finite element thin plate spline. J. Comput. Appl. Math. 451: 115975 (2024) - 2023
- [i3]Lishan Fang, Linda Stals:
Data-based Adaptive Refinement of Finite Element Thin Plate Spline. CoRR abs/2302.10442 (2023) - 2022
- [j5]Emmanuel Agullo, Mirco Altenbernd, Hartwig Anzt
Resiliency in numerical algorithm design for extreme scale simulations. Int. J. High Perform. Comput. Appl. 36(2): 251-285 (2022) - 2020
- [i2]Emmanuel Agullo, Mirco Altenbernd, Hartwig Anzt, Leonardo Bautista-Gomez, Tommaso Benacchio, Luca Bonaventura, Hans-Joachim Bungartz, Sanjay Chatterjee, Florina M. Ciorba, Nathan DeBardeleben, Daniel Drzisga, Sebastian Eibl, Christian Engelmann, Wilfried N. Gansterer, Luc Giraud, Dominik Göddeke, Marco Heisig, Fabienne Jézéquel, Nils Kohl, Xiaoye Sherry Li, Romain Lion, Miriam Mehl, Paul Mycek, Michael Obersteiner, Enrique S. Quintana-Ortí, Francesco Rizzi, Ulrich Rüde, Martin Schulz, Fred Fung, Robert Speck, Linda Stals, Keita Teranishi, Samuel Thibault, Dominik Thönnes, Andreas Wagner, Barbara I. Wohlmuth:
Resiliency in Numerical Algorithm Design for Extreme Scale Simulations. CoRR abs/2010.13342 (2020) - [i1]Luc Giraud, Ulrich Rüde, Linda Stals:
Resiliency in Numerical Algorithm Design for Extreme Scale Simulations (Dagstuhl Seminar 20101). Dagstuhl Reports 10(3): 1-57 (2020)
2010 – 2019
- 2019
- [j4]Linda Stals:
Algorithm-based fault recovery of adaptively refined parallel multilevel grids. Int. J. High Perform. Comput. Appl. 33(1) (2019) - 2016
- [j3]Bishnu P. Lamichhane
A Mixed Finite Element Discretisation of Thin Plate Splines Based on Biorthogonal Systems. J. Sci. Comput. 67(1): 20-42 (2016) - 2015
- [j2]Linda Stals
Efficient Solution Techniques for a Finite Element Thin Plate Spline Formulation. J. Sci. Comput. 63(2): 374-409 (2015) - 2013
- [c6]Jay Walter Larson, Markus Hegland
Fault-Tolerant Grid-Based Solvers: Combining Concepts from Sparse Grids and MapReduce. ICCS 2013: 130-139 - [c5]Jay Walter Larson, Peter E. Strazdins, Markus Hegland
Managing Complexity in the Parallel Sparse Grid Combination Technique. PARCO 2013: 593-602
2000 – 2009
- 2008
- [j1]Linda Stals
Stability Analysis of Time Stepping for Prolonged Plasma Fluid Simulations. SIAM J. Sci. Comput. 31(2): 961-986 (2008) - 2006
- [c4]Linda Stals, Stephen G. Roberts:
Smoothing and Filling Holes with Dirichlet Boundary Conditions. HPSC 2006: 521-530 - 2004
- [c3]Stephen G. Roberts
Teaching Computational Science Using VPython and Virtual Reality. International Conference on Computational Science 2004: 1218-1225 - 2001
- [c2]Linda Stals:
The Parallel Solution of Radiation Transport Equations. PP 2001
1990 – 1999
- 1995
- [c1]Linda Stals:
Adaptive Multigrid in Parallel. PP 1995: 367-372
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-23 19:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: