Abstract: In this paper, we present the block generalized
minimal residual (BGMRES) method in order to solve the
generalized Sylvester matrix equation. However, this method may
not be converged in some problems. We construct a polynomial
preconditioner based on BGMRES which shows why polynomial
preconditioner is superior to some block solvers. Finally, numerical
experiments report the effectiveness of this method.
Abstract: Based on the conjugate gradient (CG) algorithm, the constrained matrix equation AXB=C and the associate optimal approximation problem are considered for the symmetric arrowhead matrix solutions in the premise of consistency. The convergence results of the method are presented. At last, a numerical example is given to illustrate the efficiency of this method.
Abstract: Frequency transformation with Pascal matrix
equations is a method for transforming an electronic filter (analogue
or digital) into another filter. The technique is based on frequency
transformation in the s-domain, bilinear z-transform with pre-warping
frequency, inverse bilinear transformation and a very useful
application of the Pascal’s triangle that simplifies computing and
enables calculation by hand when transforming from one filter to
another. This paper will introduce two methods to transform a filter
into a digital filter: frequency transformation from the s-domain into
the z-domain; and frequency transformation in the z-domain. Further,
two Pascal matrix equations are derived: an analogue to digital filter
Pascal matrix equation and a digital to digital filter Pascal matrix
equation. These are used to design a desired digital filter from a given
filter.
Abstract: In this paper, according to the classical algorithm
LSQR for solving the least-squares problem, an iterative method is
proposed for least-squares solution of constrained matrix equation. By
using the Kronecker product, the matrix-form LSQR is presented to
obtain the like-minimum norm and minimum norm solutions in a
constrained matrix set for the symmetric arrowhead matrices. Finally,
numerical examples are also given to investigate the performance.
Abstract: In this paper, a system of linear matrix equations
is considered. A new necessary and sufficient condition for the
consistency of the equations is derived by means of the generalized
singular-value decomposition, and the explicit representation of the
general solution is provided.
Abstract: An inversion-free iterative algorithm is presented for
solving nonlinear matrix equation with a stepsize parameter t. The
existence of the maximal solution is discussed in detail, and the
method for finding it is proposed. Finally, two numerical examples
are reported that show the efficiency of the method.
Abstract: In this paper, the nonlinear matrix equation is investigated. Based on the fixed-point theory, the boundary and the existence of the solution with the case r>-δi are discussed. An algorithm that avoids matrix inversion with the case -1
Abstract: In this paper Algebraic Riccati matrix equation is used for Eigen-decomposition of special structured matrices. This is achieved by similarity transformation and then using algebraic riccati matrix equation to triangulation of matrices. The process is decomposition of matrices into small and specially structured submatrices with low dimensions for fast and easy finding of Eigenpairs. Numerical and structural examples included showing the efficiency of present method.
Abstract: In this paper we study numerical methods for solving Sylvester matrix equations of the form AX +XBT +CDT = 0. A new projection method is proposed. The union of Krylov subspaces in A and its inverse and the union of Krylov subspaces in B and its inverse are used as the right and left projection subspaces, respectively. The Arnoldi-like process for constructing the orthonormal basis of the projection subspaces is outlined. We show that the approximate solution is an exact solution of a perturbed Sylvester matrix equation. Moreover, exact expression for the norm of residual is derived and results on finite termination and convergence are presented. Some numerical examples are presented to illustrate the effectiveness of the proposed method.
Abstract: A block backward differentiation formula of uniform
order eight is proposed for solving first order stiff initial value
problems (IVPs). The conventional 8-step Backward Differentiation
Formula (BDF) and additional methods are obtained from the same
continuous scheme and assembled into a block matrix equation which
is applied to provide the solutions of IVPs on non-overlapping
intervals. The stability analysis of the method indicates that the
method is L0-stable. Numerical results obtained using the proposed
new block form show that it is attractive for solutions of stiff problems
and compares favourably with existing ones.
Abstract: In this paper, the construction of fast algorithms for the computation of Periodic Walsh Piecewise-Linear PWL transform and the Periodic Haar Piecewise-Linear PHL transform will be presented. Algorithms for the computation of the inverse transforms are also proposed. The matrix equation of the PWL and PHL transforms are introduced. Comparison of the computational requirements for the periodic piecewise-linear transforms and other orthogonal transforms shows that the periodic piecewise-linear transforms require less number of operations than some orthogonal transforms such as the Fourier, Walsh and the Discrete Cosine transforms.
Abstract: In this paper, the application of the Mode Matching
(MM) method in the case of photonic crystal waveguide
discontinuities is presented. The structure under consideration is
divided into a number of cells, which supports a number of guided
and evanescent modes. These modes can be calculated numerically
by an alternative formulation of the plane wave expansion method
for each frequency. A matrix equation is then formed relating the
modal amplitudes at the beginning and at the end of the structure.
The theory is highly efficient and accurate and can be applied to
study the transmission sensitivity of photonic crystal devices due to
fabrication tolerances. The accuracy of the MM method is compared
to the Finite Difference Frequency Domain (FDFD) and the Adjoint
Variable Method (AVM) and good agreement is observed.
Abstract: In this paper, the dam-reservoir interaction is
analyzed using a finite element approach. The fluid is assumed to be
incompressible, irrotational and inviscid. The assumed boundary
conditions are that the interface of the dam and reservoir is vertical
and the bottom of reservoir is rigid and horizontal. The governing
equation for these boundary conditions is implemented in the
developed finite element code considering the horizontal and vertical
earthquake components. The weighted residual standard Galerkin
finite element technique with 8-node elements is used to discretize
the equation that produces a symmetric matrix equation for the damreservoir
system. A new boundary condition is proposed for
truncating surface of unbounded fluid domain to show the energy
dissipation in the reservoir, through radiation in the infinite upstream
direction. The Sommerfeld-s and perfect damping boundary
conditions are also implemented for a truncated boundary to compare
with the proposed far end boundary. The results are compared with
an analytical solution to demonstrate the accuracy of the proposed
formulation and other truncated boundary conditions in modeling the
hydrodynamic response of an infinite reservoir.
Abstract: In this paper the gradient based iterative algorithm is
presented to solve the linear matrix equation AXB +CXTD = E,
where X is unknown matrix, A,B,C,D,E are the given constant
matrices. It is proved that if the equation has a solution, then the
unique minimum norm solution can be obtained by choosing a special
kind of initial matrices. Two numerical examples show that the
introduced iterative algorithm is quite efficient.
Abstract: In the present work, we propose a new method for
solving the matrix equation AXB=F . The new method can
be considered as a generalized form of the well-known global full
orthogonalization method (Gl-FOM) for solving multiple linear
systems. Hence, the method will be called extended Gl-FOM (EGl-
FOM). For implementing EGl-FOM, generalized forms of block
Krylov subspace and global Arnoldi process are presented. Finally,
some numerical experiments are given to illustrate the efficiency of
our new method.
Abstract: In this paper, a self starting two step continuous block
hybrid formulae (CBHF) with four Off-step points is developed using
collocation and interpolation procedures. The CBHF is then used to
produce multiple numerical integrators which are of uniform order
and are assembled into a single block matrix equation. These
equations are simultaneously applied to provide the approximate
solution for the stiff ordinary differential equations. The order of
accuracy and stability of the block method is discussed and its
accuracy is established numerically.
Abstract: In the present work, we propose a new projection method for solving the matrix equation AXB = F. For implementing our new method, generalized forms of block Krylov subspace and global Arnoldi process are presented. The new method can be considered as an extended form of the well-known global generalized minimum residual (Gl-GMRES) method for solving multiple linear systems and it will be called as the extended Gl-GMRES (EGl- GMRES). Some new theoretical results have been established for proposed method by employing Schur complement. Finally, some numerical results are given to illustrate the efficiency of our new method.
Abstract: In this paper the gradient based iterative algorithms are presented to solve the following four types linear matrix equations: (a) AXB = F; (b) AXB = F, CXD = G; (c) AXB = F s. t. X = XT ; (d) AXB+CYD = F, where X and Y are unknown matrices, A,B,C,D, F,G are the given constant matrices. It is proved that if the equation considered has a solution, then the unique minimum norm solution can be obtained by choosing a special kind of initial matrices. The numerical results show that the proposed method is reliable and attractive.
Abstract: Based on the classical algorithm LSQR for solving (unconstrained) LS problem, an iterative method is proposed for the least-squares like-minimum-norm symmetric solution of AXB+CYD=E. As the application of this algorithm, an iterative method for the least-squares like-minimum-norm biymmetric solution of AXB=E is also obtained. Numerical results are reported that show the efficiency of the proposed methods.
Abstract: In this paper, two matrix iterative methods are presented to solve the matrix equation A1X1B1 + A2X2B2 + ... + AlXlBl = C the minimum residual problem l i=1 AiXiBi−CF = minXi∈BRni×ni l i=1 AiXiBi−CF and the matrix nearness problem [X1, X2, ..., Xl] = min[X1,X2,...,Xl]∈SE [X1,X2, ...,Xl] − [X1, X2, ..., Xl]F , where BRni×ni is the set of bisymmetric matrices, and SE is the solution set of above matrix equation or minimum residual problem. These matrix iterative methods have faster convergence rate and higher accuracy than former methods. Paige’s algorithms are used as the frame method for deriving these matrix iterative methods. The numerical example is used to illustrate the efficiency of these new methods.