Related papers: A note on Sylvester-type equations
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…
Hermitian symplectic spaces provide a natural framework for the extension theory of symmetric operators. Here we show that hermitian symplectic spaces may also be used to describe the solution to the factorisation problem for the scattering…
This work focuses on the development of efficient solvers for the pseudo-stress formulation of the unsteady Stokes problem, discretised by means of a discontinuous Galerkin method on polytopal grids (PolyDG). The introduction of the…
For an equation of state in which pressure is a function only of density, the analysis of Newtonian stellar structure is simple in principle if the system is axisymmetric, or consists of a corotating binary. It is then required only to…
The inverse scattering approach for the defocusing Davey-Stewartson II equation is given by a system of D-bar equations. We present a numerical approach to semi-classical D-bar problems for real analytic rapidly decreasing potentials. We…
We study in this paper solutions to several kinds of linear bimatrix equations arising from pole assignment and stability analysis of complex-valued linear systems, which have several potential applications in control theory, particularly,…
In this paper, we consider the problem of stabilizing discrete-time linear systems by computing a nearby stable matrix to an unstable one. To do so, we provide a new characterization for the set of stable matrices. We show that a matrix $A$…
A method is suggested for treating those complicated physical problems for which exact solutions are not known but a few approximation terms of a calculational algorithm can be derived. The method permits one to answer the following rather…
Bilinear systems of equations are defined, motivated and analyzed for solvability. Elementary structure is mentioned and it is shown that all solutions may be obtained as rank one completions of a linear matrix polynomial derived from…
We obtain an approximate global stationary and axisymmetric solution of Einstein's equations which can be thought as a simple two layers star model: a self-gravitating ball built up by two layers of perfect fluid having different linear…
In this paper, we derive a randomized version of the Mirror-Prox method for solving some structured matrix saddle-point problems, such as the maximal eigenvalue minimization problem. Deterministic first-order schemes, such as Nesterov's…
We develop an accelerated gradient descent algorithm on the Grassmann manifold to compute the subspace spanned by a number of leading eigenvectors of a symmetric positive semi-definite matrix. This has a constant cost per iteration and a…
This book is about solving matrix nearness problems that are related to eigenvalues or singular values or pseudospectra. These problems arise in great diversity in various fields, be they related to dynamics, as in questions of robust…
Nonlinear matrix equations play a crucial role in science and engineering problems. However, solutions of nonlinear matrix equations cannot, in general, be given analytically. One standard way of solving nonlinear matrix equations is to…
This paper proposes a novel iterative algorithm to compute the stabilizing solution of regime-switching stochastic game-theoretic Riccati differential equations with periodic coefficients. The method decomposes the original complex…
In this work, we consider the low rank decomposition (SDPR) of general convex semidefinite programming problems (SDP) that contain both a positive semidefinite matrix and a nonnegative vector as variables. We develop a rank-support-adaptive…
A hitherto difficult and unsolved issue in plasma physics is how to give a general numerical solver for complicated plasma dispersion relation, although we have long known the general analytical forms. We transform the task to a full-matrix…
We describe novel subgradient methods for a broad class of matrix optimization problems involving nuclear norm regularization. Unlike existing approaches, our method executes very cheap iterations by combining low-rank stochastic…
The Sylvester equation $AX-XB=C$ is considered in the setting of quaternion matrices. Conditions that are necessary and sufficient for the existence of a unique solution are well-known. We study the complementary case where the equation…
We discuss the solution of eigenvalue problems associated with partial differential equations that can be written in the generalized form $\m{A}x=\lambda\m{B}x$, where the matrices $\m{A}$ and/or $\m{B}$ may depend on a scalar parameter.…