1988•Journal of Computational and Applied MathematicsOpen access

Complexity theory of numerical linear algebra

Eric Kostlan

Open full text 37 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

Open-access reader

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

OpenAlex reports 37 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Key concepts: Mathematics, Eigenvalues and eigenvectors, Hermitian matrix, Linear algebra, Numerical linear algebra, Upper and lower bounds, Matrix (chemical analysis), Numerical analysis

Back to paper search Browse research topics Original source

Complexity theory of numerical linear algebra — Research Paper | ScholarLens