English
Related papers

Related papers: A note on solutions of the matrix equation AXB=C

200 papers

The condition number of solutions to full rank linear least-squares problem are shown to be given by an optimization problem that involves nuclear norms of rank 2 matrices. The condition number is with respect to the least-squares…

Numerical Analysis · Mathematics 2015-03-13 Joseph F. Grcar

Let $\mathbb{H}$ be a field with $\mathbb{Q}\subset\mathbb{H}\subset\mathbb{C}$, and let $p(\lambda)$ be a polynomial in $\mathbb{H}[\lambda]$, and let $A\in\mathbb{H}^{n\times n}$ be nonderogatory. In this paper we consider the problem of…

Functional Analysis · Mathematics 2022-06-01 Gilbert Groenewald , Dawie Janse van Rensburg , Andre Ran , Madelein van Straaten , Frieda Theron

We propose a two-level nested preconditioned iterative scheme for solving sparse linear systems of equations in which the coefficient matrix is symmetric and indefinite with relatively small number of negative eigenvalues. The proposed…

Numerical Analysis · Computer Science 2019-01-29 Murat Manguoglu , Volker Mehrmann

The paper establishes necessary and sufficient conditions for stability of different join-the-shortest-queue models including load-balanced networks with general input and output processes. It is shown, that the necessary and sufficient…

Probability · Mathematics 2007-09-13 Vyacheslav M. Abramov

Systems of the form $x = (A x^s)^{1/s} + b$ arise in a range of economic, financial and control problems, where $A$ is a linear operator acting on a space of real-valued functions (or vectors) and $s$ is a nonzero real value. In these…

Functional Analysis · Mathematics 2022-12-02 John Stachurski , Ole Wilms , Junnan Zhang

The Kaczmarz method is a popular iterative method for solving consistent, overdetermined linear system such as medical imaging in computerized tomography. The Kaczmarz's iteration repeatedly scans all equations in order, which leads to…

Numerical Analysis · Mathematics 2023-05-23 Chuan-gang Kang

We consider the problem of finding the smallest rank of a complex matrix whose absolute values of the entries are given. We call this minimum the phaseless rank of the matrix of the entrywise absolute values. In this paper we study this…

Algebraic Geometry · Mathematics 2020-10-09 António Pedro Goucha , João Gouveia

We prove that the system of subordination equations, defining the free additive convolution of two probability measures, is stable away from the edges of the support and blow-up singularities by showing that the recent smoothness condition…

Probability · Mathematics 2016-01-05 Zhigang Bao , Laszlo Erdos , Kevin Schnelli

In this paper, for solving inconsistent matrix equations we propose a dual-space residual-based randomized extended Kaczmarz method and its version with Nesterov momentum. Without the full column rank assumptions on coefficient matrices, we…

Numerical Analysis · Mathematics 2026-04-08 Wendi Bao , Jing Li , Lili Xing , Weiguo Li , Jichao Wang

In the field of robotics research, a crucial applied problem is the hand-eye calibration issue, which involves solving the matrix equation $AX = YB$. However, this matrix equation is merely a specific case of the more general dual…

Rings and Algebras · Mathematics 2025-01-08 LvMing Xie , QingWen Wang , ZhuoHeng He

Given a multi-variant polynomial inequality with a parameter, how to find the best possible value of this parameter that satisfies the inequality? For instance, find the greatest number $k$ that satisfies $ a^3+b^3+c^3+…

Symbolic Computation · Computer Science 2016-03-07 Lu Yang , Ju Zhang

We consider the problem of approximating the solution to $A(\mu) x(\mu) = b$ for many different values of the parameter $\mu$. Here we assume $A(\mu)$ is large, sparse, and nonsingular with a nonlinear dependence on $\mu$. Our method is…

Numerical Analysis · Mathematics 2023-10-10 Siobhán Correnty , Elias Jarlebring , Daniel B. Szyld

Many applications in applied mathematics and control theory give rise to the unique solution of a Sylvester-like matrix equation associated with an underlying structured matrix operator $f$. In this paper, we will discuss the solvability of…

Numerical Analysis · Mathematics 2015-02-17 Chun-Yueh Chiang

A new domain decomposition preconditioner is introduced for efficiently solving linear systems Ax = b with a symmetric positive definite matrix A. The particularity of the new preconditioner is that it is not necessary to have access to the…

Numerical Analysis · Mathematics 2021-06-23 Nicole Spillane

A simple approximate relationship between the ground-state eigenvector and the sum of matrix elements in each row has been established for real symmetric matrices with non-positive off-diagonal elements. Specifically, the $i$-th components…

Mesoscale and Nanoscale Physics · Physics 2020-11-06 Wei Pan , Jing Wang , Deyan Sun

Field equations for generalized principle models with nonconstant metric are derived and ansatz for their Lax pairs is given. Equations that define the Lax pairs are solved for the simplest solvable group. The solution is dependent on one…

Exactly Solvable and Integrable Systems · Physics 2009-10-31 L. Hlavaty

The complete eigenstructure, or structural data, of a rational matrix $R(s)$ is comprised by its invariant rational functions, both finite and at infinity, which in turn determine its finite and infinite pole and zero structures,…

Spectral Theory · Mathematics 2025-05-02 Itziar Baragaña , Froilán M. Dopico , Silvia Marcaida , Alicia Roca

We obtain an exact necessary and sufficient condition for the existence and uniqueness of equilibrium asset prices in infinite horizon, discrete-time, arbitrage free environments. Through several applications we show how the condition…

General Finance · Quantitative Finance 2021-03-01 Jaroslav Borovicka , John Stachurski

We investigate the Moore-Penrose pseudoinverse and generalized inverse of a matrix product $A=CR$ to establish a unifying framework for generalized and randomized matrix inverses. This analysis is rooted in first principles, focusing on the…

Numerical Analysis · Mathematics 2026-02-03 Michał P. Karpowicz , Gilbert Strang

We study alternating minimization for matrix completion in the simplest possible setting: completing a rank-one matrix from a revealed subset of the entries. We bound the asymptotic convergence rate by the variational characterization of…

Machine Learning · Computer Science 2020-08-13 Rui Liu , Alex Olshevsky