Take the 2-minute tour ×
Computational Science Stack Exchange is a question and answer site for scientists using computers to solve scientific problems. It's 100% free, no registration required.

I was wondering, before trying to do that myself, has anyone attempted to do orthonormalization of Bernstein polynomials using Gram-Schmidt?

I discussed this with several people and have been told that Bernstein polynomials don't make a good basis for FEM because they are not orthogonal.

I didn't use FEM, instead I made a (pseudospectral-like) collocation method formulation, and documented my attempts to solve elliptic problems in 2D domains in an arXiv article. I had exponential convergence with polynomial orders $n<20$. After that approximation become worse as $n$ was increased. One of the reasons may be non-orthogonality of Bernstein polynomial basis functions.

The code discussed is here.

My idea is to make a new orthogonal basis using Gram-Schmidt and try again.

share|improve this question
2  
This isn't exactly what you asked, but maybe this paper is helpful. –  Christian Clason Nov 28 '12 at 18:12
    
Not bad, not bad at all :) Thanks! –  Johntra Volta Nov 28 '12 at 18:18
    
@ChristianClason - That's an answer, as far as I'm concerned, feel free to move it out of comments, and perhaps paste the abstract in to your answer. –  Aron Ahmadia Nov 28 '12 at 22:23
add comment

2 Answers 2

I think Rob Kirby told me once that he had written something on using Bernstein polynomials for FEM. Take a look at his web site at Texas Tech (or now at Baylor).

share|improve this answer
1  
Indeed, there are two recent papers in Numerische Mathematik: 121(2): 261 -- 279 (2012) and 117(4): 631 -- 652 (2011). –  Christian Clason Nov 29 '12 at 7:55
add comment

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.