Fast Parallel Matrix Inversion Algorithms
From MaRDI portal
Cited in
(only showing first 100 items - show all)- 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
- Algebraic independence over positive characteristic: new criterion and applications to locally low-algebraic-rank circuits
- Fast and efficient parallel solution of dense linear systems
- Parallel algorithms and architectures for matrix multiplication
- Factorization of polynomials given by arithmetic branching programs
- Algebraic secret sharing using privacy homomorphisms for IoT-based healthcare systems
- Unbalancing sets and an almost quadratic lower bound for syntactically multilinear arithmetic circuits
- Deterministic computation of the characteristic polynomial in the time of matrix multiplication
- On the arithmetic operational complexity for solving Vandermonde linear equations
- On approximating the eigenvalues of stochastic matrices in probabilistic logspace
- Arithmetic circuits: a chasm at depth 3
- Algebraic complexity classes
- Inversion modulo zero-dimensional regular chains
- Types of depth and formula size
- On the problem of approximating the eigenvalues of undirected graphs in probabilistic logspace
- 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 parallel complexity of analytic functions
- On the depth complexity of formulas
- Singular spaces of matrices and their application in combinatorics
- Parallel algorithm for householder transformation with applications to Ill-conditioned problems
- Quantum machine learning: a classical perspective
- Fast parallel computation of characteristic polynomials by Leverrier's power sum method adapted to fields of finite characteristic
- Fast and scalable parallel matrix computations with reconfigurable pipelined optical buses
- Fast parallel algorithms for vandermonde determinants
- NC algorithms for computing a perfect matching and a maximum flow in one-crossing-minor-free graphs
- Bipartite perfect matching is in quasi-NC
- Probabilistic logarithmic-space algorithms for Laplacian solvers
- NC algorithms for weighted planar perfect matching and related problems
- Comparison of Accuracy and Scalability of Gauss--Newton and Alternating Least Squares for CANDECOMC/PARAFAC Decomposition
- Determinant: Old algorithms, new insights
- Shortest k-disjoint paths via determinants
- Counting shortest two disjoint paths in cubic planar graphs with an NC algorithm
- Membership in polynomial ideals over \(\mathcal{Q}\) is exponential space complete
- scientific article; zbMATH DE number 7250150 (Why is no real title available?)
- scientific article; zbMATH DE number 7250151 (Why is no real title available?)
- Computation of a determinant and a matrix product in cellular automata
- ON THE MINIMAL POLYNOMIAL OF A MATRIX
- Polynomial decomposition algorithms
- 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
- Polyhedral techniques in combinatorial optimization: matchings and tours
- The stochastic arrival problem
- Optimizing \(n\)-variate \((n+k)\)-nomials for small \(k\)
- Parallel discrete sampling via continuous walks
- Randomized parallel algorithms
- Sparse interpolation of symmetric polynomials
- On the Taylor expansion of (-zg(q);f(q))_
- Verifying equilibria in finite-horizon probabilistic concurrent game systems
- Efficiently computing the minimum rank of a matrix in a monoid of zero-one matrices
- Polynomials whose roots are the differences of the roots of a given polynomial
- On computing the determinant in small parallel time using a small number of processors
- Minimum energy requirements of information transfer and computing
This page was built for publication: Fast Parallel Matrix Inversion Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4124326)
