New answers tagged numerical-algorithms
2
This is not an answer, but a response to this comment.
Assume that $A$ is the matrix which columns are the rows that we want to test for linear independence. I am putting them are columns for no other reason than personal comfort.
Doing the row transformations required in Gaussian elimination correspond to multiplying $A$ from the left by some elementary ...
1
It's unclear what $n$ is in your question. If your matrix has dimensions $n \times n$ and your model of computation allows you to perform
basic arithmetic operations in constant time then, yes, computing the inverse matrix takes $O(n)$ time.
Top 50 recent answers are included
Related Tags
numerical-algorithms × 130algorithms × 51
numerical-analysis × 25
floating-point × 20
matrices × 12
optimization × 11
machine-learning × 10
error-estimation × 9
algorithm-analysis × 8
reference-request × 7
linear-algebra × 7
complexity-theory × 6
runtime-analysis × 6
parallel-computing × 6
time-complexity × 4
terminology × 4
approximation × 4
arithmetic × 4
mathematical-programming × 4
multiplication × 4
computational-geometry × 3
search-algorithms × 3
neural-networks × 3
efficiency × 3
polynomials × 3