939 resultados para Algebraic Equations
Resumo:
In this paper we introduce a new algorithm, based on the successful work of Fathi and Alexandrov, on hybrid Monte Carlo algorithms for matrix inversion and solving systems of linear algebraic equations. This algorithm consists of two parts, approximate inversion by Monte Carlo and iterative refinement using a deterministic method. Here we present a parallel hybrid Monte Carlo algorithm, which uses Monte Carlo to generate an approximate inverse and that improves the accuracy of the inverse with an iterative refinement. The new algorithm is applied efficiently to sparse non-singular matrices. When we are solving a system of linear algebraic equations, Bx = b, the inverse matrix is used to compute the solution vector x = B(-1)b. We present results that show the efficiency of the parallel hybrid Monte Carlo algorithm in the case of sparse matrices.
Resumo:
In this paper we consider bilinear forms of matrix polynomials and show that these polynomials can be used to construct solutions for the problems of solving systems of linear algebraic equations, matrix inversion and finding extremal eigenvalues. An almost Optimal Monte Carlo (MAO) algorithm for computing bilinear forms of matrix polynomials is presented. Results for the computational costs of a balanced algorithm for computing the bilinear form of a matrix power is presented, i.e., an algorithm for which probability and systematic errors are of the same order, and this is compared with the computational cost for a corresponding deterministic method.
Resumo:
This paper describes a method for dynamic data reconciliation of nonlinear systems that are simulated using the sequential modular approach, and where individual modules are represented by a class of differential algebraic equations. The estimation technique consists of a bank of extended Kalman filters that are integrated with the modules. The paper reports a study based on experimental data obtained from a pilot scale mixing process.
Resumo:
[English] This paper is a tutorial introduction to pseudospectral optimal control. With pseudospectral methods, a function is approximated as a linear combination of smooth basis functions, which are often chosen to be Legendre or Chebyshev polynomials. Collocation of the differential-algebraic equations is performed at orthogonal collocation points, which are selected to yield interpolation of high accuracy. Pseudospectral methods directly discretize the original optimal control problem to recast it into a nonlinear programming format. A numerical optimizer is then employed to find approximate local optimal solutions. The paper also briefly describes the functionality and implementation of PSOPT, an open source software package written in C++ that employs pseudospectral discretization methods to solve multi-phase optimal control problems. The software implements the Legendre and Chebyshev pseudospectral methods, and it has useful features such as automatic differentiation, sparsity detection, and automatic scaling. The use of pseudospectral methods is illustrated in two problems taken from the literature on computational optimal control. [Portuguese] Este artigo e um tutorial introdutorio sobre controle otimo pseudo-espectral. Em metodos pseudo-espectrais, uma funcao e aproximada como uma combinacao linear de funcoes de base suaves, tipicamente escolhidas como polinomios de Legendre ou Chebyshev. A colocacao de equacoes algebrico-diferenciais e realizada em pontos de colocacao ortogonal, que sao selecionados de modo a minimizar o erro de interpolacao. Metodos pseudoespectrais discretizam o problema de controle otimo original de modo a converte-lo em um problema de programa cao nao-linear. Um otimizador numerico e entao empregado para obter solucoes localmente otimas. Este artigo tambem descreve sucintamente a funcionalidade e a implementacao de um pacote computacional de codigo aberto escrito em C++ chamado PSOPT. Tal pacote emprega metodos de discretizacao pseudo-spectrais para resolver problemas de controle otimo com multiplas fase. O PSOPT permite a utilizacao de metodos de Legendre ou Chebyshev, e possui caractersticas uteis tais como diferenciacao automatica, deteccao de esparsidade e escalonamento automatico. O uso de metodos pseudo-espectrais e ilustrado em dois problemas retirados da literatura de controle otimo computacional.
Resumo:
Conditions are given under which a descriptor, or generalized state-space system can be regularized by output feedback. It is shown that under these conditions, proportional and derivative output feedback controls can be constructed such that the closed-loop system is regular and has index at most one. This property ensures the solvability of the resulting system of dynamic-algebraic equations. A reduced form is given that allows the system properties as well as the feedback to be determined. The construction procedures used to establish the theory are based only on orthogonal matrix decompositions and can therefore be implemented in a numerically stable way.
Resumo:
For linear multivariable time-invariant continuous or discrete-time singular systems it is customary to use a proportional feedback control in order to achieve a desired closed loop behaviour. Derivative feedback is rarely considered. This paper examines how derivative feedback in descriptor systems can be used to alter the structure of the system pencil under various controllability conditions. It is shown that derivative and proportional feedback controls can be constructed such that the closed loop system has a given form and is also regular and has index at most 1. This property ensures the solvability of the resulting system of dynamic-algebraic equations. The construction procedures used to establish the theory are based only on orthogonal matrix decompositions and can therefore be implemented in a numerically stable way. The problem of pole placement with derivative feedback alone and in combination with proportional state feedback is also investigated. A computational algorithm for improving the “conditioning” of the regularized closed loop system is derived.
Resumo:
We study the regularization problem for linear, constant coefficient descriptor systems Ex' = Ax+Bu, y1 = Cx, y2 = Γx' by proportional and derivative mixed output feedback. Necessary and sufficient conditions are given, which guarantee that there exist output feedbacks such that the closed-loop system is regular, has index at most one and E+BGΓ has a desired rank, i.e., there is a desired number of differential and algebraic equations. To resolve the freedom in the choice of the feedback matrices we then discuss how to obtain the desired regularizing feedback of minimum norm and show that this approach leads to useful results in the sense of robustness only if the rank of E is decreased. Numerical procedures are derived to construct the desired feedback gains. These numerical procedures are based on orthogonal matrix transformations which can be implemented in a numerically stable way.
Resumo:
Implicit dynamic-algebraic equations, known in control theory as descriptor systems, arise naturally in many applications. Such systems may not be regular (often referred to as singular). In that case the equations may not have unique solutions for consistent initial conditions and arbitrary inputs and the system may not be controllable or observable. Many control systems can be regularized by proportional and/or derivative feedback.We present an overview of mathematical theory and numerical techniques for regularizing descriptor systems using feedback controls. The aim is to provide stable numerical techniques for analyzing and constructing regular control and state estimation systems and for ensuring that these systems are robust. State and output feedback designs for regularizing linear time-invariant systems are described, including methods for disturbance decoupling and mixed output problems. Extensions of these techniques to time-varying linear and nonlinear systems are discussed in the final section.
Resumo:
Motivated in part by the study of Fadell-Neuwirth short exact sequences, we determine the lower central and derived series for the braid groups of the finitely-punctured sphere. For n >= 1, the class of m-string braid groups B(m)(S(2)\{x(1), ... , x(n)}) of the n-punctured sphere includes the usual Artin braid groups B(m) (for n = 1), those of the annulus, which are Artin groups of type B (for n = 2), and affine Artin groups of type (C) over tilde (for n = 3). We first consider the case n = 1. Motivated by the study of almost periodic solutions of algebraic equations with almost periodic coefficients, Gorin and Lin calculated the commutator subgroup of the Artin braid groups. We extend their results, and show that the lower central series (respectively, derived series) of B(m) is completely determined for all m is an element of N (respectively, for all m not equal 4). In the exceptional case m = 4, we obtain some higher elements of the derived series and its quotients. When n >= 2, we prove that the lower central series (respectively, derived series) of B(m)(S(2)\{x(1), ... , x(n)}) is constant from the commutator subgroup onwards for all m >= 3 (respectively, m >= 5). The case m = 1 is that of the free group of rank n - 1. The case n = 2 is of particular interest notably when m = 2 also. In this case, the commutator subgroup is a free group of infinite rank. We then go on to show that B(2)(S(2)\{x(1), x(2)}) admits various interpretations, as the Baumslag-Solitar group BS(2, 2), or as a one-relator group with non-trivial centre for example. We conclude from this latter fact that B(2)(S(2)\{x(1), x(2)}) is residually nilpotent, and that from the commutator subgroup onwards, its lower central series coincides with that of the free product Z(2) * Z. Further, its lower central series quotients Gamma(i)/Gamma(i+1) are direct sums of copies of Z(2), the number of summands being determined explicitly. In the case m >= 3 and n = 2, we obtain a presentation of the derived subgroup, from which we deduce its Abelianization. Finally, in the case n = 3, we obtain partial results for the derived series, and we prove that the lower central series quotients Gamma(i)/Gamma(i+1) are 2-elementary finitely-generated groups.
Resumo:
Trabalho apresentado Numerical Solution of Differential and Differential-Algebraic Equations (NUMDIFF-14), Halle, 7-11 Sep 2015
Resumo:
This work aims at the implementation and adaptation of a computational model for the study of the Fischer-Tropsch reaction in a slurry bed reactor from synthesis gas (CO+H2) for the selective production of hydrocarbons (CnHm), with emphasis on evaluation of the influence of operating conditions on the distribution of products formed during the reaction.The present model takes into account effects of rigorous phase equilibrium in a reactive flash drum, a detailed kinetic model able of predicting the formation of each chemical species of the reaction system, as well as control loops of the process variables for pressure and level of slurry phase. As a result, a system of Differential Algebraic Equations was solved using the computational code DASSL (Petzold, 1982). The consistent initialization for the problem was based on phase equilibrium formed by the existing components in the reactor. In addition, the index of the system was reduced to 1 by the introduction of control laws that govern the output of the reactor products. The results were compared qualitatively with experimental data collected in the Fischer-Tropsch Synthesis plant installed at Laboratório de Processamento de Gás - CTGÁS-ER-Natal/RN
Resumo:
This work presents an approach for geometric solution of an optimal power flow (OPF) problem for a two bus system (a slack and a PV busses). Additionally, the geometric relationship between the losses minimization and the increase of the reactive margin and, therefore, the maximum loading point, is shown. The algebraic equations for the calculation of the Lagrange multipliers and for the minimum losses value are obtained. These equations are used to validate the results obtained using an OPF program. (C) 2002 Elsevier B.V. B.V. All rights reserved.
Resumo:
The interaction of different kinds of solitary waves of the Camassa-Holm equation is investigated. We consider soliton-soliton, soliton-cuspon and cuspon-cuspon interactions. The description of these solutions had previously been shown to be reducible to the solution of an algebraic equation. Here we give explicit examples, numerically solving these algebraic equations and plotting the corresponding solutions. Further, we show that the interaction is elastic and leads to a shift in the position of the solitons or cuspons. We give the analytical expressions for this shift and represent graphically the coupled soliton-cuspon, soliton-soliton and cuspon-cuspon interactions.
Resumo:
In this work, a numerical model to perform non-linear analysis of building floor structures is proposed. The presented model is derived from the Kirchhoff-s plate bending formulation of the boundary element method (BENI) for zoned domains, in which the plate stiffness is modified by the presence of membrane effects. In this model, no approximation of the generalized forces along the interface is required and the compatibility and equilibrium conditions along interfaces are imposed at the integral equation level. In order to reduce the number of degrees of freedom, the Navier Bernoulli hypothesis is assumed to simplify the strain field for the thin sub-regions (rectangular beams). The non-linear formulation is obtained from the linear formulation by incorporating initial internal force fields, which are approximated by using the well-known cell sub-division. Then, the non-linear solution of algebraic equations is obtained by using the concept of the consistent tangent operator. The Von Mises criterion is adopted to govern the elasto-plastic material behaviour checked at points along the plate thickness and along the rectangular beam element axes. The numerical representations are accurately obtained by either computing analytically the element integrals or performing the numerical integration accurately using an appropriate sub-elementation scheme. (C) 2007 Elsevier Ltd. All rights reserved.
Resumo:
The temperature and velocity distributions of the air inside the cabinet of domestic refrigerators affect the quality of food products. If the consumer knows the location of warm and cold zones in the refrigerator, the products can be placed in the right zone. In addition, the knowledge of the thickness of thermal and hydrodynamic boundary layers near the evaporator and the other walls is also important. If the product is too close to the evaporator wall, freezing can occur, and if it is too close to warm walls, the products can be deteriorated. The aim of the present work is to develop a steady state computational fluid dynamics (CFD) model for domestic refrigerators working on natural convection regime. The Finite Volume Methodology is chosen as numerical procedure for discretizing the governing equations. The SIMPLE-Semi-Implicit Method for Pressure-Linked Equations algorithm applied to a staggered mesh was used for solving the pressure-velocity coupling problem. The Power-Law scheme is employed as interpolation function for the convective-diffusive terms, and the TDMA-Tri-Diagonal Matrix Algorithm is used to solve the systems of algebraic equations. The model is applied to a commercial static refrigerator, where the cabinet is considered an empty three-dimensional rectangular cavity with one drawer at the bottom of the cabinet, but without shelves. In order to analyze the velocity and temperature fields of the air flow inside the cabinet the evaporator temperature, Te, was varied from -20 degrees C to 0 degrees C, and nine different evaporator positions are evaluated for evaporator temperature of -15 degrees C. The cooling capacity of the evaporator for the steady state regime is also computed for each case. One can conclude that the vertical positioning of the evaporator inside the cabinet plays an important role on the temperature distribution inside the cabinet.