Solving sparse linear equations over finite fields
IEEE Transactions on Information Theory
On randomized Lanczos algorithms
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
Applied numerical linear algebra
Applied numerical linear algebra
Certifying inconsistency of sparse linear systems
ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation
Integer Smith form via the valence: experience with large sparse matrices from homology
ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation
On Wiedemann's Method of Solving Sparse Linear Systems
AAECC-9 Proceedings of the 9th International Symposium, on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Algorithms for symbolic/numeric control of affine dynamical systems
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
A robust high-order recursive quadratic algorithm for linear-in-the-parameters models
MS'06 Proceedings of the 17th IASTED international conference on Modelling and simulation
Dense Linear Algebra over Word-Size Prime Fields: the FFLAS and FFPACK Packages
ACM Transactions on Mathematical Software (TOMS)
A high-order recursive quadratic learning algorithm
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part I
| Hi-index | 0.00 |
We present algorithms to construct an efficient black box for the pseudoinverse, At, of a black box matrix A. This in also known as the Moore-Penrose inverse of A. For the system Ax = b over a subfield of the complex numbers: the vector x = Atb is the least squares solution having the least norm. When we say that A is a black box matrix we mean simply that methods are given to compute the matrix-vector products Au and uTA, for vectors u and vectors v of compatible length. No other assumptions are made about the structure or representation of the matrix.The entries may be integers or rational numbers or elements of a finite field. For the integer or rational case the method uses homomorphic images, and is based on an algorithm capable of computing the black box for the pseudoinverse, when it exists, over an arbitrary field. We discuss the asymptotic costs and some variants that are likely to be useful in practice.Over a finite field the solution, x = Atb, is uniquely defined when it exists. The ability to produce this particular solution is a useful addition to the range of ways solution to singular linear systems may be offered in the black box model.