Applications of Limiters, Neural Networks and Polynomial Annihilation in Higher-Order FD/FV Schemes
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
1 Online-Ressource.
- Sprache
-
Englisch
- Erschienen in
-
Applications of Limiters, Neural Networks and Polynomial Annihilation in Higher-Order FD/FV Schemes ; volume:97 ; number:1 ; day:7 ; month:9 ; year:2023 ; pages:1-31 ; date:10.2023
Journal of scientific computing ; 97, Heft 1 (7.9.2023), 1-31, 10.2023
- Urheber
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1007/s10915-023-02322-2
- URN
-
urn:nbn:de:101:1-2023121213184071485612
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:38 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Hillebrand, Dorian
- Klein, Simon-Christian
- Öffner, Philipp
- SpringerLink (Online service)
Ähnliche Objekte (12)
Polynomial reproduction by symmetric subdivision schemes
Convergent adaptive hybrid higher-order schemes for convex minimization
Extensibility of association schemes and GRH-based deterministic polynomial factoring
Extensibility of Association Schemes and GRH-Based Deterministic Polynomial Factoring
Annihilation
Fully-polynomial-time approximation schemes for the Euclidean shortest path problem
Mutual Annihilation
Advanced visualization techniques for flow simulations : from higher-order polynomial data to time-dependent topology
Higher-order accurate space-time schemes for computational astrophysics—Part I: finite volume methods
Compact higher-order gas-kinetic schemes with spectral-like resolution for compressible flow simulations
An Extended Range of Stable Flux Reconstruction Schemes on Quadrilaterals for Various Polynomial Bases
Subdivision Schemes Based on Weighted Local Polynomial Regression: A New Technique for the Convergence Analysis
Polynomial reproduction by symmetric subdivision schemes
Convergent adaptive hybrid higher-order schemes for convex minimization
Extensibility of association schemes and GRH-based deterministic polynomial factoring
Extensibility of Association Schemes and GRH-Based Deterministic Polynomial Factoring
Annihilation
Fully-polynomial-time approximation schemes for the Euclidean shortest path problem
Mutual Annihilation
Advanced visualization techniques for flow simulations : from higher-order polynomial data to time-dependent topology
Higher-order accurate space-time schemes for computational astrophysics—Part I: finite volume methods
Compact higher-order gas-kinetic schemes with spectral-like resolution for compressible flow simulations
An Extended Range of Stable Flux Reconstruction Schemes on Quadrilaterals for Various Polynomial Bases
Subdivision Schemes Based on Weighted Local Polynomial Regression: A New Technique for the Convergence Analysis
Polynomial reproduction by symmetric subdivision schemes
Convergent adaptive hybrid higher-order schemes for convex minimization
Extensibility of association schemes and GRH-based deterministic polynomial factoring
Extensibility of Association Schemes and GRH-Based Deterministic Polynomial Factoring
Annihilation
Fully-polynomial-time approximation schemes for the Euclidean shortest path problem
Mutual Annihilation
Advanced visualization techniques for flow simulations : from higher-order polynomial data to time-dependent topology
Higher-order accurate space-time schemes for computational astrophysics—Part I: finite volume methods
Compact higher-order gas-kinetic schemes with spectral-like resolution for compressible flow simulations
An Extended Range of Stable Flux Reconstruction Schemes on Quadrilaterals for Various Polynomial Bases