infiltration plays an important role in surface and subsurface hydrology and it is a key factor in the rainfall and runoff equations. the use of new approaches that have no limitations of common theoretical and empirical methods to determine infiltration relationships, will minimize the necessity of time consuming and costly experiments to determine permeability values and will make it possible...

In this paper a method for solving large-scale Sylvester equations is presented. The method is based on the sign function iteration and is particularly effective for Sylvester equations with factorized righthand side. In this case, the solution will be computed in factored form as it is for instance required in model reduction. The hierarchical matrix format and the corresponding formatted arit...

This paper deals with the design of a reduced-order H∞ filter for a stochastic bilinear system with a prescribed H∞ norm criterion. The considered system is bilinear in control and with multiplicative noises in the dynamics and in the measurement equations. The problem is transformed into the search of a unique gain matrix by using Sylvester-like constraints. The approach is based on the resolu...

This paper addresses two problems: an image denoising problem assuming dense observations and an image reconstruction problem from sparse data. It shows that both problems can be solved by the Sylvester/Lyapunov algebraic equation. The Sylvester/Lyapunov equation has been extensively studied in Control Theory and it can be efficiently solved by well known numeric algorithms. This paper proposes...

In this paper, we propose two new algorithms based on modified global Arnoldi algorithm for solving large Sylvester matrix equations AX + XB = C where A ∈ Rn×n, B ∈ Rs×s, X and C ∈ Rn×s. These algorithms are based on the global FOM and GMRES algorithms and we call them by Global FOM-SylvesterLike(GFSL) and Global GMRES-Sylvester-Like(GGSL) algorithms, respectively. Some theoretical results and ...

METT VII — 7th Workshop on Matrix Equations and Tensor Techniques Pisa, 13–14 Feb 2017 Program Monday, February 13 8:30 Registration Session I (chair: B. Meini) 9:00 Opening 9:15 P. Kürschner: Large generalized Sylvester equations with additional low-rank terms 9:40 G. Mele: Krylov methods for generalized Sylvester equations with low rank commutative coefficients 10:05 E. Ringh: Sylvester-based...

We propose an elegant and conceptually simple method for computing the periodic solution of three classes of periodic matrix equations | Ric-cati, Lyapunov and Sylvester. Such equations arise naturally in several problems of linear system theory. Our approach is very attractive from a numerical point of view, since it is based on the periodic Schur form of techniques involving unitary (orthogon...

We try to arm Newton’s iteration for univariate polynomial factorization with greater convergence power by shifting to a larger basic system of multivariate constraints. The convolution equation is a natural means for a desired expansion of the basis for this iteration versus the classical univariate method, which is more vulnerable to foreign distractions from its convergence course. Compared ...