The algebraic eigenvalue problem
The algebraic eigenvalue problem
On Computing the Exact Determinant of Matrices with Polynomial Entries
Journal of the ACM (JACM)
Generation of optimal code for expressions via factorization
Communications of the ACM
New recursive minor expansion algorithms
EUROSAM '79 Proceedings of the International Symposiumon on Symbolic and Algebraic Computation
An efficient sparse minor expansion algorithm
ACM '76 Proceedings of the 1976 annual conference
Breuer's grow factor algorithm in computer algebra
SYMSAC '81 Proceedings of the fourth ACM symposium on Symbolic and algebraic computation
On computing with factored rational expressions
ACM SIGSAM Bulletin
Systems of linear equations with dense univariate polynomial coefficients
Journal of the ACM (JACM)
Efficient Gaussian Elimination Method for Symbolic Determinants and Linear Systems
ACM Transactions on Mathematical Software (TOMS)
A Parallel Symbolic Computation Environment: Structures and Mechanics
Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
Breuer's grow factor algorithm in computer algebra
SYMSAC '81 Proceedings of the fourth ACM symposium on Symbolic and algebraic computation
NETFORM and code optimizer manual
ACM SIGSAM Bulletin
An expression analysis package for REDUCE
ACM SIGSAM Bulletin
Computing determinants of rational functions
ACM Communications in Computer Algebra
Modified gauss algorithm for matrices with symbolic entries
ACM Communications in Computer Algebra
| Hi-index | 0.00 |
Symbolic solutions of large sparse systems of linear equations, such as those encountered in several engineering disciplines (electrical engineering, biology, chemical engineering etc.) are often very lengthy, and received for this reason only occasional attention. This places the designer of a new and probably more successful symbolic solution method for the hard problem to find a representation which is suitable in the corresponding engineering areas, while still being neat and compact. It is believed that this problem has been solved to a great deal with the introduction of the new Factoring Recursive Minor Expansion algorithm with Memo, FDSLEM, presented in this paper. The FDSLEM algorithm has important properties which make the implementation of an algorithm which can generate the approximate solution of a perturbed system of equations relatively straight forward. The algorithms given can operate on arbitrary sparse matrices, but one obtains optimal profit of the properties of the algorithm if the matrices have a certain fundamental form, as is illustrated in the paper.