scientific article
From MaRDI portal
Publication:4038737
zbMath0778.65034MaRDI QIDQ4038737
B. David Saunders, Erich L. Kaltofen
Publication date: 18 May 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
complexityrandomizationfinite fieldsparse matrixrankdeterminantsingular systemsprobabilistic methodToeplitz matricescoordinate recurrence method
Computational methods for sparse matrices (65F50) Analysis of algorithms and problem complexity (68Q25) Numerical computation of determinants (65F40) Probabilistic methods, stochastic differential equations (65C99)
Related Items
Numerically safe Gaussian elimination with no pivoting, Lifting and recombination techniques for absolute factorization, Fast computation of the rank profile matrix and the generalized Bruhat decomposition, On Fast and Provably Secure Message Authentication Based on Universal Hashing, Efficient matrix preconditioners for black box linear algebra, Certified sparse linear system solving, Parallel computation of polynomial GCD and some related parallel computations over abstract fields, Algebraic and numerical techniques for the computation of matrix determinants, On efficient sparse integer matrix Smith normal form computations, Techniques for exploiting structure in matrix formulae of the sparse resultant, On Matrices With Displacement Structure: Generalized Operators and Faster Algorithms, Elimination ideal and bivariate resultant over finite fields, Probabilistic analysis of Wiedemann's algorithm for minimal polynomial computation, Nearly optimal solution of rational linear systems of equations with symbolic lifting and numerical initialization, A practical approach to the secure computation of the Moore-Penrose pseudoinverse over the rationals, Improved dense multivariate polynomial factorization algorithms, Superfast algorithms for Cauchy-like matrix computations and extensions, Solving structured linear systems with large displacement rank, New recombination algorithms for bivariate polynomial factorization based on Hensel lifting, Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation, Improved algorithms for computing determinants and resultants, Efficient parallel factorization and solution of structured and unstructured linear systems, A note on the factorization method of Niederreiter, Multiparty cardinality testing for threshold private intersection, Exact Solution of Sparse Linear Systems via Left-Looking Roundoff-Error-Free LU Factorization in Time Proportional to Arithmetic Work, A new efficient algorithm for computing Gröbner bases \((F_4)\), Degeneracy loci and polynomial equation solving, Symbolic and numeric methods for exploiting structure in constructing resultant matrices, Relating \(p\)-adic eigenvalues and the local Smith normal form
