Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

The Computational Complexity of Elliptic Partial Differential Equations

From MaRDI portal
Publication:4999424
Jump to:navigation, search

DOI10.1007/978-1-4684-2001-2_8zbMath1467.65123OpenAlexW93926411MaRDI QIDQ4999424

Martin H. Schultz

Publication date: 6 July 2021

Published in: Complexity of Computer Computations (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4684-2001-2_8


zbMATH Keywords

elliptic partial differential equation


Mathematics Subject Classification ID

Finite difference methods for initial value and initial-boundary value problems involving PDEs (65M06) Second-order elliptic equations (35J15) Complexity and performance of numerical algorithms (65Y20)


Related Items (2)

Emergence of the fused spacetime from a continuum computing construct of reality ⋮ A survey of techniques in applied computational complexity







This page was built for publication: The Computational Complexity of Elliptic Partial Differential Equations

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4999424&oldid=19453059"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 8 February 2024, at 09:59.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki