scientific article

zbMath0435.65023MaRDI QIDQ3875204

John H. Carter, R. Moenck

Publication date: 1979

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

exact solutionsapproximate algorithms

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Padé approximation (41A21)

Related Items (19)

High-order lifting and integrality certification ⋮ Schur aggregation for linear systems and determinants ⋮ Complexity of parallel matrix computations ⋮ The shifted number system for fast linear algebra on integer matrices ⋮ Certified dense linear system solving ⋮ Algebraic and numerical techniques for the computation of matrix determinants ⋮ Computing the determinant and the characteristic polynomial of a matrix via solving linear systems of equations ⋮ Triangular \(x\)-basis decompositions and derandomization of linear algebra algorithms over \(K[x\)] ⋮ High-order lifting for polynomial Sylvester matrices ⋮ Computing the sign or the value of the determinant of an integer matrix, a complexity survey. ⋮ Nearly optimal solution of rational linear systems of equations with symbolic lifting and numerical initialization ⋮ An algorithm to solve integer linear systems exactly using numerical methods ⋮ Degeneration of structured integer matrices modulo an integer ⋮ Essentially optimal computation of the inverse of generic polynomial matrices ⋮ Efficient parallel factorization and solution of structured and unstructured linear systems ⋮ Newton's method and FFT trading ⋮ Fast computation of Hermite normal forms of random integer matrices ⋮ Algorithms for solving linear systems over cyclotomic fields ⋮ Simultaneous rational function reconstruction with errors: handling multiplicities and poles

This page was built for publication: