573 search results - page 8 / 115 » On Wiedemann's Method of Solving Sparse Linear Systems |
CDC
2010
IEEE
13 years 2 months ago
2010
IEEE
Interior point methods (IPMs) have proven to be an efficient way of solving quadratic programming problems in predictive control. A linear system of equations needs to be solved in...
AUTOMATICA
2006
13 years 7 months ago
2006
This paper presents a Newton-like algorithm for solving systems of rank constrained linear matrix inequalities. Though local quadratic convergence of the algorithm is not a priori...
CORR
1998
Springer
13 years 7 months ago
1998
Springer
Abstract. Consider a system F of n polynomial equations in n unknowns, over an algebraically closed field of arbitrary characteristic. We present a fast method to find a point in...
CDC
2009
IEEE
13 years 11 months ago
2009
IEEE
Abstract-- Many model order reduction methods for parameterized systems need to construct a projection matrix V which requires computing several moment matrices of the parameterize...
PVM
1999
Springer
14 years 4 hour ago
1999
Springer
The problem of solving sparse Systems of Linear Algebraic Equations (SLAE) by parallel Monte Carlo numerical methods is considered. The almost optimal Monte Carlo algorithms are pr...