Re: [deal.II] Fast FE evaluation over several points and several functions

I am solving an eigenvalue problem similar than step-36. After solving for the eigenpairs, I evaluate the eigenfunctions in the standard way: VectorTools::point_value ( mapping, dof_handler, efun[m], q_points[j], Uq ); where: efun[m] is the m-th eigenfunction from step-36,

Re: [deal.II] Re: Entry of the own problem in dealii

Thank you very much for your answer. I have watched your tutorial videos to learn how to implement the problem but actually I have difficulties to input my own geometry in dealii and refine the certain line that I need to.Currently I play with the step-1 and step-12 again, which implements the

[deal.II] Adding dirichlet values to ConstraintMatrix

Dear all I have created a std::map boundary_values; I want to add this to a ConstraintMatrix but I could not find any function to do this. >From the documentation, I could do for each dirichlet dof { add_line(...) set_inhomogeneity(...) } Is this the only way

Re: [deal.II] Re: Entry of the own problem in dealii

Dear Reza! Actually this specific code follows very much the general structure of deal.II tutorials. If you want (or need) to learn this first, I always recommend to work through the first six tutorials. Then for vector-valued problems, step-22 is important. For the specific solver, we made

Re: [deal.II] Re: Entry of the own problem in dealii

Thanks alot for your answer. I have already read the paper you mean and took a look at the homepage that you gave me and downloaded the code. But in fact I need to learn the process step by step with dealii, which is not so clear in the paper how it has been done with the software. It would be

Re: [deal.II] Re: Entry of the own problem in dealii

Thanks alot for your answer. I wrote a post for you but I think it was not posted successfully, so if you see my answer probably twice I appoligize to you for it. I have allready read the paper that is done in dealii and I saw the homepage that you gave me and downloaded the code. But actually