Two Algorithms for Approximation in Highly Complicated Planar Domains

Nira Dyn () and Roman Kazinnik ()
Additional contact information
Nira Dyn: Tel-Aviv University, School of Mathematical Sciences
Roman Kazinnik: Tel-Aviv University, School of Mathematical Sciences

A chapter in Algorithms for Approximation, 2007, pp 19-30 from Springer

Keywords: Polynomial Approximation; Convex Domain; Planar Domain; Linear Polynomial; Singularity Component (search for similar items in EconPapers)
Date: 2007
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-540-46551-5_2

Ordering information: This item can be ordered from
http://www.springer.com/9783540465515

DOI: 10.1007/978-3-540-46551-5_2

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().