563 search results - page 8 / 113 » Computing approximate PSD factorizations |
104
click to vote
MOC
2011
14 years 4 months ago
2011
Using the concept of Geometric Weakly Admissible Meshes (see §2 below) together with an algorithm based on the classical QR factorization of matrices, we compute efficient points...
110
click to vote
FAW
2010
Springer
14 years 9 months ago
2010
Springer
We study the minimum diameter color-spanning set problem which has recently drawn some attention in the database community. We show that the problem can be solved in polynomial tim...
JAIR
2006
14 years 9 months ago
2006
Efficient representations and solutions for large decision problems with continuous and discrete variables are among the most important challenges faced by the designers of automa...
COMPUTING
2006
14 years 9 months ago
2006
We investigate the numerical solution of large-scale Lyapunov equations with the sign function method. Replacing the usual matrix inversion, addition, and multiplication by format...
ENTCS
2008
14 years 9 months ago
2008
Several different uses of Newton's method in connection with the Fundamental Theorem of Algebra are pointed out. Theoretical subdivision schemes have been combined with the n...