Exact solution of linear equations using p-adic expansions
From MaRDI portal
Publication:1168041
DOI10.1007/BF01459082zbMath0492.65016MaRDI QIDQ1168041
Publication date: 1982
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/132821
rational approximationEuclidean algorithminteger matrixexact arithmeticp-adic approximationsuccessive refinements
Radix representation; digital problems (11A63) Direct numerical methods for linear systems and matrix inversion (65F05) Linear equations (linear algebraic aspects) (15A06) Valued fields (12J10)
Related Items
Algorithm 1021: SPEX Left LU, Exactly Solving Sparse Linear Systems via a Sparse Left-looking Integer-preserving LU Factorization, Solving polynomial systems in integers, High-order lifting and integrality certification, The SIAM 100-Digit Challenge: a decade later. Inspirations, ramifications, and other eddies left in its wake, Schur aggregation for linear systems and determinants, Deciding the nilpotency of the Galois group by computing elements in the centre, Solving p-adic polynomial systems via iterative eigenvector algorithms, The shifted number system for fast linear algebra on integer matrices, Certified dense linear system solving, Minimizing representations over number fields., Invariant Bilinear Forms on W-Graph Representations and Linear Algebra Over Integral Domains, EXACT SOLUTION OF LINEAR EQUATIONS ON DISTRIBUTED-MEMORY MULTIPROCESSORS, On efficient sparse integer matrix Smith normal form computations, Unnamed Item, Super-linear convergence in the p -adic QR-algorithm, Triangular \(x\)-basis decompositions and derandomization of linear algebra algorithms over \(K[x\)], Solving Simple Stochastic Games, Cryptanalysis of symmetric primitives over rings and a key recovery attack on \textsf{Rubato}, Roundoff-Error-Free Basis Updates of LU Factorizations for the Efficient Validation of Optimality Certificates, High-order lifting for polynomial Sylvester matrices, On the complexity of inverting integer and polynomial matrices, Hardness of graph-structured algebraic and symbolic problems, Robust certified numerical homotopy tracking, On the computation of the HNF of a module over the ring of integers of a number field, Computing the sign or the value of the determinant of an integer matrix, a complexity survey., The virtual Haken conjecture: Experiments and examples, Nearly optimal solution of rational linear systems of equations with symbolic lifting and numerical initialization, Sharply \(k\)-transitive permutation groups viewed as Galois groups, An algorithm to solve integer linear systems exactly using numerical methods, $p$-Adic Integral Geometry, Degeneration of structured integer matrices modulo an integer, Algorithms for polycyclic-by-finite groups, A parallel algorithm for exact solution of linear equations via congruence technique, Computing Generator in Cyclotomic Integer Rings, Essentially optimal computation of the inverse of generic polynomial matrices, A Gröbner free alternative for polynomial system solving, Kronecker's and Newton's approaches to solving: a first comparison, Fast computation of Hermite normal forms of random integer matrices, Algorithms for solving linear systems over cyclotomic fields, Roundoff-Error-Free Algorithms for Solving Linear Systems via Cholesky and LU Factorizations, A \(p\)-adic algorithm for computing the inverse of integer matrices, Simple Stochastic Games with Few Random Vertices Are Easy to Solve, An algorithm for implicit interpolation, Exterior powers of the adjoint representation and the Weyl ring of \(E_8\), On Computing the Hermite Form of a Matrix of Differential Polynomials, 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)\), Simultaneous rational function reconstruction with errors: handling multiplicities and poles, On the computation of elementary divisors of integer matrices, Parallelized Solution of Banded Linear Systems with an Introduction to p-adic Computation
Cites Work
