Efficient matrix preconditioners for black box linear algebra

DOI10.1016/S0024-3795(01)00472-4zbMath0997.65073MaRDI QIDQ1348088

William J. Turner, Wayne Eberly, Li Chen, B. David Saunders, Gilles Villard, Erich L. Kaltofen

Publication date: 15 May 2002

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

zbMATH Keywords

linear systempreconditioningfinite fielddeterminantssparse matrixJordan canonical formranklinear dependenceminimal polynomialcondition numberscyclicitymatrix preconditionersnilpotent blockblack box algorithms

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Determinants, permanents, traces, other special matrix functions (15A15) Numerical computation of matrix norms, conditioning, scaling (65F35) Numerical computation of determinants (65F40) Vector spaces, linear dependence, rank, lineability (15A03) Canonical forms, reductions, classification (15A21) Conditioning of matrices (15A12)

Related Items

Computing the determinant of a matrix with polynomial entries by approximation, Certified sparse linear system solving, Automating algorithm selection: checking for matrix properties that can simplify computations, Probabilistic analysis of Wiedemann's algorithm for minimal polynomial computation, Computing the sign or the value of the determinant of an integer matrix, a complexity survey., A practical approach to the secure computation of the Moore-Penrose pseudoinverse over the rationals, Improved dense multivariate polynomial factorization algorithms, Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation, Probabilistic analysis of block Wiedemann for leading invariant factors

Cites Work

• Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators
• A probabilistic remark on algebraic program testing
• Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey
• On Computations with Dense Structured Matrices
• Solving sparse linear equations over finite fields
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• Solving Homogeneous Linear Equations Over GF(2) via Block Wiedemann Algorithm
• The rank of sparse random matrices over finite fields
• Block solution of sparse linear systems over GF (q)
• Analysis of Coppersmith's Block Wiedemann Algorithm for the Parallel Solution of Sparse Linear Systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item