Average case complexity of elliptic partial differential equations

DOI10.1016/0885-064X(89)90028-9zbMath0685.65095OpenAlexW2046296184MaRDI QIDQ1262102

Arthur G. Werschulz

Publication date: 1989

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

Full work available at URL: https://doi.org/10.1016/0885-064x(89)90028-9

zbMATH Keywords

finite element methodworst case settingaverage case settingalmost optimal complexity algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Boundary value problems for second-order elliptic equations (35J25) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30)

Cites Work

• On the average complexity of multivariate problems
• Complexity of differential and integral equations
• Gaussian measures in Banach spaces
• Complexity of Indefinite Elliptic Problems
• On kernels, eigenvalues, and eigenfunctions of operators related to elliptic problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Average case complexity of elliptic partial differential equations