Randomization and the parallel solution of linear algebra problems

DOI10.1016/0898-1221(95)00164-TMaRDI QIDQ1905899zbMATH OpenOpenAlexFDO

Authors Gianna M. Del Corso

Publication date 22 April 1996

Published in Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0898-1221(95)00164-t

zbMATH Keywords

randomizationrankrandomized algorithmsdeterminanterror boundMonte Carlo methodparallel computationpower methoddominant eigenvalue

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Parallel numerical computation (65Y05) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical computation of determinants (65F40)

Recommendations

• Parallel evaluation of the determinant and of the inverse of a matrix
• scientific article; zbMATH DE number 2086387
• scientific article; zbMATH DE number 1241384
• Randomized algorithms for the low-rank approximation of matrices
• Randomized Monte Carlo algorithms for matrix iterations and solving large systems of linear equations

Cites work

• scientific article; zbMATH DE number 486467 (Why is no real title available?)
• scientific article; zbMATH DE number 3249395 (Why is no real title available?)
• scientific article; zbMATH DE number 3408799 (Why is no real title available?)
• A fast parallel algorithm to compute the rank of a matrix over an arbitrary field
• Estimating the Largest Eigenvalue by the Power and Lanczos Algorithms with a Random Start
• Matrix inversion in RNC\(^ 1\)
• On computing the determinant in small parallel time using a small number of processors
• Parallelism in random access machines
• Probabilistic Bounds on the Extremal Eigenvalues and Condition Number by the Lanczos Algorithm
• The Area-Time Complexity of Binary Multiplication

Cited in

(9)

• Accelerating Linear System Solutions Using Randomization Techniques
• scientific article; zbMATH DE number 2086387 (Why is no real title available?)
• Triangular \(x\)-basis decompositions and derandomization of linear algebra algorithms over \(K[x]\)
• Open problems in computational linear algebra
• A quasi-random approach to matrix spectral analysis
• From randomizing polynomials to parallel algorithms
• Randomized preprocessing of homogeneous linear systems of equations
• Parallel output-sensitive algorithms for combinatorial and linear algebra problems
• Using randomization to make recursive matrix algorithms practical

This page was built for publication: Randomization and the parallel solution of linear algebra problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1905899)