اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدA new class of complex nonsymmetric algebraic Riccati equations
60
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this paper, we first propose a new parameterized definition of comparison matrix of a given complex matrix, which generalizes the definition proposed by cite {Axe1}. Based on this, we propose a new class of complex nonsymmetric algebraic Riccati equations (NAREs) which extends the class of nonsymmetric algebraic Riccati equations proposed by cite {Axe1}. We also generalize the definition of the extremal solution of an NARE and show that the extremal solution of an NARE exists and is unique. Some classical algorithms can be applied to search for the extremal solution of an NARE, including Newtons method, some fixed-point iterative methods and doubling algorithms. Besides, we show that Newtons method is quadratically convergent and the fixed-point iterative method is linearly convergent. We also give some concrete strategies for choosing suitable parameters such that the doubling algorithms can be used to deliver the extremal solutions, and show that the two doubling algorithms with suitable parameters are quadratically convergent. Numerical experiments show that our strategies for parameters are effective.
قيم البحث
اقرأ أيضاً
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 these eigenvalues are exactly zero, the problem is called critical or null recurrent. While 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 a theoretical analysis and several numerical experiments which confirm the efficiency of the new method.
In emph{Guo et al, arXiv:2005.08288}, we propose a decoupled form of the structure-preserving doubling algorithm (dSDA). The method decouples the original two to four coupled recursions, enabling it to solve large-scale algebraic Riccati equations an
d other related problems. In this paper, we consider the numerical computations of the novel dSDA for solving large-scale continuous-time algebraic Riccati equations with low-rank structures (thus possessing numerically low-rank solutions). With the help of a new truncation strategy, the rank of the approximate solution is controlled. Consequently, large-scale problems can be treated efficiently. Illustrative numerical examples are presented to demonstrate and confirm our claims.
This work focuses on the development of a new class of high-order accurate methods for multirate time integration of systems of ordinary differential equations. The proposed methods are based on a specific subset of explicit one-step exponential inte
grators. More precisely, starting from an explicit exponential Runge--Kutta method of the appropriate form, we derive a multirate algorithm to approximate the action of the matrix exponential through the definition of modified fast initial-value problems. These fast problems may be solved using any viable solver, enabling multirate simulations through use of a subcycled method. Due to this structure, we name these Multirate Exponential Runge--Kutta (MERK) methods. In addition to showing how MERK methods may be derived, we provide rigorous convergence analysis, showing that for an overall method of order $p$, the fast problems corresponding to internal stages may be solved using a method of order $p-1$, while the final fast problem corresponding to the time-evolved solution must use a method of order $p$. Numerical simulations are then provided to demonstrate the convergence and efficiency of MERK methods with orders three through five on a series of multirate test problems.
We review a family of algorithms for Lyapunov- and Riccati-type equations which are all related to each other by the idea of emph{doubling}: they construct the iterate $Q_k = X_{2^k}$ of another naturally-arising fixed-point iteration $(X_h)$ via a s
ort of repeated squaring. The equations we consider are Stein equations $X - A^*XA=Q$, Lyapunov equations $A^*X+XA+Q=0$, discrete-time algebraic Riccati equations $X=Q+A^*X(I+GX)^{-1}A$, continuous-time algebraic Riccati equations $Q+A^*X+XA-XGX=0$, palindromic quadratic matrix equations $A+QY+A^*Y^2=0$, and nonlinear matrix equations $X+A^*X^{-1}A=Q$. We draw comparisons among these algorithms, highlight the connections between them and to other algorithms such as subspace iteration, and discuss open issues in their theory.
Differential algebraic Riccati equations are at the heart of many applications in control theory. They are time-depent, matrix-valued, and in particular nonlinear equations that require special methods for their solution. Low-rank methods have been u
sed heavily computing a low-rank solution at every step of a time-discretization. We propose the use of an all-at-once space-time solution leading to a large nonlinear space-time problem for which we propose the use of a Newton-Kleinman iteration. Approximating the space-time problem in low-rank form requires fewer applications of the discretized differential operator and gives a low-rank approximation to the overall solution.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
