What is the complexity of elliptic systems?

DOI10.1016/0021-9045(85)90060-7zbMath0583.65079OpenAlexW2033603142MaRDI QIDQ1069283

Arthur G. Werschulz

Publication date: 1985

Published in: Journal of Approximation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0021-9045(85)90060-7

zbMATH Keywords

finite element methodsquasi-optimalityoptimal complexitySpline

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30)

Related Items (2)

A survey of information-based complexity ⋮ Recent developments in information-based complexity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Asymptotic estimates of the \(L_ 2\) \(n\)-width
• Interpolation theory over curved elements, with applications to finite element methods
• Complexity of Indefinite Elliptic Problems
• Estimates near the boundary for solutions of elliptic partial differential equations satisfying general boundary conditions. I
• On the Numerical Solutions of Helmholtz’s Equation by the Finite Element Method
• Finite Element Approximation for First Order Systems
• A THEOREM ON HOMEOMORPHISMS FOR ELLIPTIC SYSTEMS AND ITS APPLICATIONS
• Least Squares Methods for 2mth Order Elliptic Boundary-Value Problems

This page was built for publication: What is the complexity of elliptic systems?