Related papers: Refined Schur Method for Robust Pole Assignment wi…
Recently, a \textbf{SCHUR} method was proposed in \cite{Chu2} to solve the robust pole assignment problem in state feedback control. It takes the departure from normality of the closed-loop system matrix $A_c$ as the measure of robustness,…
The pole assignment problem for descriptor systems is a classical inverse algebraic eigenvalue problem, which has attracted attention for decades. In this paper, we propose a direct method to solve the problem with the application of the…
We consider the classic problem of pole placement by state feedback. We adapt the Moore eigenstructure assignment algorithm to obtain a novel parametric form for the pole-placing gain matrix, and introduce an unconstrained nonlinear…
This paper introduces the application of the asynchronous iterations theory within the framework of the primal Schur domain decomposition method. A suitable relaxation scheme is designed, which asynchronous convergence is established under…
The Schur decomposition of a square matrix $A$ is an important intermediate step of state-of-the-art numerical algorithms for addressing eigenvalue problems, matrix functions, and matrix equations. This work is concerned with the following…
We consider the classic problem of pole placement by state feedback. We offer an eigenstructure assignment algorithm to obtain a novel parametric form for the pole-placing feedback matrix that can deliver any set of desired closed-loop…
The randomized Kaczmarz method and its accelerated variants are a powerful class of iterative methods for solving large-scale linear systems, offering guaranteed convergence with low per-iteration cost. However, their numerical stability…
The physical pole and running masses of squarks and gluinos have recently been related at two-loop order in a mass-independent renormalization scheme. I propose a general method for improvement of such formulas, and argue that better…
This paper proposes a robust learning methodology to place the closed-loop poles in desired convex regions in the complex plane. We considered the system state and input matrices to be unknown and can only use the measurements of the system…
Coupled multi-physics problems are encountered in countless applications and pose significant numerical challenges. Although monolithic approaches offer possibly the best solution strategy, they often require ad-hoc preconditioners and…
This paper addresses the resilience of large-scale closed-loop structured systems in the sense of arbitrary pole placement when subject to failure of feedback links. Given a structured system with input, output, and feedback matrices, we…
In this study, the problem of robust Schur stability of $n\times n$ dimensional matrix segments by using the bialternate product of matrices is considered. It is shown that the problem can be reduced to the existence of negative eigenvalues…
The paper presents a distinctive and straightforward technique for stabilization of multi-variable systems. The idea is to decouple the system state matrix depending on different inputs and outputs. Refined special canonical transformations…
Iterative sketching and sketch-and-precondition are well-established randomized algorithms for solving large-scale, over-determined linear least-squares problems. In this paper, we introduce a new perspective that interprets Iterative…
Rank-constrained optimization problems have received an increasing intensity of interest recently, because many optimization problems in communications and signal processing applications can be cast into a rank-constrained optimization…
When iteratively solving linear systems By=b with Hermitian positive semi-definite $B$, and in particular when solving least-squares problems for $Ax=b$ by reformulating them as $AA^\ast y=b$, it is often observed that SOR-type methods…
We consider the solution of the Sylvester equation $AX+XB=C$ in mixed precision. We derive a new iterative refinement scheme to solve perturbed quasi-triangular Sylvester equations; our rounding error analysis provides sufficient conditions…
In this paper we introduce an algebraic recursive multilevel incomplete factorization preconditioner, based on a distributed Schur complement formulation, for solving general linear systems. The novelty of the proposed method is to combine…
We derive efficient and reliable goal-oriented error estimations, and devise adaptive mesh procedures for the finite element method that are based on the localization of a posteriori estimates. In our previous work [SIAM J. Sci. Comput.,…
We analyze the convergence of the (algebraic) multiplicative Schwarz method applied to linear algebraic systems with matrices having a special block structure that arises, for example, when a (partial) differential equation is posed and…