Name
Abstract | ||
|---|---|---|
We describe a method for managing large expressions in symbolic computations which combines a hierarchical representation with signature calculations. As a case study, the problem of factoring matrices with non-polynomial entries is studied. Gaussian Elimination is used. Results on the complexity of the approach together with benchmark calculations are given. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1007/11856290_22 | AISC |
Keywords | Field | DocType |
signature calculation,symbolic computation,non-polynomial entry,gaussian elimination,large expression management,large expression,hierarchical representation,case study,benchmark calculation | Expression (mathematics),Matrix (mathematics),Computer science,Symbolic computation,Algorithm,Theoretical computer science,Gaussian elimination,Time complexity,Gauss–Seidel method,Factoring,Computation | Conference |
Volume | ISSN | ISBN |
4120 | 0302-9743 | 3-540-39728-0 |
Citations | PageRank | References |
4 | 0.47 | 24 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wenqin Zhou | 1 | 10 | 2.17 |
| J. Carette | 2 | 4 | 0.47 |
| D. J. Jeffrey | 3 | 33 | 8.39 |
| M. B. Monagan | 4 | 13 | 2.94 |