Sciweavers

36 search results - page 2 / 8
» Numerical decomposition of symmetric linear systems
Sort
View
TPDS
2008
97views more  TPDS 2008»
13 years 5 months ago
Solving Systems of Linear Equations on the CELL Processor Using Cholesky Factorization
: The STI CELL processor introduces pioneering solutions in processor architecture. At the same time it presents new challenges for the development of numerical algorithms. One is ...
Jakub Kurzak, Alfredo Buttari, Jack Dongarra
DATE
2007
IEEE
114views Hardware» more  DATE 2007»
13 years 11 months ago
Fast positive-real balanced truncation of symmetric systems using cross Riccati equations
We present a computationally efficient implementation of positive-real balanced truncation (PRBT) for symmetric multiple-input multiple-output (MIMO) systems. The solution of a p...
Ngai Wong
CORR
2010
Springer
127views Education» more  CORR 2010»
13 years 5 months ago
MINRES-QLP: a Krylov subspace method for indefinite or singular symmetric systems
Abstract. CG, SYMMLQ, and MINRES are Krylov subspace methods for solving large symmetric systems of linear equations. CG (the conjugate-gradient method) is reliable on positive-def...
Sou-Cheng T. Choi, Christopher C. Paige, Michael A...
EOR
2007
88views more  EOR 2007»
13 years 5 months ago
The geometry and number of the root invariant regions for linear systems
The stability domain is a feasible set for numerous optimization problems. D-decomposition technique is targeted to describe the stability domain in the parameter space for linear...
Elena N. Gryazina
SIAMMAX
2010
146views more  SIAMMAX 2010»
13 years 1 days ago
A Comparison of Two-Level Preconditioners Based on Multigrid and Deflation
It is well-known that two-level and multi-level preconditioned conjugate gradient (PCG) methods provide efficient techniques for solving large and sparse linear systems whose coeff...
J. M. Tang, S. P. MacLachlan, Reinhard Nabben, C. ...