We propose a numerically reliable approach for computing solutions of least McMillan order of linear equations with rational matrix coefficients. The main computational ingredients are the orthogonal reduction of the associated system matrix pencil to a certain Kronecker-like staircase form and the solution of a minimal dynamic cover design problem. For these computations we discuss numerically reliable algorithms relying on matrix pencil and descriptor system techniques
In this paper we present a polynomial-time procedure to find a low rank solution for a system of Lin...
180 pagesNew numerical methods using rational functions are presented for applications in linear alg...
AbstractWe consider a system of linear equations of the form A(x)X(x) = b(x), where A(x), b(x) are g...
The study deals with systems of linear algebraic equations and algorithms of their solution with a g...
AbstractLet K be a field of characteristic zero and M(Y) =N a system of linear differential equation...
In [3] we presented a technique to study the existence of rational solutions for systems of linear f...
New variants of Krylov subspace methods for numerical solution of linear systems, eigenvalue, and mo...
AbstractHensel’s symbolic lifting is a highly effective method for the solution of a general or stru...
Modular algorithms for linear equations solution, matrix inversion, determinant calculation, null sp...
Numerical procedures and codes for linear Diophantine polynomial equations are proposed in this pape...
We investigate the numerical solution of stable Sylvester equations via iterative schemes proposed f...
Linear matrix equations, such as the Sylvester and Lyapunov equations, play an important role in var...
Abstract. Numerical linear algebra and combinatorial optimization are vast subjects; as is their int...
Saunders, B. DavidThis is a study in exact computational linear algebra consisting of two parts. Fir...
This talk is about the solution of non-linear eigenvalue problems and linear systems with a nonlinea...
In this paper we present a polynomial-time procedure to find a low rank solution for a system of Lin...
180 pagesNew numerical methods using rational functions are presented for applications in linear alg...
AbstractWe consider a system of linear equations of the form A(x)X(x) = b(x), where A(x), b(x) are g...
The study deals with systems of linear algebraic equations and algorithms of their solution with a g...
AbstractLet K be a field of characteristic zero and M(Y) =N a system of linear differential equation...
In [3] we presented a technique to study the existence of rational solutions for systems of linear f...
New variants of Krylov subspace methods for numerical solution of linear systems, eigenvalue, and mo...
AbstractHensel’s symbolic lifting is a highly effective method for the solution of a general or stru...
Modular algorithms for linear equations solution, matrix inversion, determinant calculation, null sp...
Numerical procedures and codes for linear Diophantine polynomial equations are proposed in this pape...
We investigate the numerical solution of stable Sylvester equations via iterative schemes proposed f...
Linear matrix equations, such as the Sylvester and Lyapunov equations, play an important role in var...
Abstract. Numerical linear algebra and combinatorial optimization are vast subjects; as is their int...
Saunders, B. DavidThis is a study in exact computational linear algebra consisting of two parts. Fir...
This talk is about the solution of non-linear eigenvalue problems and linear systems with a nonlinea...
In this paper we present a polynomial-time procedure to find a low rank solution for a system of Lin...
180 pagesNew numerical methods using rational functions are presented for applications in linear alg...
AbstractWe consider a system of linear equations of the form A(x)X(x) = b(x), where A(x), b(x) are g...