188 search results - page 14 / 38 » Solving Rational Eigenvalue Problems via Linearization |
IPPS
2003
IEEE
15 years 2 months ago
2003
IEEE
We describe a prototype Web service for model reduction of very large-scale linear systems. Specifically, a userfriendly interface is designed so that model reduction can be easi...
JACM
2010
14 years 8 months ago
2010
A temporal constraint language is a set of relations that has a first-order definition in (Q, <), the dense linear order of the rational numbers. We present a complete comple...
IJCAI
1989
14 years 10 months ago
1989
A constraint satisfaction problem, or CSP, can be reformulated as an integer linear programming problem. The reformulated problem can be solved via polynomial multiplication. If t...
FOCM
2007
14 years 9 months ago
2007
A general scheme for trust-region methods on Riemannian manifolds is proposed and analyzed. Among the various approaches available to (approximately) solve the trust-region subpro...
76
Voted
ISSAC
2004
Springer
15 years 3 months ago
2004
Springer
A recent algorithmic procedure for computing the absolute factorization of a polynomial P(X, Y ), after a linear change of coordinates, is via a factorization modulo X3 . This was...