Polynomial approximation of some singular functions. (English) Zbl 0701.41009

The singularities of the solution of a Poisson equation in a polygonal domain are essentially the distance to a corner, up to a positive but weak power. We prove that the high degree polynomial approximation of such functions is better than the result given by the general theory. This leads to an improvement of the error estimates in some spectral type discretizations.
Reviewer: C.Bernardi


41A10 Approximation by polynomials
65N15 Error bounds for boundary value problems involving PDEs
Full Text: DOI


[1] DOI: 10.1137/0724049 · Zbl 0637.65103 · doi:10.1137/0724049
[2] Suri M., Model Math, et Anal. Numer 24 pp 265– (1990)
[3] DOI: 10.1137/0726045 · Zbl 0675.65114 · doi:10.1137/0726045
[4] Davis P.J., Methods of Numerical Integration (1984) · Zbl 0537.65020
[5] DOI: 10.1090/S0025-5718-1982-0637287-3 · doi:10.1090/S0025-5718-1982-0637287-3
[6] Dauge M., Elliptic Boundary VaJue Problems on Corner Domains (1988) · Zbl 0668.35001 · doi:10.1007/BFb0086682
[7] Triebel H., Interpolation Theory, Function Spaces, Differential Operators (1978) · Zbl 0387.46033
[8] Grisvard P., Elliptic Problems in Nonsmooth Domains (1985) · Zbl 0695.35060
[9] Raugel G., Resolution numerique de problemes elliptiques dans des domaines a. coins, These 3eme cycle (1978)
[10] DOI: 10.1007/BF02576359 · Zbl 0475.76035 · doi:10.1007/BF02576359
[11] Maday Y., Math. Comput 18 (1981)
[12] Babuska I., Personal communication
[13] Bernardi C., Polynomials in Weighted Sobolev Spaces
[14] Maday Y., State-of-the Art Surveys on Com{\(\neg\)}putational Mechanics 1989
[15] Bernardi C., IMA J. Numer. Anal 1989
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.