default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSteffen Börm
Person information
- affiliation: University of Kiel, Department of Computer Science, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i13]Steffen Börm:
Adaptive multiplication of H2-matrices with block-relative error control. CoRR abs/2403.01566 (2024)- 2023
- [j31]Steffen Börm
:
Distributed ℋ2-Matrices for Boundary Element Methods. ACM Trans. Math. Softw. 49(2): 14:1-14:21 (2023) - [i12]Steffen Börm, Ralf Köhl, Nahid Talebi:
Computing Maxwell eigenmodes with Bloch boundary conditions. CoRR abs/2304.00337 (2023) - [i11]Steffen Börm:
Adaptive multiplication of rank-structured matrices in linear complexity. CoRR abs/2309.09061 (2023) - [i10]Steffen Börm, Janne Henningsen:
Memory-efficient compression of DH2-matrices for high-frequency problems. CoRR abs/2310.00111 (2023) - 2022
- [j30]Steffen Börm:
On Iterated Interpolation. SIAM J. Numer. Anal. 60(6): 3124-3144 (2022) - [j29]Steffen Börm, Sven Christophersen, Ronald Kriemann:
SemiAutomatic Task Graph Construction for $\mathcal{H}$-Matrix Arithmetic. SIAM J. Sci. Comput. 44(2): 77- (2022) - [i9]Steffen Börm:
Distributed H2-matrices for boundary element methods. CoRR abs/2203.05665 (2022) - [i8]Steffen Börm, Janne Henningsen:
H2-matrices for translation-invariant kernel functions. CoRR abs/2210.16609 (2022) - 2021
- [j28]Rudolf Berghammer, Steffen Börm, Michael Winter:
Algorithmic Counting of Zero-Dimensional Finite Topological Spaces With Respect to the Covering Dimension. Appl. Math. Comput. 389: 125523 (2021) - [j27]Steffen Börm:
Adaptive Directional Compression of High-Frequency Helmholtz Boundary Element Matrices. Comput. Methods Appl. Math. 21(3): 513-527 (2021) - [i7]Steffen Börm:
On iterated interpolation. CoRR abs/2109.04330 (2021) - 2020
- [j26]Steffen Börm, Christina Börst:
Hybrid Matrix Compression for High-Frequency Problems. SIAM J. Matrix Anal. Appl. 41(4): 1704-1725 (2020) - [i6]Steffen Börm:
Fast large-scale boundary element algorithms. CoRR abs/2001.05523 (2020) - [i5]Cedric Münger, Steffen Börm, Jörg Ostrowski:
Dielectric breakdown prediction with GPU-accelerated BEM. CoRR abs/2003.12663 (2020) - [i4]Rudolf Berghammer, Steffen Börm, Michael Winter:
Algorithmic Counting of Zero-Dimensional Finite Topological Spaces With Respect to the Covering Dimension. CoRR abs/2003.12871 (2020)
2010 – 2019
- 2019
- [j25]Steffen Börm:
Hierarchical matrix arithmetic with accumulated updates. Comput. Vis. Sci. 20(3-6): 71-84 (2019) - [j24]Rocío Carratalá-Sáez, Sven Christophersen, José Ignacio Aliaga, Vicenç Beltran, Steffen Börm, Enrique S. Quintana-Ortí:
Exploiting nested task-parallelism in the H-LU factorization. J. Comput. Sci. 33: 20-33 (2019) - [j23]Rocío Carratalá-Sáez, Sven Christophersen, José Ignacio Aliaga, Vicenç Beltran, Steffen Börm, Enrique S. Quintana-Ortí:
Erratum to "Exploiting nested task-parallelism in theH-LU factorization" [J. Comput. Sci. 33 (2019) 20-33]. J. Comput. Sci. 35: 110 (2019) - [c2]Steffen Börm:
Fast Large-Scale Boundary Element Algorithms. HPCSE 2019: 60-79 - [i3]Rocío Carratalá-Sáez, Sven Christophersen, José Ignacio Aliaga, Vicenç Beltran, Steffen Börm, Enrique S. Quintana-Ortí:
Exploiting nested task-parallelism in the H-LU factorization. CoRR abs/1906.00874 (2019) - [i2]Steffen Börm, Sven Christophersen, Ronald Kriemann:
Semi-Automatic Task Graph Construction for H-Matrix Arithmetic. CoRR abs/1911.07531 (2019) - 2018
- [j22]Steffen Börm:
Adaptive compression of large vectors. Math. Comput. 87(309): 209-235 (2018) - 2017
- [j21]Steffen Börm, Christina Börst, Jens Markus Melenk:
An analysis of a butterfly algorithm. Comput. Math. Appl. 74(9): 2125-2143 (2017) - [j20]Steffen Börm:
Directional H2-matrix compression for high-frequency problems. Numer. Linear Algebra Appl. 24(6) (2017) - [j19]Steffen Börm, Jens Markus Melenk:
Approximation of the high-frequency Helmholtz kernel by nested directional interpolation: error analysis. Numerische Mathematik 137(1): 1-34 (2017) - 2016
- [j18]Steffen Börm, Sven Christophersen:
Approximation of integral operators by Green quadrature and nested cross approximation. Numerische Mathematik 133(3): 409-442 (2016) - 2015
- [p1]Steffen Börm:
Wissenschaftliches Rechnen: Simulationen mittels mathematischer Modelle. Wissenschaft und Kunst der Modellierung 2015: 139-158 - [i1]Steffen Börm, Sven Christophersen:
Approximation of BEM matrices using GPGPUs. CoRR abs/1510.07244 (2015) - 2013
- [j17]Steffen Börm, Knut Reimer:
Efficient arithmetic operations for rank-structured matrices based on hierarchical low-rank updates. Comput. Vis. Sci. 16(6): 247-258 (2013) - [j16]Peter Benner, Steffen Börm, Thomas Mach, Knut Reimer:
Computing the eigenvalues of symmetric (H2) -matrices by slicing the spectrum. Comput. Vis. Sci. 16(6): 271-282 (2013) - [j15]Steffen Börm, Jessica Gördes:
Low-rank approximation of integral operators by using the Green formula and quadrature. Numer. Algorithms 64(3): 567-592 (2013) - 2010
- [j14]Steffen Börm:
Approximation of solution operators of elliptic partial differential equations by ℋ- and ℋ2-matrices. Numerische Mathematik 115(2): 165-193 (2010)
2000 – 2009
- 2009
- [j13]Steffen Börm:
Construction of Data-Sparse H2-Matrices by Hierarchical Compression. SIAM J. Sci. Comput. 31(3): 1820-1839 (2009) - 2007
- [j12]Steffen Börm:
Adaptive Variable-Rank Approximation of General Dense Matrices. SIAM J. Sci. Comput. 30(1): 148-168 (2007) - [c1]Steffen Börm, Jochen Garcke:
Approximating Gaussian Processes with H2-Matrices. ECML 2007: 42-53 - 2006
- [j11]Steffen Börm:
H2 -Matrix Arithmetics in Linear Complexity. Computing 77(1): 1-28 (2006) - 2005
- [j10]Steffen Börm, Wolfgang Hackbusch:
Hierarchical Quadrature for Singular Integrals. Computing 74(2): 75-100 (2005) - [j9]Steffen Börm:
Approximation of Integral Operators by H2-Matrices with Adaptive Bases. Computing 74(3): 249-271 (2005) - [j8]Steffen Börm, Stefan A. Sauter:
BEM with linear complexity for the classical boundary integral operators. Math. Comput. 74(251): 1139-1177 (2005) - [j7]Steffen Börm, Maike Löhndorf, Jens Markus Melenk:
Approximation of Integral Operators by Variable-Order Interpolation. Numerische Mathematik 99(4): 605-643 (2005) - [j6]Steffen Börm, Lars Grasedyck:
Hybrid cross approximation of integral operators. Numerische Mathematik 101(2): 221-249 (2005) - 2004
- [j5]Steffen Börm, Lars Grasedyck:
Low-Rank Approximation of Integral Operators by Interpolation. Computing 72(3-4): 325-332 (2004) - 2002
- [j4]Steffen Börm, Ralf Hiptmair:
Multigrid Computation of Axisymmetric Electromagnetic Fields. Adv. Comput. Math. 16(4): 331-356 (2002) - [j3]Wolfgang Hackbusch, Steffen Börm:
Data-sparse Approximation by Adaptive H2-Matrices. Computing 69(1): 1-35 (2002) - 2001
- [j2]Steffen Börm:
Tensor Product Multigrid for Maxwell's Equation with Aligned Anisotropy. Computing 66(4): 321-342 (2001) - [j1]Steffen Börm, Ralf Hiptmair:
Analysis of tensor product multigrid. Numer. Algorithms 26(3): 219-234 (2001)
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-04-24 22:53 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:
