2005
DOI: 10.1007/bf02810617
|View full text |Cite
|
Sign up to set email alerts
|

Adaptive bivariate Chebyshev approximation

Abstract: We propose an adaptive algorithm which extends Chebyshev series approximation to bivariate functions, on domains which are smooth transformations of a square. The method is tested on functions with different degrees of regularity and on domains with various geometries. We show also an application to the fast evaluation of linear and nonlinear bivariate integral transforms.2000 AMS subject classification: 41A10, 65D10, 65R10.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2008
2008
2017
2017

Publication Types

Select...
5
1

Relationship

1
5

Authors

Journals

citations
Cited by 10 publications
(1 citation statement)
references
References 18 publications
0
1
0
Order By: Relevance
“…Our work adapts the univariate Chebyshev approximation algorithm of the Chebfun Team 11 to model bivariate functions, following the method of Sommariva, Vianello, and Zanovello. 12 The Chebfun algorithm was translated into Fortran and applied with minor adaptations to the bivariate problem. The univariate Chebyshev series expansion of a function takes the form…”
Section: F Computation and Differentiation Of Source Termsmentioning
confidence: 99%
“…Our work adapts the univariate Chebyshev approximation algorithm of the Chebfun Team 11 to model bivariate functions, following the method of Sommariva, Vianello, and Zanovello. 12 The Chebfun algorithm was translated into Fortran and applied with minor adaptations to the bivariate problem. The univariate Chebyshev series expansion of a function takes the form…”
Section: F Computation and Differentiation Of Source Termsmentioning
confidence: 99%