default search action
Pascal Heid
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j6]Pascal Heid
:
A link between the steepest descent method and fixed-point iterations. Optim. Lett. 17(1): 27-44 (2023) - [j5]Mario Amrein, Pascal Heid
A Numerical Energy Reduction Approach for Semilinear Diffusion-Reaction Boundary Value Problems Based on Steady-State Iterations. SIAM J. Numer. Anal. 61(2): 755-783 (2023) - [i13]Pascal Heid:
A damped Kačanov scheme for the numerical solution of a relaxed p(x)-Poisson equation. CoRR abs/2304.01566 (2023) - [i12]Massimo Fornasier, Pascal Heid, Giacomo Enrico Sodini:
Approximation Theory, Computing, and Deep Learning on the Wasserstein Space. CoRR abs/2310.19548 (2023) - 2022
- [i11]Mario Amrein, Pascal Heid, Thomas P. Wihler:
A numerical energy minimisation approach for semilinear diffusion-reaction boundary value problems based on steady state iterations. CoRR abs/2202.07398 (2022) - [i10]Pascal Heid:
An adaptive damped Newton method for strongly monotone and Lipschitz continuous operator equations. CoRR abs/2210.17107 (2022) - [i9]Maximilian Brunner
Adaptive FEM with quasi-optimal overall cost for nonsymmetric linear elliptic PDEs. CoRR abs/2212.00353 (2022) - 2021
- [j4]Pascal Heid
Energy Contraction and Optimal Convergence of Adaptive Iterative Linearized Finite Element Methods. Comput. Methods Appl. Math. 21(2): 407-422 (2021) - [j3]Pascal Heid, Benjamin Stamm
Gradient flow finite element discretizations with energy-based adaptivity for the Gross-Pitaevskii equation. J. Comput. Phys. 436: 110165 (2021) - [j2]Pascal Heid, Thomas P. Wihler
Adaptive Local Minimax Galerkin Methods for Variational Problems. SIAM J. Sci. Comput. 43(2): A1108-A1133 (2021) - [i8]Pascal Heid, Endre Süli:
On the convergence rate of the Kačanov scheme for shear-thinning fluids. CoRR abs/2101.01398 (2021) - [i7]Pascal Heid, Thomas P. Wihler:
A modified Kačanov iteration scheme with application to quasilinear diffusion models. CoRR abs/2101.10137 (2021) - [i6]Pascal Heid, Endre Süli:
Adaptive iterative linearised finite element methods for implicitly constituted incompressible fluid flow problems and its application to Bingham fluids. CoRR abs/2109.05991 (2021) - [i5]Pascal Heid:
A link between the steepest descent method and fixed-point iterations. CoRR abs/2109.09108 (2021) - 2020
- [j1]Pascal Heid
Adaptive iterative linearization Galerkin methods for nonlinear problems. Math. Comput. 89(326): 2707-2734 (2020) - [i4]Pascal Heid, Thomas P. Wihler:
Adaptive local minimax Galerkin methods for variational problems. CoRR abs/2002.06915 (2020) - [i3]Pascal Heid, Dirk Praetorius, Thomas P. Wihler:
A note on energy contraction and optimal convergence of adaptive iterative linearized finite element methods. CoRR abs/2007.10750 (2020) - [i2]Pascal Heid:
Gradient flow finite element discretisations with energy-based adaptivity for excited states of Schrödingers equation. CoRR abs/2010.10383 (2020)
2010 – 2019
- 2019
- [i1]Pascal Heid, Benjamin Stamm
Gradient Flow Finite Element Discretizations with Energy-Based Adaptivity for the Gross-Pitaevskii Equation. CoRR abs/1906.06954 (2019)
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:48 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: