共查询到20条相似文献,搜索用时 15 毫秒
1.
Augusto Ferrante 《Linear and Multilinear Algebra》2013,61(11):1460-1474
This paper proposes a reduction technique for the generalized Riccati difference equation arising in optimal control and optimal filtering. This technique relies on a study on the generalized discrete algebraic Riccati equation. In particular, an analysis on the eigenstructure of the corresponding extended symplectic pencil enables to identify a subspace in which all the solutions of the generalized discrete algebraic Riccati equation are coincident. This subspace is the key to derive a decomposition technique for the generalized Riccati difference equation. This decomposition isolates a “nilpotent” part, which converges to a steady-state solution in a finite number of steps, from another part that can be computed by iterating a reduced-order generalized Riccati difference equation. 相似文献
2.
Freiling Gerhard; Ionescu Vlad 《IMA Journal of Mathematical Control and Information》2001,18(1):61-72
Using a Fréchet-derivative-based approach some monotonicity,convexity/concavity and comparison results concerning strictlyunmixed solutions of continuous- and discrete-time algebraicRiccati equations are obtained; it turns out that these solutionsare isolated and smooth functions of the input data. Similarly,it is proved that the solutions of initial value problems forboth Riccati differential and difference equations are smoothand monotonic functions of the input data and of the initial value. They are also convex or concave functions with respectto certain matrix coefficients. 相似文献
3.
In this paper, we present a convergence analysis of the inexact Newton method for solving Discrete-time algebraic Riccati equations (DAREs) for large and sparse systems. The inexact Newton method requires, at each iteration, the solution of a symmetric Stein matrix equation. These linear matrix equations are solved approximatively by the alternating directions implicit (ADI) or Smith?s methods. We give some new matrix identities that will allow us to derive new theoretical convergence results for the obtained inexact Newton sequences. We show that under some necessary conditions the approximate solutions satisfy some desired properties such as the d-stability. The theoretical results developed in this paper are an extension to the discrete case of the analysis performed by Feitzinger et al. (2009) [8] for the continuous-time algebraic Riccati equations. In the last section, we give some numerical experiments. 相似文献
4.
5.
For the nonsymmetric algebraic Riccati equation arising from transport theory, we concern about solving its minimal positive solution. In [1], Lu transferred the equation into a vector form and pointed out that the minimal positive solution of the matrix equation could be obtained via computing that of the vector equation. In this paper, we use the King-Werner method to solve the minimal positive solution of the vector equation and give the convergence and error analysis of the method. Numerical tests show that the King-Werner method is feasible to determine the minimal positive solution of the vector equation. 相似文献
6.
A noniterative algebraic solution for Riccati equations satisfying two-point boundary-value problems
A noniterative algebraic method is presented for solving differential Riccati equations which satisfy two-point boundary-value problems. This class of numerical problems arises in quadratic optimization problems where the cost functionals are composed of both continuous and discrete state penalties, leading to piecewise periodic feedback gains. The necessary condition defining the solution for the two-point boundary value problem is cast in the form of a discrete-time algebraic Riccati equation, by using a formal representation for the solution of the differential Riccati equation. A numerical example is presented which demonstrates the validity of the approach.The authors would like to thank Dr. Fernando Incertis, IBM Madrid Scientific Center, who reviewed this paper and pointed out that the two-point boundary-value necessary condition could be manipulated into the form of a discrete-time Riccati equation. His novel approach proved to be superior to the authors' previously proposed iterative continuation method. 相似文献
7.
Fast verified computation for solutions of algebraic Riccati equations arising in transport theory
下载免费PDF全文
![点击此处可从《Numerical Linear Algebra with Applications》网站下载免费的PDF全文](/ch/ext_images/free.gif)
A fast algorithm for enclosing the solution of the nonsymmetric algebraic Riccati equation arising in transport theory is proposed. The equation has a special structure, which is taken into account to reduce the complexity. By exploiting the structure, the enclosing process involves only quadratic complexity under a reasonable assumption. The algorithm moreover verifies the uniqueness and minimal positiveness of the enclosed solution. Numerical results show the efficiency of the algorithm. 相似文献
8.
It is as well known that nonsymmetric algebraic Riccati equations arising in transport theory can be translated to vector equations. In this paper, we propose six predictor–corrector‐type iterative schemes to solve the vector equations. And we give the convergence of these schemes. Unlike the previous work, we prove that all of them converge to the minimal positive solution of the vector equations by the initial vector (e,e), where e = (1,1, ? ,1)T. Moreover, we prove that all the sequences generated by the iterative schemes are strictly and monotonically increasing and bounded above. In addition, some numerical results are also reported in the paper, which confirm the good theoretical properties of our approach. Copyright © 2014 John Wiley & Sons, Ltd. 相似文献
9.
10.
Zhong‐Zhi Bai Xiao‐Xia Guo Shu‐Fang Xu 《Numerical Linear Algebra with Applications》2006,13(8):655-674
For the non‐symmetric algebraic Riccati equations, we establish a class of alternately linearized implicit (ALI) iteration methods for computing its minimal non‐negative solutions by technical combination of alternate splitting and successive approximating of the algebraic Riccati operators. These methods include one iteration parameter, and suitable choices of this parameter may result in fast convergent iteration methods. Under suitable conditions, we prove the monotone convergence and estimate the asymptotic convergence factor of the ALI iteration matrix sequences. Numerical experiments show that the ALI iteration methods are feasible and effective, and can outperform the Newton iteration method and the fixed‐point iteration methods. Besides, we further generalize the known fixed‐point iterations, obtaining an extensive class of relaxed splitting iteration methods for solving the non‐symmetric algebraic Riccati equations. Copyright © 2006 John Wiley & Sons, Ltd. 相似文献
11.
As is known, Alternating-Directional Doubling Algorithm (ADDA) is quadratically convergent for computing the minimal nonnegative solution of an irreducible singular M-matrix algebraic Riccati equation (MARE) in the noncritical case or a nonsingular MARE, but ADDA is only linearly convergent in the critical case. The drawback can be overcome by deflating techniques for an irreducible singular MARE so that the speed of quadratic convergence is still preserved in the critical case and accelerated in the noncritical case. In this paper, we proposed an improved deflating technique to accelerate further the convergence speed – the double deflating technique for an irreducible singular MARE in the critical case. We proved that ADDA is quadratically convergent instead of linearly when it is applied to the deflated algebraic Riccati equation (ARE) obtained by a double deflating technique. We also showed that the double deflating technique is better than the deflating technique from the perspective of dimension of the deflated ARE. Numerical experiments are provided to illustrate that our double deflating technique is effective. 相似文献
12.
We are interested in computing the nonnegative solution of a nonsymmetric algebraic Riccati equation arising in transport theory. The coefficient matrices of this equation have two parameters c and α. There have been some iterative methods presented by Lu in [13] and Bai et al. in [2] to solve the minimal positive solution for or . While the equation has a unique nonnegative solution when c=1 and α=0, all the methods presented by Lu and Bai cannot be used to find the nonnegative solution. To cope with this problem, a shifted technique is used in this paper to transform the original Riccati equation into a new one so that all the methods can be effectively employed to solve the nonnegative solution. Numerical experiments are given to illustrate the results. 相似文献
13.
The worst situation in computing the minimal nonnegative solution of a nonsymmetric algebraic Riccati equation associated with an M‐matrix occurs when the corresponding linearizing matrix has two very small eigenvalues, one with positive and one with negative real part. When both eigenvalues are exactly zero, the problem is called critical or null recurrent. Although in this case the problem is ill‐conditioned and the convergence of the algorithms based on matrix iterations is slow, there exist some techniques to remove the singularity and transform the problem to a well‐behaved one. Ill‐conditioning and slow convergence appear also in close‐to‐critical problems, but when none of the eigenvalues is exactly zero, the techniques used for the critical case cannot be applied. In this paper, we introduce a new method to accelerate the convergence properties of the iterations also in close‐to‐critical cases, by working on the invariant subspace associated with the problematic eigenvalues as a whole. We present numerical experiments that confirm the efficiency of the new method.Copyright © 2012 John Wiley & Sons, Ltd. 相似文献
14.
In this paper, we propose a class of special Krylov subspace methods to solve continuous algebraic Riccati equation (CARE), i.e., the Hessenberg-based methods. The presented approaches can obtain efficiently the solution of algebraic Riccati equation to some extent. The main idea is to apply Kleinman-Newton"s method to transform the process of solving algebraic Riccati equation into Lyapunov equation at every inner iteration. Further, the Hessenberg process of pivoting strategy combined with Petrov-Galerkin condition and minimal norm condition is discussed for solving the Lyapunov equation in detail, then we get two methods, namely global generalized Hessenberg (GHESS) and changing minimal residual methods based on the Hessenberg process (CMRH) for solving CARE, respectively. Numerical experiments illustrate the efficiency of the provided methods. 相似文献
15.
Zhong‐Zhi Bai 《Numerical Linear Algebra with Applications》2011,18(3):325-341
Newton iteration method can be used to find the minimal non‐negative solution of a certain class of non‐symmetric algebraic Riccati equations. However, a serious bottleneck exists in efficiency and storage for the implementation of the Newton iteration method, which comes from the use of some direct methods in exactly solving the involved Sylvester equations. In this paper, instead of direct methods, we apply a fast doubling iteration scheme to inexactly solve the Sylvester equations. Hence, a class of inexact Newton iteration methods that uses the Newton iteration method as the outer iteration and the doubling iteration scheme as the inner iteration is obtained. The corresponding procedure is precisely described and two practical methods of monotone convergence are algorithmically presented. In addition, the convergence property of these new methods is studied and numerical results are given to show their feasibility and effectiveness for solving the non‐symmetric algebraic Riccati equations. Copyright © 2010 John Wiley & Sons, Ltd. 相似文献
16.
线性等式约束系统广义Riccati代数方程的求解* 总被引:1,自引:0,他引:1
本文基于定常离散LQ控制问题的动力学方程、价值泛函及系统的约束方程,根据极大值原理,给出了线性等式约束系统下的广义Riccati方程,进而对上述方程进行了深入的探讨,并给出了相应的数值例题。 相似文献
17.
The aim of this paper is to mention a generalization of the adapted Riccati equation and, using this method, to prove a non-oscillatory result concerning half-linear differential equations with coefficients having mean values. Note that this result is new even for linear equations. 相似文献
18.
Alexei V. Penskoi Pavel Winternitz 《Journal of Mathematical Analysis and Applications》2004,294(2):533-547
An ordinary differential equation is said to have a superposition formula if its general solution can be expressed as a function of a finite number of particular solution. Nonlinear ODE's with superposition formulas include matrix Riccati equations. Here we shall describe discretizations of Riccati equations that preserve the superposition formulas. The approach is general enough to include q-derivatives and standard discrete derivatives. 相似文献
19.
By using symmetries associated to Riccati equation in standard form (SRE), we obtain a family which can be integrated by quadratures. As a consequence, we get a new integrability condition for the generalized Riccati equation (GRE). We illustrate the result with some examples and we give some applications in the solitons theory. 相似文献
20.
V. A. Krasnov 《Mathematical Notes》1998,63(6):747-751
Two Picard numbers and two Lefschetz numbers are defined for a real algebraic surface. They are similar to the Picard number and the Lefschetz number of a complex algebraic surface. For these numbers, some estimates and relations in the form of inequalities are proved.Translated fromMatematicheskie Zametki, Vol. 63, No. 6, pp. 847–852, June, 1998. 相似文献