scientific article; zbMATH DE number 1253981
From MaRDI portal
Publication:4226959
zbMath0917.65025MaRDI QIDQ4226959
Erich L. Kaltofen, Wayne Eberly
Publication date: 5 August 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
integer factorizationLas Vegas algorithmssymmetric linear systemsrandomized Lanczos algorithmsymmetric matrix computations
Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10)
Related Items (10)
Algorithm 1021: SPEX Left LU, Exactly Solving Sparse Linear Systems via a Sparse Left-looking Integer-preserving LU Factorization ⋮ Territorial design optimization for business sales plan ⋮ Efficient matrix preconditioners for black box linear algebra ⋮ On efficient sparse integer matrix Smith normal form computations ⋮ Index calculus in the trace zero variety ⋮ Sparsified randomization algorithms for low rank approximations and applications to integral equations and inhomogeneous random field simulation ⋮ A practical approach to the secure computation of the Moore-Penrose pseudoinverse over the rationals ⋮ Решение систем линейных уравнений при вычислении логарифмов в конечном простом поле ⋮ Stochastic Algorithms in Linear Algebra - beyond the Markov Chains and von Neumann - Ulam Scheme ⋮ Stochastic boundary methods of fundamental solutions for solving PDEs
This page was built for publication:
