|
Holomorphic Embedding Load Flow Method
The Holomorphic Embedding Load-flow Method (HELM)HELM is a trademark of Gridquant Inc. 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. These properties are relevant not only for the reliability of existing off-line and real-time applications, but also because they enable new types of analytical tools that would be impossible to build with existing iterative load-flow methods (due to their convergence problems). An example of this would be decision-support tools providing validated action plans in real time. The HELM load-flow algorithm was invented by Antonio Trias and has been granted two US Patents. A detailed description was presented at the 2012 IEEE PES General Meeting and subsequently ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
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 voltages, voltage angles, real power and reactive power. It analyzes the power systems in normal steady-state operation. Power-flow or load-flow studies are important for planning future expansion of power systems as well as in determining the best operation of existing systems. The principal information obtained from the power-flow study is the magnitude and phase angle of the voltage at each bus, and the real and reactive power flowing in each line. Commercial power systems are usually too complex to allow for hand solution of the power flow. Special-purpose network analyzers were built between 1929 and the early 1960s to provide laboratory-scale physical models of power ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Homotopy
In topology, a branch of mathematics, two continuous functions from one topological space to another are called homotopic (from grc, ὁμός "same, similar" and "place") if one can be "continuously deformed" into the other, such a deformation being called a homotopy (, ; , ) between the two functions. A notable use of homotopy is the definition of homotopy groups and cohomotopy groups, important invariants in algebraic topology. In practice, there are technical difficulties in using homotopies with certain spaces. Algebraic topologists work with compactly generated spaces, CW complexes, or spectra. Formal definition Formally, a homotopy between two continuous functions ''f'' and ''g'' from a topological space ''X'' to a topological space ''Y'' is defined to be a continuous function H: X \times ,1\to Y from the product of the space ''X'' with the unit interval , 1to ''Y'' such that H(x,0) = f(x) and H(x,1) = g(x) for all x \in X. If we think of the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Power System Simulation
Electrical power system simulation involves power system modeling and network simulation in order to analyze electrical power systems using design/offline or real-time data. Power system simulation software's are a class of computer simulation programs that focus on the operation of electrical power systems. These types of computer programs are used in a wide range of planning and operational situations for electric power systems. Applications of power system simulation include: long-term generation and transmission expansion planning, short-term operational simulations, and market analysis (e.g. price forecasting). These programs typically make use of mathematical optimization techniques such linear programming, quadratic programming, and mixed integer programming. Multiple elements of a power system can be modelled. A power-flow study calculates the loading on transmission lines and the power necessary to be generated at generating stations, given the required loads to be ser ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
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 voltages, voltage angles, real power and reactive power. It analyzes the power systems in normal steady-state operation. Power-flow or load-flow studies are important for planning future expansion of power systems as well as in determining the best operation of existing systems. The principal information obtained from the power-flow study is the magnitude and phase angle of the voltage at each bus, and the real and reactive power flowing in each line. Commercial power systems are usually too complex to allow for hand solution of the power flow. Special-purpose network analyzers were built between 1929 and the early 1960s to provide laboratory-scale physical models of power ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Transfinite Diameter And Logarithmic Capacity
Transfinite may refer to: * Transfinite number, a number larger than all finite numbers, yet not absolutely infinite * Transfinite induction, an extension of mathematical induction to well-ordered sets ** Transfinite recursion Transfinite induction is an extension of mathematical induction to well-ordered sets, for example to sets of ordinal numbers or cardinal numbers. Its correctness is a theorem of ZFC. Induction by cases Let P(\alpha) be a property defined for a ... * Transfinite arithmetic, the generalization of elementary arithmetic to infinite quantities * Transfinite interpolation, a method in numerical analysis to construct functions over a planar domain so that they match a given function on the boundary {{ disambiguation ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Branch Point
In the mathematical field of complex analysis, a branch point of a multi-valued function (usually referred to as a "multifunction" in the context of complex analysis) is a point such that if the function is n-valued (has n values) at that point, all of its neighborhoods contain a point that has more than n values. Multi-valued functions are rigorously studied using Riemann surfaces, and the formal definition of branch points employs this concept. Branch points fall into three broad categories: algebraic branch points, transcendental branch points, and logarithmic branch points. Algebraic branch points most commonly arise from functions in which there is an ambiguity in the extraction of a root, such as solving the equation ''w''2 = ''z'' for ''w'' as a function of ''z''. Here the branch point is the origin, because the analytic continuation of any solution around a closed loop containing the origin will result in a different function: there is non-trivial monodromy. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Global Analytic Function
In the mathematical field of complex analysis, a global analytic function is a generalization of the notion of an analytic function which allows for functions to have multiple branches. Global analytic functions arise naturally in considering the possible analytic continuations of an analytic function, since analytic continuations may have a non-trivial monodromy. They are one foundation for the theory of Riemann surfaces. Definition The following definition is in , but also found in Weyl or perhaps Weierstrass. An analytic function in an open set ''U'' is called a function element. Two function elements (''f''1, ''U''1) and (''f''2, ''U''2) are said to be analytic continuations of one another if ''U''1 ∩ ''U''2 ≠ ∅ and ''f''1 = ''f''2 on this intersection. A chain of analytic continuations is a finite sequence of function elements (''f''1, ''U''1), …, (''f''''n'',''U''''n'') such that each consecutive pair are analytic continuations of one ano ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
System Of Linear Equations
In mathematics, a system of linear equations (or linear system) is a collection of one or more linear equations involving the same variables. For example, :\begin 3x+2y-z=1\\ 2x-2y+4z=-2\\ -x+\fracy-z=0 \end is a system of three equations in the three variables . A solution to a linear system is an assignment of values to the variables such that all the equations are simultaneously satisfied. A solution to the system above is given by the ordered triple :(x,y,z)=(1,-2,-2), since it makes all three equations valid. The word "system" indicates that the equations are to be considered collectively, rather than individually. In mathematics, the theory of linear systems is the basis and a fundamental part of linear algebra, a subject which is used in most parts of modern mathematics. Computational algorithms for finding the solutions are an important part of numerical linear algebra, and play a prominent role in engineering, physics, chemistry, computer science, and economics. A sy ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Algebraic Curves
In mathematics, an affine algebraic plane curve is the zero set of a polynomial in two variables. A projective algebraic plane curve is the zero set in a projective plane of a homogeneous polynomial in three variables. An affine algebraic plane curve can be completed in a projective algebraic plane curve by homogenizing its defining polynomial. Conversely, a projective algebraic plane curve of homogeneous equation can be restricted to the affine algebraic plane curve of equation . These two operations are each inverse to the other; therefore, the phrase algebraic plane curve is often used without specifying explicitly whether it is the affine or the projective case that is considered. More generally, an algebraic curve is an algebraic variety of dimension one. Equivalently, an algebraic curve is an algebraic variety that is birationally equivalent to an algebraic plane curve. If the curve is contained in an affine space or a projective space, one can take a projection for su ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Gröbner Basis
In mathematics, and more specifically in computer algebra, computational algebraic geometry, and computational commutative algebra, a Gröbner basis is a particular kind of generating set of an ideal in a polynomial ring over a field . A Gröbner basis allows many important properties of the ideal and the associated algebraic variety to be deduced easily, such as the dimension and the number of zeros when it is finite. Gröbner basis computation is one of the main practical tools for solving systems of polynomial equations and computing the images of algebraic varieties under projections or rational maps. Gröbner basis computation can be seen as a multivariate, non-linear generalization of both Euclid's algorithm for computing polynomial greatest common divisors, and Gaussian elimination for linear systems. Gröbner bases were introduced in 1965, together with an algorithm to compute them ( Buchberger's algorithm), by Bruno Buchberger in his Ph.D. thesis. He named them after ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Resultants
In mathematics, the resultant of two polynomials is a polynomial expression of their coefficients, which is equal to zero if and only if the polynomials have a common root (possibly in a field extension), or, equivalently, a common factor (over their field of coefficients). In some older texts, the resultant is also called the eliminant. The resultant is widely used in number theory, either directly or through the discriminant, which is essentially the resultant of a polynomial and its derivative. The resultant of two polynomials with rational or polynomial coefficients may be computed efficiently on a computer. It is a basic tool of computer algebra, and is a built-in function of most computer algebra systems. It is used, among others, for cylindrical algebraic decomposition, integration of rational functions and drawing of curves defined by a bivariate polynomial equation. The resultant of ''n'' homogeneous polynomials in ''n'' variables (also called multivariate result ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Numerical Continuation
Numerical continuation is a method of computing approximate solutions of a system of parameterized nonlinear equations, :F(\mathbf u,\lambda) = 0. The ''parameter'' \lambda is usually a real scalar, and the ''solution'' \mathbf u an ''n''-vector. For a fixed ''parameter value'' \lambda, F(\ast,\lambda) maps Euclidean n-space into itself. Often the original mapping F is from a Banach space into itself, and the Euclidean n-space is a finite-dimensional Banach space. A steady state, or fixed point, of a parameterized family of flows or maps are of this form, and by discretizing trajectories of a flow or iterating a map, periodic orbits and heteroclinic orbits can also be posed as a solution of F=0. Other forms In some nonlinear systems, parameters are explicit. In others they are implicit, and the system of nonlinear equations is written :F(\mathbf u) = 0 where \mathbf u is an ''n''-vector, and its image F(\mathbf u) is an ''n-1'' vector. This formulation, without an e ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
