Results 1  10
of
187,489
Consider block twobytwo systems of linear equations of the form
, 2013
"... ORIGINAL PAPER Additive block diagonal preconditioning for block twobytwo linear systems of skewHamiltonian coefficient matrices ..."
Abstract
 Add to MetaCart
ORIGINAL PAPER Additive block diagonal preconditioning for block twobytwo linear systems of skewHamiltonian coefficient matrices
Structured preconditioners for nonsingular matrices of block twobytwo structures
 Math. Comp
"... Abstract. For the large sparse block twobytwo real nonsingular matrices, we establish a general framework of practical and efficient structured preconditioners through matrix transformation and matrix approximations. For the specific versions such as modified block Jacobitype, modified block Gaus ..."
Abstract

Cited by 15 (8 self)
 Add to MetaCart
preconditioners are employed to precondition the Krylov subspace methods such as GMRES and restarted GMRES, fast and effective iteration solvers can be obtained for the large sparse systems of linear equations with block twobytwo coefficient matrices. In particular, these structured preconditioners can lead
Hamiltonian Square Roots of SkewHamiltonian Matrices
, 1997
"... We present a constructive existence proof that every real skewHamiltonian matrix W has a real Hamiltonian square root. The key step in this construction shows how one may bring any such W into a real quasiJordan canonical form via symplectic similarity. We show further that every W has infinitely ..."
Abstract

Cited by 28 (10 self)
 Add to MetaCart
We present a constructive existence proof that every real skewHamiltonian matrix W has a real Hamiltonian square root. The key step in this construction shows how one may bring any such W into a real quasiJordan canonical form via symplectic similarity. We show further that every W has
A general approach to analyse preconditioners for twobytwo block matrices
"... Twobytwo block matrices arise in various applications, such as in domain decomposition methods or, more generally, when solving boundary value problems discretized by finite elements from the separation of the node set of the mesh into ’fine’ and ’coarse’ nodes. Matrices with such a structure, in ..."
Abstract

Cited by 11 (6 self)
 Add to MetaCart
Twobytwo block matrices arise in various applications, such as in domain decomposition methods or, more generally, when solving boundary value problems discretized by finite elements from the separation of the node set of the mesh into ’fine’ and ’coarse’ nodes. Matrices with such a structure
On Nonsingularity of Block TwobyTwo Matrices
, 2013
"... We derive necessary and sufficient conditions for guaranteeing the nonsingularity of a block twobytwo matrix by making use of the singular value decompositions and the MoorePenrose pseudoinverses of the matrix blocks. These conditions are complete, and much weaker and simpler than those given by ..."
Abstract
 Add to MetaCart
We derive necessary and sufficient conditions for guaranteeing the nonsingularity of a block twobytwo matrix by making use of the singular value decompositions and the MoorePenrose pseudoinverses of the matrix blocks. These conditions are complete, and much weaker and simpler than those given
Preconditioned MHSS Iteration Methods for a Class of Block TwobyTwo Linear Systems with Applications to Distributed Control Problems ∗
, 2011
"... We construct a preconditioned MHSS (PMHSS) iteration scheme for solving and preconditioning a class of block twobytwo linear systems arising from the Galerkin finiteelement discretizations of a class of distributed control problems. The convergence theory of this class of PMHSS iteration methods ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
We construct a preconditioned MHSS (PMHSS) iteration scheme for solving and preconditioning a class of block twobytwo linear systems arising from the Galerkin finiteelement discretizations of a class of distributed control problems. The convergence theory of this class of PMHSS iteration methods
Preconditioned . . . for a Class of Block TwobyTwo Linear Systems with Applications to Distributed Control Problems
, 2011
"... We construct a preconditioned MHSS (PMHSS) iteration scheme for solving and preconditioning a class of block twobytwo linear systems arising from the Galerkin finiteelement discretizations of a class of distributed control problems. The convergence theory of this class of PMHSS iteration methods ..."
Abstract
 Add to MetaCart
We construct a preconditioned MHSS (PMHSS) iteration scheme for solving and preconditioning a class of block twobytwo linear systems arising from the Galerkin finiteelement discretizations of a class of distributed control problems. The convergence theory of this class of PMHSS iteration methods
SkewHamiltonian and Hamiltonian eigenvalue problems: Theory, algorithms and applications
 Proceedings of ApplMath03, Brijuni (Croatia
"... SkewHamiltonian and Hamiltonian eigenvalue problems arise from a number of applications, particularly in systems and control theory. The preservation of the underlying matrix structures often plays an important role in these applications and may lead to more accurate and more efficient computation ..."
Abstract

Cited by 16 (6 self)
 Add to MetaCart
SkewHamiltonian and Hamiltonian eigenvalue problems arise from a number of applications, particularly in systems and control theory. The preservation of the underlying matrix structures often plays an important role in these applications and may lead to more accurate and more efficient
Maximum Likelihood Linear Transformations for HMMBased Speech Recognition
 Computer Speech and Language
, 1998
"... This paper examines the application of linear transformations for speaker and environmental adaptation in an HMMbased speech recognition system. In particular, transformations that are trained in a maximum likelihood sense on adaptation data are investigated. Other than in the form of a simple bias ..."
Abstract

Cited by 538 (65 self)
 Add to MetaCart
of the constrained modelspace transform from the simple diagonal case to the full or blockdiagonal case. The constrained and unconstrained transforms are evaluated in terms of computational cost, recognition time efficiency, and use for speaker adaptive training. The recognition performance of the two model
Good ErrorCorrecting Codes based on Very Sparse Matrices
, 1999
"... We study two families of errorcorrecting codes defined in terms of very sparse matrices. "MN" (MacKayNeal) codes are recently invented, and "Gallager codes" were first investigated in 1962, but appear to have been largely forgotten, in spite of their excellent properties. The ..."
Abstract

Cited by 741 (23 self)
 Add to MetaCart
We study two families of errorcorrecting codes defined in terms of very sparse matrices. "MN" (MacKayNeal) codes are recently invented, and "Gallager codes" were first investigated in 1962, but appear to have been largely forgotten, in spite of their excellent properties
Results 1  10
of
187,489