Add to ORKGWe present a fraction-free approach to the computation of matrix Padé systems. The method relies on determining a modified Schur complement for the coefficient matrices of the linear systems of equations that are associated to matrix Padé approximation problems. By using this modified Schur complement for these matrices we are able to obtain a fast hybrid fraction-free algorithm for their computation. The algorithm is general and requires no extra assumptions on its input
The study of lossless matrices is motivated by two main applications in system theory: * Lossless ma...
Some important applicative problems require the evaluation of functions Ψ of large and sparse and/or...
In this paper we consider computational aspect of the matrix Pade approximants whose definitions and...
Abstract. We present a new set of algorithms for computation of matrix rational interpolants and one...
The Schur--Padé algorithm [N. J. Higham and L. Lin, A Schur--Padé algorithm for fractional powers ...
The Schur--Pad���© algorithm [N. J. Higham and L. Lin, A Schur--Pad���© algorithm for fracti...
A new algorithm is developed for computing arbitrary real powers $A^p$ of a matrix $A\in\mathbb{C}^{...
Abstract. A new algorithm is developed for computing arbitrary real powers Ap of a matrix A ∈ Cn×n. ...
In exact computing environments such as Maple and Mathematica problems often have symbolic parameter...
AbstractIn this paper two methods to compute Padé approximants are given. These methods are based on...
Recently, a uniform approach was given [5] for different concepts of matrix-type Pad'e approxim...
AbstractWork on Padé or Padé-type approximants ultimately involves the explicitdetermination of the ...
AbstractWe consider the problem of computing solutions to a variety of matrix rational interpolation...
The Schur method for computing a matrix square root reduces the matrix to the Schur triangular form ...
AbstractTechniques of Padé approximation and continued fractions have been used often in model reduc...
The study of lossless matrices is motivated by two main applications in system theory: * Lossless ma...
Some important applicative problems require the evaluation of functions Ψ of large and sparse and/or...
In this paper we consider computational aspect of the matrix Pade approximants whose definitions and...
Abstract. We present a new set of algorithms for computation of matrix rational interpolants and one...
The Schur--Padé algorithm [N. J. Higham and L. Lin, A Schur--Padé algorithm for fractional powers ...
The Schur--Pad���© algorithm [N. J. Higham and L. Lin, A Schur--Pad���© algorithm for fracti...
A new algorithm is developed for computing arbitrary real powers $A^p$ of a matrix $A\in\mathbb{C}^{...
Abstract. A new algorithm is developed for computing arbitrary real powers Ap of a matrix A ∈ Cn×n. ...
In exact computing environments such as Maple and Mathematica problems often have symbolic parameter...
AbstractIn this paper two methods to compute Padé approximants are given. These methods are based on...
Recently, a uniform approach was given [5] for different concepts of matrix-type Pad'e approxim...
AbstractWork on Padé or Padé-type approximants ultimately involves the explicitdetermination of the ...
AbstractWe consider the problem of computing solutions to a variety of matrix rational interpolation...
The Schur method for computing a matrix square root reduces the matrix to the Schur triangular form ...
AbstractTechniques of Padé approximation and continued fractions have been used often in model reduc...
The study of lossless matrices is motivated by two main applications in system theory: * Lossless ma...
Some important applicative problems require the evaluation of functions Ψ of large and sparse and/or...
In this paper we consider computational aspect of the matrix Pade approximants whose definitions and...