Fast Parallel Matrix Inversion Algorithms
From MaRDI portal
Publication:4124326
DOI10.1137/0205040zbMath0353.68063MaRDI QIDQ4124326
Publication date: 1976
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0205040
68Q25: Analysis of algorithms and problem complexity
65F05: Direct numerical methods for linear systems and matrix inversion
Related Items
Parallel algorithm for householder transformation with applications to Ill-conditioned problems, Fast and scalable parallel matrix computations with reconfigurable pipelined optical buses, Fast parallel algorithms for vandermonde determinants, Polynomial decomposition algorithms, ON THE MINIMAL POLYNOMIAL OF A MATRIX, Efficient algorithms for computing the characteristic polynomial in a domain, A Gröbner free alternative for polynomial system solving, A lower bound for the shortest path problem, Deformation techniques to solve generalised Pham systems, Sparse interpolation of symmetric polynomials, On computing the determinant in small parallel time using a small number of processors, Minimum energy requirements of information transfer and computing, Computation of equilibria in noncooperative games, Parallelism and fast solution of linear systems, A complexity theory of efficient parallel algorithms, Parallel models of computation: An introductory survey, Generalised characteristic polynomials, Parallel solution of linear systems by repeated squaring, The unpredictable deviousness of models, Upper bounds on the complexity of solving systems of linear equations, Tensor and border rank of certain classes of matrices and the fast evaluation of determinant, inverse matrix, and eigenvalues, Iterative methods for the parallel solution of linear systems, Matching is as easy as matrix inversion, The complexity of elementary algebra and geometry, Complexity of parallel matrix computations, On the VLSI complexity of some arithmetic and numerical problems, A VLSI fast solver for tridiagonal linear systems, The semantics and complexity of parallel programs for vector computations. I: A case study using Ada, Feasible arithmetic computations: Valiant's hypothesis, Parallel evaluation of the determinant and of the inverse of a matrix, Techniques for parallel manipulation of sparse matrices, A Monte Carlo method for the parallel solution of linear systems, NC algorithms for computing the number of perfect matchings in \(K_{3,3}\)-free graphs and related problems, Deterministic simulation of tape-bounded probabilistic Turing machine transducers, On uniform circuit complexity, On the complexity of simplifying quadratic forms, On tape-bounded probabilistic Turing machine acceptors, Efficient parallel algorithms for linear recurrence computation, Computing multivariate polynomials in parallel, Circuits for computing the GCD of two polynomials over an algebraic number field, Matrix inversion in RNC\(^ 1\), On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals, On the computational complexity and geometry of the first-order theory of the reals. II: The general decision problem. Preliminaries for quantifier elimination, On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination, Parallel solution of Toeplitzlike linear systems, Parallel algebraic reductions among numerical problems, A survey of space complexity, On affine scaling algorithms for nonconvex quadratic programming, An improved parallel algorithm for computing the generalized inverse \(A^ +\), Matching theory -- a sampler: From Dénes König to the present, Parametrization of Newton's iteration for computations with structured matrices and applications, Parallel direct linear system solvers - a survey, An improved parallel processor bound in fast matrix inversion, A new iterative Monte Carlo approach for inverse matrix problem, On the coefficients of the characteristic polynomial of a matrix, Spectral properties of some matrices close to the Toeplitz triangular form, Oracle computations in parallel numerical linear algebra, Specified precision polynomial root isolation is in NC, Lower bounds for diophantine approximations, Parallel computation of polynomial GCD and some related parallel computations over abstract fields, Successive matrix squaring algorithm for computing the Drazin inverse, Fast and efficient parallel solution of dense linear systems, Parallel algorithms and architectures for matrix multiplication, Systolic algorithm for the solution of dense linear equations, On the Descriptive Complexity of Linear Algebra, Phenotype space and kinship assignment for the simpson index, Classifying the computational complexity of problems, Parallel complexities and computations of cholesky's decomposition and QR factorization, Parallel computations in linear algebra, On the depth complexity of formulas, Singular spaces of matrices and their application in combinatorics
