default search action
Klas Modin
Person information
- affiliation: Chalmers University of Technology, Gothenburg, Sweden
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i7]Klas Modin, Stephen C. Preston:
Zeitlin's model for axisymmetric 3-D Euler equations. CoRR abs/2408.11204 (2024) - [i6]Erik Jansson, Jonathan Krook, Klas Modin, Ozan Öktem:
Geometric shape matching for recovering protein conformations from single-particle Cryo-EM data. CoRR abs/2410.00833 (2024) - [i5]Boris Khesin, Gerard Misiolek, Klas Modin:
Information geometry of diffeomorphism groups. CoRR abs/2411.03265 (2024) - 2023
- [j12]Paolo Cifani
, Milo Viviani
An efficient geometric method for incompressible hydrodynamics on the sphere. J. Comput. Phys. 473: 111772 (2023) - [i4]Klas Modin:
On the geometry and dynamical formulation of the Sinkhorn algorithm for optimal transport. CoRR abs/2309.09089 (2023) - [i3]Klas Modin, Michael Roop:
Spatio-temporal Lie-Poisson discretization for incompressible magnetohydrodynamics on the sphere. CoRR abs/2311.16045 (2023) - 2022
- [i2]Erik Jansson, Klas Modin:
Geometric discretization of diffeomorphisms. CoRR abs/2210.02328 (2022) - 2021
- [i1]Klas Modin, Milo Viviani:
Canonical scale separation in two-dimensional incompressible hydrodynamics. CoRR abs/2102.01451 (2021) - 2020
- [j11]Klas Modin
Lie-Poisson Methods for Isospectral Flows. Found. Comput. Math. 20(4): 889-921 (2020) - [j10]Klas Modin
What makes nonholonomic integrators work? Numerische Mathematik 145(2): 405-435 (2020)
2010 – 2019
- 2019
- [j9]James Benn, Stephen Marsland
Currents and Finite Elements as Tools for Shape Space. J. Math. Imaging Vis. 61(8): 1197-1220 (2019) - 2018
- [j8]Geir Bogfjellmo, Klas Modin
A Numerical Algorithm for C2-Splines on Symmetric Spaces. SIAM J. Numer. Anal. 56(4): 2623-2647 (2018) - 2017
- [j7]Robert I. McLachlan
A minimal-variable symplectic integrator on spheres. Math. Comput. 86(307): 2325-2344 (2017) - [c1]Martin Bauer, Sarang C. Joshi, Klas Modin
Diffeomorphic Random Sampling Using Optimal Information Transport. GSI 2017: 135-142 - 2016
- [j6]Robert I. McLachlan
Geometry of Discrete-Time Spin Systems. J. Nonlinear Sci. 26(5): 1507-1523 (2016) - [j5]Robert I. McLachlan
B-series methods are exactly the affine equivariant methods. Numerische Mathematik 133(3): 599-622 (2016) - 2015
- [j4]Martin Bauer
Diffeomorphic Density Matching by Optimal Information Transport. SIAM J. Imaging Sci. 8(3): 1718-1751 (2015) - 2014
- [j3]Robert I. McLachlan
Geometric Generalisations of shake and rattle. Found. Comput. Math. 14(2): 339-370 (2014) - 2013
- [j2]Stephen R. Marsland, Robert I. McLachlan
Geodesic Warps by Conformal Mappings. Int. J. Comput. Vis. 105(2): 144-154 (2013) - [j1]Robert I. McLachlan
Symplectic Integrators for Index 1 Constraints. SIAM J. Sci. Comput. 35(5) (2013)
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 2025-01-04 03:16 CET 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: