This project is set up for the intersection of curves. It aims to develop an algorithm that can calculate the intersections of curves both efficiently and rigorously.
This project shows a demo of the algorithm of the a posteriori error estimation for eigenvector of eigenvalue problems, such as, the matrix eigenvalue problem, the Laplacian eigenvalue problem.
The explicit lower bound and upper bound for the Laplace differential operator are obtained by using the conforming and non-conforming finite element method.