Upper bounds on the complexity of solving systems of linear equations (Q1057647): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5818478 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimization of the number of arithmetic operations in the solution of linear algebraic systems of equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel computations in linear algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel computations in linear algebra. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5617226 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical solution of linear equations with Toeplitz and vector Toeplitz matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4190138 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangular Factorization and Inversion by Fast Matrix Multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Direct Methods for Solving Poisson’s Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time and Parallel Processor Bounds for Linear Recurrence Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Asymptotic Complexity of Matrix Multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Parallel Matrix Inversion Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of Parallel Algorithms in Numerical Linear Algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Parallel Evaluation of Multivariate Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix Inversion Using Parallel Processing / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved parallel processor bound in fast matrix inversion / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Parallel Algorithm for the Solution of a Tridiagonal Linear System of Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3719829 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for the Inversion of Finite Toeplitz Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing multivariate polynomials in parallel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3912022 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computation Model of Parallel Solution of Linear Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3875192 / rank
 
Normal rank

Latest revision as of 17:34, 14 June 2024

scientific article
Language Label Description Also known as
English
Upper bounds on the complexity of solving systems of linear equations
scientific article

    Statements

    Upper bounds on the complexity of solving systems of linear equations (English)
    0 references
    0 references
    0 references
    1985
    0 references
    Translation from Zap. Nauchn. Semin. Leningr. Otd. Mat. Inst. Steklova 118, 159-187 (Russian) (1982; Zbl 0494.68052).
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    parallel algorithms
    0 references
    matrix multiplication and inversion
    0 references
    sequential algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references