Giter Site home page Giter Site logo

swufung / mumps.jl Goto Github PK

View Code? Open in Web Editor NEW

This project forked from juliainv/mumpsjinv.jl

0.0 2.0 0.0 9.24 MB

MUMPS interface for Julia

Julia 0.15% Makefile 0.17% MATLAB 0.14% C++ 0.62% C 13.81% HTML 0.12% Scilab 0.11% Fortran 84.80% CMake 0.05% Objective-C 0.04% Batchfile 0.01%

mumps.jl's Introduction

#MUMPS

Efficiently solving large and sparse linear systems is essential in many areas of scientific computing. This project provides an interface to MUMPS ( a MUltifrontal Massively Parallel sparse direct Solver) in Julia. To improve the memory-efficiency of the method the software package METIS (Serial Graph Partitioning and Fill-reducing Matrix Ordering) is used. Please refer to the MUMPS and metis websites for more information and updated versions.

Copyright

Please make sure you have read and understood the licenses of MUMPS 4.10.0 and Metis (4.0.3). Due to the use of Metis, this code can be freely used for educational and research purposes by non-profit institutions and US government agencies only. The wrapper itself is provided as free software under MIT License in the hope it is useful.

Note that this software is provided "as is" with absolutely no warranty. Use at your own risk.

Benchmark Example

In our experience MUMPS is considerably faster than Julia's backslash both in solving real or complex systems. It also seems to consume less memory. Another benefit is that once the factorization is generated it can be applied to multiple right-hand sides. Here are results of two benchmarks ran on a MacBookPro with 2.6 GHz Intel Core i7 Processor and 16 GB RAM.

Solving Poisson System

We are solving linear systems arising from discretization of Poisson's equation for different discretization sizes for a random right hand side. We compare the runtime for MUMPS solver and the backslash.

Grid size MUMPS (sec) Julia (sec) Speedup
8^3 0.0013 0.0030 2.243
16^3 0.0197 0.0214 1.080
24^3 0.1283 0.1112 0.866
32^3 0.4160 0.3997 0.960
48^3 2.3682 3.4196 1.443
64^3 10.9231 16.1198 1.475

Solving a complex system

As above, we obtain discretizations of Poisson's equation for different grid sizes, add an imaginary identity matrix and solve for one complex random right hand side. We compare the runtime for MUMPS solver and the backslash.

Grid size MUMPS (sec) Julia (sec) Speedup
8^3 0.002 0.004 1.829
16^3 0.047 0.087 1.867
24^3 0.319 0.415 1.299
32^3 1.312 2.502 1.907
48^3 11.091 24.057 2.168
64^3 58.472 157.315 2.690

Some more tests are provided in MUMPS/tests.

Installing MUMPS

This package was tested on Mac and Ubuntu only. Here, open a terminal navigate to MUMPS/src and run make. Please do a pull-request if you have improvements.

**ToDo: Make MUMPS available from Julia's package manager! **

mumps.jl's People

Contributors

pbellive avatar lruthotto avatar jackdevine avatar tkelman avatar

Watchers

James Cloos avatar Samy Wu Fung avatar

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    ๐Ÿ–– Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. ๐Ÿ“Š๐Ÿ“ˆ๐ŸŽ‰

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google โค๏ธ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.