Unified formulation of a family of iterative solvers for power systems analysis

This paper illustrates the construction of a new class of iterative solvers for power flow calculations based on the method of Alternating Search Directions. This method is fit to the particular algebraic structure of the power flow problem resulting from the combination of a globally linear set of equations and nonlinear local relations imposed by power conversion devices, such as loads and generators. The choice of the search directions is shown to be crucial for improving the overall robustness of the solver. A noteworthy advantage is that constant search directions yield stationary methods that, in contrast with Newton or Quasi-Newton methods, do not require the evaluation of the Jacobian matrix. Such directions can be elected to enforce the convergence to the high voltage operative solution. The method is explained through an intuitive example illustrating how the proposed generalized formulation is able to include other nonlinear solvers that are classically used for power flow analysis, thus offering a unified view on the topic. Numerical experiments are performed on publicly available benchmarks for large distribution and transmission systems.Peer ReviewedPostprint (author's final draft

Steady and Stable: Numerical Investigations of Nonlinear Partial Differential Equations

Excerpt: Mathematics is a language which can describe patterns in everyday life as well as abstract concepts existing only in our minds. Patterns exist in data, functions, and sets constructed around a common theme, but the most tangible patterns are visual. Visual demonstrations can help undergraduate students connect to abstract concepts in advanced mathematical courses. The study of partial differential equations, in particular, benefits from numerical analysis and simulation

Efficient Numerical Solution of Large Scale Algebraic Matrix Equations in PDE Control and Model Order Reduction

Matrix Lyapunov and Riccati equations are an important tool in mathematical systems theory. They are the key ingredients in balancing based model order reduction techniques and linear quadratic regulator problems. For small and moderately sized problems these equations are solved by techniques with at least cubic complexity which prohibits their usage in large scale applications. Around the year 2000 solvers for large scale problems have been introduced. The basic idea there is to compute a low rank decomposition of the quadratic and dense solution matrix and in turn reduce the memory and computational complexity of the algorithms. In this thesis efficiency enhancing techniques for the low rank alternating directions implicit iteration based solution of large scale matrix equations are introduced and discussed. Also the applicability in the context of real world systems is demonstrated. The thesis is structured in seven central chapters. After the introduction chapter 2 introduces the basic concepts and notations needed as fundamental tools for the remainder of the thesis. The next chapter then introduces a collection of test examples spanning from easily scalable academic test systems to badly conditioned technical applications which are used to demonstrate the features of the solvers. Chapter four and five describe the basic solvers and the modifications taken to make them applicable to an even larger class of problems. The following two chapters treat the application of the solvers in the context of model order reduction and linear quadratic optimal control of PDEs. The final chapter then presents the extensive numerical testing undertaken with the solvers proposed in the prior chapters. Some conclusions and an appendix complete the thesis

A low-rank solution method for Riccati equations with indefinite quadratic terms

Algebraic Riccati equations with indefinite quadratic terms play an important role in applications related to robust controller design. While there are many established approaches to solve these in case of small-scale dense coefficients, there is no approach available to compute solutions in the large-scale sparse setting. In this paper, we develop an iterative method to compute low-rank approximations of stabilizing solutions of large-scale sparse continuous-time algebraic Riccati equations with indefinite quadratic terms. We test the developed approach for dense examples in comparison to other established matrix equation solvers, and investigate the applicability and performance in large-scale sparse examples.Comment: 19 pages, 2 figures, 5 table

A hysteretic multiscale formulation for nonlinear dynamic analysis of composite materials

This article has been made available through the Brunel Open Access Publishing Fund.A new multiscale finite element formulation is presented for nonlinear dynamic analysis of heterogeneous structures. The proposed multiscale approach utilizes the hysteretic finite element method to model the microstructure. Using the proposed computational scheme, the micro-basis functions, that are used to map the microdisplacement components to the coarse mesh, are only evaluated once and remain constant throughout the analysis procedure. This is accomplished by treating inelasticity at the micro-elemental level through properly defined hysteretic evolution equations. Two types of imposed boundary conditions are considered for the derivation of the multiscale basis functions, namely the linear and periodic boundary conditions. The validity of the proposed formulation as well as its computational efficiency are verified through illustrative numerical experiments

A Structure-Preserving Divide-and-Conquer Method for Pseudosymmetric Matrices

We devise a spectral divide-and-conquer scheme for matrices that are self-adjoint with respect to a given indefinite scalar product (i.e. pseudosymmetic matrices). The pseudosymmetric structure of the matrix is preserved in the spectral division, such that the method can be applied recursively to achieve full diagonalization. The method is well-suited for structured matrices that come up in computational quantum physics and chemistry. In this application context, additional definiteness properties guarantee a convergence of the matrix sign function iteration within two steps when Zolotarev functions are used. The steps are easily parallelizable. Furthermore, it is shown that the matrix decouples into symmetric definite eigenvalue problems after just one step of spectral division

Efficient Algorithms for Solving Structured Eigenvalue Problems Arising in the Description of Electronic Excitations

Matrices arising in linear-response time-dependent density functional theory and many-body perturbation theory, in particular in the Bethe-Salpeter approach, show a 2 × 2 block structure. The motivation to devise new algorithms, instead of using general purpose eigenvalue solvers, comes from the need to solve large problems on high performance computers. This requires parallelizable and communication-avoiding algorithms and implementations. We point out various novel directions for diagonalizing structured matrices. These include the solution of skew-symmetric eigenvalue problems in ELPA, as well as structure preserving spectral divide-and-conquer schemes employing generalized polar decompostions

On a modified non-singular log-conformation formulation for Johnson-Segalman viscoelastic fluids

International audienceA modified log-conformation formulation of viscoelastic fluid flows is presented in this paper. This new formulation is non-singular for vanishing Weissenberg numbers and allows a direct steady numerical resolution by a Newton method. Moreover, an exact computation of all the terms of the linearized problem is provided. The use of an exact divergence-free finite element method for velocity-pressure approximation and a discontinuous Galerkin upwinding treatment for stresses leads to a robust discretization. A demonstration is provided by the computation of steady solutions at high Weissenberg numbers for the difficult benchmark case of the lid driven cavity flow. Numerical results are in good agreement, qualitatively with experiment measurements on real viscoelastic flows, and quantitatively with computations performed by others authors. The numerical algorithm is both robust and very efficient, as it requires a low mesh-invariant number of linear systems resolution to obtain solutions at high Weissenberg number. An adaptive mesh procedure is also presented: it alows representing accurately both boundary layers and the main and secondary vorties