Computational complexity and memory usage for multi-frontal direct solvers in structured mesh finite elements

Details Computational complexity and memory usage for multi-frontal direct solvers in structured mesh finite elements Computational complexity and memory usage for multi-frontal direct solvers in structured mesh finite elements

2012-04-08

arxiv.org/abs/1204.1718v1

Computer Science

Numerical Analysis

8 pages, 2 figures

Scientific paper

The multi-frontal direct solver is the state-of-the-art algorithm for the direct solution of sparse linear systems. This paper provides computational complexity and memory usage estimates for the application of the multi-frontal direct solver algorithm on linear systems resulting from B-spline-based isogeometric finite elements, where the mesh is a structured grid. Specifically we provide the estimates for systems resulting from $C^{p-1}$ polynomial B-spline spaces and compare them to those obtained using $C^0$ spaces.

Affiliated with

Also associated with

No associations

Rating

Computational complexity and memory usage for multi-frontal direct solvers in structured mesh finite elements does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Computational complexity and memory usage for multi-frontal direct solvers in structured mesh finite elements, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computational complexity and memory usage for multi-frontal direct solvers in structured mesh finite elements will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-509315