.. _D9.03.02:

**d9.03.02** Implementing the multifrontal method MULT_FRONT
=================================================================

**Summary:**

In this note, we present the computer description of the native version in Code_Aster, of the multi-frontal linear solver, commonly called MULT_FRONT.

This version, developed at EDF R&D, is stable, with an almost complete scope.

This note complements the Code_Aster reference documentation: "Linear solver using the multi-frontend method" [:external:ref:`R6.02.02 <R6.02.02>`].

We recall the main concepts used by the method: renumbering, elimination tree, supernodes. The computer structures created by the algorithm are described. The main computer difficulties and particularities are reported. We are considering the various possible developments.

A report published separately is dedicated to an overview and the prospects for application maintenance: [:ref:`RB12 <RB12>`] "Native multi-frontend method in Code_Aster: state of play and perspectives", CR-I23-2012-001.

 **Table of Contents**




.. toctree::
    :hidden:

    self

.. toctree::
    :maxdepth: 2
    :numbered:

    Introduction
    Renum_rotation_et_factorisation_symbolique___MLTPRE
    Factorisation_num_rique_MULFR8
    Remont_e_du_syst_me___RLTFR8
    Version_non-sym_trique_
    Version_complexe
    Parall_lisation_
    Remarques_diverses_
    Conclusions__d_veloppements_envisageables__
    R_f_rences_