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

Surface approximation is sometimes easier than surface integration

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

DOI10.1007/s00365-003-0546-1zbMath1112.41024OpenAlexW2144381961MaRDI QIDQ1885349

Arthur G. Werschulz, Henryk Woźniakowski

Publication date: 28 October 2004

Published in: Constructive Approximation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00365-003-0546-1

zbMATH Keywords

complexitysurface approximationsurface integrationoptimal algorithms


Mathematics Subject Classification ID

Best approximation, Chebyshev systems (41A50) Approximate quadratures (41A55) Computer-aided design (modeling of curves and surfaces) (65D17)


Related Items

The complexity of Fredholm equations of the second kind: noisy information about everything



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