573 search results - page 20 / 115 » On Wiedemann's Method of Solving Sparse Linear Systems |
MOC
2010
13 years 3 months ago
2010
The Lanczos method is often used to solve a large and sparse symmetric matrix eigenvalue problem. There is a well-established convergence theory that produces bounds to predict the...
JDCTA
2010
13 years 3 months ago
2010
This paper presents a new method for solving a class of infinite horizon nonlinear optimal control problems. In this method, first the original optimal control problem is transfor...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
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...
ICASSP
2008
IEEE
14 years 3 months ago
2008
IEEE
Finding sparse approximate solutions to large underdetermined linear systems of equations is a common problem in signal/image processing and statistics. Basis pursuit, the least a...
CDC
2009
IEEE
14 years 1 months ago
2009
IEEE
Abstract— A broad class of problems in circuits, electromagnetics, and optics can be expressed as finding some parameters of a linear system with a specific type. This paper is...