enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Co-simulation - Wikipedia

    en.wikipedia.org/wiki/Co-simulation

    The Gauss-Seidel, the Jacobi variants and transmission line modelling, TLM. The names of the first two methods are derived from the structural similarities to the numerical methods by the same name. The reason is that the Jacobi method is easy to convert into an equivalent parallel algorithm while there are difficulties to do so for the Gauss ...

  3. Power-flow study - Wikipedia

    en.wikipedia.org/wiki/Power-flow_study

    In power engineering, the power-flow study, or load-flow study, is a numerical analysis of the flow of electric power in an interconnected system. A power-flow study usually uses simplified notations such as a one-line diagram and per-unit system, and focuses on various aspects of AC power parameters, such as Voltage, voltage angles, real power and reactive power.

  4. Gauss–Seidel method - Wikipedia

    en.wikipedia.org/wiki/GaussSeidel_method

    algorithm GaussSeidel method is inputs: A, b output: φ Choose an initial guess φ to the solution repeat until convergence for i from 1 until n do σ ← 0 for j from 1 until n do if j ≠ i then σ ← σ + a ij φ j end if end (j-loop) φ i ← (b i − σ) / a ii end (i-loop) check if convergence is reached end (repeat)

  5. Relaxation (iterative method) - Wikipedia

    en.wikipedia.org/wiki/Relaxation_(iterative_method)

    In linear systems, the two main classes of relaxation methods are stationary iterative methods, and the more general Krylov subspace methods. The Jacobi method is a simple relaxation method. The GaussSeidel method is an improvement upon the Jacobi method.

  6. Successive over-relaxation - Wikipedia

    en.wikipedia.org/wiki/Successive_over-relaxation

    In numerical linear algebra, the method of successive over-relaxation (SOR) is a variant of the GaussSeidel method for solving a linear system of equations, resulting in faster convergence. A similar method can be used for any slowly converging iterative process.

  7. Constraint (computational chemistry) - Wikipedia

    en.wikipedia.org/wiki/Constraint_(computational...

    Although they differ in how they compute or apply the constraints themselves, the constraints are still modelled using Lagrange multipliers which are computed using the GaussSeidel method. The original SHAKE algorithm is capable of constraining both rigid and flexible molecules (eg. water, benzene and biphenyl ) and introduces negligible ...

  8. Slack bus - Wikipedia

    en.wikipedia.org/wiki/Slack_bus

    The slack bus is crucial to a load flow problem since it will account for transmission line losses. In a load flow problem, conservation of energy results in the total generation equaling to the sum of the loads. However, there still would be a discrepancy in these quantities due to line losses, which are dependent on line current.

  9. Holomorphic Embedding Load-flow method - Wikipedia

    en.wikipedia.org/wiki/Holomorphic_embedding_Load...

    The Holomorphic Embedding Load-flow Method (HELM) [note 1] is a solution method for the power-flow equations of electrical power systems. Its main features are that it is direct (that is, non-iterative) and that it mathematically guarantees a consistent selection of the correct operative branch of the multivalued problem, also signalling the condition of voltage collapse when there is no solution.