
LMI toolbox
 Referenced in 870 articles
[sw06383]
 kept in mind that the complexity of LMI computations remains higher than that of solving...

MersenneTwister
 Referenced in 169 articles
[sw05367]
 characteristic polynomial of MT with computational complexity O(p 2 ) where p is the degree...

GAMS
 Referenced in 596 articles
[sw04978]
 with large, complex problems. GAMS is available for use on personal computers, workstations, mainframes ... GAMS is especially useful for handling large, complex, oneofakind problems which...

SPARQL
 Referenced in 77 articles
[sw07429]
 classical theoretical problems such as expressiveness and complexity, and discuss algorithmic properties. Moreover, we present ... unbounded federated queries and the high computational complexity of the evaluation problem for queries including...

LAPACK
 Referenced in 1161 articles
[sw00503]
 Schur) are also provided, as are related computations such as reordering of the Schur factorizations ... similar functionality is provided for real and complex matrices, in both single and double precision ... that as much as possible of the computation is performed by calls to the Basic...

EISPACK
 Referenced in 346 articles
[sw04208]
 subroutines that compute the eigenvalues and eigenvectors of nine classes of matrices: complex general, complex...

INTLAB
 Referenced in 261 articles
[sw04004]
 INTLAB is the Matlab toolbox for reliable computing and selfvalidating algorithms. It comprises ... clusters) interval arithmetic for real and complex data including vectors and matrices (very fast) interval ... real and complex sparse matrices (very fast) automatic differentiation (forward mode, vectorized computations, fast) Gradients ... functions (fast, very accurate, 3 ulps) rigorous complex interval standard functions (fast, rigorous...

JDQZ
 Referenced in 405 articles
[sw07031]
 JDQZ algorithm can be used for computing a few selected eigenvalues with some desirable property ... matrices can be real or complex, Hermitian or nonHermitian, .... The algorithm is effective especially ... JacobiDavidson method is used to compute a partial generalized Schur decomposition of the pair...

JDQR
 Referenced in 355 articles
[sw04021]
 JDQR algorithm can be used for computing a few selected eigenvalues with some desirable property ... matrix can be real or complex, Hermitian or nonHermitian, .... The algorithm is effective especially ... JacobiDavidson method is used to compute a partial Schur decomposition of A. The decomposition...

Gfan
 Referenced in 67 articles
[sw04698]
 Gröbner fan. Gfan contains algorithms for computing this complex for general ideals and specialized algorithms ... manual. For ordinary Gröbner basis computations Gfan is not competitive in speed compared to programs...

WENO
 Referenced in 40 articles
[sw12694]
 coordinate variables, thus reducing the computational complexity to two dimensions in phase space and dramatically ... phase space is discretized) on today’s computers. The computational results have been compared with...

polymake
 Referenced in 196 articles
[sw00724]
 with simplicial complexes, matroids, polyhedral fans, graphs, tropical objects, and other objects. Computer algebra system...

POMDPS
 Referenced in 29 articles
[sw03055]
 online approaches that alleviate the computational complexity by computing good local policies at each decision...

PHCpack
 Referenced in 133 articles
[sw00705]
 powerful methods to compute numerically approximations to all isolated complex solutions. During the last decade...

SPEED
 Referenced in 19 articles
[sw08653]
 efficient static estimation of program computational complexity. This paper describes an interprocedural technique ... functions of input datastructures. Such computational complexity bounds for even simple programs are usually ... only in terms of the computational complexity, but also in terms of the constant factors ... these techniques enables generation of precise computational complexity bounds for realworld examples (drawn from...

PHAVer
 Referenced in 82 articles
[sw04123]
 large numbers. To manage the complexity of the polyhedral computations, we propose methods to conservatively...

FFTW
 Referenced in 286 articles
[sw04126]
 FFTW is a C subroutine library for computing the discrete Fourier transform ... input size, and of both real and complex data (as well as of even/odd data...

VisualSEEk
 Referenced in 88 articles
[sw13846]
 wide variety of complex joint color/spatial queries may be computed...

BARON
 Referenced in 190 articles
[sw00066]
 BARON is a computational system for solving nonconvex optimization problems to global optimality. Purely continuous ... through the hills and valleys of complex optimization problems in search of global solutions...

LiE
 Referenced in 111 articles
[sw01075]
 computations of a Lie group theoretic nature. It focuses on the representation theory of complex ... groups and root systems. LiE does not compute directly with elements of the Lie groups...