scientific article

zbMath0548.65027MaRDI QIDQ3340031

R. T. Gregory, E. V. Krishnamurthy

Publication date: 1984

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

zbMATH Keywords

generalized inversesMoore-Penrose inverseinterval linear programmingill-conditioned matricesresidue number systemerror-free computationHensel codecharacteristic polynomial of a matrixinteger solutions to linear equationsiterative inversion of matricesmultiple-modulusp- adic number systemssingle-modulusunstable mathematical models

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Theory of matrix inversion and generalized inverses (15A09) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Iterative numerical methods for linear systems (65F10) Congruences; primitive roots; residue systems (11A07) Direct numerical methods for linear systems and matrix inversion (65F05) Error analysis and interval analysis (65Gxx)

Related Items (33)

Approximation lattices of \(p\)-adic numbers ⋮ An error-free algorithm to solve a linear system of polynomial equations ⋮ One-modulus residue arithmetic algorithm to solve linear equations exactly ⋮ Improvements on the accelerated integer GCD algorithm ⋮ On convergence and limit cycles in digital filters in integer number systems ⋮ Computing a matrix symmetrizer exactly using modified multiple modulus residue arithmetic ⋮ Solving linear programming problems exactly ⋮ An error-free generalized matrix inversion and linear least squares method based on bordering ⋮ On an integral transformation for integer programming ⋮ Best \(k\)-digit rational bounds for irrational numbers: pre- and super-computer era ⋮ EXACT SOLUTION OF LINEAR EQUATIONS ON DISTRIBUTED-MEMORY MULTIPROCESSORS ⋮ Feedback shift registers, 2-adic span, and combiners with memory ⋮ Parallel p-adic computation ⋮ Kalman-type decompostion for implicit linear discrete-time systems, and its applications ⋮ Birth, growth and computation of pi to ten trillion digits ⋮ Best \(k\)-digit rational approximation of irrational numbers: pre-computer versus computer era ⋮ A direct heuristic algorithm for linear programming ⋮ Error-free algorithms to solve special and general discrete systems of linear equations ⋮ A Gröbner basis technique for Padé approximation ⋮ \(2^n\) in scientific computation and beyond ⋮ An RSA based public-key cryptosystem for secure communication ⋮ A parallel algorithm for exact solution of linear equations via congruence technique ⋮ Direct fail-proof triangularization algorithms for \(AX+XB=C\) with error- free and parallel implementations ⋮ An iterative error-free algorithm to solve Vandermonde systems ⋮ Solving linear program as linear system in polynomial time ⋮ Implementing Data Parallel Rational Multiple-Residue Arithmetic in Eden ⋮ Constraint forces in holonomic mechanical systems ⋮ Symbolic iterative algorithm for generalized inversion of rational polynomial matrices ⋮ Open problems in computational linear algebra ⋮ Error-free matrix symmetrizers and equivalent symmetric matrices ⋮ \(O(n^ 3)\) noniterative heuristic algorithm for linear programs with error-free implementation. ⋮ Iterative root approximation in \(p\)-adic numerical analysis ⋮ Local field Brownian motion

This page was built for publication: