..
   Copyright 2021 IRT Saint-Exupéry, https://www.irt-saintexupery.com

   This work is licensed under the Creative Commons Attribution-ShareAlike 4.0
   International License. To view a copy of this license, visit
   http://creativecommons.org/licenses/by-sa/4.0/ or send a letter to Creative
   Commons, PO Box 1866, Mountain View, CA 94042, USA.

.. _gen_mda_algos:

MDA algorithms
==============

.. warning::
   Some capabilities may require the :ref:`installation <installation>` of |g| with :ref:`all its features <dependencies>`
   and some others may depend on :ref:`plugins <plugins>`.

.. note::
   All the features of the wrapped libraries may not be exposed through |g|.



.. raw:: html

    <style>
    th {
      cursor: pointer;
    }

    th, td {
      text-align: center;
    }

    tr:hover {
        border: 1px solid black;
    }

    tr:nth-child(even) {
      background-color: #f2f2f2
    }
    </style>

    <script>
    function sortTable(n) {
      var table, rows, switching, i, x, y, shouldSwitch, dir, switchcount = 0;
      table = document.getElementById("myTable");
      switching = true;
      dir = "asc";
      while (switching) {
        switching = false;
        rows = table.rows;
        for (i = 1; i < (rows.length - 1); i++) {
          shouldSwitch = false;
          x = rows[i].getElementsByTagName("TD")[n];
          y = rows[i + 1].getElementsByTagName("TD")[n];
          if (dir == "asc") {
            if (x.innerHTML.toLowerCase() > y.innerHTML.toLowerCase()) {
              shouldSwitch= true;
              break;
            }
          } else if (dir == "desc") {
            if (x.innerHTML.toLowerCase() < y.innerHTML.toLowerCase()) {
              shouldSwitch = true;
              break;
            }
          }
        }
        if (shouldSwitch) {
          rows[i].parentNode.insertBefore(rows[i + 1], rows[i]);
          switching = true;
          switchcount ++;
        } else {
          if (switchcount == 0 && dir == "asc") {
            dir = "desc";
            switching = true;
          }
        }
      }
    }
    </script>



.. _MDAChain_options:

MDAChain
--------



Module: :class:`gemseo.mda.mda_chain`





.. raw:: html

    <link rel="stylesheet" href="../_static/css/theme.css" type="text/css" />
    <link rel="stylesheet" href="../_static/css/gemseo.css" type="text/css" />

































































































































    <dl class="field-list simple">
    <dt class="field-odd">Required parameters</dt>
    <dd class="field-odd"><ul class="simple">

    <li>

**disciplines** : *Sequence[MDODiscipline]*

The disciplines from which to compute the MDA.

.. raw:: html

    </li>

    </ul>
    </dd>
    </dl>



    <dl class="field-list simple">
    <dt class="field-odd">Optional parameters</dt>
    <dd class="field-odd"><ul class="simple">


    <li>

**chain_linearize** : *bool, optional*

Whether to linearize the chain of execution. Otherwise,
linearize the overall MDA with base class method. This last option is
preferred to minimize computations in adjoint mode, while in direct
mode, linearizing the chain may be cheaper.


By default it is set to False.


.. raw:: html

    </li>

    <li>

**coupling_structure** : *MDOCouplingStructure | None, optional*

The coupling structure to be used by the MDA.
If ``None``, it is created from `disciplines`.


By default it is set to None.


.. raw:: html

    </li>

    <li>

**grammar_type** : *MDODiscipline.GrammarType, optional*

The type of the input and output grammars.


By default it is set to JSONGrammar.


.. raw:: html

    </li>

    <li>

**initialize_defaults** : *bool, optional*

Whether to create a :class:`.MDOInitializationChain`
to compute the eventually missing :attr:`.default_inputs` at the first
execution.


By default it is set to False.


.. raw:: html

    </li>

    <li>

**inner_mda_name** : *str, optional*

The class name of the inner-MDA.


By default it is set to MDAJacobi.


.. raw:: html

    </li>

    <li>

**linear_solver** : *str, optional*

The name of the linear solver.


By default it is set to DEFAULT.


.. raw:: html

    </li>

    <li>

**linear_solver_options** : *Mapping[str, Any] | None, optional*

The options passed to the linear solver factory.


By default it is set to None.


.. raw:: html

    </li>

    <li>

**linear_solver_tolerance** : *float, optional*

The tolerance of the linear solver
in the adjoint equation.


By default it is set to 1e-12.


.. raw:: html

    </li>

    <li>

**log_convergence** : *bool, optional*

Whether to log the MDA convergence,
expressed in terms of normed residuals.


By default it is set to False.


.. raw:: html

    </li>

    <li>

**max_mda_iter** : *int, optional*

The maximum iterations number for the MDA algorithm.


By default it is set to 20.


.. raw:: html

    </li>

    <li>

**mdachain_parallel_options** : *Mapping[str, int | bool] | None, optional*

The options of the MDOParallelChain instances, if
any.


By default it is set to None.


.. raw:: html

    </li>

    <li>

**mdachain_parallelize_tasks** : *bool, optional*

Whether to parallelize the parallel tasks, if
any.


By default it is set to False.


.. raw:: html

    </li>

    <li>

**n_processes** : *int, optional*

The maximum simultaneous number of threads if ``use_threading``
is set to True, otherwise processes, used to parallelize the execution.


By default it is set to 2.


.. raw:: html

    </li>

    <li>

**name** : *str | None, optional*

The name to be given to the MDA.
If ``None``, use the name of the class.


By default it is set to None.


.. raw:: html

    </li>

    <li>

**sub_coupling_structures** : *Iterable[MDOCouplingStructure | None] | None, optional*

The coupling structures to be used by the
inner-MDAs. If ``None``, they are created from the sub-disciplines.


By default it is set to None.


.. raw:: html

    </li>

    <li>

**tolerance** : *float, optional*

The tolerance of the iterative direct coupling solver;
the norm of the current residuals divided by initial residuals norm
shall be lower than the tolerance to stop iterating.


By default it is set to 1e-06.


.. raw:: html

    </li>

    <li>

**use_lu_fact** : *bool, optional*

Whether to store a LU factorization of the matrix
when using adjoint/forward differentiation.
to solve faster multiple RHS problem.


By default it is set to False.


.. raw:: html

    </li>

    <li>

****inner_mda_options** : *float | int | bool | str | None*

The options of the inner-MDAs.



.. raw:: html

    </li>

    </ul>
    </dd>
    </dl>



.. _MDAGSNewton_options:

MDAGSNewton
-----------



Module: :class:`gemseo.mda.sequential_mda`





.. raw:: html

    <link rel="stylesheet" href="../_static/css/theme.css" type="text/css" />
    <link rel="stylesheet" href="../_static/css/gemseo.css" type="text/css" />









































































































    <dl class="field-list simple">
    <dt class="field-odd">Required parameters</dt>
    <dd class="field-odd"><ul class="simple">

    <li>

**disciplines** : *Sequence[MDODiscipline]*

The disciplines from which to compute the MDA.

.. raw:: html

    </li>

    </ul>
    </dd>
    </dl>



    <dl class="field-list simple">
    <dt class="field-odd">Optional parameters</dt>
    <dd class="field-odd"><ul class="simple">


    <li>

**coupling_structure** : *MDOCouplingStructure | None, optional*

The coupling structure to be used by the MDA.
If ``None``, it is created from `disciplines`.


By default it is set to None.


.. raw:: html

    </li>

    <li>

**grammar_type** : *MDODiscipline.GrammarType, optional*

The type of the input and output grammars.


By default it is set to JSONGrammar.


.. raw:: html

    </li>

    <li>

**linear_solver** : *str, optional*

The name of the linear solver.


By default it is set to DEFAULT.


.. raw:: html

    </li>

    <li>

**linear_solver_options** : *Mapping[str, Any] | None, optional*

The options passed to the linear solver factory.


By default it is set to None.


.. raw:: html

    </li>

    <li>

**linear_solver_tolerance** : *float, optional*

The tolerance of the linear solver
in the adjoint equation.


By default it is set to 1e-12.


.. raw:: html

    </li>

    <li>

**log_convergence** : *bool, optional*

Whether to log the MDA convergence,
expressed in terms of normed residuals.


By default it is set to False.


.. raw:: html

    </li>

    <li>

**max_mda_iter** : *int, optional*

The maximum iterations number for the MDA algorithm.


By default it is set to 10.


.. raw:: html

    </li>

    <li>

**max_mda_iter_gs** : *int, optional*

The maximum number of iterations of the Gauss-Seidel MDA.


By default it is set to 3.


.. raw:: html

    </li>

    <li>

**name** : *str | None, optional*

The name to be given to the MDA.
If ``None``, use the name of the class.


By default it is set to None.


.. raw:: html

    </li>

    <li>

**relax_factor** : *float, optional*

The relaxation factor.


By default it is set to 0.99.


.. raw:: html

    </li>

    <li>

**tolerance** : *float, optional*

The tolerance of the iterative direct coupling solver;
the norm of the current residuals divided by initial residuals norm
shall be lower than the tolerance to stop iterating.


By default it is set to 1e-06.


.. raw:: html

    </li>

    <li>

**use_lu_fact** : *bool, optional*

Whether to store a LU factorization of the matrix
when using adjoint/forward differentiation.
to solve faster multiple RHS problem.


By default it is set to False.


.. raw:: html

    </li>

    <li>

**warm_start** : *bool, optional*

Whether the second iteration and ongoing start
from the previous coupling solution.


By default it is set to False.


.. raw:: html

    </li>

    <li>

****newton_mda_options** : *float | str | None*

The options for the Newton MDA.



.. raw:: html

    </li>

    </ul>
    </dd>
    </dl>



.. _MDAGaussSeidel_options:

MDAGaussSeidel
--------------



Module: :class:`gemseo.mda.gauss_seidel`





.. raw:: html

    <link rel="stylesheet" href="../_static/css/theme.css" type="text/css" />
    <link rel="stylesheet" href="../_static/css/gemseo.css" type="text/css" />






































































































    <dl class="field-list simple">
    <dt class="field-odd">Required parameters</dt>
    <dd class="field-odd"><ul class="simple">

    <li>

**disciplines** : *Sequence[MDODiscipline]*

The disciplines from which to compute the MDA.

.. raw:: html

    </li>

    </ul>
    </dd>
    </dl>



    <dl class="field-list simple">
    <dt class="field-odd">Optional parameters</dt>
    <dd class="field-odd"><ul class="simple">


    <li>

**acceleration_method** : *AccelerationMethod, optional*

The acceleration method to be used to improve the
convergence rate of the fixed point iteration method.


By default it is set to NoTransformation.


.. raw:: html

    </li>

    <li>

**coupling_structure** : *MDOCouplingStructure | None, optional*

The coupling structure to be used by the MDA.
If ``None``, it is created from `disciplines`.


By default it is set to None.


.. raw:: html

    </li>

    <li>

**grammar_type** : *MDODiscipline.GrammarType, optional*

The type of the input and output grammars.


By default it is set to JSONGrammar.


.. raw:: html

    </li>

    <li>

**linear_solver** : *str, optional*

The name of the linear solver.


By default it is set to DEFAULT.


.. raw:: html

    </li>

    <li>

**linear_solver_options** : *Mapping[str, Any] | None, optional*

The options passed to the linear solver factory.


By default it is set to None.


.. raw:: html

    </li>

    <li>

**linear_solver_tolerance** : *float, optional*

The tolerance of the linear solver
in the adjoint equation.


By default it is set to 1e-12.


.. raw:: html

    </li>

    <li>

**log_convergence** : *bool, optional*

Whether to log the MDA convergence,
expressed in terms of normed residuals.


By default it is set to False.


.. raw:: html

    </li>

    <li>

**max_mda_iter** : *int, optional*

The maximum iterations number for the MDA algorithm.


By default it is set to 10.


.. raw:: html

    </li>

    <li>

**name** : *str | None, optional*

The name to be given to the MDA.
If ``None``, use the name of the class.


By default it is set to None.


.. raw:: html

    </li>

    <li>

**over_relax_factor** : *float | None, optional*

Deprecated, please consider using
:attr:`MDA.over_relaxation_factor` instead.
The relaxation coefficient, used to make the method more robust, if
``0<over_relax_factor<1`` or faster if ``1<over_relax_factor<=2``. If
``over_relax_factor =1.``, it is deactivated.


By default it is set to None.


.. raw:: html

    </li>

    <li>

**over_relaxation_factor** : *float, optional*

The over-relaxation factor.


By default it is set to 1.0.


.. raw:: html

    </li>

    <li>

**tolerance** : *float, optional*

The tolerance of the iterative direct coupling solver;
the norm of the current residuals divided by initial residuals norm
shall be lower than the tolerance to stop iterating.


By default it is set to 1e-06.


.. raw:: html

    </li>

    <li>

**use_lu_fact** : *bool, optional*

Whether to store a LU factorization of the matrix
when using adjoint/forward differentiation.
to solve faster multiple RHS problem.


By default it is set to False.


.. raw:: html

    </li>

    <li>

**warm_start** : *bool, optional*

Whether the second iteration and ongoing start
from the previous coupling solution.


By default it is set to False.


.. raw:: html

    </li>

    </ul>
    </dd>
    </dl>



.. _MDAJacobi_options:

MDAJacobi
---------



Module: :class:`gemseo.mda.jacobi`





.. raw:: html

    <link rel="stylesheet" href="../_static/css/theme.css" type="text/css" />
    <link rel="stylesheet" href="../_static/css/gemseo.css" type="text/css" />


















































































































    <dl class="field-list simple">
    <dt class="field-odd">Required parameters</dt>
    <dd class="field-odd"><ul class="simple">

    <li>

**acceleration** : *str*

Deprecated, please consider using the
:attr:`MDA.acceleration_method` instead.
The type of acceleration to be used to extrapolate the residuals and
save CPU time by reusing the information from the last iterations,
either ``None``, ``"m2d"``, or ``"secant"``, ``"m2d"`` is faster but
uses the 2 last iterations.

.. raw:: html

    </li>

    <li>

**disciplines** : *Sequence[MDODiscipline]*

The disciplines from which to compute the MDA.

.. raw:: html

    </li>

    </ul>
    </dd>
    </dl>



    <dl class="field-list simple">
    <dt class="field-odd">Optional parameters</dt>
    <dd class="field-odd"><ul class="simple">


    <li>

**acceleration_method** : *AccelerationMethod, optional*

The acceleration method to be used to improve the
convergence rate of the fixed point iteration method.


By default it is set to Alternate2Delta.


.. raw:: html

    </li>

    <li>

**coupling_structure** : *MDOCouplingStructure | None, optional*

The coupling structure to be used by the MDA.
If ``None``, it is created from `disciplines`.


By default it is set to None.


.. raw:: html

    </li>

    <li>

**grammar_type** : *MDODiscipline.GrammarType, optional*

The type of the input and output grammars.


By default it is set to JSONGrammar.


.. raw:: html

    </li>

    <li>

**linear_solver** : *str, optional*

The name of the linear solver.


By default it is set to DEFAULT.


.. raw:: html

    </li>

    <li>

**linear_solver_options** : *Mapping[str, Any] | None, optional*

The options passed to the linear solver factory.


By default it is set to None.


.. raw:: html

    </li>

    <li>

**linear_solver_tolerance** : *float, optional*

The tolerance of the linear solver
in the adjoint equation.


By default it is set to 1e-12.


.. raw:: html

    </li>

    <li>

**log_convergence** : *bool, optional*

Whether to log the MDA convergence,
expressed in terms of normed residuals.


By default it is set to False.


.. raw:: html

    </li>

    <li>

**max_mda_iter** : *int, optional*

The maximum iterations number for the MDA algorithm.


By default it is set to 10.


.. raw:: html

    </li>

    <li>

**n_processes** : *int, optional*

The maximum simultaneous number of threads if ``use_threading``
is set to True, otherwise processes, used to parallelize the execution.


By default it is set to 2.


.. raw:: html

    </li>

    <li>

**name** : *str | None, optional*

The name to be given to the MDA.
If ``None``, use the name of the class.


By default it is set to None.


.. raw:: html

    </li>

    <li>

**over_relaxation_factor** : *float, optional*

The over-relaxation factor.


By default it is set to 1.0.


.. raw:: html

    </li>

    <li>

**tolerance** : *float, optional*

The tolerance of the iterative direct coupling solver;
the norm of the current residuals divided by initial residuals norm
shall be lower than the tolerance to stop iterating.


By default it is set to 1e-06.


.. raw:: html

    </li>

    <li>

**use_lu_fact** : *bool, optional*

Whether to store a LU factorization of the matrix
when using adjoint/forward differentiation.
to solve faster multiple RHS problem.


By default it is set to False.


.. raw:: html

    </li>

    <li>

**use_threading** : *bool, optional*

Whether to use threads instead of processes to parallelize
the execution. Processes will copy (serialize) all the disciplines,
while threads will share all the memory. If one wants to execute the
same discipline multiple times then multiprocessing should be prefered.


By default it is set to True.


.. raw:: html

    </li>

    <li>

**warm_start** : *bool, optional*

Whether the second iteration and ongoing start
from the previous coupling solution.


By default it is set to False.


.. raw:: html

    </li>

    </ul>
    </dd>
    </dl>



.. _MDANewtonRaphson_options:

MDANewtonRaphson
----------------



Module: :class:`gemseo.mda.newton_raphson`





.. raw:: html

    <link rel="stylesheet" href="../_static/css/theme.css" type="text/css" />
    <link rel="stylesheet" href="../_static/css/gemseo.css" type="text/css" />




































































































































    <dl class="field-list simple">
    <dt class="field-odd">Required parameters</dt>
    <dd class="field-odd"><ul class="simple">

    <li>

**disciplines** : *Sequence[MDODiscipline]*

The disciplines from which to compute the MDA.

.. raw:: html

    </li>

    </ul>
    </dd>
    </dl>



    <dl class="field-list simple">
    <dt class="field-odd">Optional parameters</dt>
    <dd class="field-odd"><ul class="simple">


    <li>

**acceleration_method** : *AccelerationMethod, optional*

The acceleration method to be used to improve the
convergence rate of the fixed point iteration method.


By default it is set to NoTransformation.


.. raw:: html

    </li>

    <li>

**coupling_structure** : *MDOCouplingStructure | None, optional*

The coupling structure to be used by the MDA.
If ``None``, it is created from `disciplines`.


By default it is set to None.


.. raw:: html

    </li>

    <li>

**grammar_type** : *MDODiscipline.GrammarType, optional*

The type of the input and output grammars.


By default it is set to JSONGrammar.


.. raw:: html

    </li>

    <li>

**linear_solver** : *str, optional*

The name of the linear solver.


By default it is set to DEFAULT.


.. raw:: html

    </li>

    <li>

**linear_solver_options** : *Mapping[str, Any] | None, optional*

The options passed to the linear solver factory.


By default it is set to None.


.. raw:: html

    </li>

    <li>

**linear_solver_tolerance** : *float, optional*

The tolerance of the linear solver
in the adjoint equation.


By default it is set to 1e-12.


.. raw:: html

    </li>

    <li>

**log_convergence** : *bool, optional*

Whether to log the MDA convergence,
expressed in terms of normed residuals.


By default it is set to False.


.. raw:: html

    </li>

    <li>

**max_mda_iter** : *int, optional*

The maximum iterations number for the MDA algorithm.


By default it is set to 10.


.. raw:: html

    </li>

    <li>

**n_processes** : *int, optional*

The maximum simultaneous number of threads if ``use_threading``
is set to True, otherwise processes, used to parallelize the execution.


By default it is set to 2.


.. raw:: html

    </li>

    <li>

**name** : *str | None, optional*

The name to be given to the MDA.
If ``None``, use the name of the class.


By default it is set to None.


.. raw:: html

    </li>

    <li>

**newton_linear_solver_name** : *str, optional*

The name of the linear solver for the Newton
method.


By default it is set to DEFAULT.


.. raw:: html

    </li>

    <li>

**newton_linear_solver_options** : *Mapping[str, Any] | None, optional*

The options for the Newton linear solver.


By default it is set to None.


.. raw:: html

    </li>

    <li>

**over_relaxation_factor** : *float, optional*

The over-relaxation factor.


By default it is set to 0.99.


.. raw:: html

    </li>

    <li>

**parallel** : *bool, optional*

Whether to execute and linearize the disciplines in parallel.


By default it is set to False.


.. raw:: html

    </li>

    <li>

**relax_factor** : *float | None, optional*

The relaxation factor.


By default it is set to None.


.. raw:: html

    </li>

    <li>

**tolerance** : *float, optional*

The tolerance of the iterative direct coupling solver;
the norm of the current residuals divided by initial residuals norm
shall be lower than the tolerance to stop iterating.


By default it is set to 1e-06.


.. raw:: html

    </li>

    <li>

**use_lu_fact** : *bool, optional*

Whether to store a LU factorization of the matrix
when using adjoint/forward differentiation.
to solve faster multiple RHS problem.


By default it is set to False.


.. raw:: html

    </li>

    <li>

**use_threading** : *bool, optional*

Whether to use threads instead of processes to parallelize
the execution. Processes will copy (serialize) all the disciplines,
while threads will share all the memory. If one wants to execute the
same discipline multiple times then multiprocessing should be preferred.


By default it is set to True.


.. raw:: html

    </li>

    <li>

**warm_start** : *bool, optional*

Whether the second iteration and ongoing start
from the previous coupling solution.


By default it is set to False.


.. raw:: html

    </li>

    </ul>
    </dd>
    </dl>



.. _MDAQuasiNewton_options:

MDAQuasiNewton
--------------



Module: :class:`gemseo.mda.quasi_newton`





.. raw:: html

    <link rel="stylesheet" href="../_static/css/theme.css" type="text/css" />
    <link rel="stylesheet" href="../_static/css/gemseo.css" type="text/css" />


























































































    <dl class="field-list simple">
    <dt class="field-odd">Required parameters</dt>
    <dd class="field-odd"><ul class="simple">

    <li>

**disciplines** : *Sequence[MDODiscipline]*

The disciplines from which to compute the MDA.

.. raw:: html

    </li>

    </ul>
    </dd>
    </dl>



    <dl class="field-list simple">
    <dt class="field-odd">Optional parameters</dt>
    <dd class="field-odd"><ul class="simple">


    <li>

**coupling_structure** : *MDOCouplingStructure | None, optional*

The coupling structure to be used by the MDA.
If ``None``, it is created from `disciplines`.


By default it is set to None.


.. raw:: html

    </li>

    <li>

**grammar_type** : *MDODiscipline.GrammarType, optional*

The type of the input and output grammars.


By default it is set to JSONGrammar.


.. raw:: html

    </li>

    <li>

**linear_solver** : *str, optional*

The name of the linear solver.


By default it is set to DEFAULT.


.. raw:: html

    </li>

    <li>

**linear_solver_options** : *Mapping[str, Any] | None, optional*

The options passed to the linear solver factory.


By default it is set to None.


.. raw:: html

    </li>

    <li>

**linear_solver_tolerance** : *float, optional*

The tolerance of the linear solver
in the adjoint equation.


By default it is set to 1e-12.


.. raw:: html

    </li>

    <li>

**max_mda_iter** : *int, optional*

The maximum iterations number for the MDA algorithm.


By default it is set to 10.


.. raw:: html

    </li>

    <li>

**method** : *str, optional*

The name of the method in scipy root finding, among
:attr:`.QUASI_NEWTON_METHODS`.


By default it is set to hybr.


.. raw:: html

    </li>

    <li>

**name** : *str | None, optional*

The name to be given to the MDA.
If ``None``, use the name of the class.


By default it is set to None.


.. raw:: html

    </li>

    <li>

**tolerance** : *float, optional*

The tolerance of the iterative direct coupling solver;
the norm of the current residuals divided by initial residuals norm
shall be lower than the tolerance to stop iterating.


By default it is set to 1e-06.


.. raw:: html

    </li>

    <li>

**use_gradient** : *bool, optional*

Whether to use the analytic gradient of the discipline.


By default it is set to False.


.. raw:: html

    </li>

    <li>

**use_lu_fact** : *bool, optional*

Whether to store a LU factorization of the matrix
when using adjoint/forward differentiation.
to solve faster multiple RHS problem.


By default it is set to False.


.. raw:: html

    </li>

    <li>

**warm_start** : *bool, optional*

Whether the second iteration and ongoing start
from the previous coupling solution.


By default it is set to False.


.. raw:: html

    </li>

    </ul>
    </dd>
    </dl>



.. _MDASequential_options:

MDASequential
-------------



Module: :class:`gemseo.mda.sequential_mda`





.. raw:: html

    <link rel="stylesheet" href="../_static/css/theme.css" type="text/css" />
    <link rel="stylesheet" href="../_static/css/gemseo.css" type="text/css" />




















































































    <dl class="field-list simple">
    <dt class="field-odd">Required parameters</dt>
    <dd class="field-odd"><ul class="simple">

    <li>

**disciplines** : *Sequence[MDODiscipline]*

The disciplines from which to compute the MDA.

.. raw:: html

    </li>

    <li>

**mda_sequence** : *Sequence[BaseMDA]*

The sequence of MDAs.

.. raw:: html

    </li>

    </ul>
    </dd>
    </dl>



    <dl class="field-list simple">
    <dt class="field-odd">Optional parameters</dt>
    <dd class="field-odd"><ul class="simple">


    <li>

**coupling_structure** : *MDOCouplingStructure | None, optional*

The coupling structure to be used by the MDA.
If ``None``, it is created from `disciplines`.


By default it is set to None.


.. raw:: html

    </li>

    <li>

**grammar_type** : *MDODiscipline.GrammarType, optional*

The type of the input and output grammars.


By default it is set to JSONGrammar.


.. raw:: html

    </li>

    <li>

**linear_solver** : *str, optional*

The name of the linear solver.


By default it is set to DEFAULT.


.. raw:: html

    </li>

    <li>

**linear_solver_options** : *Mapping[str, Any] | None, optional*

The options passed to the linear solver factory.


By default it is set to None.


.. raw:: html

    </li>

    <li>

**linear_solver_tolerance** : *float, optional*

The tolerance of the linear solver
in the adjoint equation.


By default it is set to 1e-12.


.. raw:: html

    </li>

    <li>

**max_mda_iter** : *int, optional*

The maximum iterations number for the MDA algorithm.


By default it is set to 10.


.. raw:: html

    </li>

    <li>

**name** : *str | None, optional*

The name to be given to the MDA.
If ``None``, use the name of the class.


By default it is set to None.


.. raw:: html

    </li>

    <li>

**tolerance** : *float, optional*

The tolerance of the iterative direct coupling solver;
the norm of the current residuals divided by initial residuals norm
shall be lower than the tolerance to stop iterating.


By default it is set to 1e-06.


.. raw:: html

    </li>

    <li>

**use_lu_fact** : *bool, optional*

Whether to store a LU factorization of the matrix
when using adjoint/forward differentiation.
to solve faster multiple RHS problem.


By default it is set to False.


.. raw:: html

    </li>

    <li>

**warm_start** : *bool, optional*

Whether the second iteration and ongoing start
from the previous coupling solution.


By default it is set to False.


.. raw:: html

    </li>

    </ul>
    </dd>
    </dl>